Solving sparse linear least squares problems on some supercomputers by using large dense blocks
DEFF Research Database (Denmark)
Hansen, Per Christian; Ostromsky, T; Sameh, A
1997-01-01
technique is preferable to sparse matrix technique when the matrices are not large, because the high computational speed compensates fully the disadvantages of using more arithmetic operations and more storage. For very large matrices the computations must be organized as a sequence of tasks in each......Efficient subroutines for dense matrix computations have recently been developed and are available on many high-speed computers. On some computers the speed of many dense matrix operations is near to the peak-performance. For sparse matrices storage and operations can be saved by operating only...... and storing only nonzero elements. However, the price is a great degradation of the speed of computations on supercomputers (due to the use of indirect addresses, to the need to insert new nonzeros in the sparse storage scheme, to the lack of data locality, etc.). On many high-speed computers a dense matrix...
Fast Solvers for Dense Linear Systems
Energy Technology Data Exchange (ETDEWEB)
Kauers, Manuel [Research Institute for Symbolic Computation (RISC), Altenbergerstrasse 69, A4040 Linz (Austria)
2008-10-15
It appears that large scale calculations in particle physics often require to solve systems of linear equations with rational number coefficients exactly. If classical Gaussian elimination is applied to a dense system, the time needed to solve such a system grows exponentially in the size of the system. In this tutorial paper, we present a standard technique from computer algebra that avoids this exponential growth: homomorphic images. Using this technique, big dense linear systems can be solved in a much more reasonable time than using Gaussian elimination over the rationals.
Dobbs, David E.
2013-01-01
A direct method is given for solving first-order linear recurrences with constant coefficients. The limiting value of that solution is studied as "n to infinity." This classroom note could serve as enrichment material for the typical introductory course on discrete mathematics that follows a calculus course.
Directory of Open Access Journals (Sweden)
Ichitaro Yamazaki
2015-01-01
of their low-rank properties. To compute a low-rank approximation of a dense matrix, in this paper, we study the performance of QR factorization with column pivoting or with restricted pivoting on multicore CPUs with a GPU. We first propose several techniques to reduce the postprocessing time, which is required for restricted pivoting, on a modern CPU. We then examine the potential of using a GPU to accelerate the factorization process with both column and restricted pivoting. Our performance results on two eight-core Intel Sandy Bridge CPUs with one NVIDIA Kepler GPU demonstrate that using the GPU, the factorization time can be reduced by a factor of more than two. In addition, to study the performance of our implementations in practice, we integrate them into a recently developed software StruMF which algebraically exploits such low-rank structures for solving a general sparse linear system of equations. Our performance results for solving Poisson's equations demonstrate that the proposed techniques can significantly reduce the preconditioner construction time of StruMF on the CPUs, and the construction time can be further reduced by 10%–50% using the GPU.
Solving Linear Differential Equations
Nguyen, K.A.; Put, M. van der
2010-01-01
The theme of this paper is to 'solve' an absolutely irreducible differential module explicitly in terms of modules of lower dimension and finite extensions of the differential field K. Representations of semi-simple Lie algebras and differential Galo is theory are the main tools. The results extend
An extended GS method for dense linear systems
Niki, Hiroshi; Kohno, Toshiyuki; Abe, Kuniyoshi
2009-09-01
Davey and Rosindale [K. Davey, I. Rosindale, An iterative solution scheme for systems of boundary element equations, Internat. J. Numer. Methods Engrg. 37 (1994) 1399-1411] derived the GSOR method, which uses an upper triangular matrix [Omega] in order to solve dense linear systems. By applying functional analysis, the authors presented an expression for the optimum [Omega]. Moreover, Davey and Bounds [K. Davey, S. Bounds, A generalized SOR method for dense linear systems of boundary element equations, SIAM J. Comput. 19 (1998) 953-967] also introduced further interesting results. In this note, we employ a matrix analysis approach to investigate these schemes, and derive theorems that compare these schemes with existing preconditioners for dense linear systems. We show that the convergence rate of the Gauss-Seidel method with preconditioner PG is superior to that of the GSOR method. Moreover, we define some splittings associated with the iterative schemes. Some numerical examples are reported to confirm the theoretical analysis. We show that the EGS method with preconditioner produces an extremely small spectral radius in comparison with the other schemes considered.
A parallel solver for huge dense linear systems
Badia, J. M.; Movilla, J. L.; Climente, J. I.; Castillo, M.; Marqués, M.; Mayo, R.; Quintana-Ortí, E. S.; Planelles, J.
2011-11-01
HDSS (Huge Dense Linear System Solver) is a Fortran Application Programming Interface (API) to facilitate the parallel solution of very large dense systems to scientists and engineers. The API makes use of parallelism to yield an efficient solution of the systems on a wide range of parallel platforms, from clusters of processors to massively parallel multiprocessors. It exploits out-of-core strategies to leverage the secondary memory in order to solve huge linear systems O(100.000). The API is based on the parallel linear algebra library PLAPACK, and on its Out-Of-Core (OOC) extension POOCLAPACK. Both PLAPACK and POOCLAPACK use the Message Passing Interface (MPI) as the communication layer and BLAS to perform the local matrix operations. The API provides a friendly interface to the users, hiding almost all the technical aspects related to the parallel execution of the code and the use of the secondary memory to solve the systems. In particular, the API can automatically select the best way to store and solve the systems, depending of the dimension of the system, the number of processes and the main memory of the platform. Experimental results on several parallel platforms report high performance, reaching more than 1 TFLOP with 64 cores to solve a system with more than 200 000 equations and more than 10 000 right-hand side vectors. New version program summaryProgram title: Huge Dense System Solver (HDSS) Catalogue identifier: AEHU_v1_1 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHU_v1_1.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 87 062 No. of bytes in distributed program, including test data, etc.: 1 069 110 Distribution format: tar.gz Programming language: Fortran90, C Computer: Parallel architectures: multiprocessors, computer clusters Operating system
Accelerating Dense Linear Algebra on the GPU
DEFF Research Database (Denmark)
Sørensen, Hans Henrik Brandenborg
and matrix-vector operations on GPUs. Such operations form the backbone of level 1 and level 2 routines in the Basic Linear Algebra Subroutines (BLAS) library and are therefore of great importance in many scientific applications. The target hardware is the most recent NVIDIA Tesla 20-series (Fermi...
Students’ difficulties in solving linear equation problems
Wati, S.; Fitriana, L.; Mardiyana
2018-03-01
A linear equation is an algebra material that exists in junior high school to university. It is a very important material for students in order to learn more advanced mathematics topics. Therefore, linear equation material is essential to be mastered. However, the result of 2016 national examination in Indonesia showed that students’ achievement in solving linear equation problem was low. This fact became a background to investigate students’ difficulties in solving linear equation problems. This study used qualitative descriptive method. An individual written test on linear equation tasks was administered, followed by interviews. Twenty-one sample students of grade VIII of SMPIT Insan Kamil Karanganyar did the written test, and 6 of them were interviewed afterward. The result showed that students with high mathematics achievement donot have difficulties, students with medium mathematics achievement have factual difficulties, and students with low mathematics achievement have factual, conceptual, operational, and principle difficulties. Based on the result there is a need of meaningfulness teaching strategy to help students to overcome difficulties in solving linear equation problems.
Solving fault diagnosis problems linear synthesis techniques
Varga, Andreas
2017-01-01
This book addresses fault detection and isolation topics from a computational perspective. Unlike most existing literature, it bridges the gap between the existing well-developed theoretical results and the realm of reliable computational synthesis procedures. The model-based approach to fault detection and diagnosis has been the subject of ongoing research for the past few decades. While the theoretical aspects of fault diagnosis on the basis of linear models are well understood, most of the computational methods proposed for the synthesis of fault detection and isolation filters are not satisfactory from a numerical standpoint. Several features make this book unique in the fault detection literature: Solution of standard synthesis problems in the most general setting, for both continuous- and discrete-time systems, regardless of whether they are proper or not; consequently, the proposed synthesis procedures can solve a specific problem whenever a solution exists Emphasis on the best numerical algorithms to ...
An approach for solving linear fractional programming problems ...
African Journals Online (AJOL)
The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebraically using the concept of duality ...
A logic circuit for solving linear function by digital method
International Nuclear Information System (INIS)
Ma Yonghe
1986-01-01
A mathematical method for determining the linear relation of physical quantity with rediation intensity is described. A logic circuit has been designed for solving linear function by digital method. Some applications and the circuit function are discussed
Jing, Yan-Fei; Huang, Ting-Zhu; Carpentieri, Bruno; Duan, Yong
An interesting stabilizing variant of the biconjugate A-orthogonal residual (BiCOR) method is investigated for solving dense complex non-Hermitian systems of linear equations arising from the Galerlcin discretization of surface integral equations in electromagnetics. The novel variant is naturally
An Approach for Solving Linear Fractional Programming Problems
Andrew Oyakhobo Odior
2012-01-01
Linear fractional programming problems are useful tools in production planning, financial and corporate planning, health care and hospital planning and as such have attracted considerable research interest. The paper presents a new approach for solving a fractional linear programming problem in which the objective function is a linear fractional function, while the constraint functions are in the form of linear inequalities. The approach adopted is based mainly upon solving the problem algebr...
Linear algebra for dense matrices on a hypercube
International Nuclear Information System (INIS)
Sears, M.P.
1990-01-01
A set of routines has been written for dense matrix operations optimized for the NCUBE/6400 parallel processor. This paper was motivated by a Sandia effort to parallelize certain electronic structure calculations. Routines are included for matrix transpose, multiply, Cholesky decomposition, triangular inversion, and Householder tridiagonalization. The library is written in C and is callable from Fortran. Matrices up to order 1600 can be handled on 128 processors. For each operation, the algorithm used is presented along with typical timings and estimates of performance. Performance for order 1600 on 128 processors varies from 42 MFLOPs (House-holder tridiagonalization, triangular inverse) up to 126 MFLOPs (matrix multiply). The authors also present performance results for communications and basic linear algebra operations (saxpy and dot products)
New approach to solve symmetric fully fuzzy linear systems
Indian Academy of Sciences (India)
concepts of fuzzy set theory and then define a fully fuzzy linear system of equations. .... To represent the above problem as fully fuzzy linear system, we represent x .... Fully fuzzy linear systems can be solved by Linear programming approach, ...
Fuzzy linear programming approach for solving transportation
Indian Academy of Sciences (India)
Transportation problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at ...
Convergence of hybrid methods for solving non-linear partial ...
African Journals Online (AJOL)
This paper is concerned with the numerical solution and convergence analysis of non-linear partial differential equations using a hybrid method. The solution technique involves discretizing the non-linear system of PDE to obtain a corresponding non-linear system of algebraic difference equations to be solved at each time ...
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
The study examined errors students make in solving linear equation word problems with a view to expose the nature of these errors and to make suggestions for classroom teaching. A diagnostic test comprising 10 linear equation word problems, was administered to a sample (n=130) of senior high school first year Home ...
A convex optimization approach for solving large scale linear systems
Directory of Open Access Journals (Sweden)
Debora Cores
2017-01-01
Full Text Available The well-known Conjugate Gradient (CG method minimizes a strictly convex quadratic function for solving large-scale linear system of equations when the coefficient matrix is symmetric and positive definite. In this work we present and analyze a non-quadratic convex function for solving any large-scale linear system of equations regardless of the characteristics of the coefficient matrix. For finding the global minimizers, of this new convex function, any low-cost iterative optimization technique could be applied. In particular, we propose to use the low-cost globally convergent Spectral Projected Gradient (SPG method, which allow us to extend this optimization approach for solving consistent square and rectangular linear system, as well as linear feasibility problem, with and without convex constraints and with and without preconditioning strategies. Our numerical results indicate that the new scheme outperforms state-of-the-art iterative techniques for solving linear systems when the symmetric part of the coefficient matrix is indefinite, and also for solving linear feasibility problems.
A Proposed Method for Solving Fuzzy System of Linear Equations
Directory of Open Access Journals (Sweden)
Reza Kargar
2014-01-01
Full Text Available This paper proposes a new method for solving fuzzy system of linear equations with crisp coefficients matrix and fuzzy or interval right hand side. Some conditions for the existence of a fuzzy or interval solution of m×n linear system are derived and also a practical algorithm is introduced in detail. The method is based on linear programming problem. Finally the applicability of the proposed method is illustrated by some numerical examples.
Planning under uncertainty solving large-scale stochastic linear programs
Energy Technology Data Exchange (ETDEWEB)
Infanger, G. [Stanford Univ., CA (United States). Dept. of Operations Research]|[Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft
1992-12-01
For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.
Experimental quantum computing to solve systems of linear equations.
Cai, X-D; Weedbrook, C; Su, Z-E; Chen, M-C; Gu, Mile; Zhu, M-J; Li, Li; Liu, Nai-Le; Lu, Chao-Yang; Pan, Jian-Wei
2013-06-07
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time proportional to the number of variables N. A recently proposed quantum algorithm shows that quantum computers could solve linear systems in a time scale of order log(N), giving an exponential speedup over classical computers. Here we realize the simplest instance of this algorithm, solving 2×2 linear equations for various input vectors on a quantum computer. We use four quantum bits and four controlled logic gates to implement every subroutine required, demonstrating the working principle of this algorithm.
Sparse symmetric preconditioners for dense linear systems in electromagnetism
Carpentieri, Bruno; Duff, Iain S.; Giraud, Luc; Monga Made, M. Magolu
2004-01-01
We consider symmetric preconditioning strategies for the iterative solution of dense complex symmetric non-Hermitian systems arising in computational electromagnetics. In particular, we report on the numerical behaviour of the classical incomplete Cholesky factorization as well as some of its recent
Observations of non-linear plasmon damping in dense plasmas
Witte, B. B. L.; Sperling, P.; French, M.; Recoules, V.; Glenzer, S. H.; Redmer, R.
2018-05-01
We present simulations using finite-temperature density-functional-theory molecular-dynamics to calculate dynamic dielectric properties in warm dense aluminum. The comparison between exchange-correlation functionals in the Perdew, Burke, Ernzerhof approximation, Strongly Constrained and Appropriately Normed Semilocal Density Functional, and Heyd, Scuseria, Ernzerhof (HSE) approximation indicates evident differences in the electron transition energies, dc conductivity, and Lorenz number. The HSE calculations show excellent agreement with x-ray scattering data [Witte et al., Phys. Rev. Lett. 118, 225001 (2017)] as well as dc conductivity and absorption measurements. These findings demonstrate non-Drude behavior of the dynamic conductivity above the Cooper minimum that needs to be taken into account to determine optical properties in the warm dense matter regime.
Approximate Method for Solving the Linear Fuzzy Delay Differential Equations
Directory of Open Access Journals (Sweden)
S. Narayanamoorthy
2015-01-01
Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.
Solving Fully Fuzzy Linear System of Equations in General Form
Directory of Open Access Journals (Sweden)
A. Yousefzadeh
2012-06-01
Full Text Available In this work, we propose an approach for computing the positive solution of a fully fuzzy linear system where the coefficient matrix is a fuzzy $nimes n$ matrix. To do this, we use arithmetic operations on fuzzy numbers that introduced by Kaffman in and convert the fully fuzzy linear system into two $nimes n$ and $2nimes 2n$ crisp linear systems. If the solutions of these linear systems don't satisfy in positive fuzzy solution condition, we introduce the constrained least squares problem to obtain optimal fuzzy vector solution by applying the ranking function in given fully fuzzy linear system. Using our proposed method, the fully fuzzy linear system of equations always has a solution. Finally, we illustrate the efficiency of proposed method by solving some numerical examples.
Directory of Open Access Journals (Sweden)
Yan Chen
2017-03-01
Full Text Available Based on the vectorised and cache optimised kernel, a parallel lower upper decomposition with a novel communication avoiding pivoting scheme is developed to solve dense complex matrix equations generated by the method of moments. The fine-grain data rearrangement and assembler instructions are adopted to reduce memory accessing times and improve CPU cache utilisation, which also facilitate vectorisation of the code. Through grouping processes in a binary tree, a parallel pivoting scheme is designed to optimise the communication pattern and thus reduces the solving time of the proposed solver. Two large electromagnetic radiation problems are solved on two supercomputers, respectively, and the numerical results demonstrate that the proposed method outperforms those in open source and commercial libraries.
New approach to solve symmetric fully fuzzy linear systems
Indian Academy of Sciences (India)
In this paper, we present a method to solve fully fuzzy linear systems with symmetric coefﬁcient matrix. The symmetric coefﬁcient matrix is decomposed into two systems of equations by using Cholesky method and then a solution can be obtained. Numerical examples are given to illustrate our method.
Insights into the School Mathematics Tradition from Solving Linear Equations
Buchbinder, Orly; Chazan, Daniel; Fleming, Elizabeth
2015-01-01
In this article, we explore how the solving of linear equations is represented in English-language algebra text books from the early nineteenth century when schooling was becoming institutionalized, and then survey contemporary teachers. In the text books, we identify the increasing presence of a prescribed order of steps (a canonical method) for…
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
kofi.mereku
Development in most areas of life is based on effective knowledge of science and ... Problem solving, as used in mathematics education literature, refers ... word problems, on the other hand, are those linear equation tasks or ... taught LEWPs in the junior high school, many of them reach the senior high school without a.
Directory of Open Access Journals (Sweden)
Yi-hua Zhong
2013-01-01
Full Text Available Recently, various methods have been developed for solving linear programming problems with fuzzy number, such as simplex method and dual simplex method. But their computational complexities are exponential, which is not satisfactory for solving large-scale fuzzy linear programming problems, especially in the engineering field. A new method which can solve large-scale fuzzy number linear programming problems is presented in this paper, which is named a revised interior point method. Its idea is similar to that of interior point method used for solving linear programming problems in crisp environment before, but its feasible direction and step size are chosen by using trapezoidal fuzzy numbers, linear ranking function, fuzzy vector, and their operations, and its end condition is involved in linear ranking function. Their correctness and rationality are proved. Moreover, choice of the initial interior point and some factors influencing the results of this method are also discussed and analyzed. The result of algorithm analysis and example study that shows proper safety factor parameter, accuracy parameter, and initial interior point of this method may reduce iterations and they can be selected easily according to the actual needs. Finally, the method proposed in this paper is an alternative method for solving fuzzy number linear programming problems.
Dongarra, Jack; Ltaief, Hatem; Luszczek, Piotr R.; Weaver, Vincent M.
2012-01-01
We propose to study the impact on the energy footprint of two advanced algorithmic strategies in the context of high performance dense linear algebra libraries: (1) mixed precision algorithms with iterative refinement allow to run at the peak performance of single precision floating-point arithmetic while achieving double precision accuracy and (2) tree reduction technique exposes more parallelism when factorizing tall and skinny matrices for solving over determined systems of linear equations or calculating the singular value decomposition. Integrated within the PLASMA library using tile algorithms, which will eventually supersede the block algorithms from LAPACK, both strategies further excel in performance in the presence of a dynamic task scheduler while targeting multicore architecture. Energy consumption measurements are reported along with parallel performance numbers on a dual-socket quad-core Intel Xeon as well as a quad-socket quad-core Intel Sandy Bridge chip, both providing component-based energy monitoring at all levels of the system, through the Power Pack framework and the Running Average Power Limit model, respectively. © 2012 IEEE.
Dongarra, Jack
2012-11-01
We propose to study the impact on the energy footprint of two advanced algorithmic strategies in the context of high performance dense linear algebra libraries: (1) mixed precision algorithms with iterative refinement allow to run at the peak performance of single precision floating-point arithmetic while achieving double precision accuracy and (2) tree reduction technique exposes more parallelism when factorizing tall and skinny matrices for solving over determined systems of linear equations or calculating the singular value decomposition. Integrated within the PLASMA library using tile algorithms, which will eventually supersede the block algorithms from LAPACK, both strategies further excel in performance in the presence of a dynamic task scheduler while targeting multicore architecture. Energy consumption measurements are reported along with parallel performance numbers on a dual-socket quad-core Intel Xeon as well as a quad-socket quad-core Intel Sandy Bridge chip, both providing component-based energy monitoring at all levels of the system, through the Power Pack framework and the Running Average Power Limit model, respectively. © 2012 IEEE.
Galerkin projection methods for solving multiple related linear systems
Energy Technology Data Exchange (ETDEWEB)
Chan, T.F.; Ng, M.; Wan, W.L.
1996-12-31
We consider using Galerkin projection methods for solving multiple related linear systems A{sup (i)}x{sup (i)} = b{sup (i)} for 1 {le} i {le} s, where A{sup (i)} and b{sup (i)} are different in general. We start with the special case where A{sup (i)} = A and A is symmetric positive definite. The method generates a Krylov subspace from a set of direction vectors obtained by solving one of the systems, called the seed system, by the CG method and then projects the residuals of other systems orthogonally onto the generated Krylov subspace to get the approximate solutions. The whole process is repeated with another unsolved system as a seed until all the systems are solved. We observe in practice a super-convergence behaviour of the CG process of the seed system when compared with the usual CG process. We also observe that only a small number of restarts is required to solve all the systems if the right-hand sides are close to each other. These two features together make the method particularly effective. In this talk, we give theoretical proof to justify these observations. Furthermore, we combine the advantages of this method and the block CG method and propose a block extension of this single seed method. The above procedure can actually be modified for solving multiple linear systems A{sup (i)}x{sup (i)} = b{sup (i)}, where A{sup (i)} are now different. We can also extend the previous analytical results to this more general case. Applications of this method to multiple related linear systems arising from image restoration and recursive least squares computations are considered as examples.
Comments on new iterative methods for solving linear systems
Directory of Open Access Journals (Sweden)
Wang Ke
2017-06-01
Full Text Available Some new iterative methods were presented by Du, Zheng and Wang for solving linear systems in [3], where it is shown that the new methods, comparing to the classical Jacobi or Gauss-Seidel method, can be applied to more systems and have faster convergence. This note shows that their methods are suitable for more matrices than positive matrices which the authors suggested through further analysis and numerical examples.
CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM
Directory of Open Access Journals (Sweden)
S.H. Nasseri
2011-07-01
Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.
CHEBYSHEV ACCELERATION TECHNIQUE FOR SOLVING FUZZY LINEAR SYSTEM
Directory of Open Access Journals (Sweden)
S.H. Nasseri
2009-10-01
Full Text Available In this paper, Chebyshev acceleration technique is used to solve the fuzzy linear system (FLS. This method is discussed in details and followed by summary of some other acceleration techniques. Moreover, we show that in some situations that the methods such as Jacobi, Gauss-Sidel, SOR and conjugate gradient is divergent, our proposed method is applicable and the acquired results are illustrated by some numerical examples.
AZTEC: A parallel iterative package for the solving linear systems
Energy Technology Data Exchange (ETDEWEB)
Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S. [Sandia National Labs., Albuquerque, NM (United States)
1996-12-31
We describe a parallel linear system package, AZTEC. The package incorporates a number of parallel iterative methods (e.g. GMRES, biCGSTAB, CGS, TFQMR) and preconditioners (e.g. Jacobi, Gauss-Seidel, polynomial, domain decomposition with LU or ILU within subdomains). Additionally, AZTEC allows for the reuse of previous preconditioning factorizations within Newton schemes for nonlinear methods. Currently, a number of different users are using this package to solve a variety of PDE applications.
Solving linear inequalities in a least squares sense
Energy Technology Data Exchange (ETDEWEB)
Bramley, R.; Winnicka, B. [Indiana Univ., Bloomington, IN (United States)
1994-12-31
Let A {element_of} {Re}{sup mxn} be an arbitrary real matrix, and let b {element_of} {Re}{sup m} a given vector. A familiar problem in computational linear algebra is to solve the system Ax = b in a least squares sense; that is, to find an x* minimizing {parallel}Ax {minus} b{parallel}, where {parallel} {center_dot} {parallel} refers to the vector two-norm. Such an x* solves the normal equations A{sup T}(Ax {minus} b) = 0, and the optimal residual r* = b {minus} Ax* is unique (although x* need not be). The least squares problem is usually interpreted as corresponding to multiple observations, represented by the rows of A and b, on a vector of data x. The observations may be inconsistent, and in this case a solution is sought that minimizes the norm of the residuals. A less familiar problem to numerical linear algebraists is the solution of systems of linear inequalities Ax {le} b in a least squares sense, but the motivation is similar: if a set of observations places upper or lower bounds on linear combinations of variables, the authors want to find x* minimizing {parallel} (Ax {minus} b){sub +} {parallel}, where the i{sup th} component of the vector v{sub +} is the maximum of zero and the i{sup th} component of v.
Mathematics Literacy of Secondary Students in Solving Simultanenous Linear Equations
Sitompul, R. S. I.; Budayasa, I. K.; Masriyah
2018-01-01
This study examines the profile of secondary students’ mathematical literacy in solving simultanenous linear equations problems in terms of cognitive style of visualizer and verbalizer. This research is a descriptive research with qualitative approach. The subjects in this research consist of one student with cognitive style of visualizer and one student with cognitive style of verbalizer. The main instrument in this research is the researcher herself and supporting instruments are cognitive style tests, mathematics skills tests, problem-solving tests and interview guidelines. Research was begun by determining the cognitive style test and mathematics skill test. The subjects chosen were given problem-solving test about simultaneous linear equations and continued with interview. To ensure the validity of the data, the researcher conducted data triangulation; the steps of data reduction, data presentation, data interpretation, and conclusion drawing. The results show that there is a similarity of visualizer and verbalizer-cognitive style in identifying and understanding the mathematical structure in the process of formulating. There are differences in how to represent problems in the process of implementing, there are differences in designing strategies and in the process of interpreting, and there are differences in explaining the logical reasons.
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....
High Productivity Programming of Dense Linear Algebra on Heterogeneous NUMA Architectures
Alomairy, Rabab M.
2013-07-01
High-end multicore systems with GPU-based accelerators are now ubiquitous in the hardware landscape. Besides dealing with the nontrivial heterogeneous environ- ment, end users should often take into consideration the underlying memory architec- ture to decrease the overhead of data motion, especially when running on non-uniform memory access (NUMA) platforms. We propose the OmpSs parallel programming model approach using its Nanos++ dynamic runtime system to solve the two challeng- ing problems aforementioned, through 1) an innovative NUMA node-aware scheduling policy to reduce data movement between NUMA nodes and 2) a nested parallelism feature to concurrently exploit the resources available from the GPU devices as well as the CPU host, without compromising the overall performance. Our approach fea- tures separation of concerns by abstracting the complexity of the hardware from the end users so that high productivity can be achieved. The Cholesky factorization is used as a benchmark representative of dense numerical linear algebra algorithms. Superior performance is also demonstrated on the symmetric matrix inversion based on Cholesky factorization, commonly used in co-variance computations in statistics. Performance on a NUMA system with Kepler-based GPUs exceeds that of existing implementations, while the OmpSs-enabled code remains very similar to its original sequential version.
A recurrent neural network for solving bilevel linear programming problem.
He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian
2014-04-01
In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.
Solving large mixed linear models using preconditioned conjugate gradient iteration.
Strandén, I; Lidauer, M
1999-12-01
Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.
Ltaief, Hatem; Luszczek, Piotr R.; Dongarra, Jack
2011-01-01
This paper presents the power profile of two high performance dense linear algebra libraries i.e., LAPACK and PLASMA. The former is based on block algorithms that use the fork-join paradigm to achieve parallel performance. The latter uses fine
New approach to solve fully fuzzy system of linear equations using ...
Indian Academy of Sciences (India)
Known example problems are solved to illustrate the efficacy and ... The concept of fuzzy set and fuzzy number were first introduced by Zadeh .... (iii) Fully fuzzy linear systems can be solved by linear programming approach, Gauss elim-.
Batched Triangular Dense Linear Algebra Kernels for Very Small Matrix Sizes on GPUs
Charara, Ali; Keyes, David E.; Ltaief, Hatem
2017-01-01
Batched dense linear algebra kernels are becoming ubiquitous in scientific applications, ranging from tensor contractions in deep learning to data compression in hierarchical low-rank matrix approximation. Within a single API call, these kernels are capable of simultaneously launching up to thousands of similar matrix computations, removing the expensive overhead of multiple API calls while increasing the occupancy of the underlying hardware. A challenge is that for the existing hardware landscape (x86, GPUs, etc.), only a subset of the required batched operations is implemented by the vendors, with limited support for very small problem sizes. We describe the design and performance of a new class of batched triangular dense linear algebra kernels on very small data sizes using single and multiple GPUs. By deploying two-sided recursive formulations, stressing the register usage, maintaining data locality, reducing threads synchronization and fusing successive kernel calls, the new batched kernels outperform existing state-of-the-art implementations.
Batched Triangular Dense Linear Algebra Kernels for Very Small Matrix Sizes on GPUs
Charara, Ali
2017-03-06
Batched dense linear algebra kernels are becoming ubiquitous in scientific applications, ranging from tensor contractions in deep learning to data compression in hierarchical low-rank matrix approximation. Within a single API call, these kernels are capable of simultaneously launching up to thousands of similar matrix computations, removing the expensive overhead of multiple API calls while increasing the occupancy of the underlying hardware. A challenge is that for the existing hardware landscape (x86, GPUs, etc.), only a subset of the required batched operations is implemented by the vendors, with limited support for very small problem sizes. We describe the design and performance of a new class of batched triangular dense linear algebra kernels on very small data sizes using single and multiple GPUs. By deploying two-sided recursive formulations, stressing the register usage, maintaining data locality, reducing threads synchronization and fusing successive kernel calls, the new batched kernels outperform existing state-of-the-art implementations.
Multi-Threaded Dense Linear Algebra Libraries for Low-Power Asymmetric Multicore Processors
Catalán, Sandra; Herrero, José R.; Igual, Francisco D.; Rodríguez-Sánchez, Rafael; Quintana-Ortí, Enrique S.
2015-01-01
Dense linear algebra libraries, such as BLAS and LAPACK, provide a relevant collection of numerical tools for many scientific and engineering applications. While there exist high performance implementations of the BLAS (and LAPACK) functionality for many current multi-threaded architectures,the adaption of these libraries for asymmetric multicore processors (AMPs)is still pending. In this paper we address this challenge by developing an asymmetry-aware implementation of the BLAS, based on the...
Carpentieri, Bruno; Jing, Yan-Fei; Huang, Ting-Zhu; Pi, Wei-Chao; Sheng, Xin-Qing
We report on experiments with a novel family of Krylov subspace methods for solving dense, complex, non-Hermitian systems of linear equations arising from the Galerkin discretization of surface integral equation models in Electromagnetics. By some experiments on realistic radar-cross-section
Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
Directory of Open Access Journals (Sweden)
Oskar Cahueñas
2013-05-01
Full Text Available We address the issue of approximating the pseudoinverse of the coefficient matrix for dynamically building preconditioning strategies for the numerical solution of large dense linear least-squares problems. The new preconditioning strategies are embedded into simple and well-known iterative schemes that avoid the use of the, usually ill-conditioned, normal equations. We analyze a scheme to approximate the pseudoinverse, based on Schulz iterative method, and also different iterative schemes, based on extensions of Richardson's method, and the conjugate gradient method, that are suitable for preconditioning strategies. We present preliminary numerical results to illustrate the advantages of the proposed schemes.
Ten-Year-Old Students Solving Linear Equations
Brizuela, Barbara; Schliemann, Analucia
2004-01-01
In this article, the authors seek to re-conceptualize the perspective regarding students' difficulties with algebra. While acknowledging that students "do" have difficulties when learning algebra, they also argue that the generally espoused criteria for algebra as the ability to work with the syntactical rules for solving equations is…
Essential linear algebra with applications a problem-solving approach
Andreescu, Titu
2014-01-01
This textbook provides a rigorous introduction to linear algebra in addition to material suitable for a more advanced course while emphasizing the subject’s interactions with other topics in mathematics such as calculus and geometry. A problem-based approach is used to develop the theoretical foundations of vector spaces, linear equations, matrix algebra, eigenvectors, and orthogonality. Key features include: • a thorough presentation of the main results in linear algebra along with numerous examples to illustrate the theory; • over 500 problems (half with complete solutions) carefully selected for their elegance and theoretical significance; • an interleaved discussion of geometry and linear algebra, giving readers a solid understanding of both topics and the relationship between them. Numerous exercises and well-chosen examples make this text suitable for advanced courses at the junior or senior levels. It can also serve as a source of supplementary problems for a sophomore-level course. ...
A program package for solving linear optimization problems
International Nuclear Information System (INIS)
Horikami, Kunihiko; Fujimura, Toichiro; Nakahara, Yasuaki
1980-09-01
Seven computer programs for the solution of linear, integer and quadratic programming (four programs for linear programming, one for integer programming and two for quadratic programming) have been prepared and tested on FACOM M200 computer, and auxiliary programs have been written to make it easy to use the optimization program package. The characteristics of each program are explained and the detailed input/output descriptions are given in order to let users know how to use them. (author)
High-order quantum algorithm for solving linear differential equations
International Nuclear Information System (INIS)
Berry, Dominic W
2014-01-01
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms to general inhomogeneous sparse linear differential equations, which describe many classical physical systems. We examine the use of high-order methods (where the error over a time step is a high power of the size of the time step) to improve the efficiency. These provide scaling close to Δt 2 in the evolution time Δt. As with other algorithms of this type, the solution is encoded in amplitudes of the quantum state, and it is possible to extract global features of the solution. (paper)
Krylov subspace methods for solving large unsymmetric linear systems
International Nuclear Information System (INIS)
Saad, Y.
1981-01-01
Some algorithms based upon a projection process onto the Krylov subspace K/sub m/ = Span(r 0 , Ar 0 ,...,A/sup m/-1r 0 ) are developed, generalizing the method of conjugate gradients to unsymmetric systems. These methods are extensions of Arnoldi's algorithm for solving eigenvalue problems. The convergence is analyzed in terms of the distance of the solution to the subspace K/sub m/ and some error bounds are established showing, in particular, a similarity with the conjugate gradient method (for symmetric matrices) when the eigenvalues are real. Several numerical experiments are described and discussed
The intelligence of dual simplex method to solve linear fractional fuzzy transportation problem.
Narayanamoorthy, S; Kalyani, S
2015-01-01
An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.
The Intelligence of Dual Simplex Method to Solve Linear Fractional Fuzzy Transportation Problem
Directory of Open Access Journals (Sweden)
S. Narayanamoorthy
2015-01-01
Full Text Available An approach is presented to solve a fuzzy transportation problem with linear fractional fuzzy objective function. In this proposed approach the fractional fuzzy transportation problem is decomposed into two linear fuzzy transportation problems. The optimal solution of the two linear fuzzy transportations is solved by dual simplex method and the optimal solution of the fractional fuzzy transportation problem is obtained. The proposed method is explained in detail with an example.
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving
Bransen, Jeroen; van Binsbergen, L.Thomas; Claessen, Koen; Dijkstra, Atze
2015-01-01
Many computations over trees can be specified using attribute grammars. Compilers for attribute grammars need to find an evaluation order (or schedule) in order to generate efficient code. For the class of linearly ordered attribute grammars such a schedule can be found statically, but this problem
Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems
Czech Academy of Sciences Publication Activity Database
Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav
2014-01-01
Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014
Hybrid Method for Solving Inventory Problems with a Linear ...
African Journals Online (AJOL)
Osagiede and Omosigho (2004) proposed a direct search method for identifying the number of replenishment when the demand pattern is linearly increasing. The main computational task in this direct search method was associated with finding the optimal number of replenishments. To accelerate the use of this method, the ...
Ltaief, Hatem
2011-08-31
This paper presents the power profile of two high performance dense linear algebra libraries i.e., LAPACK and PLASMA. The former is based on block algorithms that use the fork-join paradigm to achieve parallel performance. The latter uses fine-grained task parallelism that recasts the computation to operate on submatrices called tiles. In this way tile algorithms are formed. We show results from the power profiling of the most common routines, which permits us to clearly identify the different phases of the computations. This allows us to isolate the bottlenecks in terms of energy efficiency. Our results show that PLASMA surpasses LAPACK not only in terms of performance but also in terms of energy efficiency. © 2011 Springer-Verlag.
ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations
Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil
2018-04-01
In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.
Directory of Open Access Journals (Sweden)
Tunjo Perić
2017-01-01
Full Text Available This paper presents and analyzes the applicability of three linearization techniques used for solving multi-objective linear fractional programming problems using the goal programming method. The three linearization techniques are: (1 Taylor’s polynomial linearization approximation, (2 the method of variable change, and (3 a modification of the method of variable change proposed in [20]. All three linearization techniques are presented and analyzed in two variants: (a using the optimal value of the objective functions as the decision makers’ aspirations, and (b the decision makers’ aspirations are given by the decision makers. As the criteria for the analysis we use the efficiency of the obtained solutions and the difficulties the analyst comes upon in preparing the linearization models. To analyze the applicability of the linearization techniques incorporated in the linear goal programming method we use an example of a financial structure optimization problem.
Parallel computation for solving the tridiagonal linear system of equations
International Nuclear Information System (INIS)
Ishiguro, Misako; Harada, Hiroo; Fujii, Minoru; Fujimura, Toichiro; Nakamura, Yasuhiro; Nanba, Katsumi.
1981-09-01
Recently, applications of parallel computation for scientific calculations have increased from the need of the high speed calculation of large scale programs. At the JAERI computing center, an array processor FACOM 230-75 APU has installed to study the applicability of parallel computation for nuclear codes. We made some numerical experiments by using the APU on the methods of solution of tridiagonal linear equation which is an important problem in scientific calculations. Referring to the recent papers with parallel methods, we investigate eight ones. These are Gauss elimination method, Parallel Gauss method, Accelerated parallel Gauss method, Jacobi method, Recursive doubling method, Cyclic reduction method, Chebyshev iteration method, and Conjugate gradient method. The computing time and accuracy were compared among the methods on the basis of the numerical experiments. As the result, it is found that the Cyclic reduction method is best both in computing time and accuracy and the Gauss elimination method is the second one. (author)
International Nuclear Information System (INIS)
Kanamori, Takahiro; Kamata, Shouji; Ito, Shinichi.
1989-01-01
A prototype high energy X-ray CT (computed tomography) system has been developed which employs a linear accelerator as the X-ray source (max. photon energy: 12 MeV). One problem encountered in development of this CT system was to reduce the scattered photons from adjacent detectors, i.e. crosstalk, due to high energy X-rays. This crosstalk was reduced to 2% by means of detector shields using tungsten spacers. Spatial resolution was not affected by such small crosstalk as confirmed by numerical simulations. A second problem was to reduce the scattered photons from the test object. This was done using collimators. A third concern was to realize a wide dynamic range data processing which would allow applications to large and dense objects. This problem was solved by using a sample and hold data acquisition method to reduce the dark current of the photo detectors. The dynamic range of this system was experimentally confirmed over 60 dB. It was demonstrated that slits (width: 2 mm) in an iron object (diameter: 25 cm) could be imaged by this prototype CT system. (author)
Directory of Open Access Journals (Sweden)
Mohammad Almousa
2013-01-01
Full Text Available The aim of this study is to present the use of a semi analytical method called the optimal homotopy asymptotic method (OHAM for solving the linear Fredholm integral equations of the first kind. Three examples are discussed to show the ability of the method to solve the linear Fredholm integral equations of the first kind. The results indicated that the method is very effective and simple.
Nahay, John Michael
2008-01-01
We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order Abel differential equation with two nonlinear terms in order to demonstrate in as much detail as possible the computations necessary for a complete solution. We mention in our section on further developments that the basic transformation idea can be generali...
Jamali, R. M. Jalal Uddin; Hashem, M. M. A.; Hasan, M. Mahfuz; Rahman, Md. Bazlar
2013-01-01
Solving a set of simultaneous linear equations is probably the most important topic in numerical methods. For solving linear equations, iterative methods are preferred over the direct methods especially when the coefficient matrix is sparse. The rate of convergence of iteration method is increased by using Successive Relaxation (SR) technique. But SR technique is very much sensitive to relaxation factor, {\\omega}. Recently, hybridization of classical Gauss-Seidel based successive relaxation t...
A goal programming procedure for solving fuzzy multiobjective fractional linear programming problems
Directory of Open Access Journals (Sweden)
Tunjo Perić
2014-12-01
Full Text Available This paper presents a modification of Pal, Moitra and Maulik's goal programming procedure for fuzzy multiobjective linear fractional programming problem solving. The proposed modification of the method allows simpler solving of economic multiple objective fractional linear programming (MOFLP problems, enabling the obtained solutions to express the preferences of the decision maker defined by the objective function weights. The proposed method is tested on the production planning example.
Abdelfattah, Ahmad
2015-01-15
High performance computing (HPC) platforms are evolving to more heterogeneous configurations to support the workloads of various applications. The current hardware landscape is composed of traditional multicore CPUs equipped with hardware accelerators that can handle high levels of parallelism. Graphical Processing Units (GPUs) are popular high performance hardware accelerators in modern supercomputers. GPU programming has a different model than that for CPUs, which means that many numerical kernels have to be redesigned and optimized specifically for this architecture. GPUs usually outperform multicore CPUs in some compute intensive and massively parallel applications that have regular processing patterns. However, most scientific applications rely on crucial memory-bound kernels and may witness bottlenecks due to the overhead of the memory bus latency. They can still take advantage of the GPU compute power capabilities, provided that an efficient architecture-aware design is achieved. This dissertation presents a uniform design strategy for optimizing critical memory-bound kernels on GPUs. Based on hierarchical register blocking, double buffering and latency hiding techniques, this strategy leverages the performance of a wide range of standard numerical kernels found in dense and sparse linear algebra libraries. The work presented here focuses on matrix-vector multiplication kernels (MVM) as repre- sentative and most important memory-bound operations in this context. Each kernel inherits the benefits of the proposed strategies. By exposing a proper set of tuning parameters, the strategy is flexible enough to suit different types of matrices, ranging from large dense matrices, to sparse matrices with dense block structures, while high performance is maintained. Furthermore, the tuning parameters are used to maintain the relative performance across different GPU architectures. Multi-GPU acceleration is proposed to scale the performance on several devices. The
M. ZANGIABADI; H. R. MALEKI
2007-01-01
In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...
Directory of Open Access Journals (Sweden)
Mihai-Victor PRICOP
2010-09-01
Full Text Available The present paper introduces a numerical approach of static linear elasticity equations for anisotropic materials. The domain and boundary conditions are simple, to enhance an easy implementation of the finite difference scheme. SOR and gradient are used to solve the resulting linear system. The simplicity of the geometry is also useful for MPI parallelization of the code.
EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.
Jarvis, John J.; And Others
Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…
New approach to solve fully fuzzy system of linear equations using ...
Indian Academy of Sciences (India)
This paper proposes two new methods to solve fully fuzzy system of linear equations. The fuzzy system has been converted to a crisp system of linear equations by using single and double parametric form of fuzzy numbers to obtain the non-negative solution. Double parametric form of fuzzy numbers is defined and applied ...
Solving non-linear Horn clauses using a linear Horn clause solver
DEFF Research Database (Denmark)
Kafle, Bishoksan; Gallagher, John Patrick; Ganty, Pierre
2016-01-01
In this paper we show that checking satisfiability of a set of non-linear Horn clauses (also called a non-linear Horn clause program) can be achieved using a solver for linear Horn clauses. We achieve this by interleaving a program transformation with a satisfiability checker for linear Horn...... clauses (also called a solver for linear Horn clauses). The program transformation is based on the notion of tree dimension, which we apply to a set of non-linear clauses, yielding a set whose derivation trees have bounded dimension. Such a set of clauses can be linearised. The main algorithm...... dimension. We constructed a prototype implementation of this approach and performed some experiments on a set of verification problems, which shows some promise....
International Nuclear Information System (INIS)
Gene Golub; Kwok Ko
2009-01-01
The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.
Chosen interval methods for solving linear interval systems with special type of matrix
Szyszka, Barbara
2013-10-01
The paper is devoted to chosen direct interval methods for solving linear interval systems with special type of matrix. This kind of matrix: band matrix with a parameter, from finite difference problem is obtained. Such linear systems occur while solving one dimensional wave equation (Partial Differential Equations of hyperbolic type) by using the central difference interval method of the second order. Interval methods are constructed so as the errors of method are enclosed in obtained results, therefore presented linear interval systems contain elements that determining the errors of difference method. The chosen direct algorithms have been applied for solving linear systems because they have no errors of method. All calculations were performed in floating-point interval arithmetic.
Numerical method for solving linear Fredholm fuzzy integral equations of the second kind
Energy Technology Data Exchange (ETDEWEB)
Abbasbandy, S. [Department of Mathematics, Imam Khomeini International University, P.O. Box 288, Ghazvin 34194 (Iran, Islamic Republic of)]. E-mail: saeid@abbasbandy.com; Babolian, E. [Faculty of Mathematical Sciences and Computer Engineering, Teacher Training University, Tehran 15618 (Iran, Islamic Republic of); Alavi, M. [Department of Mathematics, Arak Branch, Islamic Azad University, Arak 38135 (Iran, Islamic Republic of)
2007-01-15
In this paper we use parametric form of fuzzy number and convert a linear fuzzy Fredholm integral equation to two linear system of integral equation of the second kind in crisp case. We can use one of the numerical method such as Nystrom and find the approximation solution of the system and hence obtain an approximation for fuzzy solution of the linear fuzzy Fredholm integral equations of the second kind. The proposed method is illustrated by solving some numerical examples.
Energy Technology Data Exchange (ETDEWEB)
Alleon, G. [EADS-CCR, 31 - Blagnac (France); Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E. [Cerfacs, 31 - Toulouse (France)
2003-07-01
The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)
International Nuclear Information System (INIS)
Alleon, G.; Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E.
2003-01-01
The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)
International Nuclear Information System (INIS)
Ravi Kanth, A.S.V.; Aruna, K.
2009-01-01
In this paper, we propose a reliable algorithm to develop exact and approximate solutions for the linear and nonlinear Schroedinger equations. The approach rest mainly on two-dimensional differential transform method which is one of the approximate methods. The method can easily be applied to many linear and nonlinear problems and is capable of reducing the size of computational work. Exact solutions can also be achieved by the known forms of the series solutions. Several illustrative examples are given to demonstrate the effectiveness of the present method.
A new neural network model for solving random interval linear programming problems.
Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza
2017-05-01
This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.
Method for solving fully fuzzy linear programming problems using deviation degree measure
Institute of Scientific and Technical Information of China (English)
Haifang Cheng; Weilai Huang; Jianhu Cai
2013-01-01
A new ful y fuzzy linear programming (FFLP) prob-lem with fuzzy equality constraints is discussed. Using deviation degree measures, the FFLP problem is transformed into a crispδ-parametric linear programming (LP) problem. Giving the value of deviation degree in each constraint, the δ-fuzzy optimal so-lution of the FFLP problem can be obtained by solving this LP problem. An algorithm is also proposed to find a balance-fuzzy optimal solution between two goals in conflict: to improve the va-lues of the objective function and to decrease the values of the deviation degrees. A numerical example is solved to il ustrate the proposed method.
On a new iterative method for solving linear systems and comparison results
Jing, Yan-Fei; Huang, Ting-Zhu
2008-10-01
In Ujevic [A new iterative method for solving linear systems, Appl. Math. Comput. 179 (2006) 725-730], the author obtained a new iterative method for solving linear systems, which can be considered as a modification of the Gauss-Seidel method. In this paper, we show that this is a special case from a point of view of projection techniques. And a different approach is established, which is both theoretically and numerically proven to be better than (at least the same as) Ujevic's. As the presented numerical examples show, in most cases, the convergence rate is more than one and a half that of Ujevic.
Guo, Sangang
2017-09-01
There are two stages in solving security-constrained unit commitment problems (SCUC) within Lagrangian framework: one is to obtain feasible units’ states (UC), the other is power economic dispatch (ED) for each unit. The accurate solution of ED is more important for enhancing the efficiency of the solution to SCUC for the fixed feasible units’ statues. Two novel methods named after Convex Combinatorial Coefficient Method and Power Increment Method respectively based on linear programming problem for solving ED are proposed by the piecewise linear approximation to the nonlinear convex fuel cost functions. Numerical testing results show that the methods are effective and efficient.
Directory of Open Access Journals (Sweden)
Ai-Min Yang
2014-01-01
Full Text Available The local fractional Laplace variational iteration method was applied to solve the linear local fractional partial differential equations. The local fractional Laplace variational iteration method is coupled by the local fractional variational iteration method and Laplace transform. The nondifferentiable approximate solutions are obtained and their graphs are also shown.
Directory of Open Access Journals (Sweden)
Jen-Yuan Chen
2014-01-01
Full Text Available Continuing from the works of Li et al. (2014, Li (2007, and Kincaid et al. (2000, we present more generalizations and modifications of iterative methods for solving large sparse symmetric and nonsymmetric indefinite systems of linear equations. We discuss a variety of iterative methods such as GMRES, MGMRES, MINRES, LQ-MINRES, QR MINRES, MMINRES, MGRES, and others.
The H-N method for solving linear transport equation: theory and application
International Nuclear Information System (INIS)
Kaskas, A.; Gulecyuz, M.C.; Tezcan, C.
2002-01-01
The system of singular integral equation which is obtained from the integro-differential form of the linear transport equation as a result of Placzec lemma is solved. Application are given using the exit distributions and the infinite medium Green's function. The same theoretical results are also obtained with the use of the singular eigenfunction of the method of elementary solutions
Object-Based Dense Matching Method for Maintaining Structure Characteristics of Linear Buildings.
Su, Nan; Yan, Yiming; Qiu, Mingjie; Zhao, Chunhui; Wang, Liguo
2018-03-29
In this paper, we proposed a novel object-based dense matching method specially for the high-precision disparity map of building objects in urban areas, which can maintain accurate object structure characteristics. The proposed framework mainly includes three stages. Firstly, an improved edge line extraction method is proposed for the edge segments to fit closely to building outlines. Secondly, a fusion method is proposed for the outlines under the constraint of straight lines, which can maintain the building structural attribute with parallel or vertical edges, which is very useful for the dense matching method. Finally, we proposed an edge constraint and outline compensation (ECAOC) dense matching method to maintain building object structural characteristics in the disparity map. In the proposed method, the improved edge lines are used to optimize matching search scope and matching template window, and the high-precision building outlines are used to compensate the shape feature of building objects. Our method can greatly increase the matching accuracy of building objects in urban areas, especially at building edges. For the outline extraction experiments, our fusion method verifies the superiority and robustness on panchromatic images of different satellites and different resolutions. For the dense matching experiments, our ECOAC method shows great advantages for matching accuracy of building objects in urban areas compared with three other methods.
Object-Based Dense Matching Method for Maintaining Structure Characteristics of Linear Buildings
Directory of Open Access Journals (Sweden)
Nan Su
2018-03-01
Full Text Available In this paper, we proposed a novel object-based dense matching method specially for the high-precision disparity map of building objects in urban areas, which can maintain accurate object structure characteristics. The proposed framework mainly includes three stages. Firstly, an improved edge line extraction method is proposed for the edge segments to fit closely to building outlines. Secondly, a fusion method is proposed for the outlines under the constraint of straight lines, which can maintain the building structural attribute with parallel or vertical edges, which is very useful for the dense matching method. Finally, we proposed an edge constraint and outline compensation (ECAOC dense matching method to maintain building object structural characteristics in the disparity map. In the proposed method, the improved edge lines are used to optimize matching search scope and matching template window, and the high-precision building outlines are used to compensate the shape feature of building objects. Our method can greatly increase the matching accuracy of building objects in urban areas, especially at building edges. For the outline extraction experiments, our fusion method verifies the superiority and robustness on panchromatic images of different satellites and different resolutions. For the dense matching experiments, our ECOAC method shows great advantages for matching accuracy of building objects in urban areas compared with three other methods.
Analysis of junior high school students' attempt to solve a linear inequality problem
Taqiyuddin, Muhammad; Sumiaty, Encum; Jupri, Al
2017-08-01
Linear inequality is one of fundamental subjects within junior high school mathematics curricula. Several studies have been conducted to asses students' perform on linear inequality. However, it can hardly be found that linear inequality problems are in the form of "ax + b condition leads to the research questions concerning students' attempt on solving a simple linear inequality problem in this form. In order to do so, the written test was administered to 58 students from two schools in Bandung followed by interviews. The other sources of the data are from teachers' interview and mathematics books used by students. After that, the constant comparative method was used to analyse the data. The result shows that the majority approached the question by doing algebraic operations. Interestingly, most of them did it incorrectly. In contrast, algebraic operations were correctly used by some of them. Moreover, the others performed expected-numbers solution, rewriting the question, translating the inequality into words, and blank answer. Furthermore, we found that there is no one who was conscious of the existence of all-numbers solution. It was found that this condition is reasonably due to how little the learning components concern about why a procedure of solving a linear inequality works and possibilities of linear inequality solution.
Matrix form of Legendre polynomials for solving linear integro-differential equations of high order
Kammuji, M.; Eshkuvatov, Z. K.; Yunus, Arif A. M.
2017-04-01
This paper presents an effective approximate solution of high order of Fredholm-Volterra integro-differential equations (FVIDEs) with boundary condition. Legendre truncated series is used as a basis functions to estimate the unknown function. Matrix operation of Legendre polynomials is used to transform FVIDEs with boundary conditions into matrix equation of Fredholm-Volterra type. Gauss Legendre quadrature formula and collocation method are applied to transfer the matrix equation into system of linear algebraic equations. The latter equation is solved by Gauss elimination method. The accuracy and validity of this method are discussed by solving two numerical examples and comparisons with wavelet and methods.
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.
Solving linear systems in FLICA-4, thermohydraulic code for 3-D transient computations
International Nuclear Information System (INIS)
Allaire, G.
1995-01-01
FLICA-4 is a computer code, developed at the CEA (France), devoted to steady state and transient thermal-hydraulic analysis of nuclear reactor cores, for small size problems (around 100 mesh cells) as well as for large ones (more than 100000), on, either standard workstations or vector super-computers. As for time implicit codes, the largest time and memory consuming part of FLICA-4 is the routine dedicated to solve the linear system (the size of which is of the order of the number of cells). Therefore, the efficiency of the code is crucially influenced by the optimization of the algorithms used in assembling and solving linear systems: direct methods as the Gauss (or LU) decomposition for moderate size problems, iterative methods as the preconditioned conjugate gradient for large problems. 6 figs., 13 refs
Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables
Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.
2018-02-01
In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.
Directory of Open Access Journals (Sweden)
Salih Yalcinbas
2016-01-01
Full Text Available In this paper, a new collocation method based on the Fibonacci polynomials is introduced to solve the high-order linear Volterra integro-differential equations under the conditions. Numerical examples are included to demonstrate the applicability and validity of the proposed method and comparisons are made with the existing results. In addition, an error estimation based on the residual functions is presented for this method. The approximate solutions are improved by using this error estimation.
Stress-constrained truss topology optimization problems that can be solved by linear programming
DEFF Research Database (Denmark)
Stolpe, Mathias; Svanberg, Krister
2004-01-01
We consider the problem of simultaneously selecting the material and determining the area of each bar in a truss structure in such a way that the cost of the structure is minimized subject to stress constraints under a single load condition. We show that such problems can be solved by linear...... programming to give the global optimum, and that two different materials are always sufficient in an optimal structure....
Using a grid platform for solving large sparse linear systems over GF(2)
Kleinjung , Thorsten; Nussbaum , Lucas; Thomé , Emmanuel
2010-01-01
International audience; In Fall 2009, the final step of the factorization of rsa768 was carried out on several clusters of the Grid'5000 platform, leading to a new record in integer factorization. This step involves solving a huge sparse linear system defined over the binary field GF(2). This article aims at describing the algorithm used, the difficulties encountered, and the methodology which led to success. In particular, we illustrate how our use of the block Wiedemann algorithm led to a m...
Cichocki, A; Unbehauen, R
1994-01-01
In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known algorithms: the row-action projection-Kaczmarz algorithm and/or the LMS (Adaline) Widrow-Hoff algorithms. The algorithms can be applied to any problem which can be formulated as a linear regression problem. The correctness and high performance of the proposed neural networks are illustrated by extensive computer simulation results.
A parallel algorithm for solving linear equations arising from one-dimensional network problems
International Nuclear Information System (INIS)
Mesina, G.L.
1991-01-01
One-dimensional (1-D) network problems, such as those arising from 1- D fluid simulations and electrical circuitry, produce systems of sparse linear equations which are nearly tridiagonal and contain a few non-zero entries outside the tridiagonal. Most direct solution techniques for such problems either do not take advantage of the special structure of the matrix or do not fully utilize parallel computer architectures. We describe a new parallel direct linear equation solution algorithm, called TRBR, which is especially designed to take advantage of this structure on MIMD shared memory machines. The new method belongs to a family of methods which split the coefficient matrix into the sum of a tridiagonal matrix T and a matrix comprised of the remaining coefficients R. Efficient tridiagonal methods are used to algebraically simplify the linear system. A smaller auxiliary subsystem is created and solved and its solution is used to calculate the solution of the original system. The newly devised BR method solves the subsystem. The serial and parallel operation counts are given for the new method and related earlier methods. TRBR is shown to have the smallest operation count in this class of direct methods. Numerical results are given. Although the algorithm is designed for one-dimensional networks, it has been applied successfully to three-dimensional problems as well. 20 refs., 2 figs., 4 tabs
International Nuclear Information System (INIS)
Huang Zhenghai; Gu Weizhe
2008-01-01
In this paper, we construct an augmented system of the standard monotone linear complementarity problem (LCP), and establish the relations between the augmented system and the LCP. We present a smoothing-type algorithm for solving the augmented system. The algorithm is shown to be globally convergent without assuming any prior knowledge of feasibility/infeasibility of the problem. In particular, if the LCP has a solution, then the algorithm either generates a maximal complementary solution of the LCP or detects correctly solvability of the LCP, and in the latter case, an existing smoothing-type algorithm can be directly applied to solve the LCP without any additional assumption and it generates a maximal complementary solution of the LCP; and that if the LCP is infeasible, then the algorithm detect correctly infeasibility of the LCP. To the best of our knowledge, such properties have not appeared in the existing literature for smoothing-type algorithms
Scilab software as an alternative low-cost computing in solving the linear equations problem
Agus, Fahrul; Haviluddin
2017-02-01
Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited.
Development and adjustment of programs for solving systems of linear equations
International Nuclear Information System (INIS)
Fujimura, Toichiro
1978-03-01
Programs for solving the systems of linear equations have been adjusted and developed in expanding the scientific subroutine library SSL. The principal programs adjusted are based on the congruent method, method of product form of the inverse, orthogonal method, Crout's method for sparse system, and acceleration of iterative methods. The programs developed are based on the escalator method, direct parallel residue method and block tridiagonal method for band system. Described are usage of the programs developed and their future improvement. FORTRAN lists with simple examples in tests of the programs are also given. (auth.)
Parallel Implementation of 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 usually the main computational effort. In this paper...... an alternative version of the Riccati recursion solver for LQ control problems is presented. The performance of both the classical and the alternative version is analyzed from a theoretical as well as a numerical point of view, and the alternative version is found to be approximately 50% faster than...
Directory of Open Access Journals (Sweden)
Animesh Biswas
2016-04-01
Full Text Available This paper deals with fuzzy goal programming approach to solve fuzzy linear bilevel integer programming problems with fuzzy probabilistic constraints following Pareto distribution and Frechet distribution. In the proposed approach a new chance constrained programming methodology is developed from the view point of managing those probabilistic constraints in a hybrid fuzzy environment. A method of defuzzification of fuzzy numbers using ?-cut has been adopted to reduce the problem into a linear bilevel integer programming problem. The individual optimal value of the objective of each DM is found in isolation to construct the fuzzy membership goals. Finally, fuzzy goal programming approach is used to achieve maximum degree of each of the membership goals by minimizing under deviational variables in the decision making environment. To demonstrate the efficiency of the proposed approach, a numerical example is provided.
A new modified conjugate gradient coefficient for solving system of linear equations
Hajar, N.; ‘Aini, N.; Shapiee, N.; Abidin, Z. Z.; Khadijah, W.; Rivaie, M.; Mamat, M.
2017-09-01
Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations
Linear and nonlinear rheology of dense emulsions across the glass and the jamming regimes
International Nuclear Information System (INIS)
Scheffold, F; Cardinaux, F; Mason, T G
2013-01-01
We discuss the linear and nonlinear rheology of concentrated microscale emulsions, amorphous disordered solids composed of repulsive and deformable soft colloidal spheres. Based on recent results from simulation and theory, we derive quantitative predictions for the dependences of the elastic shear modulus and the yield stress on the droplet volume fraction. The remarkable agreement with experiments we observe supports the scenario that the repulsive glass and the jammed state can be clearly identified in the rheology of soft spheres at finite temperature while crossing continuously from a liquid to a highly compressed yet disordered solid. (fast track communication)
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.
An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem
Directory of Open Access Journals (Sweden)
Meriem Ait Mehdi
2014-01-01
Full Text Available We describe an improvement of Chergui and Moulaï’s method (2008 that generates the whole efficient set of a multiobjective integer linear fractional program based on the branch and cut concept. The general step of this method consists in optimizing (maximizing without loss of generality one of the fractional objective functions over a subset of the original continuous feasible set; then if necessary, a branching process is carried out until obtaining an integer feasible solution. At this stage, an efficient cut is built from the criteria’s growth directions in order to discard a part of the feasible domain containing only nonefficient solutions. Our contribution concerns firstly the optimization process where a linear program that we define later will be solved at each step rather than a fractional linear program. Secondly, local ideal and nadir points will be used as bounds to prune some branches leading to nonefficient solutions. The computational experiments show that the new method outperforms the old one in all the treated instances.
A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
Chan, Tony; Szeto, Tedd
1994-03-01
We propose a new and more stable variant of the CGS method [27] for solving nonsymmetric linear systems. The method is based on squaring the Composite Step BCG method, introduced recently by Bank and Chan [1,2], which itself is a stabilized variant of BCG in that it skips over steps for which the BCG iterate is not defined and causes one kind of breakdown in BCG. By doing this, we obtain a method (Composite Step CGS or CSCGS) which not only handles the breakdowns described above, but does so with the advantages of CGS, namely, no multiplications by the transpose matrix and a faster convergence rate than BCG. Our strategy for deciding whether to skip a step does not involve any machine dependent parameters and is designed to skip near breakdowns as well as produce smoother iterates. Numerical experiments show that the new method does produce improved performance over CGS on practical problems.
Non-linear algorithms solved with the help of the GIBIANE macro-language
International Nuclear Information System (INIS)
Ebersolt, L.; Combescure, A.; Millard, A.; Verpeaux, P.
1987-01-01
Non linear finite element problems are often solved with the help of iteratives procedures. In the finite element program CASTEM 2000, the syntax of the dataset permits the user to derive his own algorithm and tune it to his problem. These basic ideas, simple to imagine, needed a proper frame to be materialized in a general purpose finite element program, and three concepts emerged: Operators, the Gibiane macro-language. In the two first paragraphs, we will detail these concepts, in the third paragraph, we will describe the different possibilities of the program, in the fourth paragraph, we will show, by combining operators in a proper order, how to obtain the desired algorithm. (orig./GL)
DEFF Research Database (Denmark)
Barari, Amin; Ganjavi, B.; Jeloudar, M. Ghanbari
2010-01-01
and fluid mechanics. Design/methodology/approach – Two new but powerful analytical methods, namely, He's VIM and HPM, are introduced to solve some boundary value problems in structural engineering and fluid mechanics. Findings – Analytical solutions often fit under classical perturbation methods. However......, as with other analytical techniques, certain limitations restrict the wide application of perturbation methods, most important of which is the dependence of these methods on the existence of a small parameter in the equation. Disappointingly, the majority of nonlinear problems have no small parameter at all......Purpose – In the last two decades with the rapid development of nonlinear science, there has appeared ever-increasing interest of scientists and engineers in the analytical techniques for nonlinear problems. This paper considers linear and nonlinear systems that are not only regarded as general...
Solving block linear systems with low-rank off-diagonal blocks is easily parallelizable
Energy Technology Data Exchange (ETDEWEB)
Menkov, V. [Indiana Univ., Bloomington, IN (United States)
1996-12-31
An easily and efficiently parallelizable direct method is given for solving a block linear system Bx = y, where B = D + Q is the sum of a non-singular block diagonal matrix D and a matrix Q with low-rank blocks. This implicitly defines a new preconditioning method with an operation count close to the cost of calculating a matrix-vector product Qw for some w, plus at most twice the cost of calculating Qw for some w. When implemented on a parallel machine the processor utilization can be as good as that of those operations. Order estimates are given for the general case, and an implementation is compared to block SSOR preconditioning.
International Nuclear Information System (INIS)
Hernandez-Walls, R; Martín-Atienza, B; Salinas-Matus, M; Castillo, J
2017-01-01
When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations. (paper)
Hernandez-Walls, R.; Martín-Atienza, B.; Salinas-Matus, M.; Castillo, J.
2017-11-01
When solving the linear inviscid shallow water equations with variable depth in one dimension using finite differences, a tridiagonal system of equations must be solved. Here we present an approach, which is more efficient than the commonly used numerical method, to solve this tridiagonal system of equations using a recursion formula. We illustrate this approach with an example in which we solve for a rectangular channel to find the resonance modes. Our numerical solution agrees very well with the analytical solution. This new method is easy to use and understand by undergraduate students, so it can be implemented in undergraduate courses such as Numerical Methods, Lineal Algebra or Differential Equations.
Directory of Open Access Journals (Sweden)
A. Aminataei
2014-05-01
Full Text Available In this paper, a new and ecient approach is applied for numerical approximation of the linear dierential equations with variable coecients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansioncoecients for the moments of derivatives of any dierentiable function in terms of the original expansion coecients of the function itself are given in the matrix form. The mainimportance of this scheme is that using this approach reduces solving the linear dierentialequations to solve a system of linear algebraic equations, thus greatly simplifying the problem. In addition, two experiments are given to demonstrate the validity and applicability of the method
A novel algebraic procedure for solving non-linear evolution equations of higher order
International Nuclear Information System (INIS)
Huber, Alfred
2007-01-01
We report here a systematic approach that can easily be used for solving non-linear partial differential equations (nPDE), especially of higher order. We restrict the analysis to the so called evolution equations describing any wave propagation. The proposed new algebraic approach leads us to traveling wave solutions and moreover, new class of solution can be obtained. The crucial step of our method is the basic assumption that the solutions satisfy an ordinary differential equation (ODE) of first order that can be easily integrated. The validity and reliability of the method is tested by its application to some non-linear evolution equations. The important aspect of this paper however is the fact that we are able to calculate distinctive class of solutions which cannot be found in the current literature. In other words, using this new algebraic method the solution manifold is augmented to new class of solution functions. Simultaneously we would like to stress the necessity of such sophisticated methods since a general theory of nPDE does not exist. Otherwise, for practical use the algebraic construction of new class of solutions is of fundamental interest
Performance prediction of gas turbines by solving a system of non-linear equations
Energy Technology Data Exchange (ETDEWEB)
Kaikko, J
1998-09-01
This study presents a novel method for implementing the performance prediction of gas turbines from the component models. It is based on solving the non-linear set of equations that corresponds to the process equations, and the mass and energy balances for the engine. General models have been presented for determining the steady state operation of single components. Single and multiple shad arrangements have been examined with consideration also being given to heat regeneration and intercooling. Emphasis has been placed upon axial gas turbines of an industrial scale. Applying the models requires no information of the structural dimensions of the gas turbines. On comparison with the commonly applied component matching procedures, this method incorporates several advantages. The application of the models for providing results is facilitated as less attention needs to be paid to calculation sequences and routines. Solving the set of equations is based on zeroing co-ordinate functions that are directly derived from the modelling equations. Therefore, controlling the accuracy of the results is easy. This method gives more freedom for the selection of the modelling parameters since, unlike for the matching procedures, exchanging these criteria does not itself affect the algorithms. Implicit relationships between the variables are of no significance, thus increasing the freedom for the modelling equations as well. The mathematical models developed in this thesis will provide facilities to optimise the operation of any major gas turbine configuration with respect to the desired process parameters. The computational methods used in this study may also be adapted to any other modelling problems arising in industry. (orig.) 36 refs.
Linear differential equations to solve nonlinear mechanical problems: A novel approach
Nair, C. Radhakrishnan
2004-01-01
Often a non-linear mechanical problem is formulated as a non-linear differential equation. A new method is introduced to find out new solutions of non-linear differential equations if one of the solutions of a given non-linear differential equation is known. Using the known solution of the non-linear differential equation, linear differential equations are set up. The solutions of these linear differential equations are found using standard techniques. Then the solutions of the linear differe...
Programmable Solution for Solving Non-linearity Characteristics of Smart Sensor Applications
Directory of Open Access Journals (Sweden)
S. Khan
2007-10-01
Full Text Available This paper presents a simple but programmable technique to solve the problem of non-linear characteristics of sensors used in more sensitive applications. The nonlinearity of the output response becomes a very sensitive issue in cases where a proportional increase in the physical quantity fails to bring about a proportional increase in the signal measured. The nonlinearity is addressed by using the interpolation method on the characteristics of a given sensor, approximating it to a set of tangent lines, the tangent points of which are recognized in the code of the processor by IF-THEN code. The method suggested here eliminates the use of external circuits for interfacing, and eases the programming burden on the processor at the cost of proportionally reduced memory requirements. The mathematically worked out results are compared with the simulation and experimental results for an IR sensor selected for the purpose and used for level measurement. This work will be of paramount importance and significance in applications where the controlled signal is required to follow the input signal precisely particularly in sensitive robotic applications.
Aihong Ren
2016-01-01
This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solut...
Directory of Open Access Journals (Sweden)
Faridah Hani Mohamed Salleh
2017-01-01
Full Text Available Gene regulatory network (GRN reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C as a direct interaction (A → C. Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Salleh, Faridah Hani Mohamed; Zainudin, Suhaila; Arif, Shereena M
2017-01-01
Gene regulatory network (GRN) reconstruction is the process of identifying regulatory gene interactions from experimental data through computational analysis. One of the main reasons for the reduced performance of previous GRN methods had been inaccurate prediction of cascade motifs. Cascade error is defined as the wrong prediction of cascade motifs, where an indirect interaction is misinterpreted as a direct interaction. Despite the active research on various GRN prediction methods, the discussion on specific methods to solve problems related to cascade errors is still lacking. In fact, the experiments conducted by the past studies were not specifically geared towards proving the ability of GRN prediction methods in avoiding the occurrences of cascade errors. Hence, this research aims to propose Multiple Linear Regression (MLR) to infer GRN from gene expression data and to avoid wrongly inferring of an indirect interaction (A → B → C) as a direct interaction (A → C). Since the number of observations of the real experiment datasets was far less than the number of predictors, some predictors were eliminated by extracting the random subnetworks from global interaction networks via an established extraction method. In addition, the experiment was extended to assess the effectiveness of MLR in dealing with cascade error by using a novel experimental procedure that had been proposed in this work. The experiment revealed that the number of cascade errors had been very minimal. Apart from that, the Belsley collinearity test proved that multicollinearity did affect the datasets used in this experiment greatly. All the tested subnetworks obtained satisfactory results, with AUROC values above 0.5.
Fonger, Nicole L.; Davis, Jon D.; Rohwer, Mary Lou
2018-01-01
This research addresses the issue of how to support students' representational fluency--the ability to create, move within, translate across, and derive meaning from external representations of mathematical ideas. The context of solving linear equations in a combined computer algebra system (CAS) and paper-and-pencil classroom environment is…
Energy Technology Data Exchange (ETDEWEB)
Moryakov, A. V., E-mail: sailor@orc.ru [National Research Centre Kurchatov Institute (Russian Federation)
2016-12-15
An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.
DEFF Research Database (Denmark)
Amini Afshar, Mostafa; Bingham, Harry B.
2017-01-01
. Frequency-domain results are then obtained from a Fourier transform of the force and motion signals. In order to make a robust Fourier transform, and capture the response around the critical frequency, the tail of the force signal is asymptotically extrapolated assuming a linear decay rate. Fourth......The linearized potential flow approximation for the forward speed radiation problem is solved in the time domain using a high-order finite difference method. The finite-difference discretization is developed on overlapping, curvilinear body-fitted grids. To ensure numerical stability...
Yanti, Y. R.; Amin, S. M.; Sulaiman, R.
2018-01-01
This study described representation of students who have musical, logical-mathematic and naturalist intelligence in solving a problem. Subjects were selected on the basis of multiple intelligence tests (TPM) consists of 108 statements, with 102 statements adopted from Chislet and Chapman and 6 statements equal to eksistensial intelligences. Data were analyzed based on problem-solving tests (TPM) and interviewing. See the validity of the data then problem-solving tests (TPM) and interviewing is given twice with an analyzed using the representation indikator and the problem solving step. The results showed that: the stage of presenting information known, stage of devising a plan, and stage of carrying out the plan those three subjects were using same form of representation. While he stage of presenting information asked and stage of looking back, subject of logical-mathematic was using different forms of representation with subjects of musical and naturalist intelligence. From this research is expected to provide input to the teacher in determining the learning strategy that will be used by considering the representation of students with the basis of multiple intelligences.
Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure
Czech Academy of Sciences Publication Activity Database
Fränzle, M.; Herde, C.; Teige, T.; Ratschan, Stefan; Schubert, T.
2007-01-01
Roč. 1, - (2007), s. 209-236 ISSN 1574-0617 Grant - others:AVACS(DE) SFB/TR 14 Institutional research plan: CEZ:AV0Z10300504 Keywords : interval-based arithmetic constraint solving * SAT modulo theories Subject RIV: BA - General Mathematics
An implicit iterative scheme for solving large systems of linear equations
International Nuclear Information System (INIS)
Barry, J.M.; Pollard, J.P.
1986-12-01
An implicit iterative scheme for the solution of large systems of linear equations arising from neutron diffusion studies is presented. The method is applied to three-dimensional reactor studies and its performance is compared with alternative iterative approaches
Directory of Open Access Journals (Sweden)
Samir Dey
2015-07-01
Full Text Available This paper proposes a new multi-objective intuitionistic fuzzy goal programming approach to solve a multi-objective nonlinear programming problem in context of a structural design. Here we describe some basic properties of intuitionistic fuzzy optimization. We have considered a multi-objective structural optimization problem with several mutually conflicting objectives. The design objective is to minimize weight of the structure and minimize the vertical deflection at loading point of a statistically loaded three-bar planar truss subjected to stress constraints on each of the truss members. This approach is used to solve the above structural optimization model based on arithmetic mean and compare with the solution by intuitionistic fuzzy goal programming approach. A numerical solution is given to illustrate our approach.
Directory of Open Access Journals (Sweden)
Shahid Hasnain
2017-07-01
Full Text Available This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.
Hasnain, Shahid; Saqib, Muhammad; Mashat, Daoud Suleiman
2017-07-01
This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit) to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.
A neural network method for solving a system of linear variational inequalities
International Nuclear Information System (INIS)
Lan Hengyou; Cui Yishun
2009-01-01
In this paper, we transmute the solution for a new system of linear variational inequalities to an equilibrium point of neural networks, and by using analytic technique, some sufficient conditions are presented. Further, the estimation of the exponential convergence rates of the neural networks is investigated. The new and useful results obtained in this paper generalize and improve the corresponding results of recent works.
Lancellotti, V.; Tijhuis, A.G.
2012-01-01
The calculation of electromagnetic (EM) fields and waves inside finite-sized structures comprised of different media can benefit from a diakoptics method such as linear embedding via Green's operators (LEGO). Unlike scattering problems, the excitation of EM waves within the bulk dielectric requires
An Interactive Method to Solve Infeasibility in Linear Programming Test Assembling Models
Huitzing, Hiddo A.
2004-01-01
In optimal assembly of tests from item banks, linear programming (LP) models have proved to be very useful. Assembly by hand has become nearly impossible, but these LP techniques are able to find the best solutions, given the demands and needs of the test to be assembled and the specifics of the item bank from which it is assembled. However,…
A comparison of iterative methods to solve complex valued linear algebraic systems
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Neytcheva, M.; Ahmad, B.
2013-01-01
Roč. 66, č. 4 (2013), s. 811-841 ISSN 1017-1398 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : linear systems * complex symmetric * real valued form * preconditioning Subject RIV: BA - General Mathematics Impact factor: 1.005, year: 2013 http://www.it.uu.se/research/publications/reports/2013-005/2013-005-nc.pdf
An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems
Sitopu, Joni Wilson; Mawengkang, Herman; Syafitri Lubis, Riri
2018-01-01
The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the “active constraint” method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.
A frequency-domain method for solving linear time delay systems with constant coefficients
Jin, Mengshi; Chen, Wei; Song, Hanwen; Xu, Jian
2018-03-01
In an active control system, time delay will occur due to processes such as signal acquisition and transmission, calculation, and actuation. Time delay systems are usually described by delay differential equations (DDEs). Since it is hard to obtain an analytical solution to a DDE, numerical solution is of necessity. This paper presents a frequency-domain method that uses a truncated transfer function to solve a class of DDEs. The theoretical transfer function is the sum of infinite items expressed in terms of poles and residues. The basic idea is to select the dominant poles and residues to truncate the transfer function, thus ensuring the validity of the solution while improving the efficiency of calculation. Meanwhile, the guideline of selecting these poles and residues is provided. Numerical simulations of both stable and unstable delayed systems are given to verify the proposed method, and the results are presented and analysed in detail.
Effective quadrature formula in solving linear integro-differential equations of order two
Eshkuvatov, Z. K.; Kammuji, M.; Long, N. M. A. Nik; Yunus, Arif A. M.
2017-08-01
In this note, we solve general form of Fredholm-Volterra integro-differential equations (IDEs) of order 2 with boundary condition approximately and show that proposed method is effective and reliable. Initially, IDEs is reduced into integral equation of the third kind by using standard integration techniques and identity between multiple and single integrals then truncated Legendre series are used to estimate the unknown function. For the kernel integrals, we have applied Gauss-Legendre quadrature formula and collocation points are chosen as the roots of the Legendre polynomials. Finally, reduce the integral equations of the third kind into the system of algebraic equations and Gaussian elimination method is applied to get approximate solutions. Numerical examples and comparisons with other methods reveal that the proposed method is very effective and dominated others in many cases. General theory of existence of the solution is also discussed.
Solving the linear radiation problem using a volume method on an overset grid
DEFF Research Database (Denmark)
Read, Robert; Bingham, Harry B.
2012-01-01
of numerical results with established analytical solutions. The linear radiation problem is considered in this paper. A two-dimensional computational tool has been developed to calculate the force applied to a floating body of arbitrary form in response to a prescribed displacement. Fourier transforms......This paper describes recent progress towards the development of a computational tool, based on potential ow theory, that can accurately and effciently simulate wave-induced loadings on marine structures. Engsig-Karup et al. (2009) have successfully developed an arbitrary-order, finite...
International Nuclear Information System (INIS)
Secher, Bernard; Belliard, Michel; Calvin, Christophe
2009-01-01
This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost
hi-class: Horndeski in the Cosmic Linear Anisotropy Solving System
Energy Technology Data Exchange (ETDEWEB)
Zumalacárregui, Miguel [Nordita, KHT Royal Institute of Technology and Stockholm University, Roslagstullsbacken 23, SE-106 91 Stockholm (Sweden); Bellini, Emilio [Institut de Ciènces del Cosmos, Universitat de Barcelona, IEEC-UB, Martì i Franquè 1, E-08028 Barcelona (Spain); Sawicki, Ignacy [Central European Institute for Cosmology and Fundamental Physics, Fyzikální ustáv Akademie v\\v ed \\v CR, Na Slovance 2, 182 21 Praha 8 (Czech Republic); Lesgourgues, Julien [Institut für Theoretische Teilchenphysik und Kosmologie, RWTH Aachen University, D-52056 Aachen (Germany); Ferreira, Pedro G., E-mail: miguelzuma@berkeley.edu, E-mail: emilio.bellini@physics.ox.ac.uk, E-mail: ignacy.sawicki@fzu.cz, E-mail: lesgourg@physik.rwth-aachen.de, E-mail: pedro.ferreira@physics.ox.ac.uk [Astrophysics, University of Oxford, Denys Wilkinson Building, Keble Road, Oxford OX1 3RH (United Kingdom)
2017-08-01
We present the public version of hi-class (www.hiclass-code.net), an extension of the Boltzmann code CLASS to a broad ensemble of modifications to general relativity. In particular, hi-class can calculate predictions for models based on Horndeski's theory, which is the most general scalar-tensor theory described by second-order equations of motion and encompasses any perfect-fluid dark energy, quintessence, Brans-Dicke, f ( R ) and covariant Galileon models. hi-class has been thoroughly tested and can be readily used to understand the impact of alternative theories of gravity on linear structure formation as well as for cosmological parameter extraction.
Energy Technology Data Exchange (ETDEWEB)
Secher, Bernard [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SFME/LGLS, Bat. 454, F-91191 Gif-sur-Yvette Cedex (France)], E-mail: bsecher@cea.fr; Belliard, Michel [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Cadarache DER/SSTH/LMDL, Bat. 238, F-13108 Saint-Paul-lez-Durance Cedex (France); Calvin, Christophe [French Atomic Energy Commission (CEA), Nuclear Energy Division (DEN) (France); CEA Saclay DM2S/SERMA/LLPR, Bat. 470, F-91191 Gif-sur-Yvette Cedex (France)
2009-01-15
This paper describes a tool called 'Numerical Platon' developed by the French Atomic Energy Commission (CEA). It provides a freely available (GNU LGPL license) interface for coupling scientific computing applications to various freeware linear solver libraries (essentially PETSc, SuperLU and HyPre), together with some proprietary CEA solvers, for high-performance computers that may be used in industrial software written in various programming languages. This tool was developed as part of considerable efforts by the CEA Nuclear Energy Division in the past years to promote massively parallel software and on-shelf parallel tools to help develop new generation simulation codes. After the presentation of the package architecture and the available algorithms, we show examples of how Numerical Platon is used in sequential and parallel CEA codes. Comparing with in-house solvers, the gain in terms of increases in computation capacities or in terms of parallel performances is notable, without considerable extra development cost.
Constraints to solve parallelogram grid problems in 2D non separable linear canonical transform
Zhao, Liang; Healy, John J.; Muniraj, Inbarasan; Cui, Xiao-Guang; Malallah, Ra'ed; Ryle, James P.; Sheridan, John T.
2017-05-01
The 2D non-separable linear canonical transform (2D-NS-LCT) can model a range of various paraxial optical systems. Digital algorithms to evaluate the 2D-NS-LCTs are important in modeling the light field propagations and also of interest in many digital signal processing applications. In [Zhao 14] we have reported that a given 2D input image with rectangular shape/boundary, in general, results in a parallelogram output sampling grid (generally in an affine coordinates rather than in a Cartesian coordinates) thus limiting the further calculations, e.g. inverse transform. One possible solution is to use the interpolation techniques; however, it reduces the speed and accuracy of the numerical approximations. To alleviate this problem, in this paper, some constraints are derived under which the output samples are located in the Cartesian coordinates. Therefore, no interpolation operation is required and thus the calculation error can be significantly eliminated.
DEFF Research Database (Denmark)
Sorokin, Vladislav; Thomsen, Jon Juel
2015-01-01
Parametrically excited systems appear in many fields of science and technology, intrinsically or imposed purposefully; e.g. spatially periodic structures represent an important class of such systems [4]. When the parametric excitation can be considered weak, classical asymptotic methods like...... the method of averaging [2] or multiple scales [6] can be applied. However, with many practically important applications this simplification is inadequate, e.g. with spatially periodic structures it restricts the possibility to affect their effective dynamic properties by a structural parameter modulation...... of considerable magnitude. Approximate methods based on Floquet theory [4] for analyzing problems involving parametric excitation, e.g. the classical Hill’s method of infinite determinants [3,4], can be employed also in cases of strong excitation; however, with Floquet theory being applicable only for linear...
Robust linear discriminant models to solve financial crisis in banking sectors
Lim, Yai-Fung; Yahaya, Sharipah Soaad Syed; Idris, Faoziah; Ali, Hazlina; Omar, Zurni
2014-12-01
Linear discriminant analysis (LDA) is a widely-used technique in patterns classification via an equation which will minimize the probability of misclassifying cases into their respective categories. However, the performance of classical estimators in LDA highly depends on the assumptions of normality and homoscedasticity. Several robust estimators in LDA such as Minimum Covariance Determinant (MCD), S-estimators and Minimum Volume Ellipsoid (MVE) are addressed by many authors to alleviate the problem of non-robustness of the classical estimates. In this paper, we investigate on the financial crisis of the Malaysian banking institutions using robust LDA and classical LDA methods. Our objective is to distinguish the "distress" and "non-distress" banks in Malaysia by using the LDA models. Hit ratio is used to validate the accuracy predictive of LDA models. The performance of LDA is evaluated by estimating the misclassification rate via apparent error rate. The results and comparisons show that the robust estimators provide a better performance than the classical estimators for LDA.
Yager’s ranking method for solving the trapezoidal fuzzy number linear programming
Karyati; Wutsqa, D. U.; Insani, N.
2018-03-01
In the previous research, the authors have studied the fuzzy simplex method for trapezoidal fuzzy number linear programming based on the Maleki’s ranking function. We have found some theories related to the term conditions for the optimum solution of fuzzy simplex method, the fuzzy Big-M method, the fuzzy two-phase method, and the sensitivity analysis. In this research, we study about the fuzzy simplex method based on the other ranking function. It is called Yager's ranking function. In this case, we investigate the optimum term conditions. Based on the result of research, it is found that Yager’s ranking function is not like Maleki’s ranking function. Using the Yager’s function, the simplex method cannot work as well as when using the Maleki’s function. By using the Yager’s function, the value of the subtraction of two equal fuzzy numbers is not equal to zero. This condition makes the optimum table of the fuzzy simplex table is undetected. As a result, the simplified fuzzy simplex table becomes stopped and does not reach the optimum solution.
Liu, Tao; Huang, Jie
2017-04-17
This paper presents a discrete-time recurrent neural network approach to solving systems of linear equations with two features. First, the system of linear equations may not have a unique solution. Second, the system matrix is not known precisely, but a sequence of matrices that converges to the unknown system matrix exponentially is known. The problem is motivated from solving the output regulation problem for linear systems. Thus, an application of our main result leads to an online solution to the output regulation problem for linear systems.
International Nuclear Information System (INIS)
Murfi, Hendri; Basaruddin, T.
2001-01-01
The interior point method for linear programming has gained extraordinary interest as an alternative to simplex method since Karmarkar presented a polynomial-time algorithm for linear programming based on interior point method. In implementation of the algorithm of this method, there are two important things that have impact heavily to performance of the algorithm; they are data structure and used method to solve linear equation system in the algorithm. This paper describes about solving linear equation system in variants of the algorithm called dual-affine scaling algorithm. Next, we evaluate experimentally results of some used methods, either direct method or iterative method. The experimental evaluation used Matlab
Directory of Open Access Journals (Sweden)
Aihong Ren
2016-01-01
Full Text Available This paper is concerned with a class of fully fuzzy bilevel linear programming problems where all the coefficients and decision variables of both objective functions and the constraints are fuzzy numbers. A new approach based on deviation degree measures and a ranking function method is proposed to solve these problems. We first introduce concepts of the feasible region and the fuzzy optimal solution of a fully fuzzy bilevel linear programming problem. In order to obtain a fuzzy optimal solution of the problem, we apply deviation degree measures to deal with the fuzzy constraints and use a ranking function method of fuzzy numbers to rank the upper and lower level fuzzy objective functions. Then the fully fuzzy bilevel linear programming problem can be transformed into a deterministic bilevel programming problem. Considering the overall balance between improving objective function values and decreasing allowed deviation degrees, the computational procedure for finding a fuzzy optimal solution is proposed. Finally, a numerical example is provided to illustrate the proposed approach. The results indicate that the proposed approach gives a better optimal solution in comparison with the existing method.
Directory of Open Access Journals (Sweden)
Salvador Lucas
2015-12-01
Full Text Available Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In this setting, Order-Sorted First-Order Logic provides a powerful framework to represent declarative programs. It also provides a target logic to obtain models for other logics via transformations. We investigate the automatic generation of numerical models for order-sorted first-order logics and its use in program analysis, in particular in termination analysis of declarative programs. We use convex domains to give domains to the different sorts of an order-sorted signature; we interpret the ranked symbols of sorted signatures by means of appropriately adapted convex matrix interpretations. Such numerical interpretations permit the use of existing algorithms and tools from linear algebra and arithmetic constraint solving to synthesize the models.
Directory of Open Access Journals (Sweden)
H Kazemipoor
2012-04-01
Full Text Available A multi-skilled project scheduling problem (MSPSP has been generally presented to schedule a project with staff members as resources. Each activity in project network requires different skills and also staff members have different skills, too. This causes the MSPSP becomes a special type of a multi-mode resource-constrained project scheduling problem (MM-RCPSP with a huge number of modes. Given the importance of this issue, in this paper, a mixed integer linear programming for the MSPSP is presented. Due to the complexity of the problem, a meta-heuristic algorithm is proposed in order to find near optimal solutions. To validate performance of the algorithm, results are compared against exact solutions solved by the LINGO solver. The results are promising and show that optimal or near-optimal solutions are derived for small instances and good solutions for larger instances in reasonable time.
Nguyen, Duc T.; Mohammed, Ahmed Ali; Kadiam, Subhash
2010-01-01
Solving large (and sparse) system of simultaneous linear equations has been (and continues to be) a major challenging problem for many real-world engineering/science applications [1-2]. For many practical/large-scale problems, the sparse, Symmetrical and Positive Definite (SPD) system of linear equations can be conveniently represented in matrix notation as [A] {x} = {b} , where the square coefficient matrix [A] and the Right-Hand-Side (RHS) vector {b} are known. The unknown solution vector {x} can be efficiently solved by the following step-by-step procedures [1-2]: Reordering phase, Matrix Factorization phase, Forward solution phase, and Backward solution phase. In this research work, a Game-Based Learning (GBL) approach has been developed to help engineering students to understand crucial details about matrix reordering and factorization phases. A "chess-like" game has been developed and can be played by either a single player, or two players. Through this "chess-like" open-ended game, the players/learners will not only understand the key concepts involved in reordering algorithms (based on existing algorithms), but also have the opportunities to "discover new algorithms" which are better than existing algorithms. Implementing the proposed "chess-like" game for matrix reordering and factorization phases can be enhanced by FLASH [3] computer environments, where computer simulation with animated human voice, sound effects, visual/graphical/colorful displays of matrix tables, score (or monetary) awards for the best game players, etc. can all be exploited. Preliminary demonstrations of the developed GBL approach can be viewed by anyone who has access to the internet web-site [4]!
Energy Technology Data Exchange (ETDEWEB)
de la Torre Vega, E. [Instituto de Investigaciones Electricas, Cuernavaca (Mexico); Cesar Suarez Arriaga, M. [Universidad Michoacana SNH, Michoacan (Mexico)
1995-03-01
In geothermal simulation processes, MULKOM uses Integrated Finite Differences to solve the corresponding partial differential equations. This method requires to resolve efficiently big linear dispersed systems of non-symmetrical nature on each temporal iteration. The order of the system is usually greater than one thousand its solution could represent around 80% of CPU total calculation time. If the elapsed time solving this class of linear systems is reduced, the duration of numerical simulation decreases notably. When the matrix is big (N{ge}500) and with holes, it is inefficient to handle all the system`s elements, because it is perfectly figured out by its elements distinct of zero, quantity greatly minor than N{sup 2}. In this area, iteration methods introduce advantages with respect to gaussian elimination methods, because these last replenish matrices not having any special distribution of their non-zero elements and because they do not make use of the available solution estimations. The iterating methods of the Conjugated Gradient family, based on the subspaces of Krylov, possess the advantage of improving the convergence speed by means of preconditioning techniques. The creation of DIOMRES(k,m) method guarantees the continuous descent of the residual norm, without incurring in division by zero. This technique converges at most in N iterations if the system`s matrix is symmetrical, it does not employ too much memory to converge and updates immediately the approximation by using incomplete orthogonalization and adequate restarting. A preconditioned version of DIOMRES was applied to problems related to unsymmetrical systems with 1000 unknowns and less than five terms per equation. We found that this technique could reduce notably the time needful to find the solution without requiring memory increment. The coupling of this method to geothermal versions of MULKOM is in process.
A Newton method for solving continuous multiple material minimum compliance problems
DEFF Research Database (Denmark)
Stolpe, M; Stegmann, Jan
method, one or two linear saddle point systems are solved. These systems involve the Hessian of the objective function, which is both expensive to compute and completely dense. Therefore, the linear algebra is arranged such that the Hessian is not explicitly formed. The main concern is to solve...
A Newton method for solving continuous multiple material minimum compliance problems
DEFF Research Database (Denmark)
Stolpe, Mathias; Stegmann, Jan
2007-01-01
method, one or two linear saddle point systems are solved. These systems involve the Hessian of the objective function, which is both expensive to compute and completely dense. Therefore, the linear algebra is arranged such that the Hessian is not explicitly formed. The main concern is to solve...
Safari, A.; Sharifi, M. A.; Amjadiparvar, B.
2010-05-01
The GRACE mission has substantiated the low-low satellite-to-satellite tracking (LL-SST) concept. The LL-SST configuration can be combined with the previously realized high-low SST concept in the CHAMP mission to provide a much higher accuracy. The line of sight (LOS) acceleration difference between the GRACE satellite pair is the mostly used observable for mapping the global gravity field of the Earth in terms of spherical harmonic coefficients. In this paper, mathematical formulae for LOS acceleration difference observations have been derived and the corresponding linear system of equations has been set up for spherical harmonic up to degree and order 120. The total number of unknowns is 14641. Such a linear equation system can be solved with iterative solvers or direct solvers. However, the runtime of direct methods or that of iterative solvers without a suitable preconditioner increases tremendously. This is the reason why we need a more sophisticated method to solve the linear system of problems with a large number of unknowns. Multiplicative variant of the Schwarz alternating algorithm is a domain decomposition method, which allows it to split the normal matrix of the system into several smaller overlaped submatrices. In each iteration step the multiplicative variant of the Schwarz alternating algorithm solves linear systems with the matrices obtained from the splitting successively. It reduces both runtime and memory requirements drastically. In this paper we propose the Multiplicative Schwarz Alternating Algorithm (MSAA) for solving the large linear system of gravity field recovery. The proposed algorithm has been tested on the International Association of Geodesy (IAG)-simulated data of the GRACE mission. The achieved results indicate the validity and efficiency of the proposed algorithm in solving the linear system of equations from accuracy and runtime points of view. Keywords: Gravity field recovery, Multiplicative Schwarz Alternating Algorithm, Low
Wang, Y.; Lin, F. C.; Allam, A. A.; Ben-Zion, Y.
2017-12-01
The San Jacinto fault is presently the most seismically active component of the San Andreas Transform system in Southern California. To study the damage zone structure, two dense linear geophone arrays (BS and RR) were deployed across the Clark segment of the San Jacinto Fault between Anza and Hemet during winter 2015 and Fall 2016, respectively. Both arrays were 2 km long with 20 m station spacing. Month-long three-component ambient seismic noise data were recorded and used to calculate multi-channel cross-correlation functions. All three-component noise records of each array were normalized simultaneously to retain relative amplitude information between different stations and different components. We observed clear Rayleigh waves and Love waves on the cross-correlations of both arrays at 0.3 - 1 s period. The phase travel times of the Rayleigh waves on both arrays were measured by frequency-time analysis (FTAN), and inverted for Rayleigh wave phase velocity profiles of the upper 500 m depth. For both arrays, we observe prominent asymmetric low velocity zones which narrow with depth. At the BS array near the Hemet Stepover, an approximately 250m wide slow zone is observed to be offset by 75m to the northeast of the surface fault trace. At the RR array near the Anza segment of the fault, a similar low velocity zone width and offset are observed, along with a 10% across-fault velocity contrast. Analyses of Rayleigh wave ellipticity (H/V ratio), Love wave phase travel times, and site amplification are in progress. By using multiple measurements from ambient noise cross-correlations, we can obtain strong constraints on the local damage zone structure of the San Jacinto Fault. The results contribute to improved understanding of rupture directivity, maximum earthquake magnitude and more generally seismic hazard associated with the San Jacinto fault zone.
Ebrahimnejad, Ali
2015-08-01
There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.
Sole, Marla A.
2016-01-01
Open-ended questions that can be solved using different strategies help students learn and integrate content, and provide teachers with greater insights into students' unique capabilities and levels of understanding. This article provides a problem that was modified to allow for multiple approaches. Students tended to employ high-powered, complex,…
Dense image correspondences for computer vision
Liu, Ce
2016-01-01
This book describes the fundamental building-block of many new computer vision systems: dense and robust correspondence estimation. Dense correspondence estimation techniques are now successfully being used to solve a wide range of computer vision problems, very different from the traditional applications such techniques were originally developed to solve. This book introduces the techniques used for establishing correspondences between challenging image pairs, the novel features used to make these techniques robust, and the many problems dense correspondences are now being used to solve. The book provides information to anyone attempting to utilize dense correspondences in order to solve new or existing computer vision problems. The editors describe how to solve many computer vision problems by using dense correspondence estimation. Finally, it surveys resources, code, and data necessary for expediting the development of effective correspondence-based computer vision systems. · Provides i...
International Nuclear Information System (INIS)
Aspinall, J.
1982-01-01
A computational method was developed which alleviates the need for lengthy parametric scans as part of a design process. The method makes use of a least squares algorithm to find the optimal value of a parameter vector. Optimal is defined in terms of a utility function prescribed by the user. The placement of the vertical field coils of a torsatron is such a non linear problem
International Nuclear Information System (INIS)
Ahlfeld, D.P.; Dougherty, D.E.
1994-11-01
MODLP is a computational tool that may help design capture zones for controlling the movement of contaminated groundwater. It creates and solves linear optimization programs that contain constraints on hydraulic head or head differences in a groundwater system. The groundwater domain is represented by USGS MODFLOW groundwater flow simulation model. This document describes the general structure of the computer program, MODLP, the types of constraints that may be imposed, detailed input instructions, interpretation of the output, and the interaction with the MODFLOW simulation kernel
DEFF Research Database (Denmark)
Stolpe, Mathias; Bendsøe, Martin P.
2007-01-01
This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...
DEFF Research Database (Denmark)
Stolpe, Mathias; Bendsøe, Martin P.
2007-01-01
This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities......) and cuts....
Energy Technology Data Exchange (ETDEWEB)
Tetsu, Hiroyuki; Nakamoto, Taishi, E-mail: h.tetsu@geo.titech.ac.jp [Earth and Planetary Sciences, Tokyo Institute of Technology, Tokyo 152-8551 (Japan)
2016-03-15
Radiation is an important process of energy transport, a force, and a basis for synthetic observations, so radiation hydrodynamics (RHD) calculations have occupied an important place in astrophysics. However, although the progress in computational technology is remarkable, their high numerical cost is still a persistent problem. In this work, we compare the following schemes used to solve the nonlinear simultaneous equations of an RHD algorithm with the flux-limited diffusion approximation: the Newton–Raphson (NR) method, operator splitting, and linearization (LIN), from the perspective of the computational cost involved. For operator splitting, in addition to the traditional simple operator splitting (SOS) scheme, we examined the scheme developed by Douglas and Rachford (DROS). We solve three test problems (the thermal relaxation mode, the relaxation and the propagation of linear waves, and radiating shock) using these schemes and then compare their dependence on the time step size. As a result, we find the conditions of the time step size necessary for adopting each scheme. The LIN scheme is superior to other schemes if the ratio of radiation pressure to gas pressure is sufficiently low. On the other hand, DROS can be the most efficient scheme if the ratio is high. Although the NR scheme can be adopted independently of the regime, especially in a problem that involves optically thin regions, the convergence tends to be worse. In all cases, SOS is not practical.
Herman, Gabor T; Chen, Wei
2008-03-01
The goal of Intensity-Modulated Radiation Therapy (IMRT) is to deliver sufficient doses to tumors to kill them, but without causing irreparable damage to critical organs. This requirement can be formulated as a linear feasibility problem. The sequential (i.e., iteratively treating the constraints one after another in a cyclic fashion) algorithm ART3 is known to find a solution to such problems in a finite number of steps, provided that the feasible region is full dimensional. We present a faster algorithm called ART3+. The idea of ART3+ is to avoid unnecessary checks on constraints that are likely to be satisfied. The superior performance of the new algorithm is demonstrated by mathematical experiments inspired by the IMRT application.
Liu, Tianyang; Chan, Hiu Ning; Grimshaw, Roger; Chow, Kwok Wing
2017-11-01
The spatial structure of small disturbances in stratified flows without background shear, usually named the `Taylor-Goldstein equation', is studied by employing the Boussinesq approximation (variation in density ignored except in the buoyancy). Analytical solutions are derived for special wavenumbers when the Brunt-Väisälä frequency is quadratic in hyperbolic secant, by comparison with coupled systems of nonlinear Schrödinger equations intensively studied in the literature. Cases of coupled Schrödinger equations with four, five and six components are utilized as concrete examples. Dispersion curves for arbitrary wavenumbers are obtained numerically. The computations of the group velocity, second harmonic, induced mean flow, and the second derivative of the angular frequency can all be facilitated by these exact linear eigenfunctions of the Taylor-Goldstein equation in terms of hyperbolic function, leading to a cubic Schrödinger equation for the evolution of a wavepacket. The occurrence of internal rogue waves can be predicted if the dispersion and cubic nonlinearity terms of the Schrödinger equations are of the same sign. Partial financial support has been provided by the Research Grants Council contract HKU 17200815.
Introduction to computational linear algebra
Nassif, Nabil; Erhel, Jocelyne
2015-01-01
Introduction to Computational Linear Algebra introduces the reader with a background in basic mathematics and computer programming to the fundamentals of dense and sparse matrix computations with illustrating examples. The textbook is a synthesis of conceptual and practical topics in ""Matrix Computations."" The book's learning outcomes are twofold: to understand state-of-the-art computational tools to solve matrix computations problems (BLAS primitives, MATLAB® programming) as well as essential mathematical concepts needed to master the topics of numerical linear algebra. It is suitable for s
Redesigning Triangular Dense Matrix Computations on GPUs
Charara, Ali
2016-08-09
A new implementation of the triangular matrix-matrix multiplication (TRMM) and the triangular solve (TRSM) kernels are described on GPU hardware accelerators. Although part of the Level 3 BLAS family, these highly computationally intensive kernels fail to achieve the percentage of the theoretical peak performance on GPUs that one would expect when running kernels with similar surface-to-volume ratio on hardware accelerators, i.e., the standard matrix-matrix multiplication (GEMM). The authors propose adopting a recursive formulation, which enriches the TRMM and TRSM inner structures with GEMM calls and, therefore, reduces memory traffic while increasing the level of concurrency. The new implementation enables efficient use of the GPU memory hierarchy and mitigates the latency overhead, to run at the speed of the higher cache levels. Performance comparisons show up to eightfold and twofold speedups for large dense matrix sizes, against the existing state-of-the-art TRMM and TRSM implementations from NVIDIA cuBLAS, respectively, across various GPU generations. Once integrated into high-level Cholesky-based dense linear algebra algorithms, the performance impact on the overall applications demonstrates up to fourfold and twofold speedups, against the equivalent native implementations, linked with cuBLAS TRMM and TRSM kernels, respectively. The new TRMM/TRSM kernel implementations are part of the open-source KBLAS software library (http://ecrc.kaust.edu.sa/Pages/Res-kblas.aspx) and are lined up for integration into the NVIDIA cuBLAS library in the upcoming v8.0 release.
Arimond, Mary; Vitta, Bineti S; Martin-Prével, Yves; Moursi, Mourad; Dewey, Kathryn G
2018-01-01
Women of reproductive age are at nutritional risk due to their need for nutrient-dense diets. Risk is further elevated in resource-poor environments. In one such environment, we evaluated feasibility of meeting micronutrient needs of women of reproductive age using local foods alone or using local foods and supplements, while minimizing cost. Based on dietary recall data from Ouagadougou, we used linear programming to identify the lowest cost options for meeting 10 micronutrient intake recommendations, while also meeting energy needs and following an acceptable macronutrient intake pattern. We modeled scenarios with maximum intake per food item constrained at the 75th percentile of reported intake and also with more liberal maxima based on recommended portions per day, with and without the addition of supplements. Some scenarios allowed only commonly consumed foods (reported on at least 10% of recall days). We modeled separately for pregnant, lactating, and nonpregnant, nonlactating women. With maxima constrained to the 75th percentile, all micronutrient needs could be met with local foods but only when several nutrient-dense but rarely consumed items were included in daily diets. When only commonly consumed foods were allowed, micronutrient needs could not be met without supplements. When larger amounts of common animal-source foods were allowed, all needs could be met for nonpregnant, nonlactating women but not for pregnant or lactating women, without supplements. We conclude that locally available foods could meet micronutrient needs but that to achieve this, strategies would be needed to increase consistent availability in markets, consistent economic access, and demand. © 2017 John Wiley & Sons Ltd.
Avoiding Communication in Dense Linear Algebra
2013-08-16
22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply...from ParLab affiliates National Instruments, Nokia , NVIDIA, Oracle and Samsung, as well as MathWorks. Research is also supported by DOE grants DE...see why , take A = ( X 0 Y T 0 ) , and then A ·AT = ( ∗ XY ∗ ∗ ) . CHAPTER 3. COMMUNICATION LOWER BOUNDS VIA REDUCTIONS 25 ± 1∗ 0∗ y 1∗ 1∗ 1∗ 1∗ 0∗ 1∗ 0
Visinelli, Luca; Baum, Sebastian; Redondo, Javier; Freese, Katherine; Wilczek, Frank
2018-02-01
Axion stars are hypothetical objects formed of axions, obtained as localized and coherently oscillating solutions to their classical equation of motion. Depending on the value of the field amplitude at the core |θ0 | ≡ | θ (r = 0) |, the equilibrium of the system arises from the balance of the kinetic pressure and either self-gravity or axion self-interactions. Starting from a general relativistic framework, we obtain the set of equations describing the configuration of the axion star, which we solve as a function of |θ0 |. For small |θ0 | ≲ 1, we reproduce results previously obtained in the literature, and we provide arguments for the stability of such configurations in terms of first principles. We compare qualitative analytical results with a numerical calculation. For large amplitudes |θ0 | ≳ 1, the axion field probes the full non-harmonic QCD chiral potential and the axion star enters the dense branch. Our numerical solutions show that in this latter regime the axions are relativistic, and that one should not use a single frequency approximation, as previously applied in the literature. We employ a multi-harmonic expansion to solve the relativistic equation for the axion field in the star, and demonstrate that higher modes cannot be neglected in the dense regime. We interpret the solutions in the dense regime as pseudo-breathers, and show that the life-time of such configurations is much smaller than any cosmological time scale.
Suprathermal viscosity of dense matter
International Nuclear Information System (INIS)
Alford, Mark; Mahmoodifar, Simin; Schwenzer, Kai
2010-01-01
Motivated by the existence of unstable modes of compact stars that eventually grow large, we study the bulk viscosity of dense matter, taking into account non-linear effects arising in the large amplitude regime, where the deviation μ Δ of the chemical potentials from chemical equilibrium fulfills μ Δ > or approx. T. We find that this supra-thermal bulk viscosity can provide a potential mechanism for saturating unstable modes in compact stars since the viscosity is strongly enhanced. Our study confirms previous results on strange quark matter and shows that the suprathermal enhancement is even stronger in the case of hadronic matter. We also comment on the competition of different weak channels and the presence of suprathermal effects in various color superconducting phases of dense quark matter.
International Nuclear Information System (INIS)
More, R.M.
1986-01-01
Recent experiments with high-power pulsed lasers have strongly encouraged the development of improved theoretical understanding of highly charged ions in a dense plasma environment. This work examines the theory of dense plasmas with emphasis on general rules which govern matter at extreme high temperature and density. 106 refs., 23 figs
Energy Technology Data Exchange (ETDEWEB)
More, R.M.
1986-01-01
Recent experiments with high-power pulsed lasers have strongly encouraged the development of improved theoretical understanding of highly charged ions in a dense plasma environment. This work examines the theory of dense plasmas with emphasis on general rules which govern matter at extreme high temperature and density. 106 refs., 23 figs.
Directory of Open Access Journals (Sweden)
Maria S. Prokhorova
2014-01-01
Full Text Available The article deals with a study of problemsof ﬁnding the optimal portfolio securitiesusing convolutions expectation of portfolioreturns and portfolio variance. Value of thecoefﬁcient of risk, in which the problem ofmaximizing the variance - limited yieldis equivalent to maximizing a linear convolution of criteria for «expected returns-variance» is obtained. An automated method for ﬁnding the optimal portfolio, onthe basis of which the results of the studydemonstrated is proposed.
Green, David L.; Berry, Lee A.; Simpson, Adam B.; Younkin, Timothy R.
2018-04-01
We present the KINETIC-J code, a computational kernel for evaluating the linearized Vlasov equation with application to calculating the kinetic plasma response (current) to an applied time harmonic wave electric field. This code addresses the need for a configuration space evaluation of the plasma current to enable kinetic full-wave solvers for waves in hot plasmas to move beyond the limitations of the traditional Fourier spectral methods. We benchmark the kernel via comparison with the standard k →-space forms of the hot plasma conductivity tensor.
Quantum dense key distribution
International Nuclear Information System (INIS)
Degiovanni, I.P.; Ruo Berchera, I.; Castelletto, S.; Rastello, M.L.; Bovino, F.A.; Colla, A.M.; Castagnoli, G.
2004-01-01
This paper proposes a protocol for quantum dense key distribution. This protocol embeds the benefits of a quantum dense coding and a quantum key distribution and is able to generate shared secret keys four times more efficiently than the Bennet-Brassard 1984 protocol. We hereinafter prove the security of this scheme against individual eavesdropping attacks, and we present preliminary experimental results, showing its feasibility
Tuey, R. C.
1972-01-01
Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.
Modelling dense relational data
DEFF Research Database (Denmark)
Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard
2012-01-01
they are not naturally suited for kernel K-means. We propose a generative Bayesian model for dense matrices which generalize kernel K-means to consider off-diagonal interactions in matrices of interactions, and demonstrate its ability to detect structure on both artificial data and two real data sets....
Is dense codeswitching complex?
Dorleijn, M.
In this paper the question is raised to what extent dense code switching can be considered complex. Psycholinguistic experiments indicate that code switching involves cognitive costs, both in production and comprehension, a conclusion that could indicate that code switching is indeed complex. In
Herrmann, H.J.; Harting, J.D.R.; Hecht, M.; Ben-Naim, E.
2008-01-01
We present in this proceeding recent large scale simulations of dense colloids. On one hand we simulate model clay consisting of nanometric aluminum oxide spheres in water using realistic DLVO potentials and a combination of MD and SRD. We find pronounced cluster formation and retrieve the shear
Fuzzy linear programming approach for solving transportation ...
Indian Academy of Sciences (India)
ALI EBRAHIMNEJAD
Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran e-mail: ..... est grade of membership at x are μ ˜AL (x) and μ ˜AU (x), respectively. ..... trapezoidal fuzzy numbers transportation problem (12) are.
International Nuclear Information System (INIS)
More, R.M.
1987-01-01
This paper covers some aspects of the theory of atomic processes in dense plasmas. Because the topic is very broad, a few general rules which give useful guidance about the typical behavior of dense plasmas have been selected. These rules are illustrated by semiclassical estimates, scaling laws and appeals to more elaborate calculations. Included in the paper are several previously unpublished results including a new mechanism for electron-ion heat exchange (section II), and an approximate expression for oscillator-strengths of highly charged ions (section V). However the main emphasis is not upon practical formulas but rather on questions of fundamental theory, the structural ingredients which must be used in building a model for plasma events. What are the density effects and how does one represent them? Which are most important? How does one identify an incorrect theory? The general rules help to answer these questions. 106 references, 23 figures, 2 tables
Energy Technology Data Exchange (ETDEWEB)
Li, Hui [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Li, Shengtai [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Jungman, Gerard [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Hayes-Sterbenz, Anna Catherine [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-08-31
The mechanisms for pinch formation in Dense Plasma Focus (DPF) devices, with the generation of high-energy ions beams and subsequent neutron production over a relatively short distance, are not fully understood. Here we report on high-fidelity 2D and 3D numerical magnetohydrodynamic (MHD) simulations using the LA-COMPASS code to study the pinch formation dynamics and its associated instabilities and neutron production.
Dense time discretization technique for verification of real time systems
International Nuclear Information System (INIS)
Makackas, Dalius; Miseviciene, Regina
2016-01-01
Verifying the real-time system there are two different models to control the time: discrete and dense time based models. This paper argues a novel verification technique, which calculates discrete time intervals from dense time in order to create all the system states that can be reached from the initial system state. The technique is designed for real-time systems specified by a piece-linear aggregate approach. Key words: real-time system, dense time, verification, model checking, piece-linear aggregate
Edwards, Harold M
1995-01-01
In his new undergraduate textbook, Harold M Edwards proposes a radically new and thoroughly algorithmic approach to linear algebra Originally inspired by the constructive philosophy of mathematics championed in the 19th century by Leopold Kronecker, the approach is well suited to students in the computer-dominated late 20th century Each proof is an algorithm described in English that can be translated into the computer language the class is using and put to work solving problems and generating new examples, making the study of linear algebra a truly interactive experience Designed for a one-semester course, this text adopts an algorithmic approach to linear algebra giving the student many examples to work through and copious exercises to test their skills and extend their knowledge of the subject Students at all levels will find much interactive instruction in this text while teachers will find stimulating examples and methods of approach to the subject
International Nuclear Information System (INIS)
Cockbain, A.G.
1976-01-01
A method is described for the manufacture of articles of substantially pure dense ceramic materials, for use in severe environments. Si N is very suitable for use in such environments, but suffers from the disadvantage that it is not amenable to sintering. Some disadvantages of the methods normally used for making articles of Si N are mentioned. The method described comprises mixing a powder of the substantially pure ceramic material with an additive that promotes densification, and which is capable of nuclear transmutation into a gas when exposed to radiation, and hot pressing the mixture to form a billet. The billet is then irradiated to convert the additive into a gas which is held captive in the billet, and it is then subjected to a hot forging operation, during which the captive gas escapes and an article of substantially pure dense ceramic material is forged. The method is intended primarily for use for Si N, but may be applied to other ceramic materials. The additive may be Li or Be or their compounds, to the extent of at least 5 ppm and not more than 5% by weight. Irradiation is effected by proton or neutron bombardment. (UK)
DENSE MEDIUM CYCLONE OPTIMIZATON
Energy Technology Data Exchange (ETDEWEB)
Gerald H. Luttrell; Chris J. Barbee; Peter J. Bethell; Chris J. Wood
2005-06-30
Dense medium cyclones (DMCs) are known to be efficient, high-tonnage devices suitable for upgrading particles in the 50 to 0.5 mm size range. This versatile separator, which uses centrifugal forces to enhance the separation of fine particles that cannot be upgraded in static dense medium separators, can be found in most modern coal plants and in a variety of mineral plants treating iron ore, dolomite, diamonds, potash and lead-zinc ores. Due to the high tonnage, a small increase in DMC efficiency can have a large impact on plant profitability. Unfortunately, the knowledge base required to properly design and operate DMCs has been seriously eroded during the past several decades. In an attempt to correct this problem, a set of engineering tools have been developed to allow producers to improve the efficiency of their DMC circuits. These tools include (1) low-cost density tracers that can be used by plant operators to rapidly assess DMC performance, (2) mathematical process models that can be used to predict the influence of changes in operating and design variables on DMC performance, and (3) an expert advisor system that provides plant operators with a user-friendly interface for evaluating, optimizing and trouble-shooting DMC circuits. The field data required to develop these tools was collected by conducting detailed sampling and evaluation programs at several industrial plant sites. These data were used to demonstrate the technical, economic and environmental benefits that can be realized through the application of these engineering tools.
Energy Technology Data Exchange (ETDEWEB)
Dapo, Haris
2009-01-28
The hyperon-nucleon YN low momentum effective interaction (V{sub low} {sub k}) allows for an extensive study of the behavior of hyperons in dense matter, together with an investigation of effects of the presence of hyperons on dense matter. The first step towards this goal is the construction of the matrix elements for the hyperon-nucleon low momentum potential. In order to assess the different properties of hyperons within these potentials we calculate the hyperon single-particle potentials in the Hartree-Fock approximation for all of the interactions. Their dependence on both momentum and density, is studied. The single-particle potentials are then used to determine the chemical potential of hyperons in neutron stars. For nucleonic properties, the nucleon-nucleon V{sub low} {sub k} can be used with the caveat that the calculation of the ground-state energy of symmetric nuclear matter does not correctly reproduce the properties of matter at saturation. With the nucleon-nucleon V{sub low} {sub k} one is unable to reach the densities needed for the calculation of neutron star masses. To circumvent this problem we use two approaches: in the first one, we parametrize the entire nucleonic sector. In the second one, we replace only the three-body force. The former will enable us to study neutron star masses, and the latter for studying the medium's response to the external probe. In this thesis we take the external probe to be the neutrino. By combining this parametrization with the YN V{sub low} {sub k} potential, we calculate the equation of state of equilibrated matter. Performing the calculation in the Hartree-Fock approximation at zero temperature, the concentrations of all particles are calculated. From these we can ascertain at which densities hyperons appear for a wide range of parameters. Finally, we calculate the masses of neutron stars with these concentrations. For the calculation of the medium's response to an external probe, we replace the three
International Nuclear Information System (INIS)
Dapo, Haris
2009-01-01
The hyperon-nucleon YN low momentum effective interaction (V low k ) allows for an extensive study of the behavior of hyperons in dense matter, together with an investigation of effects of the presence of hyperons on dense matter. The first step towards this goal is the construction of the matrix elements for the hyperon-nucleon low momentum potential. In order to assess the different properties of hyperons within these potentials we calculate the hyperon single-particle potentials in the Hartree-Fock approximation for all of the interactions. Their dependence on both momentum and density, is studied. The single-particle potentials are then used to determine the chemical potential of hyperons in neutron stars. For nucleonic properties, the nucleon-nucleon V low k can be used with the caveat that the calculation of the ground-state energy of symmetric nuclear matter does not correctly reproduce the properties of matter at saturation. With the nucleon-nucleon V low k one is unable to reach the densities needed for the calculation of neutron star masses. To circumvent this problem we use two approaches: in the first one, we parametrize the entire nucleonic sector. In the second one, we replace only the three-body force. The former will enable us to study neutron star masses, and the latter for studying the medium's response to the external probe. In this thesis we take the external probe to be the neutrino. By combining this parametrization with the YN V low k potential, we calculate the equation of state of equilibrated matter. Performing the calculation in the Hartree-Fock approximation at zero temperature, the concentrations of all particles are calculated. From these we can ascertain at which densities hyperons appear for a wide range of parameters. Finally, we calculate the masses of neutron stars with these concentrations. For the calculation of the medium's response to an external probe, we replace the three-body force with a density-dependent interaction. This
Geometrical optics of dense aerosols: forming dense plasma slabs.
Hay, Michael J; Valeo, Ernest J; Fisch, Nathaniel J
2013-11-01
Assembling a freestanding, sharp-edged slab of homogeneous material that is much denser than gas, but much more rarefied than a solid, is an outstanding technological challenge. The solution may lie in focusing a dense aerosol to assume this geometry. However, whereas the geometrical optics of dilute aerosols is a well-developed field, the dense aerosol limit is mostly unexplored. Yet controlling the geometrical optics of dense aerosols is necessary in preparing such a material slab. Focusing dense aerosols is shown here to be possible, but the finite particle density reduces the effective Stokes number of the flow, a critical result for controlled focusing.
Transport equation solving methods
International Nuclear Information System (INIS)
Granjean, P.M.
1984-06-01
This work is mainly devoted to Csub(N) and Fsub(N) methods. CN method: starting from a lemma stated by Placzek, an equivalence is established between two problems: the first one is defined in a finite medium bounded by a surface S, the second one is defined in the whole space. In the first problem the angular flux on the surface S is shown to be the solution of an integral equation. This equation is solved by Galerkin's method. The Csub(N) method is applied here to one-velocity problems: in plane geometry, slab albedo and transmission with Rayleigh scattering, calculation of the extrapolation length; in cylindrical geometry, albedo and extrapolation length calculation with linear scattering. Fsub(N) method: the basic integral transport equation of the Csub(N) method is integrated on Case's elementary distributions; another integral transport equation is obtained: this equation is solved by a collocation method. The plane problems solved by the Csub(N) method are also solved by the Fsub(N) method. The Fsub(N) method is extended to any polynomial scattering law. Some simple spherical problems are also studied. Chandrasekhar's method, collision probability method, Case's method are presented for comparison with Csub(N) and Fsub(N) methods. This comparison shows the respective advantages of the two methods: a) fast convergence and possible extension to various geometries for Csub(N) method; b) easy calculations and easy extension to polynomial scattering for Fsub(N) method [fr
Photons in dense nuclear matter: Random-phase approximation
Stetina, Stephan; Rrapaj, Ermal; Reddy, Sanjay
2018-04-01
We present a comprehensive and pedagogic discussion of the properties of photons in cold and dense nuclear matter based on the resummed one-loop photon self-energy. Correlations among electrons, muons, protons, and neutrons in β equilibrium that arise as a result of electromagnetic and strong interactions are consistently taken into account within the random phase approximation. Screening effects, damping, and collective excitations are systematically studied in a fully relativistic setup. Our study is relevant to the linear response theory of dense nuclear matter, calculations of transport properties of cold dense matter, and investigations of the production and propagation of hypothetical vector bosons such as the dark photons.
Anomalous properties of hot dense nonequilibrium plasmas
International Nuclear Information System (INIS)
Ferrante, G; Zarcone, M; Uryupin, S A
2005-01-01
A concise overview of a number of anomalous properties of hot dense nonequilibrium plasmas is given. The possibility of quasistationary megagauss magnetic field generation due to Weibel instability is discussed for plasmas created in atom tunnel ionization. The collisionless absorption and reflection of a test electromagnetic wave normally impinging on the plasma with two-temperature bi-maxwellian electron velocity distribution function are studied. Due to the wave magnetic field influence on the electron kinetics in the skin layer the wave absorption and reflection significantly depend on the degree of the electron temperature anisotropy. The linearly polarized impinging wave during reflection transforms into an elliptically polarized one. The problem of transmission of an ultrashort laser pulse through a layer of dense plasma, formed as a result of ionization of a thin foil, is considered. It is shown that the strong photoelectron distribution anisotropy yields an anomalous penetration of the wave field through the foil
A Fast Condensing Method for Solution of Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
consider a condensing (or state elimination) method to solve an extended version of the LQ control problem, and we show how to exploit the structure of this problem to both factorize the dense Hessian matrix and solve the system. Furthermore, we present two efficient implementations. The first......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 usually the main computational effort. In this paper we...... implementation is formally identical to the Riccati recursion based solver and has a computational complexity that is linear in the control horizon length and cubic in the number of states. The second implementation has a computational complexity that is quadratic in the control horizon length as well...
Mercury's Densely Cratered Surface
1974-01-01
Mariner 10 took this picture (FDS 27465) of the densely cratered surface of Mercury when the spacecraft was 18,200 kilometers (8085 miles) from the planet on March 29. The dark line across top of picture is a 'dropout' of a few TV lines of data. At lower left, a portion of a 61 kilometer (38 mile) crater shows a flow front extending across the crater floor and filling more than half of the crater. The smaller, fresh crater at center is about 25 kilometers (15 miles) in diameter. Craters as small as one kilometer (about one-half mile) across are visible in the picture.The Mariner 10 mission, managed by the Jet Propulsion Laboratory for NASA's Office of Space Science, explored Venus in February 1974 on the way to three encounters with Mercury-in March and September 1974 and in March 1975. The spacecraft took more than 7,000 photos of Mercury, Venus, the Earth and the Moon.Image Credit: NASA/JPL/Northwestern University
Hadrons in dense matter. Proceedings
International Nuclear Information System (INIS)
Buballa, M.; Noerenberg, W.; Schaefer, B.J.; Wambach, J.
2000-03-01
The following topics were dealt with: Elementary hadronic reactions, Delta dynamics in nuclei, in-medium s-wave ππ-correlations, strangeness in hot and dense matter, medium modifications of vector mesons and dilepton production, medium modifications of charmonium, thermal properties of hot and dense hadronic matter, nuclear matter, spectral functions and QCD sum rules
Collective dynamics in dense fluid mixtures
International Nuclear Information System (INIS)
Sinha, S.
1992-01-01
This thesis deals with the short wavelength collective dynamics of dense binary fluid mixtures. The analysis shows that at the level of linearized generalized hydrodynamics, the longitudinal modes of the system separates essentially into two parts - one involves the coupling of partial density fluctuations of the two species and the other involves coupling of longitudinal momentum and temperature fluctuations. The authors have shown that the coupling of longitudinal momentum and temperature fluctuations leads to an adequate description of sound propagation in such systems. In particular, they show that structural disorder controls the trapping of sound waves in dense mixtures. The coupling of the partial density fluctuations of the two species leads to a simple description of the partial dynamic structure factors. The results are in agreement with the molecular dynamics simulations of soft sphere mixtures. The partial density fluctuations are the slowest decaying fluctuations on molecular length scales and it turns out that nonlinear coupling of these slow modes leads to important corrections to the long time behavior of the time correlation functions determining the shear viscosity in dense mixtures
Unified approach to dense matter
International Nuclear Information System (INIS)
Park, Byung-Yoon; Lee, Hee-Jung; Vento, Vicente; Kim, Joon-Il; Min, Dong-Pil; Rho, Mannque
2005-01-01
We apply the Skyrme model to dense hadronic matter, which provides a unified approach to high density, valid in the large N c limit. In our picture, dense hadronic matter is described by the classical soliton configuration with minimum energy for the given baryon number density. By incorporating the meson fluctuations on such ground state we obtain an effective Lagrangian for meson dynamics in a dense medium. Our starting point has been the Skyrme model defined in terms of pions, thereafter we have extended and improved the model by incorporating other degrees of freedom such as dilaton, kaons and vector mesons
Linearly concatenated cyclobutane (ladderane) lipids form a dense bacterial membrane
Sinninghe Damsté, J.S.; Strous, M.; Rijpstra, W.I.C.; Hopmans, E.C.; Geenevasen, J.A.J.; Duin, A.C.T. van; Niftrik, L.A.; Jetten, M.S.M.
2002-01-01
Lipid membranes are essential to the functioning of cells, enabling the existence of concentration gradients of ions and metabolites. Microbial membrane lipids can contain three-, five-, six- and even seven-membered aliphatic rings, but four-membered aliphatic cyclobutane rings have never been
Transport properties of dense matter
International Nuclear Information System (INIS)
Itoh, Naoki; Mitake, Shinichi; Iyetomi, Hiroshi; Ichimaru, Setsuo
1983-01-01
Transport coefficients, electrical and thermal conductivities in particular, are essential physical quantities for the theories of stellar structure. Since the discoveries of pulsars and X-ray stars, an accurate evaluation of the transport coefficients in the dense matter has become indispensable to the quantitative understanding of the observed neutron stars. The authors present improved calculations of the electrical and thermal conductivities of the dense matter in the liquid metal phase, appropriate to white dwarfs and neutron stars. (Auth.)
Evolution of dense spatially modulated electron bunches
Balal, N.; Bratman, V. L.; Friedman, A.
2018-03-01
An analytical theory describing the dynamics of relativistic moving 1D electron pulses (layers) with the density modulation affected by a space charge has been revised and generalized for its application to the formation of dense picosecond bunches from linear accelerators with laser-driven photo injectors, and its good agreement with General Particle Tracer simulations has been demonstrated. Evolution of quasi-one-dimensional bunches (disks), for which the derived formulas predict longitudinal expansion, is compared with that for thin and long electron cylinders (threads), for which the excitation of non-linear waves with density spikes was found earlier by Musumeci et al. [Phys. Rev. Lett. 106(18), 184801 (2011)] and Musumeci et al. [Phys. Rev. Spec. Top. -Accel. Beams 16(10), 100701 (2013)]. Both types of bunches can be used for efficiency enhancement of THz sources based on the Doppler frequency up-shifted coherent spontaneous radiation of electrons. Despite the strong Coulomb repulsion, the periodicity of a preliminary modulation in dense 1D layers persists during their expansion in the most interesting case of a relatively small change in particle energy. However, the period of modulation increases and its amplitude decreases in time. In the case of a large change in electron energy, the uniformity of periodicity is broken due to different relativistic changes in longitudinal scales along the bunch: the "period" of modulation decreases and its amplitude increases from the rear to the front boundary. Nevertheless, the use of relatively long electron bunches with a proper preliminary spatial modulation of density can provide a significantly higher power and a narrower spectrum of coherent spontaneous radiation of dense bunches than in the case of initially short single bunches with the same charge.
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.
Some Applications of Algebraic System Solving
Roanes-Lozano, Eugenio
2011-01-01
Technology and, in particular, computer algebra systems, allows us to change both the way we teach mathematics and the mathematical curriculum. Curiously enough, unlike what happens with linear system solving, algebraic system solving is not widely known. The aim of this paper is to show that, although the theory lying behind the "exact…
Solving applied mathematical problems with Matlab
Xue, Dingyu
2008-01-01
Computer Mathematics Language-An Overview. Fundamentals of MATLAB Programming. Calculus Problems. MATLAB Computations of Linear Algebra Problems. Integral Transforms and Complex Variable Functions. Solutions to Nonlinear Equations and Optimization Problems. MATLAB Solutions to Differential Equation Problems. Solving Interpolations and Approximations Problems. Solving Probability and Mathematical Statistics Problems. Nontraditional Solution Methods for Mathematical Problems.
Dynamics of dense particle disks
International Nuclear Information System (INIS)
Araki, S.; Tremaine, S.; Toronto Univ., Canada)
1986-01-01
The present investigation of mechanical equilibrium and collisional transport processes in dense, differentially rotating particle disks is based on the Enskog (1922) theory of dense, hard sphere gases, with the single exception that the spheres are inelastic. The viscous instability suggested as a source of Saturn B ring structure does not arise in the models presented, although the ring may be subject to a phase transition analogous to the liquid-solid transition observed in molecular dynamics simulations of elastic hard spheres. In such a case, the ring would alternately exhibit zero-shear, or solid, and high shear, or liquid, zones. 29 references
Topics in computational linear optimization
DEFF Research Database (Denmark)
Hultberg, Tim Helge
2000-01-01
Linear optimization has been an active area of research ever since the pioneering work of G. Dantzig more than 50 years ago. This research has produced a long sequence of practical as well as theoretical improvements of the solution techniques avilable for solving linear optimization problems...... of high quality solvers and the use of algebraic modelling systems to handle the communication between the modeller and the solver. This dissertation features four topics in computational linear optimization: A) automatic reformulation of mixed 0/1 linear programs, B) direct solution of sparse unsymmetric...... systems of linear equations, C) reduction of linear programs and D) integration of algebraic modelling of linear optimization problems in C++. Each of these topics is treated in a separate paper included in this dissertation. The efficiency of solving mixed 0-1 linear programs by linear programming based...
Dense Crowds of Virtual Humans
Stüvel, S.A.
2016-01-01
This thesis presents a novel crowd simulation method `Torso Crowds', aimed at the simulation of dense crowds. The method is based on the results of user studies and a motion capture experiment, which are also described in this thesis. Torso Crowds introduces a capsule shape to represent people in
KBLAS: An Optimized Library for Dense Matrix-Vector Multiplication on GPU Accelerators
Abdelfattah, Ahmad; Keyes, David E.; Ltaief, Hatem
2016-01-01
compliance with the standard BLAS API. Another optimization technique allows ensuring coalesced memory access when dealing with submatrices, especially for high-level dense linear algebra algorithms. All KBLAS kernels have been leveraged to a multi
Frontiers and challenges in warm dense matter
Desjarlais, Michael; Redmer, Ronald; Trickey, Samuel
2014-01-01
Warm Dense Matter (WDM) occupies a loosely defined region of phase space intermediate between solid, liquid, gas, and plasma, and typically shares characteristics of two or more of these phases. WDM is generally associated with the combination of strongly coupled ions and moderately degenerate electrons, and careful attention to quantum physics and electronic structure is essential. The lack of a small perturbation parameter greatly limits approximate attempts at its accurate description. Since WDM resides at the intersection of solid state and high energy density physics, many high energy density physics (HEDP) experiments pass through this difficult region of phase space. Thus, understanding and modeling WDM is key to the success of experiments on diverse facilities. These include the National Ignition Campaign centered on the National Ignition Facility (NIF), pulsed-power driven experiments on the Z machine, ion-beam-driven WDM experiments on the NDCX-II, and fundamental WDM research at the Linear Coherent...
Efficient dense blur map estimation for automatic 2D-to-3D conversion
Vosters, L. P. J.; de Haan, G.
2012-03-01
Focus is an important depth cue for 2D-to-3D conversion of low depth-of-field images and video. However, focus can be only reliably estimated on edges. Therefore, Bea et al. [1] first proposed an optimization based approach to propagate focus to non-edge image portions, for single image focus editing. While their approach produces accurate dense blur maps, the computational complexity and memory requirements for solving the resulting sparse linear system with standard multigrid or (multilevel) preconditioning techniques, are infeasible within the stringent requirements of the consumer electronics and broadcast industry. In this paper we propose fast, efficient, low latency, line scanning based focus propagation, which mitigates the need for complex multigrid or (multilevel) preconditioning techniques. In addition we propose facial blur compensation to compensate for false shading edges that cause incorrect blur estimates in people's faces. In general shading leads to incorrect focus estimates, which may lead to unnatural 3D and visual discomfort. Since visual attention mostly tends to faces, our solution solves the most distracting errors. A subjective assessment by paired comparison on a set of challenging low-depth-of-field images shows that the proposed approach achieves equal 3D image quality as optimization based approaches, and that facial blur compensation results in a significant improvement.
Energy Technology Data Exchange (ETDEWEB)
Wiedemann, H.
1981-11-01
Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center.
International Nuclear Information System (INIS)
Wiedemann, H.
1981-11-01
Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center
Rayleigh-Taylor/gravitational instability in dense magnetoplasmas
Energy Technology Data Exchange (ETDEWEB)
Ali, S., E-mail: shahid.ali@ncp.edu.p [National Centre for Physics, Quaid-i-Azam University Campus, Islamabad (Pakistan); IPFN, Instituto Superior Tecnico, Av. Rovisco Pais, 1049-001 Lisboa (Portugal); Ahmed, Z. [COMSATS Institute of Information Technology, Department of Physics, Wah Campus (Pakistan); Mirza, Arshad M. [Theoretical Plasma Physics Group, Physics Department, Quaid-i-Azam University, Islamabad 45320 (Pakistan); Ahmad, I. [COMSATS Institute of Information Technology, Department of Physics, Islamabad Campus (Pakistan)
2009-08-10
The Rayleigh-Taylor instability is investigated in a nonuniform dense quantum magnetoplasma. For this purpose, a quantum hydrodynamical model is used for the electrons whereas the ions are assumed to be cold and classical. The dispersion relation for the Rayleigh-Taylor instability becomes modified with the quantum corrections associated with the Fermi pressure law and the quantum Bohm potential force. Numerically, it is found that the quantum speed and density gradient significantly modify the growth rate of RT instability. In a dense quantum magnetoplasma case, the linear growth rate of RT instability becomes significantly higher than its classical value and the modes are found to be highly localized. The present investigation should be useful in the studies of dense astrophysical magnetoplasmas as well as in laser-produced plasmas.
Rayleigh-Taylor/gravitational instability in dense magnetoplasmas
International Nuclear Information System (INIS)
Ali, S.; Ahmed, Z.; Mirza, Arshad M.; Ahmad, I.
2009-01-01
The Rayleigh-Taylor instability is investigated in a nonuniform dense quantum magnetoplasma. For this purpose, a quantum hydrodynamical model is used for the electrons whereas the ions are assumed to be cold and classical. The dispersion relation for the Rayleigh-Taylor instability becomes modified with the quantum corrections associated with the Fermi pressure law and the quantum Bohm potential force. Numerically, it is found that the quantum speed and density gradient significantly modify the growth rate of RT instability. In a dense quantum magnetoplasma case, the linear growth rate of RT instability becomes significantly higher than its classical value and the modes are found to be highly localized. The present investigation should be useful in the studies of dense astrophysical magnetoplasmas as well as in laser-produced plasmas.
Arbitrary electron acoustic waves in degenerate dense plasmas
Rahman, Ata-ur; Mushtaq, A.; Qamar, A.; Neelam, S.
2017-05-01
A theoretical investigation is carried out of the nonlinear dynamics of electron-acoustic waves in a collisionless and unmagnetized plasma whose constituents are non-degenerate cold electrons, ultra-relativistic degenerate electrons, and stationary ions. A dispersion relation is derived for linear EAWs. An energy integral equation involving the Sagdeev potential is derived, and basic properties of the large amplitude solitary structures are investigated in such a degenerate dense plasma. It is shown that only negative large amplitude EA solitary waves can exist in such a plasma system. The present analysis may be important to understand the collective interactions in degenerate dense plasmas, occurring in dense astrophysical environments as well as in laser-solid density plasma interaction experiments.
Warm Dense Matter: An Overview
International Nuclear Information System (INIS)
Kalantar, D H; Lee, R W; Molitoris, J D
2004-01-01
This document provides a summary of the ''LLNL Workshop on Extreme States of Materials: Warm Dense Matter to NIF'' which was held on 20, 21, and 22 February 2002 at the Wente Conference Center in Livermore, CA. The warm dense matter regime, the transitional phase space region between cold material and hot plasma, is presently poorly understood. The drive to understand the nature of matter in this regime is sparking scientific activity worldwide. In addition to pure scientific interest, finite temperature dense matter occurs in the regimes of interest to the SSMP (Stockpile Stewardship Materials Program). So that obtaining a better understanding of WDM is important to performing effective experiments at, e.g., NIF, a primary mission of LLNL. At this workshop we examined current experimental and theoretical work performed at, and in conjunction with, LLNL to focus future activities and define our role in this rapidly emerging research area. On the experimental front LLNL plays a leading role in three of the five relevant areas and has the opportunity to become a major player in the other two. Discussion at the workshop indicated that the path forward for the experimental efforts at LLNL were two fold: First, we are doing reasonable baseline work at SPLs, HE, and High Energy Lasers with more effort encouraged. Second, we need to plan effectively for the next evolution in large scale facilities, both laser (NIF) and Light/Beam sources (LCLS/TESLA and GSI) Theoretically, LLNL has major research advantages in areas as diverse as the thermochemical approach to warm dense matter equations of state to first principles molecular dynamics simulations. However, it was clear that there is much work to be done theoretically to understand warm dense matter. Further, there is a need for a close collaboration between the generation of verifiable experimental data that can provide benchmarks of both the experimental techniques and the theoretical capabilities. The conclusion of this
An algorithm for the solution of dynamic linear programs
Psiaki, Mark L.
1989-01-01
The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation
Holographic Renormalization in Dense Medium
International Nuclear Information System (INIS)
Park, Chanyong
2014-01-01
The holographic renormalization of a charged black brane with or without a dilaton field, whose dual field theory describes a dense medium at finite temperature, is investigated in this paper. In a dense medium, two different thermodynamic descriptions are possible due to an additional conserved charge. These two different thermodynamic ensembles are classified by the asymptotic boundary condition of the bulk gauge field. It is also shown that in the holographic renormalization regularity of all bulk fields can reproduce consistent thermodynamic quantities and that the Bekenstein-Hawking entropy is nothing but the renormalized thermal entropy of the dual field theory. Furthermore, we find that the Reissner-Nordström AdS black brane is dual to a theory with conformal matter as expected, whereas a charged black brane with a nontrivial dilaton profile is mapped to a theory with nonconformal matter although its leading asymptotic geometry still remains as AdS space
Masuda, Y; Misztal, I; Legarra, A; Tsuruta, S; Lourenco, D A L; Fragomeni, B O; Aguilar, I
2017-01-01
This paper evaluates an efficient implementation to multiply the inverse of a numerator relationship matrix for genotyped animals () by a vector (). The computation is required for solving mixed model equations in single-step genomic BLUP (ssGBLUP) with the preconditioned conjugate gradient (PCG). The inverse can be decomposed into sparse matrices that are blocks of the sparse inverse of a numerator relationship matrix () including genotyped animals and their ancestors. The elements of were rapidly calculated with the Henderson's rule and stored as sparse matrices in memory. Implementation of was by a series of sparse matrix-vector multiplications. Diagonal elements of , which were required as preconditioners in PCG, were approximated with a Monte Carlo method using 1,000 samples. The efficient implementation of was compared with explicit inversion of with 3 data sets including about 15,000, 81,000, and 570,000 genotyped animals selected from populations with 213,000, 8.2 million, and 10.7 million pedigree animals, respectively. The explicit inversion required 1.8 GB, 49 GB, and 2,415 GB (estimated) of memory, respectively, and 42 s, 56 min, and 13.5 d (estimated), respectively, for the computations. The efficient implementation required <1 MB, 2.9 GB, and 2.3 GB of memory, respectively, and <1 sec, 3 min, and 5 min, respectively, for setting up. Only <1 sec was required for the multiplication in each PCG iteration for any data sets. When the equations in ssGBLUP are solved with the PCG algorithm, is no longer a limiting factor in the computations.
Common intersection points in dense fluids via equations of state
International Nuclear Information System (INIS)
Parsafar, G. A.; Noorian, R.
2001-01-01
Some new of state which are derived for dense fluids in recent years, namely the linear isotherm regularity, the dense system equation of state, Ihm-Song-Mason equation of state, and a newly derived semi-empirical equation of state have used to investigate the common intersection point of isobaric expansivity (α p ) in dense fluids. We have shown that the accuracy of these equations of state in predicting such a common intersection point is reduced from the new semi-imperial equation of state, dense system equation of state, linear isotherm regularity, to Ihm-Song-Mason equation of state. respectively. Form physical point of view, the van der Waals equation of state is used to investigate such an intersection point. It is shown that the van der Waals repulsion forces and temperature dependency of the effective molecular diameter are important for existence of this common point. Finally, we have shown that the common intersection points of the isotherms of thermal pressure coefficient, the isotherms of heat capacity at constant volume, and the iso chores of internal pressure for a fluid are related to each other. Also, the common intersection points of the reduced bulk modulus and 1/(Tα p ) for isotherms of a fluid both appear at the same density
A framework for dense triangular matrix kernels on various manycore architectures
Charara, Ali
2017-06-06
We present a new high-performance framework for dense triangular Basic Linear Algebra Subroutines (BLAS) kernels, ie, triangular matrix-matrix multiplication (TRMM) and triangular solve (TRSM), on various manycore architectures. This is an extension of a previous work on a single GPU by the same authors, presented at the EuroPar\\'16 conference, in which we demonstrated the effectiveness of recursive formulations in enhancing the performance of these kernels. In this paper, the performance of triangular BLAS kernels on a single GPU is further enhanced by implementing customized in-place CUDA kernels for TRMM and TRSM, which are called at the bottom of the recursion. In addition, a multi-GPU implementation of TRMM and TRSM is proposed and we show an almost linear performance scaling, as the number of GPUs increases. Finally, the algorithmic recursive formulation of these triangular BLAS kernels is in fact oblivious to the targeted hardware architecture. We, therefore, port these recursive kernels to homogeneous x86 hardware architectures by relying on the vendor optimized BLAS implementations. Results reported on various hardware architectures highlight a significant performance improvement against state-of-the-art implementations. These new kernels are freely available in the KAUST BLAS (KBLAS) open-source library at https://github.com/ecrc/kblas.
A framework for dense triangular matrix kernels on various manycore architectures
Charara, Ali; Keyes, David E.; Ltaief, Hatem
2017-01-01
We present a new high-performance framework for dense triangular Basic Linear Algebra Subroutines (BLAS) kernels, ie, triangular matrix-matrix multiplication (TRMM) and triangular solve (TRSM), on various manycore architectures. This is an extension of a previous work on a single GPU by the same authors, presented at the EuroPar'16 conference, in which we demonstrated the effectiveness of recursive formulations in enhancing the performance of these kernels. In this paper, the performance of triangular BLAS kernels on a single GPU is further enhanced by implementing customized in-place CUDA kernels for TRMM and TRSM, which are called at the bottom of the recursion. In addition, a multi-GPU implementation of TRMM and TRSM is proposed and we show an almost linear performance scaling, as the number of GPUs increases. Finally, the algorithmic recursive formulation of these triangular BLAS kernels is in fact oblivious to the targeted hardware architecture. We, therefore, port these recursive kernels to homogeneous x86 hardware architectures by relying on the vendor optimized BLAS implementations. Results reported on various hardware architectures highlight a significant performance improvement against state-of-the-art implementations. These new kernels are freely available in the KAUST BLAS (KBLAS) open-source library at https://github.com/ecrc/kblas.
Inferring segmented dense motion layers using 5D tensor voting.
Min, Changki; Medioni, Gérard
2008-09-01
We present a novel local spatiotemporal approach to produce motion segmentation and dense temporal trajectories from an image sequence. A common representation of image sequences is a 3D spatiotemporal volume, (x,y,t), and its corresponding mathematical formalism is the fiber bundle. However, directly enforcing the spatiotemporal smoothness constraint is difficult in the fiber bundle representation. Thus, we convert the representation into a new 5D space (x,y,t,vx,vy) with an additional velocity domain, where each moving object produces a separate 3D smooth layer. The smoothness constraint is now enforced by extracting 3D layers using the tensor voting framework in a single step that solves both correspondence and segmentation simultaneously. Motion segmentation is achieved by identifying those layers, and the dense temporal trajectories are obtained by converting the layers back into the fiber bundle representation. We proceed to address three applications (tracking, mosaic, and 3D reconstruction) that are hard to solve from the video stream directly because of the segmentation and dense matching steps, but become straightforward with our framework. The approach does not make restrictive assumptions about the observed scene or camera motion and is therefore generally applicable. We present results on a number of data sets.
Dense Breasts: Answers to Commonly Asked Questions
... Cancer Prevention Genetics of Breast & Gynecologic Cancers Breast Cancer Screening Research Dense Breasts: Answers to Commonly Asked Questions What are dense breasts? Breasts contain glandular, connective, and fat tissue. Breast density is a term that describes the ...
Constructing Dense Graphs with Unique Hamiltonian Cycles
Lynch, Mark A. M.
2012-01-01
It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…
Vortex structures in dense electron-positron-ion plasmas
Energy Technology Data Exchange (ETDEWEB)
Haque, Q [Theoretical Plasma Physics Division, PINSTECH, P O Nilore, Islamabad (Pakistan)], E-mail: qamar_haque@hotmail.com
2009-11-15
A linear dispersion relation for electrostatic quantum drift and acoustic waves has been found for dense electron-positron-ion magnetoplasmas. Both the fermion and thermal temperature effects have been considered for electrons and positrons. In the nonlinear regime, a stationary solution in the form of dipolar vortices has been obtained. For illustration, the results were applied to the astrophysical plasma of the atmosphere of neutron stars/pulsars.
Shilov, Georgi E
1977-01-01
Covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, Euclidean spaces, unitary spaces, quadratic forms in Euclidean and unitary spaces, finite-dimensional space. Problems with hints and answers.
Screening in dense ionic fluids
International Nuclear Information System (INIS)
Tosi, M.P.
1991-01-01
There has been great progress in recent years in determining and understanding the structure of molten salts. I focus on molten alkali halides and discuss two main points concerning their liquid structure and its relationship with static electrical response in these dense ionic conductors. These are (i) the nature of screening and the related definitions and properties of the screening length and of the dielectric function, and (ii) developments in integral equations techniques for the evaluation of molten salt structure and static screening from given pair potentials. (author). 26 refs, 3 figs, 2 tabs
Linear versus non-linear supersymmetry, in general
Energy Technology Data Exchange (ETDEWEB)
Ferrara, Sergio [Theoretical Physics Department, CERN,CH-1211 Geneva 23 (Switzerland); INFN - Laboratori Nazionali di Frascati,Via Enrico Fermi 40, I-00044 Frascati (Italy); Department of Physics and Astronomy, UniversityC.L.A.,Los Angeles, CA 90095-1547 (United States); Kallosh, Renata [SITP and Department of Physics, Stanford University,Stanford, California 94305 (United States); Proeyen, Antoine Van [Institute for Theoretical Physics, Katholieke Universiteit Leuven,Celestijnenlaan 200D, B-3001 Leuven (Belgium); Wrase, Timm [Institute for Theoretical Physics, Technische Universität Wien,Wiedner Hauptstr. 8-10, A-1040 Vienna (Austria)
2016-04-12
We study superconformal and supergravity models with constrained superfields. The underlying version of such models with all unconstrained superfields and linearly realized supersymmetry is presented here, in addition to the physical multiplets there are Lagrange multiplier (LM) superfields. Once the equations of motion for the LM superfields are solved, some of the physical superfields become constrained. The linear supersymmetry of the original models becomes non-linearly realized, its exact form can be deduced from the original linear supersymmetry. Known examples of constrained superfields are shown to require the following LM’s: chiral superfields, linear superfields, general complex superfields, some of them are multiplets with a spin.
Linear versus non-linear supersymmetry, in general
International Nuclear Information System (INIS)
Ferrara, Sergio; Kallosh, Renata; Proeyen, Antoine Van; Wrase, Timm
2016-01-01
We study superconformal and supergravity models with constrained superfields. The underlying version of such models with all unconstrained superfields and linearly realized supersymmetry is presented here, in addition to the physical multiplets there are Lagrange multiplier (LM) superfields. Once the equations of motion for the LM superfields are solved, some of the physical superfields become constrained. The linear supersymmetry of the original models becomes non-linearly realized, its exact form can be deduced from the original linear supersymmetry. Known examples of constrained superfields are shown to require the following LM’s: chiral superfields, linear superfields, general complex superfields, some of them are multiplets with a spin.
A Novel Approach for Solving Semidefinite Programs
Directory of Open Access Journals (Sweden)
Hong-Wei Jiao
2014-01-01
Full Text Available A novel linearizing alternating direction augmented Lagrangian approach is proposed for effectively solving semidefinite programs (SDP. For every iteration, by fixing the other variables, the proposed approach alternatively optimizes the dual variables and the dual slack variables; then the primal variables, that is, Lagrange multipliers, are updated. In addition, the proposed approach renews all the variables in closed forms without solving any system of linear equations. Global convergence of the proposed approach is proved under mild conditions, and two numerical problems are given to demonstrate the effectiveness of the presented approach.
The role of triplet correlation function in dense fluids
International Nuclear Information System (INIS)
Rashid, R.I.M.A.
1993-09-01
In the theory of dense liquids, one usually introduces various correlation functions for describing properties of such systems. It has proved impossible to solve these correlation functions exactly and as such one often resorts to some meaningful approximations for their solutions. It is well known that unless proper precautions are taken, the approximate solutions will violate some useful sum rules and thermodynamic consistency conditions. Here the general rules for generating thermodynamically consistent approximate correlation functions are discussed. The role of triplet correlation is elucidated further by calculating a residual correction to the vacancy formation energy via three-particle correlation in rare gas solids. (author). 16 refs, 4 figs, 1 tab
Linear Programming and Network Flows
Bazaraa, Mokhtar S; Sherali, Hanif D
2011-01-01
The authoritative guide to modeling and solving complex problems with linear programming-extensively revised, expanded, and updated The only book to treat both linear programming techniques and network flows under one cover, Linear Programming and Network Flows, Fourth Edition has been completely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problems in a variety of fields, including industrial engineering, management science, operations research
Flow splitting in numerical simulations of oceanic dense-water outflows
Marques, Gustavo M.; Wells, Mathew G.; Padman, Laurie; Özgökmen, Tamay M.
2017-05-01
Flow splitting occurs when part of a gravity current becomes neutrally buoyant and separates from the bottom-trapped plume as an interflow. This phenomenon has been previously observed in laboratory experiments, small-scale water bodies (e.g., lakes) and numerical studies of small-scale systems. Here, the potential for flow splitting in oceanic gravity currents is investigated using high-resolution (Δx = Δz = 5 m) two-dimensional numerical simulations of gravity flows into linearly stratified environments. The model is configured to solve the non-hydrostatic Boussinesq equations without rotation. A set of experiments is conducted by varying the initial buoyancy number B0 =Q0N3 /g‧2 (where Q0 is the volume flux of the dense water flow per unit width, N is the ambient stratification and g‧ is the reduced gravity), the bottom slope (α) and the turbulent Prandtl number (Pr). Regardless of α or Pr, when B0 ≤ 0.002 the outflow always reaches the deep ocean forming an underflow. Similarly, when B0 ≥ 0.13 the outflow always equilibrates at intermediate depths, forming an interflow. However, when B0 ∼ 0.016, flow splitting always occurs when Pr ≥ 10, while interflows always occur for Pr = 1. An important characteristic of simulations that result in flow splitting is the development of Holmboe-like interfacial instabilities and flow transition from a supercritical condition, where the Froude number (Fr) is greater than one, to a slower and more uniform subcritical condition (Fr internal hydraulic jump and consequent mixing enhancement. Although our experiments do not take into account three-dimensionality and rotation, which are likely to influence mixing and the transition between flow regimes, a comparison between our results and oceanic observations suggests that flow splitting may occur in dense-water outflows with weak ambient stratification, such as Antarctic outflows.
Deterministic and unambiguous dense coding
International Nuclear Information System (INIS)
Wu Shengjun; Cohen, Scott M.; Sun Yuqing; Griffiths, Robert B.
2006-01-01
Optimal dense coding using a partially-entangled pure state of Schmidt rank D and a noiseless quantum channel of dimension D is studied both in the deterministic case where at most L d messages can be transmitted with perfect fidelity, and in the unambiguous case where when the protocol succeeds (probability τ x ) Bob knows for sure that Alice sent message x, and when it fails (probability 1-τ x ) he knows it has failed. Alice is allowed any single-shot (one use) encoding procedure, and Bob any single-shot measurement. For D≤D a bound is obtained for L d in terms of the largest Schmidt coefficient of the entangled state, and is compared with published results by Mozes et al. [Phys. Rev. A71, 012311 (2005)]. For D>D it is shown that L d is strictly less than D 2 unless D is an integer multiple of D, in which case uniform (maximal) entanglement is not needed to achieve the optimal protocol. The unambiguous case is studied for D≤D, assuming τ x >0 for a set of DD messages, and a bound is obtained for the average . A bound on the average requires an additional assumption of encoding by isometries (unitaries when D=D) that are orthogonal for different messages. Both bounds are saturated when τ x is a constant independent of x, by a protocol based on one-shot entanglement concentration. For D>D it is shown that (at least) D 2 messages can be sent unambiguously. Whether unitary (isometric) encoding suffices for optimal protocols remains a major unanswered question, both for our work and for previous studies of dense coding using partially-entangled states, including noisy (mixed) states
Solving Conic Systems via Projection and Rescaling
Pena, Javier; Soheili, Negar
2015-01-01
We propose a simple projection and rescaling algorithm to solve the feasibility problem \\[ \\text{ find } x \\in L \\cap \\Omega, \\] where $L$ and $\\Omega$ are respectively a linear subspace and the interior of a symmetric cone in a finite-dimensional vector space $V$. This projection and rescaling algorithm is inspired by previous work on rescaled versions of the perceptron algorithm and by Chubanov's projection-based method for linear feasibility problems. As in these predecessors, each main it...
Fundamentals of linear algebra
Dash, Rajani Ballav
2008-01-01
FUNDAMENTALS OF LINEAR ALGEBRA is a comprehensive Text Book, which can be used by students and teachers of All Indian Universities. The Text has easy, understandable form and covers all topics of UGC Curriculum. There are lots of worked out examples which helps the students in solving the problems without anybody's help. The Problem sets have been designed keeping in view of the questions asked in different examinations.
International Nuclear Information System (INIS)
Scheffel, J.
1984-03-01
The linear Grad-Shafranov equation for a toroidal, axisymmetric plasma is solved analytically. Exact solutions are given in terms of confluent hyper-geometric functions. As an alternative, simple and accurate WKBJ solutions are presented. With parabolic pressure profiles, both hollow and peaked toroidal current density profiles are obtained. As an example the equilibrium of a z-pinch with a square-shaped cross section is derived.(author)
Matching Cost Filtering for Dense Stereo Correspondence
Directory of Open Access Journals (Sweden)
Yimin Lin
2013-01-01
Full Text Available Dense stereo correspondence enabling reconstruction of depth information in a scene is of great importance in the field of computer vision. Recently, some local solutions based on matching cost filtering with an edge-preserving filter have been proved to be capable of achieving more accuracy than global approaches. Unfortunately, the computational complexity of these algorithms is quadratically related to the window size used to aggregate the matching costs. The recent trend has been to pursue higher accuracy with greater efficiency in execution. Therefore, this paper proposes a new cost-aggregation module to compute the matching responses for all the image pixels at a set of sampling points generated by a hierarchical clustering algorithm. The complexity of this implementation is linear both in the number of image pixels and the number of clusters. Experimental results demonstrate that the proposed algorithm outperforms state-of-the-art local methods in terms of both accuracy and speed. Moreover, performance tests indicate that parameters such as the height of the hierarchical binary tree and the spatial and range standard deviations have a significant influence on time consumption and the accuracy of disparity maps.
Breaking Dense Structures: Proving Stability of Densely Structured Hybrid Systems
Directory of Open Access Journals (Sweden)
Eike Möhlmann
2015-06-01
Full Text Available Abstraction and refinement is widely used in software development. Such techniques are valuable since they allow to handle even more complex systems. One key point is the ability to decompose a large system into subsystems, analyze those subsystems and deduce properties of the larger system. As cyber-physical systems tend to become more and more complex, such techniques become more appealing. In 2009, Oehlerking and Theel presented a (de-composition technique for hybrid systems. This technique is graph-based and constructs a Lyapunov function for hybrid systems having a complex discrete state space. The technique consists of (1 decomposing the underlying graph of the hybrid system into subgraphs, (2 computing multiple local Lyapunov functions for the subgraphs, and finally (3 composing the local Lyapunov functions into a piecewise Lyapunov function. A Lyapunov function can serve multiple purposes, e.g., it certifies stability or termination of a system or allows to construct invariant sets, which in turn may be used to certify safety and security. In this paper, we propose an improvement to the decomposing technique, which relaxes the graph structure before applying the decomposition technique. Our relaxation significantly reduces the connectivity of the graph by exploiting super-dense switching. The relaxation makes the decomposition technique more efficient on one hand and on the other allows to decompose a wider range of graph structures.
Optimal super dense coding over memory channels
Shadman, Zahra; Kampermann, Hermann; Macchiavello, Chiara; Bruß, Dagmar
2011-01-01
We study the super dense coding capacity in the presence of quantum channels with correlated noise. We investigate both the cases of unitary and non-unitary encoding. Pauli channels for arbitrary dimensions are treated explicitly. The super dense coding capacity for some special channels and resource states is derived for unitary encoding. We also provide an example of a memory channel where non-unitary encoding leads to an improvement in the super dense coding capacity.
International Nuclear Information System (INIS)
Shlachter, J.S.; Hammel, J.E.; Scudder, D.W.
1985-01-01
Early researchers recogniZed the desirable features of the linear Z-pinch configuration as a magnetic fusion scheme. In particular, a Z-pinch reactor might not require auxiliary heating or external field coils, and could constitute an uncomplicated, high plasma β geometry. The simple Z pinch, however, exhibited gross MHD instabilities that disrupted the plasma, and the linear Z pinch was abandoned in favor of more stable configurations. Recent advances in pulsed-power technology and an appreciation of the dynamic behavior of an ohmically heated Z pinch have led to a reexamination of the Z pinch as a workable fusion concept
Dense module enumeration in biological networks
Tsuda, Koji; Georgii, Elisabeth
2009-12-01
Analysis of large networks is a central topic in various research fields including biology, sociology, and web mining. Detection of dense modules (a.k.a. clusters) is an important step to analyze the networks. Though numerous methods have been proposed to this aim, they often lack mathematical rigorousness. Namely, there is no guarantee that all dense modules are detected. Here, we present a novel reverse-search-based method for enumerating all dense modules. Furthermore, constraints from additional data sources such as gene expression profiles or customer profiles can be integrated, so that we can systematically detect dense modules with interesting profiles. We report successful applications in human protein interaction network analyses.
Dense module enumeration in biological networks
International Nuclear Information System (INIS)
Tsuda, Koji; Georgii, Elisabeth
2009-01-01
Analysis of large networks is a central topic in various research fields including biology, sociology, and web mining. Detection of dense modules (a.k.a. clusters) is an important step to analyze the networks. Though numerous methods have been proposed to this aim, they often lack mathematical rigorousness. Namely, there is no guarantee that all dense modules are detected. Here, we present a novel reverse-search-based method for enumerating all dense modules. Furthermore, constraints from additional data sources such as gene expression profiles or customer profiles can be integrated, so that we can systematically detect dense modules with interesting profiles. We report successful applications in human protein interaction network analyses.
Parallel Access of Out-Of-Core Dense Extendible Arrays
Energy Technology Data Exchange (ETDEWEB)
Otoo, Ekow J; Rotem, Doron
2007-07-26
Datasets used in scientific and engineering applications are often modeled as dense multi-dimensional arrays. For very large datasets, the corresponding array models are typically stored out-of-core as array files. The array elements are mapped onto linear consecutive locations that correspond to the linear ordering of the multi-dimensional indices. Two conventional mappings used are the row-major order and the column-major order of multi-dimensional arrays. Such conventional mappings of dense array files highly limit the performance of applications and the extendibility of the dataset. Firstly, an array file that is organized in say row-major order causes applications that subsequently access the data in column-major order, to have abysmal performance. Secondly, any subsequent expansion of the array file is limited to only one dimension. Expansions of such out-of-core conventional arrays along arbitrary dimensions, require storage reorganization that can be very expensive. Wepresent a solution for storing out-of-core dense extendible arrays that resolve the two limitations. The method uses a mapping function F*(), together with information maintained in axial vectors, to compute the linear address of an extendible array element when passed its k-dimensional index. We also give the inverse function, F-1*() for deriving the k-dimensional index when given the linear address. We show how the mapping function, in combination with MPI-IO and a parallel file system, allows for the growth of the extendible array without reorganization and no significant performance degradation of applications accessing elements in any desired order. We give methods for reading and writing sub-arrays into and out of parallel applications that run on a cluster of workstations. The axial-vectors are replicated and maintained in each node that accesses sub-array elements.
A method for solving neutron transport equation
International Nuclear Information System (INIS)
Dimitrijevic, Z.
1993-01-01
The procedure for solving the transport equation by directly integrating for case one-dimensional uniform multigroup medium is shown. The solution is expressed in terms of linear combination of function H n (x,μ), and the coefficient is determined from given conditions. The solution is applied for homogeneous slab of critical thickness. (author)
One-shot 3D scanning by combining sparse landmarks with dense gradient information
Di Martino, Matías; Flores, Jorge; Ferrari, José A.
2018-06-01
Scene understanding is one of the most challenging and popular problems in the field of robotics and computer vision and the estimation of 3D information is at the core of most of these applications. In order to retrieve the 3D structure of a test surface we propose a single shot approach that combines dense gradient information with sparse absolute measurements. To that end, we designed a colored pattern that codes fine horizontal and vertical fringes, with sparse corners landmarks. By measuring the deformation (bending) of horizontal and vertical fringes, we are able to estimate surface local variations (i.e. its gradient field). Then corner sparse landmarks are detected and matched to infer spare absolute information about the test surface height. Local gradient information is combined with the sparse absolute values which work as anchors to guide the integration process. We show that this can be mathematically done in a very compact and intuitive way by properly defining a Poisson-like partial differential equation. Then we address in detail how the problem can be formulated in a discrete domain and how it can be practically solved by straight forward linear numerical solvers. Finally, validation experiment are presented.
International Nuclear Information System (INIS)
Tetsu, Miyamoto
1999-01-01
The steady state and quasi-steady processes of infinite- and finite-width sheet z-pinches are studied. The relations corresponding to the Bennett relation and Pease-Braginskii current of cylindrical fiber z-pinches depend on a geometrical factor in the sheet z-pinches. The finite-width sheet z-pinch is approximated by a segment of infinite-width sheet z-pinch, if it is wide enough, and corresponds to a number of (width/thickness) times fiber z-pinch plasmas of the diameter that equals the sheet thickness. If the sheet current equals this number times the fiber current, the plasma created in the sheet z-pinches is as dense as in the fiber z-pinches. The total energy of plasma and magnetic field per unit mass is approximately equal in both pinches. Quasi-static transient processes are different in several aspects from the fiber z-pinch. No radiation collapse occurs in the sheet z-pinch. The stability is improved in the sheet z-pinches. The fusion criterions and the experimental arrangements to produce the sheet z-pinches are also discussed. (author)
STAR FORMATION IN DENSE CLUSTERS
International Nuclear Information System (INIS)
Myers, Philip C.
2011-01-01
A model of core-clump accretion with equally likely stopping describes star formation in the dense parts of clusters, where models of isolated collapsing cores may not apply. Each core accretes at a constant rate onto its protostar, while the surrounding clump gas accretes as a power of protostar mass. Short accretion flows resemble Shu accretion and make low-mass stars. Long flows resemble reduced Bondi accretion and make massive stars. Accretion stops due to environmental processes of dynamical ejection, gravitational competition, and gas dispersal by stellar feedback, independent of initial core structure. The model matches the field star initial mass function (IMF) from 0.01 to more than 10 solar masses. The core accretion rate and the mean accretion duration set the peak of the IMF, independent of the local Jeans mass. Massive protostars require the longest accretion durations, up to 0.5 Myr. The maximum protostar luminosity in a cluster indicates the mass and age of its oldest protostar. The distribution of protostar luminosities matches those in active star-forming regions if protostars have a constant birthrate but not if their births are coeval. For constant birthrate, the ratio of young stellar objects to protostars indicates the star-forming age of a cluster, typically ∼1 Myr. The protostar accretion luminosity is typically less than its steady spherical value by a factor of ∼2, consistent with models of episodic disk accretion.
International Nuclear Information System (INIS)
Suwono.
1978-01-01
A linear gate providing a variable gate duration from 0,40μsec to 4μsec was developed. The electronic circuity consists of a linear circuit and an enable circuit. The input signal can be either unipolar or bipolar. If the input signal is bipolar, the negative portion will be filtered. The operation of the linear gate is controlled by the application of a positive enable pulse. (author)
Singh, Chandralekha
2009-07-01
One finding of cognitive research is that people do not automatically acquire usable knowledge by spending lots of time on task. Because students' knowledge hierarchy is more fragmented, "knowledge chunks" are smaller than those of experts. The limited capacity of short term memory makes the cognitive load high during problem solving tasks, leaving few cognitive resources available for meta-cognition. The abstract nature of the laws of physics and the chain of reasoning required to draw meaningful inferences makes these issues critical. In order to help students, it is crucial to consider the difficulty of a problem from the perspective of students. We are developing and evaluating interactive problem-solving tutorials to help students in the introductory physics courses learn effective problem-solving strategies while solidifying physics concepts. The self-paced tutorials can provide guidance and support for a variety of problem solving techniques, and opportunity for knowledge and skill acquisition.
Teaching Creative Problem Solving.
Christensen, Kip W.; Martin, Loren
1992-01-01
Interpersonal and cognitive skills, adaptability, and critical thinking can be developed through problem solving and cooperative learning in technology education. These skills have been identified as significant needs of the workplace as well as for functioning in society. (SK)
International Nuclear Information System (INIS)
Vretenar, M
2014-01-01
The main features of radio-frequency linear accelerators are introduced, reviewing the different types of accelerating structures and presenting the main characteristics aspects of linac beam dynamics
Linearization Method and Linear Complexity
Tanaka, Hidema
We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N(≅2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.
Linear System of Equations, Matrix Inversion, and Linear Programming Using MS Excel
El-Gebeily, M.; Yushau, B.
2008-01-01
In this note, we demonstrate with illustrations two different ways that MS Excel can be used to solve Linear Systems of Equation, Linear Programming Problems, and Matrix Inversion Problems. The advantage of using MS Excel is its availability and transparency (the user is responsible for most of the details of how a problem is solved). Further, we…
Elementary linear programming with applications
Kolman, Bernard
1995-01-01
Linear programming finds the least expensive way to meet given needs with available resources. Its results are used in every area of engineering and commerce: agriculture, oil refining, banking, and air transport. Authors Kolman and Beck present the basic notions of linear programming and illustrate how they are used to solve important common problems. The software on the included disk leads students step-by-step through the calculations. The Second Edition is completely revised and provides additional review material on linear algebra as well as complete coverage of elementary linear program
Said-Houari, Belkacem
2017-01-01
This self-contained, clearly written textbook on linear algebra is easily accessible for students. It begins with the simple linear equation and generalizes several notions from this equation for the system of linear equations and introduces the main ideas using matrices. It then offers a detailed chapter on determinants and introduces the main ideas with detailed proofs. The third chapter introduces the Euclidean spaces using very simple geometric ideas and discusses various major inequalities and identities. These ideas offer a solid basis for understanding general Hilbert spaces in functional analysis. The following two chapters address general vector spaces, including some rigorous proofs to all the main results, and linear transformation: areas that are ignored or are poorly explained in many textbooks. Chapter 6 introduces the idea of matrices using linear transformation, which is easier to understand than the usual theory of matrices approach. The final two chapters are more advanced, introducing t...
Solving the Linear 1D Thermoelasticity Equations with Pure Delay
Directory of Open Access Journals (Sweden)
Denys Ya. Khusainov
2015-01-01
Full Text Available We propose a system of partial differential equations with a single constant delay τ>0 describing the behavior of a one-dimensional thermoelastic solid occupying a bounded interval of R1. For an initial-boundary value problem associated with this system, we prove a well-posedness result in a certain topology under appropriate regularity conditions on the data. Further, we show the solution of our delayed model to converge to the solution of the classical equations of thermoelasticity as τ→0. Finally, we deduce an explicit solution representation for the delay problem.
Solving large linear systems in an implicit thermohaline ocean model
de Niet, Arie Christiaan
2007-01-01
The climate on earth is largely determined by the global ocean circulation. Hence it is important to predict how the flow will react to perturbation by for example melting icecaps. To answer questions about the stability of the global ocean flow, a computer model has been developed that is able to
Students' errors in solving linear equation word problems: Case ...
African Journals Online (AJOL)
kofi.mereku
the modified Newman Error Hierarchical levels (NEAL), which comprise reading, comprehension, transformation, process skills and encoding errors. The results revealed that majority (60%) of the students attempted most of the questions with a few (2%) arriving at the correct answer which implies students have difficulties ...
An Application of Linear Algebra over Lattices
Directory of Open Access Journals (Sweden)
M. Hosseinyazdi
2008-03-01
Full Text Available In this paper, first we consider L n as a semimodule over a complete bounded distributive lattice L. Then we define the basic concepts of module theory for L n. After that, we proved many similar theorems in linear algebra for the space L n. An application of linear algebra over lattices for solving linear systems, was given
An Application of Linear Algebra over Lattices
M. Hosseinyazdi
2008-01-01
In this paper, first we consider L n as a semimodule over a complete bounded distributive lattice L. Then we define the basic concepts of module theory for L n. After that, we proved many similar theorems in linear algebra for the space L n. An application of linear algebra over lattices for solving linear systems, was given
Investigating Integer Restrictions in Linear Programming
Edwards, Thomas G.; Chelst, Kenneth R.; Principato, Angela M.; Wilhelm, Thad L.
2015-01-01
Linear programming (LP) is an application of graphing linear systems that appears in many Algebra 2 textbooks. Although not explicitly mentioned in the Common Core State Standards for Mathematics, linear programming blends seamlessly into modeling with mathematics, the fourth Standard for Mathematical Practice (CCSSI 2010, p. 7). In solving a…
Stoll, R R
1968-01-01
Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand
DEFF Research Database (Denmark)
Chemi, Tatiana
2016-01-01
This chapter aims to deconstruct some persistent myths about creativity: the myth of individualism and of the genius. By looking at literature that approaches creativity as a participatory and distributed phenomenon and by bringing empirical evidence from artists’ studios, the author presents a p......, what can educators at higher education learn from the ways creative groups solve problems? How can artists contribute to inspiring higher education?......This chapter aims to deconstruct some persistent myths about creativity: the myth of individualism and of the genius. By looking at literature that approaches creativity as a participatory and distributed phenomenon and by bringing empirical evidence from artists’ studios, the author presents...... a perspective that is relevant to higher education. The focus here is on how artists solve problems in distributed paths, and on the elements of creative collaboration. Creative problem-solving will be looked at as an ongoing dialogue that artists engage with themselves, with others, with recipients...
Solving Environmental Problems
DEFF Research Database (Denmark)
Ørding Olsen, Anders; Sofka, Wolfgang; Grimpe, Christoph
2017-01-01
for Research and Technological Development (FP7), our results indicate that the problem-solving potential of a search strategy increases with the diversity of existing knowledge of the partners in a consortium and with the experience of the partners involved. Moreover, we identify a substantial negative effect...... dispersed. Hence, firms need to collaborate. We shed new light on collaborative search strategies led by firms in general and for solving environmental problems in particular. Both topics are largely absent in the extant open innovation literature. Using data from the European Seventh Framework Program...
Solow, Daniel
2014-01-01
This text covers the basic theory and computation for a first course in linear programming, including substantial material on mathematical proof techniques and sophisticated computation methods. Includes Appendix on using Excel. 1984 edition.
Liesen, Jörg
2015-01-01
This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...
Berberian, Sterling K
2014-01-01
Introductory treatment covers basic theory of vector spaces and linear maps - dimension, determinants, eigenvalues, and eigenvectors - plus more advanced topics such as the study of canonical forms for matrices. 1992 edition.
Searle, Shayle R
2012-01-01
This 1971 classic on linear models is once again available--as a Wiley Classics Library Edition. It features material that can be understood by any statistician who understands matrix algebra and basic statistical methods.
Composite systems of dilute and dense couplings
International Nuclear Information System (INIS)
Raymond, J R; Saad, D
2008-01-01
Composite systems, where couplings are of two types, a combination of strong dilute and weak dense couplings of Ising spins, are examined through the replica method. The dilute and dense parts are considered to have independent canonical disordered or uniform bond distributions; mixing the models by variation of a parameter γ alongside inverse temperature β we analyse the respective thermodynamic solutions. We describe the variation in high temperature transitions as mixing occurs; in the vicinity of these transitions we exactly analyse the competing effects of the dense and sparse models. By using the replica symmetric ansatz and population dynamics we described the low temperature behaviour of mixed systems
Christofilos, N.C.; Polk, I.J.
1959-02-17
Improvements in linear particle accelerators are described. A drift tube system for a linear ion accelerator reduces gap capacity between adjacent drift tube ends. This is accomplished by reducing the ratio of the diameter of the drift tube to the diameter of the resonant cavity. Concentration of magnetic field intensity at the longitudinal midpoint of the external sunface of each drift tube is reduced by increasing the external drift tube diameter at the longitudinal center region.
Introspection in Problem Solving
Jäkel, Frank; Schreiber, Cornell
2013-01-01
Problem solving research has encountered an impasse. Since the seminal work of Newell und Simon (1972) researchers do not seem to have made much theoretical progress (Batchelder and Alexander, 2012; Ohlsson, 2012). In this paper we argue that one factor that is holding back the field is the widespread rejection of introspection among cognitive…
Greene, Kim; Heyck-Williams, Jeff; Timpson Gray, Elicia
2017-01-01
Problem solving spans all grade levels and content areas, as evidenced by this compilation of projects from schools across the United States. In one project, high school girls built a solar-powered tent to serve their city's homeless population. In another project, 4th graders explored historic Jamestown to learn about the voices lost to history.…
Utomo, P.H.; Makarim, R.H.
2017-01-01
A Binary puzzle is a Sudoku-like puzzle with values in each cell taken from the set {0,1} {0,1}. Let n≥4 be an even integer, a solved binary puzzle is an n×n binary array that satisfies the following conditions: (1) no three consecutive ones and no three consecutive zeros in each row and each
Ayrinhac, Simon
2014-01-01
We present in this work a demonstration of the maze-solving problem with electricity. Electric current flowing in a maze as a printed circuit produces Joule heating and the right way is instantaneously revealed with infrared thermal imaging. The basic properties of electric current can be discussed in this context, with this challenging question:…
Toward Solving the Problem of Problem Solving: An Analysis Framework
Roesler, Rebecca A.
2016-01-01
Teaching is replete with problem solving. Problem solving as a skill, however, is seldom addressed directly within music teacher education curricula, and research in music education has not examined problem solving systematically. A framework detailing problem-solving component skills would provide a needed foundation. I observed problem solving…
Intense, ultrashort light and dense, hot matter
Indian Academy of Sciences (India)
tiphoton and tunneling ionization, the physics of plasma formed in dense matter is .... A typical Gaussian laser pulse of 100 fs dura- .... J range) – and finally it is compressed back to its .... bond-hardening, molecular orientation and reori-.
Finding dense locations in indoor tracking data
DEFF Research Database (Denmark)
Ahmed, Tanvir; Pedersen, Torben Bach; Lu, Hua
2014-01-01
for semi-constrained indoor movement, and then uses this to map raw tracking records into mapping records representing object entry and exit times in particular locations. Then, an efficient indexing structure, the Dense Location Time Index (DLT-Index) is proposed for indexing the time intervals...... of the mapping table, along with associated construction, query processing, and pruning techniques. The DLT-Index supports very efficient aggregate point queries, interval queries, and dense location queries. A comprehensive experimental study with real data shows that the proposed techniques can efficiently......Finding the dense locations in large indoor spaces is very useful for getting overloaded locations, security, crowd management, indoor navigation, and guidance. Indoor tracking data can be very large and are not readily available for finding dense locations. This paper presents a graph-based model...
Interference Coordination for Dense Wireless Networks
DEFF Research Database (Denmark)
Soret, Beatriz; Pedersen, Klaus I.; Jørgensen, Niels T.K.
2015-01-01
and dense deployment in Tokyo are compared. Evolution to DenseNets offers new opportunities for further development of downlink interference cooperation techniques. Various mechanisms in LTE and LTE-Advanced are revisited. Some techniques try to anticipate the future in a proactive way, whereas others......The promise of ubiquitous and super-fast connectivity for the upcoming years will be in large part fulfilled by the addition of base stations and spectral aggregation. The resulting very dense networks (DenseNets) will face a number of technical challenges. Among others, the interference emerges...... as an old acquaintance with new significance. As a matter of fact, the interference conditions and the role of aggressor and victim depend to a large extent on the density and the scenario. To illustrate this, downlink interference statistics for different 3GPP simulation scenarios and a more irregular...
Skyrmions, dense matter and nuclear forces
International Nuclear Information System (INIS)
Pethick, C.J.
1984-12-01
A simple introduction to a number of properties of Skyrme's chiral soliton model of baryons is given. Some implications of the model for dense matter and for nuclear interactions are discussed. (orig.)
Dynamical theory of dense groups of galaxies
Mamon, Gary A.
1990-01-01
It is well known that galaxies associate in groups and clusters. Perhaps 40% of all galaxies are found in groups of 4 to 20 galaxies (e.g., Tully 1987). Although most groups appear to be so loose that the galaxy interactions within them ought to be insignificant, the apparently densest groups, known as compact groups appear so dense when seen in projection onto the plane of the sky that their members often overlap. These groups thus appear as dense as the cores of rich clusters. The most popular catalog of compact groups, compiled by Hickson (1982), includes isolation among its selection critera. Therefore, in comparison with the cores of rich clusters, Hickson's compact groups (HCGs) appear to be the densest isolated regions in the Universe (in galaxies per unit volume), and thus provide in principle a clean laboratory for studying the competition of very strong gravitational interactions. The $64,000 question here is then: Are compact groups really bound systems as dense as they appear? If dense groups indeed exist, then one expects that each of the dynamical processes leading to the interaction of their member galaxies should be greatly enhanced. This leads us to the questions: How stable are dense groups? How do they form? And the related question, fascinating to any theorist: What dynamical processes predominate in dense groups of galaxies? If HCGs are not bound dense systems, but instead 1D change alignments (Mamon 1986, 1987; Walke & Mamon 1989) or 3D transient cores (Rose 1979) within larger looser systems of galaxies, then the relevant question is: How frequent are chance configurations within loose groups? Here, the author answers these last four questions after comparing in some detail the methods used and the results obtained in the different studies of dense groups.
Kinetic chemistry of dense interstellar clouds
International Nuclear Information System (INIS)
Graedel, T.E.; Langer, W.D.; Frerking, M.A.
1982-01-01
A detailed model of the time-dependent chemistry of dense interstellar clouds has been developed to study the dominant chemical processes in carbon and oxygen isotope fractionation, formation of nitrogen-containing molecules, evolution of product molecules as a function of cloud density and temperature, and other topics of interest. The full computation involves 328 individual reactions (expanded to 1067 to study carbon and oxygen isotope chemistry); photodegradation processes are unimportant in these dense clouds and are excluded
Parallel Algorithm for Solving TOV Equations for Sequence of Cold and Dense Nuclear Matter Models
Ayriyan, Alexander; Buša, Ján; Grigorian, Hovik; Poghosyan, Gevorg
2018-04-01
We have introduced parallel algorithm simulation of neutron star configurations for set of equation of state models. The performance of the parallel algorithm has been investigated for testing set of EoS models on two computational systems. It scales when using with MPI on modern CPUs and this investigation allowed us also to compare two different types of computational nodes.
Olive, David J
2017-01-01
This text covers both multiple linear regression and some experimental design models. The text uses the response plot to visualize the model and to detect outliers, does not assume that the error distribution has a known parametric distribution, develops prediction intervals that work when the error distribution is unknown, suggests bootstrap hypothesis tests that may be useful for inference after variable selection, and develops prediction regions and large sample theory for the multivariate linear regression model that has m response variables. A relationship between multivariate prediction regions and confidence regions provides a simple way to bootstrap confidence regions. These confidence regions often provide a practical method for testing hypotheses. There is also a chapter on generalized linear models and generalized additive models. There are many R functions to produce response and residual plots, to simulate prediction intervals and hypothesis tests, to detect outliers, and to choose response trans...
International Nuclear Information System (INIS)
Alcaraz, J.
2001-01-01
After several years of study e''+ e''- linear colliders in the TeV range have emerged as the major and optimal high-energy physics projects for the post-LHC era. These notes summarize the present status form the main accelerator and detector features to their physics potential. The LHC era. These notes summarize the present status, from the main accelerator and detector features to their physics potential. The LHC is expected to provide first discoveries in the new energy domain, whereas an e''+ e''- linear collider in the 500 GeV-1 TeV will be able to complement it to an unprecedented level of precision in any possible areas: Higgs, signals beyond the SM and electroweak measurements. It is evident that the Linear Collider program will constitute a major step in the understanding of the nature of the new physics beyond the Standard Model. (Author) 22 refs
Joint shape segmentation with linear programming
Huang, Qixing; Koltun, Vladlen; Guibas, Leonidas
2011-01-01
program is solved via a linear programming relaxation, using a block coordinate descent procedure that makes the optimization feasible for large databases. We evaluate the presented approach on the Princeton segmentation benchmark and show that joint shape
A Direct Heuristic Algorithm for Linear Programming
Indian Academy of Sciences (India)
Abstract. An (3) mathematically non-iterative heuristic procedure that needs no artificial variable is presented for solving linear programming problems. An optimality test is included. Numerical experiments depict the utility/scope of such a procedure.
Creativity and Problem Solving
DEFF Research Database (Denmark)
Vidal, Rene Victor Valqui
2004-01-01
This paper presents some modern and interdisciplinary concepts about creativity and creative processes of special relevance for Operational Research workers. Central publications in the area Creativity-Operational Research are shortly reviewed. Some creative tools and the Creative Problem Solving...... approach are also discussed. Finally, some applications of these concepts and tools are outlined. Some central references are presented for further study of themes related to creativity or creative tools....
Creativity and problem Solving
Directory of Open Access Journals (Sweden)
René Victor Valqui Vidal
2004-12-01
Full Text Available This paper presents some modern and interdisciplinary concepts about creativity and creative processes of special relevance for Operational Research workers. Central publications in the area Creativity-Operational Research are shortly reviewed. Some creative tools and the Creative Problem Solving approach are also discussed. Finally, some applications of these concepts and tools are outlined. Some central references are presented for further study of themes related to creativity or creative tools.
Generalised Assignment Matrix Methodology in Linear Programming
Jerome, Lawrence
2012-01-01
Discrete Mathematics instructors and students have long been struggling with various labelling and scanning algorithms for solving many important problems. This paper shows how to solve a wide variety of Discrete Mathematics and OR problems using assignment matrices and linear programming, specifically using Excel Solvers although the same…
Linear viscoelastic properties of aging suspensions
Purnomo, E.H.; Purnomo, E.H; van den Ende, Henricus T.M.; Mellema, J.; Mugele, Friedrich Gunther
2006-01-01
We have examined the linear viscoelastic behavior of poly-N-isopropylacrylamide (PNIPAM) microgel suspensions in order to obtain insight in the aging processes in these densely packed suspensions at various temperatures below the volume transition temperature. The system is found to display a strong
High performance linear algebra algorithms: An introduction
DEFF Research Database (Denmark)
Gustavson, F.G.; Wasniewski, Jerzy
2006-01-01
his Mini-Symposium consisted of two back to back sessions, each consisting of five presentations, held on the afternoon of Monday, June 21, 2004. A major theme of both sessions was novel data structures for the matrices of dense linear algebra, DLA. Talks one to four of session one all centered...
Single-particle model of a strongly driven, dense, nanoscale quantum ensemble
DiLoreto, C. S.; Rangan, C.
2018-01-01
We study the effects of interatomic interactions on the quantum dynamics of a dense, nanoscale, atomic ensemble driven by a strong electromagnetic field. We use a self-consistent, mean-field technique based on the pseudospectral time-domain method and a full, three-directional basis to solve the coupled Maxwell-Liouville equations. We find that interatomic interactions generate a decoherence in the state of an ensemble on a much faster time scale than the excited-state lifetime of individual atoms. We present a single-particle model of the driven, dense ensemble by incorporating interactions into a dephasing rate. This single-particle model reproduces the essential physics of the full simulation and is an efficient way of rapidly estimating the collective dynamics of a dense ensemble.
Linear and non-linear calculations of the hose instability in the ion-focused regime
International Nuclear Information System (INIS)
Buchanan, H.L.
1982-01-01
A simple model is adopted to study the hose instability of an intense relativistic electron beam in a partially neutralized, low density ion channel (ion focused regime). Equations of motion for the beam and the channel are derived and linearized to obtain an approximate dispersion relation. The non-linear equations of motion are then solved numerically and the results compared to linearized data
Generalized Linear Covariance Analysis
Carpenter, James R.; Markley, F. Landis
2014-01-01
This talk presents a comprehensive approach to filter modeling for generalized covariance analysis of both batch least-squares and sequential estimators. We review and extend in two directions the results of prior work that allowed for partitioning of the state space into solve-for'' and consider'' parameters, accounted for differences between the formal values and the true values of the measurement noise, process noise, and textita priori solve-for and consider covariances, and explicitly partitioned the errors into subspaces containing only the influence of the measurement noise, process noise, and solve-for and consider covariances. In this work, we explicitly add sensitivity analysis to this prior work, and relax an implicit assumption that the batch estimator's epoch time occurs prior to the definitive span. We also apply the method to an integrated orbit and attitude problem, in which gyro and accelerometer errors, though not estimated, influence the orbit determination performance. We illustrate our results using two graphical presentations, which we call the variance sandpile'' and the sensitivity mosaic,'' and we compare the linear covariance results to confidence intervals associated with ensemble statistics from a Monte Carlo analysis.
Karloff, Howard
1991-01-01
To this reviewer’s knowledge, this is the first book accessible to the upper division undergraduate or beginning graduate student that surveys linear programming from the Simplex Method…via the Ellipsoid algorithm to Karmarkar’s algorithm. Moreover, its point of view is algorithmic and thus it provides both a history and a case history of work in complexity theory. The presentation is admirable; Karloff's style is informal (even humorous at times) without sacrificing anything necessary for understanding. Diagrams (including horizontal brackets that group terms) aid in providing clarity. The end-of-chapter notes are helpful...Recommended highly for acquisition, since it is not only a textbook, but can also be used for independent reading and study. —Choice Reviews The reader will be well served by reading the monograph from cover to cover. The author succeeds in providing a concise, readable, understandable introduction to modern linear programming. —Mathematics of Computing This is a textbook intend...
DEFF Research Database (Denmark)
Hansen, David
2012-01-01
Many industrial production work systems have increased in complexity, and their new business model scompete on innovation, rather than low cost.At a medical device production facility committed to Lean Production, a research project was carried out to use Appreciative Inquiry to better engage...... employee strengths in continuou simprovements of the work system. The research question was: “How can Lean problem solving and Appreciative Inquiry be combined for optimized work system innovation?” The research project was carried out as a co-creation process with close cooperation between researcher...
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2006-01-01
as a general approach to problem solving. We apply these Simonian ideas to organisational issues, specifically new organisational forms. Specifically, Simonian ideas allow us to develop a morphology of new organisational forms and to point to some design problems that characterise these forms.......Two of Herbert Simon's best-known papers are 'The Architecture of Complexity' and 'The Structure of Ill-Structured Problems.' We discuss the neglected links between these two papers, highlighting the role of decomposition in the context of problems on which constraints have been imposed...
1982-10-01
Artificial Intelig ~ence (Vol. III, edited by Paul R. Cohen and’ Edward A.. Feigenbaum)’, The chapter was written B’ Paul Cohen, with contributions... Artificial Intelligence (Vol. III, edited by Paul R. Cohen and EdWard A. Feigenbaum). The chapter was written by Paul R. Cohen, with contributions by Stephen...Wheevoats"EntermdI’ Planning and Problem ’Solving by Paul R. Cohen Chaptb-rXV-of Volumec III’of the Handbook of Artificial Intelligence edited by Paul R
Constitutive law of dense granular matter
International Nuclear Information System (INIS)
Hatano, Takahiro
2010-01-01
The frictional properties of dense granular matter under steady shear flow are investigated using numerical simulation. Shear flow tends to localize near the driving boundary unless the coefficient of restitution is close to zero and the driving velocity is small. The bulk friction coefficient is independent of shear rate in dense and slow flow, whereas it is an increasing function of shear rate in rapid flow. The coefficient of restitution affects the friction coefficient only in such rapid flow. Contrastingly, in dense and slow regime, the friction coefficient is independent of the coefficient of restitution and mainly determined by the elementary friction coefficient and the rotation of grains. It is found that the mismatch between the vorticity of flow and the angular frequency of grains plays a key role to the frictional properties of sheared granular matter.
International Nuclear Information System (INIS)
Mahmood, S.; Sadiq, Safeer; Haque, Q.
2013-01-01
Linear and nonlinear electrostatic waves in magnetized dense electron-ion plasmas are studied with nonrelativistic and ultra-relativistic degenerate and singly, doubly charged helium (He + , He ++ ) and hydrogen (H + ) ions, respectively. The dispersion relation of electrostatic waves in magnetized dense plasmas is obtained under both the energy limits of degenerate electrons. Using reductive perturbation method, the Zakharov-Kuznetsov equation for nonlinear propagation of electrostatic solitons in magnetized dense plasmas is derived for both nonrelativistic and ultra-relativistic degenerate electrons. It is found that variations in plasma density, magnetic field intensity, different mass, and charge number of ions play significant role in the formation of electrostatic solitons in magnetized dense plasmas. The numerical plots are also presented for illustration using the parameters of dense astrophysical plasma situations such as white dwarfs and neutron stars exist in the literature. The present investigation is important for understanding the electrostatic waves propagation in the outer periphery of compact stars which mostly consists of hydrogen and helium ions with degenerate electrons in dense magnetized plasmas
Nucleon structure and properties of dense matter
International Nuclear Information System (INIS)
Kutschera, M.; Pethick, C.J.; Illinois Univ., Urbana, IL
1988-01-01
We consider the properties of dense matter in a framework of the Skyrme soliton model and the chiral bag model. The influence of the nucleon structure on the equation of state of dense matter is emphasized. We find that in both models the energy per unit volume is proportional to n 4/3 , n being the baryon number density. We discuss the properties of neutron stars with a derived equation of state. The role of many-body effects is investigated. The effect of including higher order terms in the chiral lagrangian is examined. The phase transition to quark matter is studied. 29 refs., 6 figs. (author)
Solving Differential Equations in R: Package deSolve
In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines appr...
Solving Differential Equations in R: Package deSolve
Soetaert, K.E.R.; Petzoldt, T.; Setzer, R.W.
2010-01-01
In this paper we present the R package deSolve to solve initial value problems (IVP) written as ordinary differential equations (ODE), differential algebraic equations (DAE) of index 0 or 1 and partial differential equations (PDE), the latter solved using the method of lines approach. The
Numerical solution of large sparse linear systems
International Nuclear Information System (INIS)
Meurant, Gerard; Golub, Gene.
1982-02-01
This note is based on one of the lectures given at the 1980 CEA-EDF-INRIA Numerical Analysis Summer School whose aim is the study of large sparse linear systems. The main topics are solving least squares problems by orthogonal transformation, fast Poisson solvers and solution of sparse linear system by iterative methods with a special emphasis on preconditioned conjuguate gradient method [fr
Simplified Linear Equation Solvers users manual
Energy Technology Data Exchange (ETDEWEB)
Gropp, W. [Argonne National Lab., IL (United States); Smith, B. [California Univ., Los Angeles, CA (United States)
1993-02-01
The solution of large sparse systems of linear equations is at the heart of many algorithms in scientific computing. The SLES package is a set of easy-to-use yet powerful and extensible routines for solving large sparse linear systems. The design of the package allows new techniques to be used in existing applications without any source code changes in the applications.
Energy Technology Data Exchange (ETDEWEB)
Gillman, Eric D., E-mail: eric.gillman.ctr@nrl.navy.mil [National Research Council Postdoctoral Associate at the U.S. Naval Research Laboratory, Washington, DC 20375 (United States); Amatucci, W. E. [U.S. Naval Research Laboratory, Washington, DC 20375 (United States)
2014-06-15
These experiments utilize a linear hollow cathode to create a dense, rectangular plasma sheet to simulate the plasma layer surrounding vehicles traveling at hypersonic velocities within the Earth's atmosphere. Injection of fine dielectric microparticles significantly reduces the electron density and therefore lowers the electron plasma frequency by binding a significant portion of the bulk free electrons to the relatively massive microparticles. Measurements show that microwave transmission through this previously overly dense, impenetrable plasma layer increases with the injection of alumina microparticles approximately 60 μm in diameter. This method of electron depletion is a potential means of mitigating the radio communications blackout experienced by hypersonic vehicles.
Reduction of Linear Programming to Linear Approximation
Vaserstein, Leonid N.
2006-01-01
It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.
Dense high temperature ceramic oxide superconductors
Landingham, Richard L.
1993-01-01
Dense superconducting ceramic oxide articles of manufacture and methods for producing these articles are described. Generally these articles are produced by first processing these superconducting oxides by ceramic processing techniques to optimize materials properties, followed by reestablishing the superconducting state in a desired portion of the ceramic oxide composite.
Dense high-temperature plasma transport processes
International Nuclear Information System (INIS)
Giniyatova, Sh.G.
2002-01-01
In this work the transport processes in dense high-temperature semiclassical plasma are studied on the base of the kinetic equation, where the semiclassical potential was used, in its collision integral. The coefficient of plasma electrical conductivity, viscosity and thermal conductivity were received. There were compared with the other authors' results. The Grad's method was used obtaining of viscosity and thermal coefficients. (author)
The electronic pressure in dense plasmas
International Nuclear Information System (INIS)
Pozwolski, A.E.
1982-01-01
A thermodynamic calculation of the electronic pressure in a dense plasma is given. Approximations involved by the use of the Debye length are avoided, so the above theory remains valid even if the Debye length is smaller than the interionic distance. (author)
APT: Action localization Proposals from dense Trajectories
van Gemert, J.C.; Jain, M.; Gati, E.; Snoek, C.G.M.; Xie, X.; Jones, M.W.; Tam, G.K.L.
2015-01-01
This paper is on action localization in video with the aid of spatio-temporal proposals. To alleviate the computational expensive video segmentation step of existing proposals, we propose bypassing the segmentations completely by generating proposals directly from the dense trajectories used to
Dense Alternating Sign Matrices and Extensions
Czech Academy of Sciences Publication Activity Database
Fiedler, Miroslav; Hall, F.J.; Stroev, M.
2014-01-01
Roč. 444, 1 March (2014), s. 219-226 ISSN 0024-3795 Institutional support: RVO:67985807 Keywords : alternating sign matrix * dense matrix * totally unimodular matrix * combined matrix * generalized complementary basic matrix Subject RIV: BA - General Mathematics Impact factor: 0.939, year: 2014
Coalescence preference in dense packing of bubbles
Kim, Yeseul; Gim, Bopil; Gim, Bopil; Weon, Byung Mook
2015-11-01
Coalescence preference is the tendency that a merged bubble from the contact of two original bubbles (parent) tends to be near to the bigger parent. Here, we show that the coalescence preference can be blocked by densely packing of neighbor bubbles. We use high-speed high-resolution X-ray microscopy to clearly visualize individual coalescence phenomenon which occurs in micro scale seconds and inside dense packing of microbubbles with a local packing fraction of ~40%. Previous theory and experimental evidence predict a power of -5 between the relative coalescence position and the parent size. However, our new observation for coalescence preference in densely packed microbubbles shows a different power of -2. We believe that this result may be important to understand coalescence dynamics in dense packing of soft matter. This work (NRF-2013R1A22A04008115) was supported by Mid-career Researcher Program through NRF grant funded by the MEST and also was supported by Ministry of Science, ICT and Future Planning (2009-0082580) and by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry and Education, Science and Technology (NRF-2012R1A6A3A04039257).
Probing dense matter with strange hadrons
Rafelski, Johann; Rafelski, Johann; Letessier, Jean
2002-01-01
Analysis of hadron production experimental data allows to understand the properties of the dense matter fireball produced in relativistic heavy ion collisions. We interpret the analysis results and argue that color deconfined state has been formed at highest CERN-SPS energies and at BNL-RHIC.
Solved problems in electromagnetics
Salazar Bloise, Félix; Bayón Rojo, Ana; Gascón Latasa, Francisco
2017-01-01
This book presents the fundamental concepts of electromagnetism through problems with a brief theoretical introduction at the beginning of each chapter. The present book has a strong didactic character. It explains all the mathematical steps and the theoretical concepts connected with the development of the problem. It guides the reader to understand the employed procedures to learn to solve the exercises independently. The exercises are structured in a similar way: The chapters begin with easy problems increasing progressively in the level of difficulty. This book is written for students of physics and engineering in the framework of the new European Plans of Study for Bachelor and Master and also for tutors and lecturers. .
Solved problems in electrochemistry
International Nuclear Information System (INIS)
Piron, D.L.
2004-01-01
This book presents calculated solutions to problems in fundamental and applied electrochemistry. It uses industrial data to illustrate scientific concepts and scientific knowledge to solve practical problems. It is subdivided into three parts. The first uses modern basic concepts, the second studies the scientific basis for electrode and electrolyte thermodynamics (including E-pH diagrams and the minimum energy involved in transformations) and the kinetics of rate processes (including the energy lost in heat and in parasite reactions). The third part treats larger problems in electrolysis and power generation, as well as in corrosion and its prevention. Each chapter includes three sections: the presentation of useful principles; some twenty problems with their solutions; and, a set of unsolved problems
Statistical mechanics of dense plasmas: numerical simulation and theory
International Nuclear Information System (INIS)
DeWitt, H.E.
1977-10-01
Recent Monte Carlo calculations from Paris and from Livermore for dense one and two component plasmas have led to systematic and accurate results for the thermodynamic properties of dense Coulombic fluids. This talk will summarize the results of these numerical experiments, and the simple analytic expressions for the equation of state and other thermodynamic functions that have been obtained. The thermal energy for the one component plasma has a simple power law dependence on temperature that is identical to Monte Carlo results on strongly coupled fluids governed by l/r/sup n/ potentials. A universal model for fluids governed by simple repulsive forces is suggested. For two component plasmas the ion-sphere model is shown to accurately reproduce the Monte Carlo data for the static portion of the energy. Electron screening is included using the Lindhard dielectric function and linear response theory. Free energy expressions have been constructed for one and two component plasmas that allow easy computation of all thermodynamic functions
Polarized electron sources for linear colliders
International Nuclear Information System (INIS)
Clendenin, J.E.; Ecklund, S.D.; Miller, R.H.; Schultz, D.C.; Sheppard, J.C.
1992-07-01
Linear colliders require high peak current beams with low duty factors. Several methods to produce polarized e - beams for accelerators have been developed. The SLC, the first linear collider, utilizes a photocathode gun with a GaAs cathode. Although photocathode sources are probably the only practical alternative for the next generation of linear colliders, several problems remain to be solved, including high voltage breakdown which poisons the cathode, charge limitations that are associated with the condition of the semiconductor cathode, and a relatively low polarization of ≤5O%. Methods to solve or at least greatly reduce the impact of each of these problems are at hand
Skin-effect in a dense ionizing plasma
International Nuclear Information System (INIS)
Ivanenkov, G.V.; Taranenko, S.B.
1989-01-01
Effect of multiple ionization and radiation (bremmstrahlung and photorecombination) on skin effect in a dense plasma is investigated. Limiting cases are considered: 1) fast skin-effect, when plasma movement and any types of losses (radiation, electron thermal conductivity) have no time to manifest themselves during short heating times; 2) deceleration of skinning under effect of radiation achieving equilibrium with Joule heating. Self-simulating solutions of the problem for half-space are investigated. The results are applied to analysing experiments with exploding wires. It is shown that under conditions, typical of heavy-current decelerators tubular structures are produced as a result of heat and current skinning under free dispersion of plasma produced during the explosion. Their dimensions are of the order of dozens of microns, and the temperature exceeds 50 eV. The linear power and complete ''tube'' radiation yield at this stage are able to make a substantial contribution to the energy balance in the group
Solving ptychography with a convex relaxation
Horstmeyer, Roarke; Chen, Richard Y.; Ou, Xiaoze; Ames, Brendan; Tropp, Joel A.; Yang, Changhuei
2015-05-01
Ptychography is a powerful computational imaging technique that transforms a collection of low-resolution images into a high-resolution sample reconstruction. Unfortunately, algorithms that currently solve this reconstruction problem lack stability, robustness, and theoretical guarantees. Recently, convex optimization algorithms have improved the accuracy and reliability of several related reconstruction efforts. This paper proposes a convex formulation of the ptychography problem. This formulation has no local minima, it can be solved using a wide range of algorithms, it can incorporate appropriate noise models, and it can include multiple a priori constraints. The paper considers a specific algorithm, based on low-rank factorization, whose runtime and memory usage are near-linear in the size of the output image. Experiments demonstrate that this approach offers a 25% lower background variance on average than alternating projections, the ptychographic reconstruction algorithm that is currently in widespread use.
Directory of Open Access Journals (Sweden)
Tanwiwat Jaikuna
2017-02-01
Full Text Available Purpose: To develop an in-house software program that is able to calculate and generate the biological dose distribution and biological dose volume histogram by physical dose conversion using the linear-quadratic-linear (LQL model. Material and methods : The Isobio software was developed using MATLAB version 2014b to calculate and generate the biological dose distribution and biological dose volume histograms. The physical dose from each voxel in treatment planning was extracted through Computational Environment for Radiotherapy Research (CERR, and the accuracy was verified by the differentiation between the dose volume histogram from CERR and the treatment planning system. An equivalent dose in 2 Gy fraction (EQD2 was calculated using biological effective dose (BED based on the LQL model. The software calculation and the manual calculation were compared for EQD2 verification with pair t-test statistical analysis using IBM SPSS Statistics version 22 (64-bit. Results: Two and three-dimensional biological dose distribution and biological dose volume histogram were displayed correctly by the Isobio software. Different physical doses were found between CERR and treatment planning system (TPS in Oncentra, with 3.33% in high-risk clinical target volume (HR-CTV determined by D90%, 0.56% in the bladder, 1.74% in the rectum when determined by D2cc, and less than 1% in Pinnacle. The difference in the EQD2 between the software calculation and the manual calculation was not significantly different with 0.00% at p-values 0.820, 0.095, and 0.593 for external beam radiation therapy (EBRT and 0.240, 0.320, and 0.849 for brachytherapy (BT in HR-CTV, bladder, and rectum, respectively. Conclusions : The Isobio software is a feasible tool to generate the biological dose distribution and biological dose volume histogram for treatment plan evaluation in both EBRT and BT.
WARM EXTENDED DENSE GAS AT THE HEART OF A COLD COLLAPSING DENSE CORE
International Nuclear Information System (INIS)
Shinnaga, Hiroko; Phillips, Thomas G.; Furuya, Ray S.; Kitamura, Yoshimi
2009-01-01
In order to investigate when and how the birth of a protostellar core occurs, we made survey observations of four well-studied dense cores in the Taurus molecular cloud using CO transitions in submillimeter bands. We report here the detection of unexpectedly warm (∼30-70 K), extended (radius of ∼2400 AU), dense (a few times 10 5 cm -3 ) gas at the heart of one of the dense cores, L1521F (MC27), within the cold dynamically collapsing components. We argue that the detected warm, extended, dense gas may originate from shock regions caused by collisions between the dynamically collapsing components and outflowing/rotating components within the dense core. We propose a new stage of star formation, 'warm-in-cold core stage (WICCS)', i.e., the cold collapsing envelope encases the warm extended dense gas at the center due to the formation of a protostellar core. WICCS would constitute a missing link in evolution between a cold quiescent starless core and a young protostar in class 0 stage that has a large-scale bipolar outflow.
Stopping test of iterative methods for solving PDE
International Nuclear Information System (INIS)
Wang Bangrong
1991-01-01
In order to assure the accuracy of the numerical solution of the iterative method for solving PDE (partial differential equation), the stopping test is very important. If the coefficient matrix of the system of linear algebraic equations is strictly diagonal dominant or irreducible weakly diagonal dominant, the stopping test formulas of the iterative method for solving PDE is proposed. Several numerical examples are given to illustrate the applications of the stopping test formulas
Variational iteration method for solving coupled-KdV equations
International Nuclear Information System (INIS)
Assas, Laila M.B.
2008-01-01
In this paper, the He's variational iteration method is applied to solve the non-linear coupled-KdV equations. This method is based on the use of Lagrange multipliers for identification of optimal value of a parameter in a functional. This technique provides a sequence of functions which converge to the exact solution of the coupled-KdV equations. This procedure is a powerful tool for solving coupled-KdV equations
A Photon Free Method to Solve Radiation Transport Equations
International Nuclear Information System (INIS)
Chang, B
2006-01-01
The multi-group discrete-ordinate equations of radiation transfer is solved for the first time by Newton's method. It is a photon free method because the photon variables are eliminated from the radiation equations to yield a N group XN direction smaller but equivalent system of equations. The smaller set of equations can be solved more efficiently than the original set of equations. Newton's method is more stable than the Semi-implicit Linear method currently used by conventional radiation codes
A "feasible direction" search for Lineal Programming problem solving
Directory of Open Access Journals (Sweden)
Jaime U Malpica Angarita
2003-07-01
Full Text Available The study presents an approach to solve linear programming problems with no artificial variables. A primal linear minimization problem is standard form and its associated dual linear maximization problem are used. Initially, the dual (or a partial dual program is solved by a "feasible direction" search, where the Karush-Kuhn-Tucker conditions help to verify its optimality and then its feasibility. The "feasible direction" search exploits the characteristics of the convex polyhedron (or prototype formed by the dual program constraints to find a starting point and then follows line segments, whose directions are found in afine subspaces defined by boundary hyperplanes of polyhedral faces, to find next points up to the (an optimal one. Them, the remaining dual constraints not satisfaced at that optimal dual point, if there are any, are handled as nonbasic variables of the primal program, which is to be solved by such "feasible direction" search.
Redesigning Triangular Dense Matrix Computations on GPUs
Charara, Ali; Ltaief, Hatem; Keyes, David E.
2016-01-01
A new implementation of the triangular matrix-matrix multiplication (TRMM) and the triangular solve (TRSM) kernels are described on GPU hardware accelerators. Although part of the Level 3 BLAS family, these highly computationally intensive kernels
Dense Output for Strong Stability Preserving Runge–Kutta Methods
Ketcheson, David I.
2016-12-10
We investigate dense output formulae (also known as continuous extensions) for strong stability preserving (SSP) Runge–Kutta methods. We require that the dense output formula also possess the SSP property, ideally under the same step-size restriction as the method itself. A general recipe for first-order SSP dense output formulae for SSP methods is given, and second-order dense output formulae for several optimal SSP methods are developed. It is shown that SSP dense output formulae of order three and higher do not exist, and that in any method possessing a second-order SSP dense output, the coefficient matrix A has a zero row.
Dense plasma focus - a literature review
International Nuclear Information System (INIS)
Tendys, J.
1976-01-01
The dense plasma focus (DPF) is a convenient source of short, intense neutron pulses, and dense, high temperature plasma. This review of the literature on the DPF indicates that its operation is still not understood, and attempts to show where the present data is either inadequate or inconsistent. Because the plasma conditions and neutron and x-ray fluxes vary from shot to shot, it is maintained that, to resolve inconsistencies in the present data, spectra need to be measured with energy and time resolution simultaneously, and cannot be built up from a large number of shots. Time resolutions of the order of 1 nsec for pulse lengths of about 100 nsec make these requirements especially difficult. Some theoretical models are presented for the neutron output and its spectrum, but no self-consistent description of the plasma in the focus region is likely for some time. (author)
Highly Dense Isolated Metal Atom Catalytic Sites
DEFF Research Database (Denmark)
Chen, Yaxin; Kasama, Takeshi; Huang, Zhiwei
2015-01-01
-ray diffraction. A combination of electron microscopy images with X-ray absorption spectra demonstrated that the silver atoms were anchored on five-fold oxygen-terminated cavities on the surface of the support to form highly dense isolated metal active sites, leading to excellent reactivity in catalytic oxidation......Atomically dispersed noble-metal catalysts with highly dense active sites are promising materials with which to maximise metal efficiency and to enhance catalytic performance; however, their fabrication remains challenging because metal atoms are prone to sintering, especially at a high metal...... loading. A dynamic process of formation of isolated metal atom catalytic sites on the surface of the support, which was achieved starting from silver nanoparticles by using a thermal surface-mediated diffusion method, was observed directly by using in situ electron microscopy and in situ synchrotron X...
Deterministic dense coding with partially entangled states
Mozes, Shay; Oppenheim, Jonathan; Reznik, Benni
2005-01-01
The utilization of a d -level partially entangled state, shared by two parties wishing to communicate classical information without errors over a noiseless quantum channel, is discussed. We analytically construct deterministic dense coding schemes for certain classes of nonmaximally entangled states, and numerically obtain schemes in the general case. We study the dependency of the maximal alphabet size of such schemes on the partially entangled state shared by the two parties. Surprisingly, for d>2 it is possible to have deterministic dense coding with less than one ebit. In this case the number of alphabet letters that can be communicated by a single particle is between d and 2d . In general, we numerically find that the maximal alphabet size is any integer in the range [d,d2] with the possible exception of d2-1 . We also find that states with less entanglement can have a greater deterministic communication capacity than other more entangled states.
PHOTOCHEMICAL HEATING OF DENSE MOLECULAR GAS
Energy Technology Data Exchange (ETDEWEB)
Glassgold, A. E. [Astronomy Department, University of California, Berkeley, CA 94720 (United States); Najita, J. R. [National Optical Astronomy Observatory, 950 North Cherry Avenue, Tucson, AZ 85719 (United States)
2015-09-10
Photochemical heating is analyzed with an emphasis on the heating generated by chemical reactions initiated by the products of photodissociation and photoionization. The immediate products are slowed down by collisions with the ambient gas and then heat the gas. In addition to this direct process, heating is also produced by the subsequent chemical reactions initiated by these products. Some of this chemical heating comes from the kinetic energy of the reaction products and the rest from collisional de-excitation of the product atoms and molecules. In considering dense gas dominated by molecular hydrogen, we find that the chemical heating is sometimes as large, if not much larger than, the direct heating. In very dense gas, the total photochemical heating approaches 10 eV per photodissociation (or photoionization), competitive with other ways of heating molecular gas.
Dense-plasma research using ballistic compressors
International Nuclear Information System (INIS)
Hess, H.
1986-01-01
An introduction is given to research on dense (or nonideal) plasmas which can be generated to advantage by ballistic compressors. Some properties of ballistic compressors are discussed especially in comparison with shock tubes. A short review is given on the history of these devices for high-pressure plasma generation. The present state of the art is reported including research on the two ZIE (Central Institute for Electron Physics) ballistic compressors. (author)
Studying dense plasmas with coherent XUV pulses
International Nuclear Information System (INIS)
Stabile, H.
2006-12-01
The investigation of dense plasma dynamic requires the development of diagnostics able to ensure the measurement of electronic density with micro-metric space resolution and sub-nanosecond, or even subpicosecond, time resolution (indeed this must be at least comparable with the characteristic tune scale of plasma evolution). In contrast with low-density plasmas, dense plasmas cannot be studied using optical probes in the visible domain, the density range accessible being limited to the critical density (N c equals 1.1*10 21 λ -2 (μm) ∼ 10 21 cm -3 for infrared). In addition, light is reflected even at smaller densities if the medium exhibits sharp density gradients. Hence probing of dense plasmas, for instance those produced by laser irradiation of solids, requires using shorter wavelength radiation. Thanks to their physical properties, high order harmonics generated in rare gases are particularly adapted to the study of dense plasmas. Indeed, they can naturally be synchronized with the generating laser and their pulse duration is very short, which makes it possible to use them in pump-probe experiments. Moreover, they exhibit good spatial and temporal coherencies. Two types of diagnostics were developed during this thesis. The first one was used to study the instantaneous creation of hot-solid-density plasma generated by focusing a femtosecond high-contrast laser on an ultra-thin foil (100 nm) in the 10 18 W/cm 2 intensity regime. The use of high order harmonics, providing a probe beam of sufficiently short wavelengths to penetrate such a medium, enables the study of its dynamics on the 100 fs time scale. The second one uses the harmonics beam as probe beam (λ equals 32 nm) within an interferometric device. This diagnostic was designed to ensure a micro-metric spatial resolution and a temporal resolution in the femtosecond range. The first results in presence of plasma created by irradiation of an aluminum target underline the potentialities of this new
Particle identification system based on dense aerogel
Energy Technology Data Exchange (ETDEWEB)
Barnyakov, A.Yu. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Barnyakov, M.Yu. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Novosibirsk State Technical University, 20, Karl Marx prospect, Novosibirsk, 630092 (Russian Federation); Beloborodov, K.I., E-mail: K.I.Beloborodov@inp.nsk.su [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Novosibirsk State University, 2, Pirogova Street, Novosibirsk 630090 (Russian Federation); Bobrovnikov, V.S.; Buzykaev, A.R. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Danilyuk, A.F. [Boreskov Institute of Catalysis, 5, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Golubev, V.B. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Novosibirsk State University, 2, Pirogova Street, Novosibirsk 630090 (Russian Federation); Gulevich, V.V. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Kononov, S.A.; Kravchenko, E.A. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Novosibirsk State University, 2, Pirogova Street, Novosibirsk 630090 (Russian Federation); Onuchin, A.P.; Martin, K.A. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Novosibirsk State Technical University, 20, Karl Marx prospect, Novosibirsk, 630092 (Russian Federation); Serednyakov, S.I. [Budker Institute of Nuclear Physics, 11, akademika Lavrentieva prospect, Novosibirsk 630090 (Russian Federation); Novosibirsk State University, 2, Pirogova Street, Novosibirsk 630090 (Russian Federation); and others
2013-12-21
A threshold Cherenkov counter based on dense aerogel with refraction index n=1.13 is described. This counter is used for kaon identification at momenta below 1 GeV/c in the SND detector, which takes data at the VEPP-2000 e{sup +}e{sup −} collider. The results of measurements of the counter efficiency using electrons, muons, pions, and kaons produced in e{sup +}e{sup −} annihilation are presented.
Leeuwpan fine coal dense medium plant
CSIR Research Space (South Africa)
Lundt, M
2010-11-01
Full Text Available Beneficiation 2010, 4–6 May 2010. 671The Journal of The Southern African Institute of Mining and Metallurgy VOLUME 110 NOVEMBER 2010 L Leeuwpan fine coal dense medium plant mixed with magnetite in the launder and enters... with production. Plant equipment operational changes Cyclone spigot changes In an attempt to lower the cut-point density, the spigot on the L 672 NOVEMBER 2010 VOLUME 110 The Journal of The Southern African Institute of Mining and Metallurgy Figure 1...
Formation and fragmentation of protostellar dense cores
International Nuclear Information System (INIS)
Maury, Anaelle
2009-01-01
Stars form in molecular clouds, when they collapse and fragment to produce protostellar dense cores. These dense cores are then likely to contract under their own gravity, and form young protostars, that further evolve while accreting their circumstellar mass, until they reach the main sequence. The main goal of this thesis was to study the formation and fragmentation of protostellar dense cores. To do so, two main studies, described in this manuscript, were carried out. First, we studied the formation of protostellar cores by quantifying the impact of protostellar outflows on clustered star formation. We carried out a study of the protostellar outflows powered by the young stellar objects currently formed in the NGc 2264-C proto-cluster, and we show that protostellar outflows seem to play a crucial role as turbulence progenitors in clustered star forming regions, although they seem unlikely to significantly modify the global infall processes at work on clump scales. Second, we investigated the formation of multiple systems by core fragmentation, by using high - resolution observations that allow to probe the multiplicity of young protostars on small scales. Our results suggest that the multiplicity rate of protostars on small scales increase while they evolve, and thus favor dynamical scenarios for the formation of multiple systems. Moreover, our results favor magnetized scenarios of core collapse to explain the small-scale properties of protostars at the earliest stages. (author) [fr
Hybrid-Based Dense Stereo Matching
Chuang, T. Y.; Ting, H. W.; Jaw, J. J.
2016-06-01
Stereo matching generating accurate and dense disparity maps is an indispensable technique for 3D exploitation of imagery in the fields of Computer vision and Photogrammetry. Although numerous solutions and advances have been proposed in the literature, occlusions, disparity discontinuities, sparse texture, image distortion, and illumination changes still lead to problematic issues and await better treatment. In this paper, a hybrid-based method based on semi-global matching is presented to tackle the challenges on dense stereo matching. To ease the sensitiveness of SGM cost aggregation towards penalty parameters, a formal way to provide proper penalty estimates is proposed. To this end, the study manipulates a shape-adaptive cross-based matching with an edge constraint to generate an initial disparity map for penalty estimation. Image edges, indicating the potential locations of occlusions as well as disparity discontinuities, are approved by the edge drawing algorithm to ensure the local support regions not to cover significant disparity changes. Besides, an additional penalty parameter 𝑃𝑒 is imposed onto the energy function of SGM cost aggregation to specifically handle edge pixels. Furthermore, the final disparities of edge pixels are found by weighting both values derived from the SGM cost aggregation and the U-SURF matching, providing more reliable estimates at disparity discontinuity areas. Evaluations on Middlebury stereo benchmarks demonstrate satisfactory performance and reveal the potency of the hybrid-based dense stereo matching method.
International Nuclear Information System (INIS)
Ma, L.X.; Tan, J.Y.; Zhao, J.M.; Wang, F.Q.; Wang, C.A.
2017-01-01
The radiative transfer equation (RTE) has been widely used to deal with multiple scattering of light by sparsely and randomly distributed discrete particles. However, for densely packed particles, the RTE becomes questionable due to strong dependent scattering effects. This paper examines the accuracy of RTE by comparing with the exact electromagnetic theory. For an imaginary spherical volume filled with randomly distributed, densely packed spheres, the RTE is solved by the Monte Carlo method combined with the Percus–Yevick hard model to consider the dependent scattering effect, while the electromagnetic calculation is based on the multi-sphere superposition T-matrix method. The Mueller matrix elements of the system with different size parameters and volume fractions of spheres are obtained using both methods. The results verify that the RTE fails to deal with the systems with a high-volume fraction due to the dependent scattering effects. Apart from the effects of forward interference scattering and coherent backscattering, the Percus–Yevick hard sphere model shows good accuracy in accounting for the far-field interference effects for medium or smaller size parameters (up to 6.964 in this study). For densely packed discrete spheres with large size parameters (equals 13.928 in this study), the improvement of dependent scattering correction tends to deteriorate. The observations indicate that caution must be taken when using RTE in dealing with the radiative transfer in dense discrete random media even though the dependent scattering correction is applied. - Highlights: • The Muller matrix of randomly distributed, densely packed spheres are investigated. • The effects of multiple scattering and dependent scattering are analyzed. • The accuracy of radiative transfer theory for densely packed spheres is discussed. • Dependent scattering correction takes effect at medium size parameter or smaller. • Performance of dependent scattering correction
Clock Math — a System for Solving SLEs Exactly
Directory of Open Access Journals (Sweden)
Jakub Hladík
2013-01-01
Full Text Available In this paper, we present a GPU-accelerated hybrid system that solves ill-conditioned systems of linear equations exactly. Exactly means without rounding errors due to using integer arithmetics. First, we scale floating-point numbers up to integers, then we solve dozens of SLEs within different modular arithmetics and then we assemble sub-solutions back using the Chinese remainder theorem. This approach effectively bypasses current CPU floating-point limitations. The system is capable of solving Hilbert’s matrix without losing a single bit of precision, and with a significant speedup compared to existing CPU solvers.
Solving PDEs in Python the FEniCS tutorial I
Langtangen, Hans Petter
2016-01-01
This book offers a concise and gentle introduction to finite element programming in Python based on the popular FEniCS software library. Using a series of examples, including the Poisson equation, the equations of linear elasticity, the incompressible Navier–Stokes equations, and systems of nonlinear advection–diffusion–reaction equations, it guides readers through the essential steps to quickly solving a PDE in FEniCS, such as how to define a finite variational problem, how to set boundary conditions, how to solve linear and nonlinear systems, and how to visualize solutions and structure finite element Python programs. This book is open access under a CC BY license.
Energy Technology Data Exchange (ETDEWEB)
Munehiro, H
1980-05-29
When driving the carriage of a printer through a rotating motor, there are problems regarding the limited accuracy of the carriage position due to rotation or contraction and ageing of the cable. In order to solve the problem, a direct drive system was proposed, in which the printer carriage is driven by a linear motor. If one wants to keep the motor circuit of such a motor compact, then the magnetic flux density in the air gap must be reduced or the motor travel must be reduced. It is the purpose of this invention to create an electrodynamic linear motor, which on the one hand is compact and light and on the other hand has a relatively high constant force over a large travel. The invention is characterised by the fact that magnetic fields of alternating polarity are generated at equal intervals in the magnetic field, and that the coil arrangement has 2 adjacent coils, whose size corresponds to half the length of each magnetic pole. A logic circuit is provided to select one of the two coils and to determine the direction of the current depending on the signals of a magnetic field sensor on the coil arrangement.
Dense Output for Strong Stability Preserving Runge–Kutta Methods
Ketcheson, David I.; Loczi, Lajos; Jangabylova, Aliya; Kusmanov, Adil
2016-01-01
We investigate dense output formulae (also known as continuous extensions) for strong stability preserving (SSP) Runge–Kutta methods. We require that the dense output formula also possess the SSP property, ideally under the same step
About chiral models of dense matter and its magnetic properties
International Nuclear Information System (INIS)
Kutschera, M.
1990-12-01
The chiral models of dense nucleon matter are discussed. The quark matter with broken chiral symmetry is described. The magnetic properties of dense matter are presented and conclusions are given. 37 refs. (A.S.)
Solving Kepler's equation using implicit functions
Mortari, Daniele; Elipe, Antonio
2014-01-01
A new approach to solve Kepler's equation based on the use of implicit functions is proposed here. First, new upper and lower bounds are derived for two ranges of mean anomaly. These upper and lower bounds initialize a two-step procedure involving the solution of two implicit functions. These two implicit functions, which are non-rational (polynomial) Bézier functions, can be linear or quadratic, depending on the derivatives of the initial bound values. These are new initial bounds that have been compared and proven more accurate than Serafin's bounds. The procedure reaches machine error accuracy with no more that one quadratic and one linear iterations, experienced in the "tough range", where the eccentricity is close to one and the mean anomaly to zero. The proposed method is particularly suitable for space-based applications with limited computational capability.
Mahmood, S.; Sadiq, Safeer; Haque, Q.; Ali, Munazza Z.
2016-06-01
The obliquely propagating arbitrary amplitude electrostatic wave is studied in a dense magnetized plasma having singly and doubly charged helium ions with nonrelativistic and ultrarelativistic degenerate electrons pressures. The Fermi temperature for ultrarelativistic degenerate electrons described by N. M. Vernet [(Cambridge University Press, Cambridge, 2007), p. 57] is used to define ion acoustic speed in ultra-dense plasmas. The pseudo-potential approach is used to solve the fully nonlinear set of dynamic equations for obliquely propagating electrostatic waves in a dense magnetized plasma containing helium ions. The upper and lower Mach number ranges for the existence of electrostatic solitons are found which depends on the obliqueness of the wave propagation with respect to applied magnetic field and charge number of the helium ions. It is found that only compressive (hump) soliton structures are formed in all the cases and only subsonic solitons are formed for a singly charged helium ions plasma case with nonrelativistic degenerate electrons. Both subsonic and supersonic soliton hump structures are formed for doubly charged helium ions with nonrelativistic degenerate electrons and ultrarelativistic degenerate electrons plasma case containing singly as well as doubly charged helium ions. The effect of propagation direction on the soliton amplitude and width of the electrostatic waves is also presented. The numerical plots are also shown for illustration using dense plasma parameters of a compact star (white dwarf) from literature.
Behavioral modeling of the dominant dynamics in input-output transfer of linear(ized) circuits
Beelen, T.G.J.; Maten, ter E.J.W.; Sihaloho, H.J.; Eijndhoven, van S.J.L.
2010-01-01
We present a powerful procedure for determining both the dominant dynamics of the inputoutput transfer and the corresponding most influential circuit parameters of a linear(ized) circuit. The procedure consists of several steps in which a specific (sub)problem is solved and its solution is used in
Normal mode analysis for linear resistive magnetohydrodynamics
International Nuclear Information System (INIS)
Kerner, W.; Lerbinger, K.; Gruber, R.; Tsunematsu, T.
1984-10-01
The compressible, resistive MHD equations are linearized around an equilibrium with cylindrical symmetry and solved numerically as a complex eigenvalue problem. This normal mode code allows to solve for very small resistivity eta proportional 10 -10 . The scaling of growthrates and layer width agrees very well with analytical theory. Especially, both the influence of current and pressure on the instabilities is studied in detail; the effect of resistivity on the ideally unstable internal kink is analyzed. (orig.)
ITMETH, Iterative Routines for Linear System
International Nuclear Information System (INIS)
Greenbaum, A.
1989-01-01
1 - Description of program or function: ITMETH is a collection of iterative routines for solving large, sparse linear systems. 2 - Method of solution: ITMETH solves general linear systems of the form AX=B using a variety of methods: Jacobi iteration; Gauss-Seidel iteration; incomplete LU decomposition or matrix splitting with iterative refinement; diagonal scaling, matrix splitting, or incomplete LU decomposition with the conjugate gradient method for the problem AA'Y=B, X=A'Y; bi-conjugate gradient method with diagonal scaling, matrix splitting, or incomplete LU decomposition; and ortho-min method with diagonal scaling, matrix splitting, or incomplete LU decomposition. ITMETH also solves symmetric positive definite linear systems AX=B using the conjugate gradient method with diagonal scaling or matrix splitting, or the incomplete Cholesky conjugate gradient method
Difficulties in Genetics Problem Solving.
Tolman, Richard R.
1982-01-01
Examined problem-solving strategies of 30 high school students as they solved genetics problems. Proposes a new sequence of teaching genetics based on results: meiosis, sex chromosomes, sex determination, sex-linked traits, monohybrid and dihybrid crosses (humans), codominance (humans), and Mendel's pea experiments. (JN)
Problem Solving, Scaffolding and Learning
Lin, Shih-Yin
2012-01-01
Helping students to construct robust understanding of physics concepts and develop good solving skills is a central goal in many physics classrooms. This thesis examine students' problem solving abilities from different perspectives and explores strategies to scaffold students' learning. In studies involving analogical problem solving…
Problem Solving on a Monorail.
Barrow, Lloyd H.; And Others
1994-01-01
This activity was created to address a lack of problem-solving activities for elementary children. A "monorail" activity from the Evening Science Program for K-3 Students and Parents program is presented to illustrate the problem-solving format. Designed for performance at stations by groups of two students. (LZ)
Solving complex fisheries management problems
DEFF Research Database (Denmark)
Petter Johnsen, Jahn; Eliasen, Søren Qvist
2011-01-01
A crucial issue for the new EU common fisheries policy is how to solve the discard problem. Through a study of the institutional set up and the arrangements for solving the discard problem in Denmark, the Faroe Islands, Iceland and Norway, the article identifies the discard problem as related...
Observations during static and cyclic undrained loading of dense Aalborg University sand no. 1
DEFF Research Database (Denmark)
Sabaliauskas, Tomas; Diaz, Alberto Troya; Ibsen, Lars Bo
. Soil strength and stiffness are found to change depending on the type of loading applied. Effective friction angle is found to be changing during various phases of loading. Linear Mohr Coulomb model could potentially be sufficient for modeling the full spectrum of dense sand behavior if extended...... with a changing friction angle following the examined patterns of response. A total stress path based material model is presented in this paper....
Bistable behaviour of biexciton population in a dense exciton-biexciton system in semiconductors
International Nuclear Information System (INIS)
Nguyen Ba An.
1986-05-01
The steady state bistable behaviour of biexciton population in a dense exciton-biexciton semiconductor is considered. The intrinsic optical feedback is provided by the recombination mechanism. The exciton-biexciton and biexciton-biexciton interactions play the role of non-linearity responsible for biexciton bistability to occur. The conditions leading to the effect of bistability are obtained and two-parameter phase transition diagrams are drawn for both intensity and frequency bistable phenomena. (author)
Linear programming foundations and extensions
Vanderbei, Robert J
2001-01-01
Linear Programming: Foundations and Extensions is an introduction to the field of optimization. The book emphasizes constrained optimization, beginning with a substantial treatment of linear programming, and proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. The book is carefully written. Specific examples and concrete algorithms precede more abstract topics. Topics are clearly developed with a large number of numerical examples worked out in detail. Moreover, Linear Programming: Foundations and Extensions underscores the purpose of optimization: to solve practical problems on a computer. Accordingly, the book is coordinated with free efficient C programs that implement the major algorithms studied: -The two-phase simplex method; -The primal-dual simplex method; -The path-following interior-point method; -The homogeneous self-dual methods. In addition, there are online JAVA applets that illustrate various pivot rules and variants of the simplex m...
Monte Carlo method for solving a parabolic problem
Directory of Open Access Journals (Sweden)
Tian Yi
2016-01-01
Full Text Available In this paper, we present a numerical method based on random sampling for a parabolic problem. This method combines use of the Crank-Nicolson method and Monte Carlo method. In the numerical algorithm, we first discretize governing equations by Crank-Nicolson method, and obtain a large sparse system of linear algebraic equations, then use Monte Carlo method to solve the linear algebraic equations. To illustrate the usefulness of this technique, we apply it to some test problems.
Temperature scaling in a dense vibrofluidized granular material.
Sunthar, P; Kumaran, V
1999-08-01
The leading order "temperature" of a dense two-dimensional granular material fluidized by external vibrations is determined. The grain interactions are characterized by inelastic collisions, but the coefficient of restitution is considered to be close to 1, so that the dissipation of energy during a collision is small compared to the average energy of a particle. An asymptotic solution is obtained where the particles are considered to be elastic in the leading approximation. The velocity distribution is a Maxwell-Boltzmann distribution in the leading approximation. The density profile is determined by solving the momentum balance equation in the vertical direction, where the relation between the pressure and density is provided by the virial equation of state. The temperature is determined by relating the source of energy due to the vibrating surface and the energy dissipation due to inelastic collisions. The predictions of the present analysis show good agreement with simulation results at higher densities where theories for a dilute vibrated granular material, with the pressure-density relation provided by the ideal gas law, are in error.
Implementing a New Dense Symmetric Eigensolver on Multicore Systems
Sukkari, Dalal E.
2013-07-01
We present original advanced architecture implementations of the QDWHeig algo- rithm for solving dense symmetric eigenproblems. The algorithm (Y. Nakatsukasa and N. J. Higham, 2012) performs a spectral divide-and-conquer, which recursively divides the matrix into smaller submatrices by finding an invariant subspace for a subset of the spectrum. The main contribution of this thesis is to enhance the per- formance of QDWHeig algorithm by relying on a high performance kernels from PLASMA [1] and LAPACK [2]. We demonstrate the quality of the eigenpairs that are computed with the QDWHeig algorithm for many matrix types with different eigenvalue clustering. We then implement QDWHeig using kernels from LAPACK and PLASMA, and compare its performance against other divide-and-conquer sym- metric eigensolvers. The main part of QDWHeig is finding a polar decomposition. We introduce mixed precision to enhance the performance in finding the polar decom- position. Our evaluation considers speed and accuracy of the computed eigenvalues. Some applications require finding only a subspectrum of the eigenvalues; therefore we modify the algorithm to find the eigenpairs in a given interval of interest. An ex- perimental study shows significant improvement on the performance of our algorithm using mixed precision and PLASMA routines.
A Seemingly Simple Task: Filling a Solenoid Volume in Vacuum with Dense Plasma
International Nuclear Information System (INIS)
Anders, Andre; Kauffeldt, Marina; Roy, Prabir; Oks, Efim
2010-01-01
Space-charge neutralization of a pulsed, high-current ion beam is required to compress and focus the beam on a target for warm dense matter physics or heavy ion fusion experiments. We described attempts to produce dense plasma in and near the final focusing solenoid through which the ion beam travels, thereby providing an opportunity for the beam to acquire the necessary charge-compensating electrons. Among the options are plasma injection from four pulsed vacuum arc sources located outside the solenoid, and using a high current (> 4 kA) pulsed vacuum arc plasma from a ring cathode near the edge of the solenoid. The plasma distribution is characterized by photographic means and by an array of movable Langmuir probes. The plasma is produced at several cathode spots distributed azimuthally on the ring cathode. Beam neutralization and compression are accomplished, though issues of density, uniformity, and pulse-to-pulse reproducibly remain to be solved.
Overlapping communities from dense disjoint and high total degree clusters
Zhang, Hongli; Gao, Yang; Zhang, Yue
2018-04-01
Community plays an important role in the field of sociology, biology and especially in domains of computer science, where systems are often represented as networks. And community detection is of great importance in the domains. A community is a dense subgraph of the whole graph with more links between its members than between its members to the outside nodes, and nodes in the same community probably share common properties or play similar roles in the graph. Communities overlap when nodes in a graph belong to multiple communities. A vast variety of overlapping community detection methods have been proposed in the literature, and the local expansion method is one of the most successful techniques dealing with large networks. The paper presents a density-based seeding method, in which dense disjoint local clusters are searched and selected as seeds. The proposed method selects a seed by the total degree and density of local clusters utilizing merely local structures of the network. Furthermore, this paper proposes a novel community refining phase via minimizing the conductance of each community, through which the quality of identified communities is largely improved in linear time. Experimental results in synthetic networks show that the proposed seeding method outperforms other seeding methods in the state of the art and the proposed refining method largely enhances the quality of the identified communities. Experimental results in real graphs with ground-truth communities show that the proposed approach outperforms other state of the art overlapping community detection algorithms, in particular, it is more than two orders of magnitude faster than the existing global algorithms with higher quality, and it obtains much more accurate community structure than the current local algorithms without any priori information.
Electron conductivity model for dense plasmas
International Nuclear Information System (INIS)
Lee, Y.T.; More, R.M.
1984-01-01
An electron conductivity model for dense plasmas is described which gives a consistent and complete set of transport coefficients including not only electrical conductivity and thermal conductivity, but also thermoelectric power, and Hall, Nernst, Ettinghausen, and Leduc--Righi coefficients. The model is useful for simulating plasma experiments with strong magnetic fields. The coefficients apply over a wide range of plasma temperature and density and are expressed in a computationally simple form. Different formulas are used for the electron relaxation time in plasma, liquid, and solid phases. Comparisons with recent calculations and available experimental measurement show the model gives results which are sufficiently accurate for many practical applications
Dense hydrogen plasma: Comparison between models
International Nuclear Information System (INIS)
Clerouin, J.G.; Bernard, S.
1997-01-01
Static and dynamical properties of the dense hydrogen plasma (ρ≥2.6gcm -3 , 0.1< T<5eV) in the strongly coupled regime are compared through different numerical approaches. It is shown that simplified density-functional molecular-dynamics simulations (DFMD), without orbitals, such as Thomas-Fermi Dirac or Thomas-Fermi-Dirac-Weiszaecker simulations give similar results to more sophisticated descriptions such as Car-Parrinello (CP), tight binding, or path-integral Monte Carlo, in a wide range of temperatures. At very low temperature, screening effects predicted by DFMD are still less pronounced than CP simulations. copyright 1997 The American Physical Society
Electrical and thermal conductivities in dense plasmas
Energy Technology Data Exchange (ETDEWEB)
Faussurier, G., E-mail: gerald.faussurier@cea.fr; Blancard, C.; Combis, P.; Videau, L. [CEA, DAM, DIF, F-91297 Arpajon (France)
2014-09-15
Expressions for the electrical and thermal conductivities in dense plasmas are derived combining the Chester-Thellung-Kubo-Greenwood approach and the Kramers approximation. The infrared divergence is removed assuming a Drude-like behaviour. An analytical expression is obtained for the Lorenz number that interpolates between the cold solid-state and the hot plasma phases. An expression for the electrical resistivity is proposed using the Ziman-Evans formula, from which the thermal conductivity can be deduced using the analytical expression for the Lorenz number. The present method can be used to estimate electrical and thermal conductivities of mixtures. Comparisons with experiment and quantum molecular dynamics simulations are done.
Dense ceramic membranes for methane conversion
Energy Technology Data Exchange (ETDEWEB)
Bouwmeester, Henny J.M. [Laboratory for Inorganic Materials Science, Department of Science and Technology and MESA Research Institute, University of Twente, 7500 AE Enschede (Netherlands)
2003-07-30
Dense ceramic membranes made from mixed oxygen-ionic and electronic conducting perovskite-related oxides allow separation of oxygen from an air supply at elevated temperatures (>700C). By combining air separation and catalytic partial oxidation of methane to syngas into a ceramic membrane reactor, this technology is expected to significantly reduce the capital costs of conversion of natural gas to liquid added-value products. The present survey is mainly concerned with the material properties that govern the performance of the mixed-conducting membranes in real operating conditions and highlights significant developments in the field.
The Magpie dense z-pinch project
International Nuclear Information System (INIS)
Chittenden, J.; Choi, P.; Mitchell, I.; Dangor, A.E.; Haines, M.G.
1990-01-01
The authors present a design study on the Mega Ampere Generator for Plasma Implosion Experiments (MAGPIE), a project currently under construction at Imperial College London, to study radiative collapse of a dense Z-pinch plasma created from a 20 um diameter cryogenic hydrogen fiber. The 2 TW generator is composed of four individual 2.4 MV Marx banks of the HERMES III type design with a maximum stored energy of 336 kJ. They drive four 5 ohm Pulse Forming Lines which are combined into a single 1.25 MA in 150 ns to a 150 nH load
Strange mesons in dense nuclear matter
International Nuclear Information System (INIS)
Senger, P.
2000-10-01
Experimental data on the production of kaons and antikaons in heavy ion collisions at relativistic energies are reviewed with respect to in-medium effects. The K - /K + ratios measured in nucleus-nucleus collisions are 1-2 orders of magnitude larger than in proton-proton collisions. The azimuthal angle distributions of K + mesons indicate a repulsive kaon-nucleon potential. Microscopic transport calculations consistently explain both the yields and the emission patterns of kaons and antikaons when assuming that their properties are modified in dense nuclear matter. The K + production excitation functions measured in light and heavy collision systems provide evidence for a soft nuclear equation-of-state. (orig.)
Atomic physics in dense plasmas. Recent advances
International Nuclear Information System (INIS)
Leboucher-Dalimier, E.; Angelo, P.; Ceccotti, T.; Derfoul, H.; Poquerusse, A.; Sauvan, P.; Oks, E.
2000-01-01
This paper presents observations and simulations of novel density-dependent spectroscopic features in hot and dense plasmas. Both time-integrated and time-resolved results using ultra-high resolutions spectrometers are presented; they are justified within the standard spectral line shape theory or the quasi-molecular alternative treatment. A particular attention is paid to the impact of the spatio-temporal evolution of the plasma on the experimental spectra. Satellite-like features and molecular lines in the cases of Flyβ, Heβ are discussed emphasizing their importance for the density diagnostics when ion-ion correlations are significant. (authors)
Structure of a new dense amorphous ice
International Nuclear Information System (INIS)
Finney, J.L.; Bowron, D.T.; Soper, A.K.; Loerting, T.; Mayer, E.; Hallbrucker, A.
2002-01-01
The detailed structure of a new dense amorphous ice, VHDA, is determined by isotope substitution neutron diffraction. Its structure is characterized by a doubled occupancy of the stabilizing interstitial location that was found in high density amorphous ice, HDA. As would be expected for a thermally activated unlocking of the stabilizing 'interstitial', the transition from VHDA to LDA (low-density amorphous ice) is very sharp. Although its higher density makes VHDA a better candidate than HDA for a physical manifestation of the second putative liquid phase of water, as for the HDA case, the VHDA to LDA transition also appears to be kinetically controlled
Fabrication of dense panels in lithium fluoride
International Nuclear Information System (INIS)
Farcy, P.; Roger, J.; Pointud, R.
1958-04-01
The authors report a study aimed at the fabrication of large and dense lithium fluoride panels. This sintered lithium fluoride is then supposed to be used for the construction of barriers of protection against a flow of thermal neutrons. They briefly present the raw material which is used under the form of chamotte obtained through a pre-sintering process which is also described. Grain size measurements and sample preparation are indicated. Shaping, drying, and thermal treatment are briefly described, and characteristics of the sintered product are indicated
Quasi-molecular processes in dense plasmas
International Nuclear Information System (INIS)
Younger, S.M.
1991-01-01
Quasi-molecular phenomena occur in dense plasmas when the interatomic spacing is comparable to the characteristic wavelength of the electrons. If the electronic states are bound, covalent orbitals arise with different excitation energies, radiative rates, and collisional rates than for isolated ions. For continuum electrons, charge localization near transient clusters of nuclei can influence many scattering and transport processes. We identify several novel consequences of quasi-molecular phenomena in plasmas and give a possible explanation of high energy features associated with helium-like emissions lines observed in recent inertial fusion experiments. 7 refs
Graph Quasicontinuous Functions and Densely Continuous Forms
Directory of Open Access Journals (Sweden)
Lubica Hola
2017-07-01
Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.
Finding low-conductance sets with dense interactions (FLCD) for better protein complex prediction.
Wang, Yijie; Qian, Xiaoning
2017-03-14
Intuitively, proteins in the same protein complexes should highly interact with each other but rarely interact with the other proteins in protein-protein interaction (PPI) networks. Surprisingly, many existing computational algorithms do not directly detect protein complexes based on both of these topological properties. Most of them, depending on mathematical definitions of either "modularity" or "conductance", have their own limitations: Modularity has the inherent resolution problem ignoring small protein complexes; and conductance characterizes the separability of complexes but fails to capture the interaction density within complexes. In this paper, we propose a two-step algorithm FLCD (Finding Low-Conductance sets with Dense interactions) to predict overlapping protein complexes with the desired topological structure, which is densely connected inside and well separated from the rest of the networks. First, FLCD detects well-separated subnetworks based on approximating a potential low-conductance set through a personalized PageRank vector from a protein and then solving a mixed integer programming (MIP) problem to find the minimum-conductance set within the identified low-conductance set. At the second step, the densely connected parts in those subnetworks are discovered as the protein complexes by solving another MIP problem that aims to find the dense subnetwork in the minimum-conductance set. Experiments on four large-scale yeast PPI networks from different public databases demonstrate that the complexes predicted by FLCD have better correspondence with the yeast protein complex gold standards than other three state-of-the-art algorithms (ClusterONE, LinkComm, and SR-MCL). Additionally, results of FLCD show higher biological relevance with respect to Gene Ontology (GO) terms by GO enrichment analysis.
Linear Algebra and Smarandache Linear Algebra
Vasantha, Kandasamy
2003-01-01
The present book, on Smarandache linear algebra, not only studies the Smarandache analogues of linear algebra and its applications, it also aims to bridge the need for new research topics pertaining to linear algebra, purely in the algebraic sense. We have introduced Smarandache semilinear algebra, Smarandache bilinear algebra and Smarandache anti-linear algebra and their fuzzy equivalents. Moreover, in this book, we have brought out the study of linear algebra and vector spaces over finite p...
Neutrino interactions in hot and dense matter
International Nuclear Information System (INIS)
Reddy, S.; Prakash, M.; Lattimer, J.M.
1998-01-01
We study the charged and neutral current weak interaction rates relevant for the determination of neutrino opacities in dense matter found in supernovae and neutron stars. We establish an efficient formalism for calculating differential cross sections and mean free paths for interacting, asymmetric nuclear matter at arbitrary degeneracy. The formalism is valid for both charged and neutral current reactions. Strong interaction corrections are incorporated through the in-medium single particle energies at the relevant density and temperature. The effects of strong interactions on the weak interaction rates are investigated using both potential and effective field-theoretical models of matter. We investigate the relative importance of charged and neutral currents for different astrophysical situations, and also examine the influence of strangeness-bearing hyperons. Our findings show that the mean free paths are significantly altered by the effects of strong interactions and the multi-component nature of dense matter. The opacities are then discussed in the context of the evolution of the core of a protoneutron star. copyright 1998 The American Physical Society
Predicting diffusivities in dense fluid mixtures
Directory of Open Access Journals (Sweden)
C. DARIVA
1999-09-01
Full Text Available In this work the Enskog solution of the Boltzmann equation, as corrected by Speedy, together with the Weeks-Chandler-Andersen (WCA perturbation theory of liquids is employed in correlating and predicting self-diffusivities of dense fluids. Afterwards this theory is used to estimate mutual diffusion coefficients of solutes at infinite dilution in sub and supercritical solvents. We have also investigated the behavior of Fick diffusion coefficients in the proximity of a binary vapor-liquid critical point since this subject is of great interest for extraction purposes. The approach presented here, which makes use of a density and temperature dependent hard-sphere diameter, is shown to be excellent for predicting diffusivities in dense pure fluids and fluid mixtures. The calculations involved highly nonideal mixtures as well as systems with high molecular asymmetry. The predicted diffusivities are in good agreement with the experimental data for the pure and binary systems. The methodology proposed here makes only use of pure component information and density of mixtures. The simple algebraic relations are proposed without any binary adjustable parameters and can be readily used for estimating diffusivities in multicomponent mixtures.
Cold dense baryonic matter and compact stars
International Nuclear Information System (INIS)
Hyun Kyu Lee; Sang-Jin Sin; Mannque Rho
2011-01-01
Probing dense hadronic matter is thus far an uncharted field of physics. Here we give a brief summary of the highlights of what has been so far accomplished and what will be done in the years ahead by the World Class University III Project at Hanyang University in the endeavor to unravel and elucidate the multi-facet of the cold dense baryonic matter existing in the interior of the densest visible stable object in the universe, i.e. neutron stars, strangeness stars and/or quark stars, from a modest and simplified starting point of an effective field theory modeled on the premise of QCD as well as from a gravity dual approach of hQCD. The core of the matter of our research is the possible origin of the ∼ 99% of the proton mass that is to be accounted for and how the 'vacuum' can be tweaked so that the source of the mass generation can be uncovered by measurements made in terrestrial as well as space laboratories. Some of the issues treated in the program concern what can be done - both theoretically and experimentally - in anticipation of what's to come for basic physics research in Korea. (authors)
Collective dynamics in dense Hg vapour
International Nuclear Information System (INIS)
Ishikawa, D; Inui, M; Matsuda, K; Tamura, K; Baron, A Q R; Tsutsui, S; Tanaka, Y; Ishikawa, T
2004-01-01
The dynamic structure factor, S(Q,ο), of dense Hg vapour has been measured by high resolution inelastic x-ray scattering for densities of 3.0, 2.1 and 1.0 g cm -3 corresponding to 0.52, 0.36 and 0.17 times the critical density, respectively, and for momentum transfers between 2.0 and 48 nm -1 . Analysis of the longitudinal current-current correlation function in the framework of generalized hydrodynamics reveals that the frequencies of the collective excitations increase faster with Q than estimated from the macroscopic speed of sound. The ratios of the frequencies were found to be 1.27 at 3.0 g cm -3 , 1.12 at 2.1 g cm -3 and 1.10 at 1.0 g cm -3 . The sound velocity obtained from the present experiments is well reproduced by a wavenumber dependent adiabatic sound velocity, which means that the collective modes remain in the spectra of dense Hg vapour. (letter to the editor)
Multiscale empirical interpolation for solving nonlinear PDEs
Calo, Victor M.
2014-12-01
In this paper, we propose a multiscale empirical interpolation method for solving nonlinear multiscale partial differential equations. The proposed method combines empirical interpolation techniques and local multiscale methods, such as the Generalized Multiscale Finite Element Method (GMsFEM). To solve nonlinear equations, the GMsFEM is used to represent the solution on a coarse grid with multiscale basis functions computed offline. Computing the GMsFEM solution involves calculating the system residuals and Jacobians on the fine grid. We use empirical interpolation concepts to evaluate these residuals and Jacobians of the multiscale system with a computational cost which is proportional to the size of the coarse-scale problem rather than the fully-resolved fine scale one. The empirical interpolation method uses basis functions which are built by sampling the nonlinear function we want to approximate a limited number of times. The coefficients needed for this approximation are computed in the offline stage by inverting an inexpensive linear system. The proposed multiscale empirical interpolation techniques: (1) divide computing the nonlinear function into coarse regions; (2) evaluate contributions of nonlinear functions in each coarse region taking advantage of a reduced-order representation of the solution; and (3) introduce multiscale proper-orthogonal-decomposition techniques to find appropriate interpolation vectors. We demonstrate the effectiveness of the proposed methods on several nonlinear multiscale PDEs that are solved with Newton\\'s methods and fully-implicit time marching schemes. Our numerical results show that the proposed methods provide a robust framework for solving nonlinear multiscale PDEs on a coarse grid with bounded error and significant computational cost reduction.
Solving or resolving inadequate and noisy tomographic systems
Nolet, G.
1985-01-01
Tomography in seismology often leads to underdetermined and inconsistent systems of linear equations. When solving, care must be taken to keep the propagation of data errors under control. In this paper I test the applicability of three types of damped least-squares algorithms to the kind of
A multiobjective approach for solving cooperative n-person games
Energy Technology Data Exchange (ETDEWEB)
Maali, Yashar [Department of Industrial Engineering, Payam-e-Noor University, Tehran (Iran)
2009-11-15
A linear programming model is introduced to solve cooperative games. The solution is always Pareto optimal. It is based on the idea of the core but instead of requiring rationality for all groups, a multiobjective approach is proposed including the importance weights of the players. A case study illustrates the application of this method. (author)
W-algebra for solving problems with fuzzy parameters
Shevlyakov, A. O.; Matveev, M. G.
2018-03-01
A method of solving the problems with fuzzy parameters by means of a special algebraic structure is proposed. The structure defines its operations through operations on real numbers, which simplifies its use. It avoids deficiencies limiting applicability of the other known structures. Examples for solution of a quadratic equation, a system of linear equations and a network planning problem are given.
A numerical method for solving singular De`s
Energy Technology Data Exchange (ETDEWEB)
Mahaver, W.T.
1996-12-31
A numerical method is developed for solving singular differential equations using steepest descent based on weighted Sobolev gradients. The method is demonstrated on a variety of first and second order problems, including linear constrained, unconstrained, and partially constrained first order problems, a nonlinear first order problem with irregular singularity, and two second order variational problems.
Non-Interior Continuation Method for Solving the Monotone Semidefinite Complementarity Problem
International Nuclear Information System (INIS)
Huang, Z.H.; Han, J.
2003-01-01
Recently, Chen and Tseng extended non-interior continuation smoothing methods for solving linear/ nonlinear complementarity problems to semidefinite complementarity problems (SDCP). In this paper we propose a non-interior continuation method for solving the monotone SDCP based on the smoothed Fischer-Burmeister function, which is shown to be globally linearly and locally quadratically convergent under suitable assumptions. Our algorithm needs at most to solve a linear system of equations at each iteration. In addition, in our analysis on global linear convergence of the algorithm, we need not use the assumption that the Frechet derivative of the function involved in the SDCP is Lipschitz continuous. For non-interior continuation/ smoothing methods for solving the nonlinear complementarity problem, such an assumption has been used widely in the literature in order to achieve global linear convergence results of the algorithms
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)
How to solve mathematical problems
Wickelgren, Wayne A
1995-01-01
Seven problem-solving techniques include inference, classification of action sequences, subgoals, contradiction, working backward, relations between problems, and mathematical representation. Also, problems from mathematics, science, and engineering with complete solutions.
Interactive Problem-Solving Interventions
African Journals Online (AJOL)
Frew Demeke Alemu
concerted efforts of unofficial actors to establish unofficial communication ... Frew Demeke Alemu (LLB, LLM in International Human Rights Law from Lund ..... 24 Tamra Pearson d'Estrée (2009), “Problem-Solving Approaches”, (in The SAGE ...
The analysis and design of linear circuits
Thomas, Roland E; Toussaint, Gregory J
2009-01-01
The Analysis and Design of Linear Circuits, 6e gives the reader the opportunity to not only analyze, but also design and evaluate linear circuits as early as possible. The text's abundance of problems, applications, pedagogical tools, and realistic examples helps engineers develop the skills needed to solve problems, design practical alternatives, and choose the best design from several competing solutions. Engineers searching for an accessible introduction to resistance circuits will benefit from this book that emphasizes the early development of engineering judgment.
High Productivity Programming of Dense Linear Algebra on Heterogeneous NUMA Architectures
Alomairy, Rabab M.
2013-01-01
compromising the overall performance. Our approach fea- tures separation of concerns by abstracting the complexity of the hardware from the end users so that high productivity can be achieved. The Cholesky factorization is used as a benchmark representative
Abdelfattah, Ahmad
2015-01-01
applications rely on crucial memory-bound kernels and may witness bottlenecks due to the overhead of the memory bus latency. They can still take advantage of the GPU compute power capabilities, provided that an efficient architecture-aware design is achieved
Energy Technology Data Exchange (ETDEWEB)
Chen, Ke [Univ. of Liverpool (United Kingdom)
1996-12-31
We study various preconditioning techniques for the iterative solution of boundary integral equations, and aim to provide a theory for a class of sparse preconditioners. Two related ideas are explored here: singularity separation and inverse approximation. Our preliminary conclusion is that singularity separation based preconditioners perform better than approximate inverse based while it is desirable to have both features.
Zhong, Xiaodong; Spottiswoode, Bruce S.; Meyer, Craig H.; Kramer, Christopher M.; Epstein, Frederick H.
2010-01-01
A navigator-gated 3D spiral cine displacement encoding with stimulated echoes (DENSE) pulse sequence for imaging 3D myocardial mechanics was developed. In addition, previously-described 2D post-processing algorithms including phase unwrapping, tissue tracking, and strain tensor calculation for the left ventricle (LV) were extended to 3D. These 3D methods were evaluated in 5 healthy volunteers, using 2D cine DENSE and historical 3D myocardial tagging as reference standards. With an average scan time of 20.5 ± 5.7 minutes, 3D data sets with a matrix size of 128 × 128 × 22, voxel size of 2.8 × 2.8 × 5.0 mm3, and temporal resolution of 32 ms were obtained with displacement encoding in three orthogonal directions. Mean values for end-systolic mid-ventricular mid-wall radial, circumferential, and longitudinal strain were 0.33 ± 0.10, −0.17 ± 0.02, and −0.16 ± 0.02, respectively. Transmural strain gradients were detected in the radial and circumferential directions, reflecting high spatial resolution. Good agreement by linear correlation and Bland-Altman analysis was achieved when comparing normal strains measured by 2D and 3D cine DENSE. Also, the 3D strains, twist, and torsion results obtained by 3D cine DENSE were in good agreement with historical values measured by 3D myocardial tagging. PMID:20574967
Glaciations and dense interstellar clouds; and reply
Energy Technology Data Exchange (ETDEWEB)
McCrea, W H [Sussex Univ., Brighton (UK); Dennison, B; Mansfield, V N
1976-09-16
Reference is made to Dennison and Mansfield (Nature 261:32 (1976)) who offered comments on a previous paper by the author (Nature 255:607 (1975)), in which he suggested that a possible cause of an ice age on the Earth was the passage of the solar system through an interstellar matter compression region bordering a spiral arm of the Galaxy. Dennison and Mansfield criticised this suggestion because it led them to expect to find a dense cloud of interstellar matter still very close to the Earth, whereas no such cloud is known. It is stated here that this criticism ignores the structure of the Galaxy, that provided the basis of the suggestion. A reply by Dennison and Mansfield is appended.
Charmonium propagation through a dense medium
Directory of Open Access Journals (Sweden)
Kopeliovich B.Z.
2015-01-01
Full Text Available Attenuation of a colourless c̄c dipole propagating with a large momentum through a hot medium originates from two sources, Debye screening (melting, and inelastic collisions with surrounding scattering centres (absorption. The former never terminates completely production of a bound charmonium in heavy ion collisions, even at very high temperatures. The latter, is controlled my the magnitude of the dipole cross section, related to the transport coefficient, which is the rate of transverse momentum broadening in the medium. A novel procedure of Lorentz boosting of the Schrödinger equation is developed, which allows to calculate the charmonium survival probability employing the path-integral technique, incorporating both melting and absorption. A novel mechanism of charmonium regeneration in a dense medium is proposed.
Intrinsically secure fast reactors with dense cores
International Nuclear Information System (INIS)
Slessarev, Igor
2007-01-01
Secure safety, resistance to weapons material proliferation and problems of long-lived wastes remain the most important 'painful points' of nuclear power. Many innovative reactor concepts have been developed aimed at a radical enhancement of safety. The promising potential of innovative nuclear reactors allows for shifting accents in current reactor safety 'strategy' to reveal this worth. Such strategy is elaborated focusing on the priority for intrinsically secure safety features as well as on sure protection being provided by the first barrier of defence. Concerning the potential of fast reactors (i.e. sodium cooled, lead-cooled, etc.), there are no doubts that they are able to possess many favourable intrinsically secure safety features and to lay the proper foundation for a new reactor generation. However, some of their neutronic characteristics have to be radically improved. Among intrinsically secure safety properties, the following core parameters are significantly important: reactivity margin values, reactivity feed-back and coolant void effects. Ways of designing intrinsically secure safety features in fast reactors (titled hereafter as Intrinsically Secure Fast Reactors - ISFR) can be found in the frame of current reactor technologies by radical enhancement of core neutron economy and by optimization of core compositions. Simultaneously, respecting resistance to proliferation, by using non-enriched fuel feed as well as a core breeding gain close to zero, are considered as the important features (long-lived waste problems will be considered in a separate paper). This implies using the following reactor design options as well as closed fuel cycles with natural U as the reactor feed: ·Ultra-plate 'dense cores' of the ordinary (monolithic) type with negative total coolant void effects. ·Modular type cores. Multiple dense modules can be embedded in the common reflector for achieving the desired NPP total power. The modules can be used also independently (as
Coherent neutrino interactions in a dense medium
International Nuclear Information System (INIS)
Kiers, K.; Weiss, N.
1997-01-01
Motivated by the effect of matter on neutrino oscillations (the MSW effect) we study in more detail the propagation of neutrinos in a dense medium. The dispersion relation for massive neutrinos in a medium is known to have a minimum at nonzero momentum p∼G F ρ/√(2). We study in detail the origin and consequences of this dispersion relation for both Dirac and Majorana neutrinos both in a toy model with only neutral currents and a single neutrino flavor and in a realistic open-quotes standard modelclose quotes with two neutrino flavors. We find that for a range of neutrino momenta near the minimum of the dispersion relation, Dirac neutrinos are trapped by their coherent interactions with the medium. This effect does not lead to the trapping of Majorana neutrinos. copyright 1997 The American Physical Society
Equation of state of dense baryonic matter
International Nuclear Information System (INIS)
Weber, F.; Weigel, M.K.
1989-01-01
In a previous investigation we treated nuclear matter as well as neutron matter at zero and finite temperatures in the frame of different relativistic field theoretical models, but with the restriction to nucleons as the only present baryons. This approach is extended by including a larger fraction of baryons and mesons, necessary for a description of baryon matter under extreme conditions. The equation of state (EOS) is calculated in both the Hartree and Hartree-Fock (HF) approximations for dense nuclear as well as neutron matter. Self-interactions of the σ field up to fourth order have been taken into account. For the treatment of many-baryon matter in the HF approach the parameters of the theory had to be readjusted. A phase transition of both many-baryon systems (neutron as well as nuclear matter) in the high-pressure and high-energy-density region has been found. (author)
Nonlinear extraordinary wave in dense plasma
Energy Technology Data Exchange (ETDEWEB)
Krasovitskiy, V. B., E-mail: krasovit@mail.ru [Russian Academy of Sciences, Keldysh Institute of Applied Mathematics (Russian Federation); Turikov, V. A. [Russian University of Peoples’ Friendship (Russian Federation)
2013-10-15
Conditions for the propagation of a slow extraordinary wave in dense magnetized plasma are found. A solution to the set of relativistic hydrodynamic equations and Maxwell’s equations under the plasma resonance conditions, when the phase velocity of the nonlinear wave is equal to the speed of light, is obtained. The deviation of the wave frequency from the resonance frequency is accompanied by nonlinear longitudinal-transverse oscillations. It is shown that, in this case, the solution to the set of self-consistent equations obtained by averaging the initial equations over the period of high-frequency oscillations has the form of an envelope soliton. The possibility of excitation of a nonlinear wave in plasma by an external electromagnetic pulse is confirmed by numerical simulations.
Statistical mechanics of dense granular media
International Nuclear Information System (INIS)
Coniglio, A; Fierro, A; Nicodemi, M; Ciamarra, M Pica; Tarzia, M
2005-01-01
We discuss some recent results on the statistical mechanics approach to dense granular media. In particular, by analytical mean field investigation we derive the phase diagram of monodisperse and bidisperse granular assemblies. We show that 'jamming' corresponds to a phase transition from a 'fluid' to a 'glassy' phase, observed when crystallization is avoided. The nature of such a 'glassy' phase turns out to be the same as found in mean field models for glass formers. This gives quantitative evidence for the idea of a unified description of the 'jamming' transition in granular media and thermal systems, such as glasses. We also discuss mixing/segregation transitions in binary mixtures and their connections to phase separation and 'geometric' effects
Tangram solved? Prefrontal cortex activation analysis during geometric problem solving.
Ayaz, Hasan; Shewokis, Patricia A; Izzetoğlu, Meltem; Çakır, Murat P; Onaral, Banu
2012-01-01
Recent neuroimaging studies have implicated prefrontal and parietal cortices for mathematical problem solving. Mental arithmetic tasks have been used extensively to study neural correlates of mathematical reasoning. In the present study we used geometric problem sets (tangram tasks) that require executive planning and visuospatial reasoning without any linguistic representation interference. We used portable optical brain imaging (functional near infrared spectroscopy--fNIR) to monitor hemodynamic changes within anterior prefrontal cortex during tangram tasks. Twelve healthy subjects were asked to solve a series of computerized tangram puzzles and control tasks that required same geometric shape manipulation without problem solving. Total hemoglobin (HbT) concentration changes indicated a significant increase during tangram problem solving in the right hemisphere. Moreover, HbT changes during failed trials (when no solution found) were significantly higher compared to successful trials. These preliminary results suggest that fNIR can be used to assess cortical activation changes induced by geometric problem solving. Since fNIR is safe, wearable and can be used in ecologically valid environments such as classrooms, this neuroimaging tool may help to improve and optimize learning in educational settings.
A constitutive law for dense granular flows.
Jop, Pierre; Forterre, Yoël; Pouliquen, Olivier
2006-06-08
A continuum description of granular flows would be of considerable help in predicting natural geophysical hazards or in designing industrial processes. However, the constitutive equations for dry granular flows, which govern how the material moves under shear, are still a matter of debate. One difficulty is that grains can behave like a solid (in a sand pile), a liquid (when poured from a silo) or a gas (when strongly agitated). For the two extreme regimes, constitutive equations have been proposed based on kinetic theory for collisional rapid flows, and soil mechanics for slow plastic flows. However, the intermediate dense regime, where the granular material flows like a liquid, still lacks a unified view and has motivated many studies over the past decade. The main characteristics of granular liquids are: a yield criterion (a critical shear stress below which flow is not possible) and a complex dependence on shear rate when flowing. In this sense, granular matter shares similarities with classical visco-plastic fluids such as Bingham fluids. Here we propose a new constitutive relation for dense granular flows, inspired by this analogy and recent numerical and experimental work. We then test our three-dimensional (3D) model through experiments on granular flows on a pile between rough sidewalls, in which a complex 3D flow pattern develops. We show that, without any fitting parameter, the model gives quantitative predictions for the flow shape and velocity profiles. Our results support the idea that a simple visco-plastic approach can quantitatively capture granular flow properties, and could serve as a basic tool for modelling more complex flows in geophysical or industrial applications.
Dense gas dispersion in the atmosphere
Energy Technology Data Exchange (ETDEWEB)
Nielsen, Morten
1998-09-01
Dense gas dispersion is characterized by buoyancy induced gravity currents and reduction of the vertical mixing. Liquefied gas releases from industrial accidents are cold because of the heat of evaporation which determines the density for a given concentration and physical properties. The temperature deficit is moderated by the heat flux from the ground, and this convection is an additional source of turbulence which affects the mixing. A simple model as the soil heat flux is used to estimate the ability of the ground to sustain the heat flux during release. The initial enthalpy, release rate, initial entrainment and momentum are discussed for generic source types and the interaction with obstacles is considered. In the MTH project BA experiments source with and without momentum were applied. The continuously released propane gas passed a two-dimensional removable obstacle perpendicular to the wind direction. Ground-level gas concentrations and vertical profiles of concentration, temperature, wind speed and turbulence were measured in front of and behind the obstacle. Ultrasonic anemometers providing fast velocity and concentration signals were mounted at three levels on the masts. The observed turbulence was influenced by the stability and the initial momentum of the jet releases. Additional information were taken from the `Dessert tortoise` ammonia jet releases, from the `Fladis` experiment with transition from dense to passive dispersion, and from the `Thorney Island` continuous releases of isothermal freon mixtures. The heat flux was found to moderate the negative buoyancy in both the propane and ammonia experiments. The heat flux measurements are compared to an estimate by analogy with surface layer theory. (au) 41 tabs., 146 ills., 189 refs.
Ultrasonic Linear Motor with Two Independent Vibrations
Muneishi, Takeshi; Tomikawa, Yoshiro
2004-09-01
We propose a new structure of an ultrasonic linear motor in order to solve the problems of high-power ultrasonic linear motors that drive the XY-stage for electron beam equipment and to expand the application fields of the motor. We pay special attention to the following three points: (1) the vibration in two directions of the ultrasonic linear motor should not influence mutually each other, (2) the vibration in two directions should be divided into the stage traveling direction and the pressing direction of the ultrasonic linear motor, and (3) the rigidity of the stage traveling direction of the ultrasonic linear motor should be increased. As a result, the supporting method of ultrasonic linear motors is simplified. The efficiency of the motor is improved and temperature rise is reduced. The stage position drift is also improved.
Solution of systems of linear algebraic equations by the method of summation of divergent series
International Nuclear Information System (INIS)
Kirichenko, G.A.; Korovin, Ya.S.; Khisamutdinov, M.V.; Shmojlov, V.I.
2015-01-01
A method for solving systems of linear algebraic equations has been proposed on the basis on the summation of the corresponding continued fractions. The proposed algorithm for solving systems of linear algebraic equations is classified as direct algorithms providing an exact solution in a finite number of operations. Examples of solving systems of linear algebraic equations have been presented and the effectiveness of the algorithm has been estimated [ru
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
Uzawa method for fuzzy linear system
Ke Wang
2013-01-01
An Uzawa method is presented for solving fuzzy linear systems whose coefficient matrix is crisp and the right-hand side column is arbitrary fuzzy number vector. The explicit iterative scheme is given. The convergence is analyzed with convergence theorems and the optimal parameter is obtained. Numerical examples are given to illustrate the procedure and show the effectiveness and efficiency of the method.
Dense Deposit Disease Mimicking a Renal Small Vessel Vasculitis
Singh, Lavleen; Bhardwaj, Swati; Sinha, Aditi; Bagga, Arvind; Dinda, Amit
2016-01-01
Dense deposit disease is caused by fluid-phase dysregulation of the alternative complement pathway and frequently deviates from the classic membranoproliferative pattern of injury on light microscopy. Other patterns of injury described for dense deposit disease include mesangioproliferative, acute proliferative/exudative, and crescentic GN. Regardless of the histologic pattern, C3 glomerulopathy, which includes dense deposit disease and C3 GN, is defined by immunofluorescence intensity of C3c two or more orders of magnitude greater than any other immune reactant (on a 0–3 scale). Ultrastructural appearances distinguish dense deposit disease and C3 GN. Focal and segmental necrotizing glomerular lesions with crescents, mimicking a small vessel vasculitis such as ANCA-associated GN, are a very rare manifestation of dense deposit disease. We describe our experience with this unusual histologic presentation and distinct clinical course of dense deposit disease, discuss the pitfalls in diagnosis, examine differential diagnoses, and review the relevant literature. PMID:26361799
Damping of Resonantly Forced Density Waves in Dense Planetary Rings
Lehmann, Marius; Schmidt, Jürgen; Salo, Heikki
2016-10-01
We address the stability of resonantly forced density waves in dense planetary rings.Already by Goldreich and Tremaine (1978) it has been argued that density waves might be unstable, depending on the relationship between the ring's viscosity and the surface mass density. In the recent paper (Schmidt et al. 2016) we have pointed out that when - within a fluid description of the ring dynamics - the criterion for viscous overstability is satisfied, forced spiral density waves become unstable as well. In this case, linear theory fails to describe the damping.We apply the multiple scale formalism to derive a weakly nonlinear damping relation from a hydrodynamical model.This relation describes the resonant excitation and nonlinear viscous damping of spiral density waves in a vertically integrated fluid disk with density dependent transport coefficients. The model consistently predicts linear instability of density waves in a ring region where the conditions for viscous overstability are met. In this case, sufficiently far away from the Lindblad resonance, the surface mass density perturbation is predicted to saturate to a constant value due to nonlinear viscous damping. In general the model wave damping lengths depend on a set of input parameters, such as the distance to the threshold for viscous overstability and the ground state surface mass density.Our new model compares reasonably well with the streamline model for nonlinear density waves of Borderies et al. 1986.Deviations become substantial in the highly nonlinear regime, corresponding to strong satellite forcing.Nevertheless, we generally observe good or at least qualitative agreement between the wave amplitude profiles of both models. The streamline approach is superior at matching the total wave profile of waves observed in Saturn's rings, while our new damping relation is a comparably handy tool to gain insight in the evolution of the wave amplitude with distance from resonance, and the different regimes of
Observations of strong ion-ion correlations in dense plasmas
Energy Technology Data Exchange (ETDEWEB)
Ma, T.; Fletcher, L.; Pak, A.; Chapman, D. A.; Falcone, R. W.; Fortmann, C.; Galtier, E.; Gericke, D. O.; Gregori, G.; Hastings, J.; Landen, O. L.; Le Pape, S.; Lee, H. J.; Nagler, B.; Neumayer, P.; Turnbull, D.; Vorberger, J.; White, T. G.; Wünsch, K.; Zastrau, U.; Glenzer, S. H.; Döppner, T.
2014-05-01
Using simultaneous spectrally, angularly, and temporally resolved x-ray scattering, we measure the pronounced ion-ion correlation peak in a strongly coupled plasma. Laser-driven shock-compressed aluminum at ~3× solid density is probed with high-energy photons at 17.9 keV created by molybdenum He-α emission in a laser-driven plasma source. The measured elastic scattering feature shows a well-pronounced correlation peak at a wave vector of k=4k=4Å-1. The magnitude of this correlation peak cannot be described by standard plasma theories employing a linear screened Coulomb potential. Advanced models, including a strong short-range repulsion due to the inner structure of the aluminum ions are however in good agreement with the scattering data. These studies have demonstrated a new highly accurate diagnostic technique to directly measure the state of compression and the ion-ion correlations. We have since applied this new method in single-shot wave-number resolved S(k) measurements to characterize the physical properties of dense plasmas.
TREMOR: A wireless MEMS accelerograph for dense arrays
Evans, J.R.; Hamstra, R.H.; Kundig, C.; Camina, P.; Rogers, J.A.
2005-01-01
The ability of a strong-motion network to resolve wavefields can be described on three axes: frequency, amplitude, and space. While the need for spatial resolution is apparent, for practical reasons that axis is often neglected. TREMOR is a MEMS-based accelerograph using wireless Internet to minimize lifecycle cost. TREMOR instruments can economically augment traditional ones, residing between them to improve spatial resolution. The TREMOR instrument described here has dynamic range of 96 dB between ??2 g, or 102 dB between ??4 g. It is linear to ???1% of full scale (FS), with a response function effectively shaped electronically. We developed an economical, very low noise, accurate (???1%FS) temperature compensation method. Displacement is easily recovered to 10-cm accuracy at full bandwidth, and better with care. We deployed prototype instruments in Oakland, California, beginning in 1998, with 13 now at mean spacing of ???3 km - one of the most densely instrumented urban centers in the United States. This array is among the quickest in returning (PGA, PGV, Sa) vectors to ShakeMap, ???75 to 100 s. Some 13 events have been recorded. A ShakeMap and an example of spatial variability are shown. Extensive tests of the prototypes for a commercial instrument are described here and in a companion paper. ?? 2005, Earthquake Engineering Research Institute.
LinvPy : a Python package for linear inverse problems
Beaud, Guillaume François Paul
2016-01-01
The goal of this project is to make a Python package including the tau-estimator algorithm to solve linear inverse problems. The package must be distributed, well documented, easy to use and easy to extend for future developers.
Evaluating forest management policies by parametric linear programing
Daniel I. Navon; Richard J. McConnen
1967-01-01
An analytical and simulation technique, parametric linear programing explores alternative conditions and devises an optimal management plan for each condition. Its application in solving policy-decision problems in the management of forest lands is illustrated in an example.
Near-Regular Structure Discovery Using Linear Programming
Huang, Qixing; Guibas, Leonidas J.; Mitra, Niloy J.
2014-01-01
as an optimization and efficiently solve it using linear programming techniques. Our optimization has a discrete aspect, that is, the connectivity relationships among the elements, as well as a continuous aspect, namely the locations of the elements of interest. Both
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).
A Global Optimization Algorithm for Sum of Linear Ratios Problem
Yuelin Gao; Siqiao Jin
2013-01-01
We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the c...
Systems of Inhomogeneous Linear Equations
Scherer, Philipp O. J.
Many problems in physics and especially computational physics involve systems of linear equations which arise e.g. from linearization of a general nonlinear problem or from discretization of differential equations. If the dimension of the system is not too large standard methods like Gaussian elimination or QR decomposition are sufficient. Systems with a tridiagonal matrix are important for cubic spline interpolation and numerical second derivatives. They can be solved very efficiently with a specialized Gaussian elimination method. Practical applications often involve very large dimensions and require iterative methods. Convergence of Jacobi and Gauss-Seidel methods is slow and can be improved by relaxation or over-relaxation. An alternative for large systems is the method of conjugate gradients.
Computational linear and commutative algebra
Kreuzer, Martin
2016-01-01
This book combines, in a novel and general way, an extensive development of the theory of families of commuting matrices with applications to zero-dimensional commutative rings, primary decompositions and polynomial system solving. It integrates the Linear Algebra of the Third Millennium, developed exclusively here, with classical algorithmic and algebraic techniques. Even the experienced reader will be pleasantly surprised to discover new and unexpected aspects in a variety of subjects including eigenvalues and eigenspaces of linear maps, joint eigenspaces of commuting families of endomorphisms, multiplication maps of zero-dimensional affine algebras, computation of primary decompositions and maximal ideals, and solution of polynomial systems. This book completes a trilogy initiated by the uncharacteristically witty books Computational Commutative Algebra 1 and 2 by the same authors. The material treated here is not available in book form, and much of it is not available at all. The authors continue to prese...
Modeling of dilute and dense dispersed fluid-particle flow
Energy Technology Data Exchange (ETDEWEB)
Laux, Harald
1998-08-01
A general two-fluid model is derived and applied in CFD computations to various test cases of important industrial multiphase flows. It is general in the sense of its applicability to dilute and dense dispersed fluid-particle flows. The model is limited to isothermal flow without mass transfer and only one particle phase is described. The instantaneous fluid phase equations, including the phase interaction terms, are derived from a volume averaging technique, and the instantaneous particle phase equations are derived from the kinetic theory of granular material. Whereas the averaging procedure, the treatment of the interaction terms, and the kinetic theory approach have been reported in literature prior to this work the combination of the approaches is new. The resulting equations are derived without ambiguity in the interpretation of the particle phase pressure (equation-of-state of particle phase). The basic modeling for the particle phase is improved in two steps. Because in the basic modeling only stresses due to kinetic and collisional interactions are included, a simple model for an effective viscosity is developed in order to allow also frictional stresses within the particle phase. Moreover, turbulent stresses and turbulent dispersion of particles play often an important role for the transport processes. Therefore in a second step, a two-equation turbulence model for both fluid and particle phase turbulence is derived by applying the phasic average to the instantaneous equations. The resulting k-{epsilon}-k{sup d}-{epsilon}{sup d} model is new. Mathematical closure is attempted such that the resulting set of equations is valid for both dilute arid dense flows. During the development of the closure relations a clear distinction is made between granular or ''viscous'' microscale fluctuations and turbulent macro scale fluctuations (true particle turbulence) within the particle phase. The set of governing equations is discretized by using a
Modeling of dilute and dense dispersed fluid-particle flow
Energy Technology Data Exchange (ETDEWEB)
Laux, Harald
1998-08-01
A general two-fluid model is derived and applied in CFD computations to various test cases of important industrial multiphase flows. It is general in the sense of its applicability to dilute and dense dispersed fluid-particle flows. The model is limited to isothermal flow without mass transfer and only one particle phase is described. The instantaneous fluid phase equations, including the phase interaction terms, are derived from a volume averaging technique, and the instantaneous particle phase equations are derived from the kinetic theory of granular material. Whereas the averaging procedure, the treatment of the interaction terms, and the kinetic theory approach have been reported in literature prior to this work the combination of the approaches is new. The resulting equations are derived without ambiguity in the interpretation of the particle phase pressure (equation-of-state of particle phase). The basic modeling for the particle phase is improved in two steps. Because in the basic modeling only stresses due to kinetic and collisional interactions are included, a simple model for an effective viscosity is developed in order to allow also frictional stresses within the particle phase. Moreover, turbulent stresses and turbulent dispersion of particles play often an important role for the transport processes. Therefore in a second step, a two-equation turbulence model for both fluid and particle phase turbulence is derived by applying the phasic average to the instantaneous equations. The resulting k-{epsilon}-k{sup d}-{epsilon}{sup d} model is new. Mathematical closure is attempted such that the resulting set of equations is valid for both dilute arid dense flows. During the development of the closure relations a clear distinction is made between granular or ''viscous'' microscale fluctuations and turbulent macro scale fluctuations (true particle turbulence) within the particle phase. The set of governing equations is discretized by using a finite volume method
Breast cancer screening in Korean woman with dense breast tissue
International Nuclear Information System (INIS)
Shin, Hee Jung; Ko, Eun Sook; Yi, Ann
2015-01-01
Asian women, including Korean, have a relatively higher incidence of dense breast tissue, compared with western women. Dense breast tissue has a lower sensitivity for the detection of breast cancer and a higher relative risk for breast cancer, compared with fatty breast tissue. Thus, there were limitations in the mammographic screening for women with dense breast tissue, and many studies for the supplemental screening methods. This review included appropriate screening methods for Korean women with dense breasts. We also reviewed the application and limitation of supplemental screening methods, including breast ultrasound, digital breast tomosynthesis, and breast magnetic resonance imaging; and furthermore investigated the guidelines, as well as the study results
Breast cancer screening in Korean woman with dense breast tissue
Energy Technology Data Exchange (ETDEWEB)
Shin, Hee Jung [Dept. of Radiology and Research Institute of Radiology, University of Ulsan College of Medicine, Asan Medical Center, Seoul (Korea, Republic of); Ko, Eun Sook [Dept. of Radiology, Sungkyunkwan University School of Medicine, Samsung Medical Center, Seoul (Korea, Republic of); Yi, Ann [Dept. of Radiology, Seoul National University College of Medicine, Seoul National University Hospital, Seoul (Korea, Republic of)
2015-11-15
Asian women, including Korean, have a relatively higher incidence of dense breast tissue, compared with western women. Dense breast tissue has a lower sensitivity for the detection of breast cancer and a higher relative risk for breast cancer, compared with fatty breast tissue. Thus, there were limitations in the mammographic screening for women with dense breast tissue, and many studies for the supplemental screening methods. This review included appropriate screening methods for Korean women with dense breasts. We also reviewed the application and limitation of supplemental screening methods, including breast ultrasound, digital breast tomosynthesis, and breast magnetic resonance imaging; and furthermore investigated the guidelines, as well as the study results.
Numerical linear algebra with applications using Matlab
Ford, William
2014-01-01
Designed for those who want to gain a practical knowledge of modern computational techniques for the numerical solution of linear algebra problems, Numerical Linear Algebra with Applications contains all the material necessary for a first year graduate or advanced undergraduate course on numerical linear algebra with numerous applications to engineering and science. With a unified presentation of computation, basic algorithm analysis, and numerical methods to compute solutions, this book is ideal for solving real-world problems. It provides necessary mathematical background information for
Correlated Levy Noise in Linear Dynamical Systems
International Nuclear Information System (INIS)
Srokowski, T.
2011-01-01
Linear dynamical systems, driven by a non-white noise which has the Levy distribution, are analysed. Noise is modelled by a specific stochastic process which is defined by the Langevin equation with a linear force and the Levy distributed symmetric white noise. Correlation properties of the process are discussed. The Fokker-Planck equation driven by that noise is solved. Distributions have the Levy shape and their width, for a given time, is smaller than for processes in the white noise limit. Applicability of the adiabatic approximation in the case of the linear force is discussed. (author)
Modelling the Multiphase Flow in Dense Medium Cyclones
Directory of Open Access Journals (Sweden)
Kaiwei Chu
2010-12-01
Full Text Available Dense medium cyclone (DMC is widely used in mineral industry to separate solids by density. It is simple in design but the flow pattern within it is complex due to the size and density distributions of the feed and process medium solids, and the turbulent vortex formed. Recently, the so-called combined computational fluid dynamics (CFD and discrete element method (DEM (CFD-DEM was extended from two-phase flow to model the flow in DMCs at the University of New South Wales (UNSW. In the CFD-DEM model, the flow of coal particles is modelled by DEM and that of medium flow by CFD, allowing consideration of medium-coal mutual interaction and particle-particle collisions. In the DEM model, Newton's laws of motion are applied to individual particles, and in the CFD model the local-averaged Navier-Stokes equations combined with the volume of fluid (VOF and mixture multiphase flow models are solved. The application to the DMC studies requires intensive computational effort. Therefore, various simplified versions have been proposed, corresponding to the approaches such as Lagrangian particle tracking (LPT method where dilute phase flow is assumed so that the interaction between particles can be ignored, one-way coupling where the effect of particle flow on fluid flow is ignored, and the use of the concept of parcel particles whose properties are empirically determined. In this paper, the previous works on the modelling of DMCs at UNSW are summarized and the features and applicability of the models used are discussed.
An Adaptive Channel Access Method for Dynamic Super Dense Wireless Sensor Networks.
Lei, Chunyang; Bie, Hongxia; Fang, Gengfa; Zhang, Xuekun
2015-12-03
Super dense and distributed wireless sensor networks have become very popular with the development of small cell technology, Internet of Things (IoT), Machine-to-Machine (M2M) communications, Vehicular-to-Vehicular (V2V) communications and public safety networks. While densely deployed wireless networks provide one of the most important and sustainable solutions to improve the accuracy of sensing and spectral efficiency, a new channel access scheme needs to be designed to solve the channel congestion problem introduced by the high dynamics of competing nodes accessing the channel simultaneously. In this paper, we firstly analyzed the channel contention problem using a novel normalized channel contention analysis model which provides information on how to tune the contention window according to the state of channel contention. We then proposed an adaptive channel contention window tuning algorithm in which the contention window tuning rate is set dynamically based on the estimated channel contention level. Simulation results show that our proposed adaptive channel access algorithm based on fast contention window tuning can achieve more than 95 % of the theoretical optimal throughput and 0 . 97 of fairness index especially in dynamic and dense networks.
An Adaptive Channel Access Method for Dynamic Super Dense Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Chunyang Lei
2015-12-01
Full Text Available Super dense and distributed wireless sensor networks have become very popular with the development of small cell technology, Internet of Things (IoT, Machine-to-Machine (M2M communications, Vehicular-to-Vehicular (V2V communications and public safety networks. While densely deployed wireless networks provide one of the most important and sustainable solutions to improve the accuracy of sensing and spectral efficiency, a new channel access scheme needs to be designed to solve the channel congestion problem introduced by the high dynamics of competing nodes accessing the channel simultaneously. In this paper, we firstly analyzed the channel contention problem using a novel normalized channel contention analysis model which provides information on how to tune the contention window according to the state of channel contention. We then proposed an adaptive channel contention window tuning algorithm in which the contention window tuning rate is set dynamically based on the estimated channel contention level. Simulation results show that our proposed adaptive channel access algorithm based on fast contention window tuning can achieve more than 95 % of the theoretical optimal throughput and 0 . 97 of fairness index especially in dynamic and dense networks.
Solving a Deconvolution Problem in Photon Spectrometry
Aleksandrov, D; Hille, P T; Polichtchouk, B; Kharlov, Y; Sukhorukov, M; Wang, D; Shabratova, G; Demanov, V; Wang, Y; Tveter, T; Faltys, M; Mao, Y; Larsen, D T; Zaporozhets, S; Sibiryak, I; Lovhoiden, G; Potcheptsov, T; Kucheryaev, Y; Basmanov, V; Mares, J; Yanovsky, V; Qvigstad, H; Zenin, A; Nikolaev, S; Siemiarczuk, T; Yuan, X; Cai, X; Redlich, K; Pavlinov, A; Roehrich, D; Manko, V; Deloff, A; Ma, K; Maruyama, Y; Dobrowolski, T; Shigaki, K; Nikulin, S; Wan, R; Mizoguchi, K; Petrov, V; Mueller, H; Ippolitov, M; Liu, L; Sadovsky, S; Stolpovsky, P; Kurashvili, P; Nomokonov, P; Xu, C; Torii, H; Il'kaev, R; Zhang, X; Peresunko, D; Soloviev, A; Vodopyanov, A; Sugitate, T; Ullaland, K; Huang, M; Zhou, D; Nystrand, J; Punin, V; Yin, Z; Batyunya, B; Karadzhev, K; Nazarov, G; Fil'chagin, S; Nazarenko, S; Buskenes, J I; Horaguchi, T; Djuvsland, O; Chuman, F; Senko, V; Alme, J; Wilk, G; Fehlker, D; Vinogradov, Y; Budilov, V; Iwasaki, T; Ilkiv, I; Budnikov, D; Vinogradov, A; Kazantsev, A; Bogolyubsky, M; Lindal, S; Polak, K; Skaali, B; Mamonov, A; Kuryakin, A; Wikne, J; Skjerdal, K
2010-01-01
We solve numerically a deconvolution problem to extract the undisturbed spectrum from the measured distribution contaminated by the finite resolution of the measuring device. A problem of this kind emerges when one wants to infer the momentum distribution of the neutral pions by detecting the it decay photons using the photon spectrometer of the ALICE LHC experiment at CERN {[}1]. The underlying integral equation connecting the sought for pion spectrum and the measured gamma spectrum has been discretized and subsequently reduced to a system of linear algebraic equations. The latter system, however, is known to be ill-posed and must be regularized to obtain a stable solution. This task has been accomplished here by means of the Tikhonov regularization scheme combined with the L-curve method. The resulting pion spectrum is in an excellent quantitative agreement with the pion spectrum obtained from a Monte Carlo simulation. (C) 2010 Elsevier B.V. All rights reserved.
Modeling and Solving the Train Pathing Problem
Directory of Open Access Journals (Sweden)
Chuen-Yih Chen
2009-04-01
Full Text Available In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clearance time between the trains to depend on their relative status. The heuristic generates a number of alternative paths for each train service in the initialization phase. Then it uses a neighborhood search approach to find good feasible combinations of these paths. A linear program is developed to evaluate the quality of each combination that is encountered. Numerical examples are provided.
The Correlation Characteristics of Polarization Backscattering Matrix of Dense Chaff Clouds
Directory of Open Access Journals (Sweden)
B. Tang
2018-04-01
Full Text Available This paper studied the correlation characteristics of the polarization backscattering matrix of the dense chaff cloud with uniform orientation and location distributions in circular symmetry region. Based on the theoretical analysis and numerical experiments, the correlation coefficients of the four elements in the polarization backscattering matrix are obtained, and the results indicate that the cross to co-polar correlation coefficient is still zero; and that the sum of the co-polar cross-correlation coefficient and the two times of linear depolarization ratio equals one. The results are beneficial for better understanding of the backscattering characteristics of dense chaff clouds, and are useful in the application of jamming recognition in radar electronic warfare. Numerical experiments are performed by using the method of moments.
A study on the aseismic safety of the experimental VHTR on the dense sandy layer
International Nuclear Information System (INIS)
Fujita, Shigeki; Ito, Yoshio; Baba, Osamu; Suzuki, Hideyuki; Takewaki, Naonobu; Kondo, Tsukasa; Yoshimura, Takashi; Yamada, Hitoshi.
1986-12-01
A series of studies has been carried out in 1983 and 1985 for the purpose of confirming the aseismic safety of the Experimental VHTR on the dense sandy layer. In 1983, effect of some of soil properties on seismic responses of the reactor building was estimated by means of parametric survey, and soil properties were estimated by analyzing the obserbed earthquake record. In 1985, literature review, linear, nonlinear parametric analyses and nonlinear simulation analyses were carried to study and compare the analysis method. In addition, seismic response of proposed construction site was estimated with nonlinear analysis method. As a result of these studies, the seismic response of reactor building on the dense sandy layers and wave propagation characteristics of sandy layers are understood. Especially, by means of many parametric studies, the effect of input wave characteristics, soil stiffness, nonlinear characteristics of soil properties and nonlinear analysis method on the reactor building responses were evaluated. (author)
Customer-centered problem solving.
Samelson, Q B
1999-11-01
If there is no single best way to attract new customers and retain current customers, there is surely an easy way to lose them: fail to solve the problems that arise in nearly every buyer-supplier relationship, or solve them in an unsatisfactory manner. Yet, all too frequently, companies do just that. Either we deny that a problem exists, we exert all our efforts to pin the blame elsewhere, or we "Band-Aid" the problem instead of fixing it, almost guaranteeing that we will face it again and again.
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
as a general approach to problem solving. We apply these Simonian ideas to organizational issues, specifically new organizational forms. Specifically, Simonian ideas allow us to develop a morphology of new organizational forms and to point to some design problems that characterize these forms.Keywords: Herbert...... Simon, problem-solving, new organizational forms. JEL Code: D23, D83......Two of Herbert Simon's best-known papers are "The Architecture of Complexity" and "The Structure of Ill-Structured Problems." We discuss the neglected links between these two papers, highlighting the role of decomposition in the context of problems on which constraints have been imposed...
Interactive problem solving using LOGO
Boecker, Heinz-Dieter; Fischer, Gerhard
2014-01-01
This book is unique in that its stress is not on the mastery of a programming language, but on the importance and value of interactive problem solving. The authors focus on several specific interest worlds: mathematics, computer science, artificial intelligence, linguistics, and games; however, their approach can serve as a model that may be applied easily to other fields as well. Those who are interested in symbolic computing will find that Interactive Problem Solving Using LOGO provides a gentle introduction from which one may move on to other, more advanced computational frameworks or more
Inference rule and problem solving
Energy Technology Data Exchange (ETDEWEB)
Goto, S
1982-04-01
Intelligent information processing signifies an opportunity of having man's intellectual activity executed on the computer, in which inference, in place of ordinary calculation, is used as the basic operational mechanism for such an information processing. Many inference rules are derived from syllogisms in formal logic. The problem of programming this inference function is referred to as a problem solving. Although logically inference and problem-solving are in close relation, the calculation ability of current computers is on a low level for inferring. For clarifying the relation between inference and computers, nonmonotonic logic has been considered. The paper deals with the above topics. 16 references.
Linearly constrained minimax optimization
DEFF Research Database (Denmark)
Madsen, Kaj; Schjær-Jacobsen, Hans
1978-01-01
We present an algorithm for nonlinear minimax optimization subject to linear equality and inequality constraints which requires first order partial derivatives. The algorithm is based on successive linear approximations to the functions defining the problem. The resulting linear subproblems...
Applying Groebner bases to solve reduction problems for Feynman integrals
International Nuclear Information System (INIS)
Smirnov, Alexander V.; Smirnov, Vladimir A.
2006-01-01
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some master integrals. Our approach is based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. We illustrate it through various examples of reduction problems for families of one- and two-loop Feynman integrals. We also solve the reduction problem for a family of integrals contributing to the three-loop static quark potential
Applying Groebner bases to solve reduction problems for Feynman integrals
Energy Technology Data Exchange (ETDEWEB)
Smirnov, Alexander V. [Mechanical and Mathematical Department and Scientific Research Computer Center of Moscow State University, Moscow 119992 (Russian Federation); Smirnov, Vladimir A. [Nuclear Physics Institute of Moscow State University, Moscow 119992 (Russian Federation)
2006-01-15
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some master integrals. Our approach is based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. We illustrate it through various examples of reduction problems for families of one- and two-loop Feynman integrals. We also solve the reduction problem for a family of integrals contributing to the three-loop static quark potential.
Bhatia, A. K.; Sinha, C.
2012-01-01
The free-free transition is studied for an electron-hydrogen in the ground state at low incident energies in the presence of an external homogenous, monochromatic, and linearly polarized laser-field inside a hot dense plasma.The effect of plasma screening is considered in the Debye-Huckel approximation. The calculations are performed in the soft photon limit, assuming that the plasma frequency is much higher than the laser frequency. The incident electron is considered to be dressed by the laser field in a nonperturbative manner by choosing the Volkov solutions in both the initial and final channels. The space part of the scattering wave function for the electron is solved numerically by taking into account the electron exchange. The laser-assisted differential and total cross sections are calculated for single-photon absorption /emission and no photon exchange in the soft photon limit, the laser intensity being much less than the atomic field intensity. The calculations have been carried out for various values of Debye parameter, ranging from 0.005 to 0.12. A strong suppression is noted in the laser-assisted cross sections as compared to the field-free situation. A significant difference is noted for the singlet and triplet cross sections. The suppression is much more in the triplet states.
Quantum statistical model for hot dense matter
International Nuclear Information System (INIS)
Rukhsana Kouser; Tasneem, G.; Saleem Shahzad, M.; Shafiq-ur-Rehman; Nasim, M.H.; Amjad Ali
2015-01-01
In solving numerous applied problems, one needs to know the equation of state, photon absorption coefficient and opacity of substances employed. We present a code for absorption coefficient and opacity calculation based on quantum statistical model. A self-consistent method for the calculation of potential is used. By solving Schrödinger equation with self-consistent potential we find energy spectrum of quantum mechanical system and corresponding wave functions. In addition we find mean occupation numbers of electron states and average charge state of the substance studied. The main processes of interaction of radiation with matter included in our opacity calculation are photon absorption in spectral lines (Bound-bound), photoionization (Bound-free), inverse bremsstrahlung (Free-free), Compton and Thomson scattering. Bound-bound line shape function has contribution from natural, Doppler, fine structure, collisional and stark broadening. To illustrate the main features of the code and its capabilities, calculation of average charge state, absorption coefficient, Rosseland and Planck mean and group opacities of aluminum and iron are presented. Results are satisfactorily compared with the published data. (authors)
Characterisation of Ferrosilicon Dense Medium Separation Material
International Nuclear Information System (INIS)
Waanders, F. B.; Mans, A.
2003-01-01
Ferrosilicon is used in the dense medium separation of iron ore at Kumba resources, Sishen, South Africa. Due to high cost and losses that occur during use, maximum recovery by means of magnetic separation is aimed for. The purpose of this project was to determine the characteristics of the unused Fe-Si and then to characterise the changes that occur during storage and use thereof. Scanning electron microscopy was used to determine the composition of each sample, whilst Moessbauer spectroscopy yielded a two-sextet spectrum with hyperfine magnetic field strengths of 20 and 31 T, respectively, for the fresh samples. Additional hematite oxide peaks appeared in the Moessbauer spectra after use of the Fe-Si over a length of time, but this did not result in a dramatic degradation of the medium. No definite changes occurred during correct storage methods. It was, however, found that the biggest loss of Fe-Si was due to the abrasion of the particles, which resulted in the formation of an oxihydroxide froth, during the process.
Improved models of dense anharmonic lattices
Energy Technology Data Exchange (ETDEWEB)
Rosenau, P., E-mail: rosenau@post.tau.ac.il; Zilburg, A.
2017-01-15
We present two improved quasi-continuous models of dense, strictly anharmonic chains. The direct expansion which includes the leading effect due to lattice dispersion, results in a Boussinesq-type PDE with a compacton as its basic solitary mode. Without increasing its complexity we improve the model by including additional terms in the expanded interparticle potential with the resulting compacton having a milder singularity at its edges. A particular care is applied to the Hertz potential due to its non-analyticity. Since, however, the PDEs of both the basic and the improved model are ill posed, they are unsuitable for a study of chains dynamics. Using the bond length as a state variable we manipulate its dispersion and derive a well posed fourth order PDE. - Highlights: • An improved PDE model of a Newtonian lattice renders compacton solutions. • Compactons are classical solutions of the improved model and hence amenable to standard analysis. • An alternative well posed model enables to study head on interactions of lattices' solitary waves. • Well posed modeling of Hertz potential.
Load Designs For MJ Dense Plasma Foci
Link, A.; Povlius, A.; Anaya, R.; Anderson, M. G.; Angus, J. R.; Cooper, C. M.; Falabella, S.; Goerz, D.; Higginson, D.; Holod, I.; McMahon, M.; Mitrani, J.; Koh, E. S.; Pearson, A.; Podpaly, Y. A.; Prasad, R.; van Lue, D.; Watson, J.; Schmidt, A. E.
2017-10-01
Dense plasma focus (DPF) Z-pinches are compact pulse power driven devices with coaxial electrodes. The discharge of DPF consists of three distinct phases: first generation of a plasma sheath, plasma rail gun phase where the sheath is accelerated down the electrodes and finally an implosion phase where the plasma stagnates into a z-pinch geometry. During the z-pinch phase, DPFs can produce MeV ion beams, x-rays and neutrons. Megaampere class DPFs with deuterium fills have demonstrated neutron yields in the 1012 neutrons/shot range with pulse durations of 10-100 ns. Kinetic simulations using the code Chicago are being used to evaluate various load configurations from initial sheath formation to the final z-pinch phase for DPFs with up to 5 MA and 1 MJ coupled to the load. Results will be presented from the preliminary design simulations. LLNL-ABS-734785 This work performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory (LLNL) under Contract DE-AC52-07NA27344 and with support from the Computing Grand Challenge program at LLNL.
Kinetic Simulations of Dense Plasma Focus Breakdown
Schmidt, A.; Higginson, D. P.; Jiang, S.; Link, A.; Povilus, A.; Sears, J.; Bennett, N.; Rose, D. V.; Welch, D. R.
2015-11-01
A dense plasma focus (DPF) device is a type of plasma gun that drives current through a set of coaxial electrodes to assemble gas inside the device and then implode that gas on axis to form a Z-pinch. This implosion drives hydrodynamic and kinetic instabilities that generate strong electric fields, which produces a short intense pulse of x-rays, high-energy (>100 keV) electrons and ions, and (in deuterium gas) neutrons. A strong factor in pinch performance is the initial breakdown and ionization of the gas along the insulator surface separating the two electrodes. The smoothness and isotropy of this ionized sheath are imprinted on the current sheath that travels along the electrodes, thus making it an important portion of the DPF to both understand and optimize. Here we use kinetic simulations in the Particle-in-cell code LSP to model the breakdown. Simulations are initiated with neutral gas and the breakdown modeled self-consistently as driven by a charged capacitor system. We also investigate novel geometries for the insulator and electrodes to attempt to control the electric field profile. The initial ionization fraction of gas is explored computationally to gauge possible advantages of pre-ionization which could be created experimentally via lasers or a glow-discharge. Prepared by LLNL under Contract DE-AC52-07NA27344.
Neutrino ground state in a dense star
International Nuclear Information System (INIS)
Kiers, K.; Tytgat, M.H.
1998-01-01
It has recently been argued that long range forces due to the exchange of massless neutrinos give rise to a very large self-energy in a dense, finite-ranged, weakly charged medium. Such an effect, if real, would destabilize a neutron star. To address this issue we have studied the related problem of a massless neutrino field in the presence of an external, static electroweak potential of finite range. To be precise, we have computed to one loop the exact vacuum energy for the case of a spherical square well potential of depth α and radius R. For small wells, the vacuum energy is reliably determined by a perturbative expansion in the external potential. For large wells, however, the perturbative expansion breaks down. A manifestation of this breakdown is that the vacuum carries a non-zero neutrino charge. The energy and neutrino charge of the ground state are, to a good approximation for large wells, those of a neutrino condensate with chemical potential μ=α. Our results demonstrate explicitly that long-range forces due to the exchange of massless neutrinos do not threaten the stability of neutron stars. copyright 1998 The American Physical Society
Neutral helium spectral lines in dense plasmas
International Nuclear Information System (INIS)
Omar, Banaz; Wierling, August; Roepke, Gerd; Guenter, Sibylle
2006-01-01
Shift and broadening of isolated neutral helium lines 7281 A ring (2 1 P-3 1 S), 7065 A ring (2 3 P-3 3 S), 6678 A ring (2 1 P-3 1 D), 5048 A ring (2 1 P-4 1 S), 4922 A ring (2 1 P-4 1 D), and 4713 A ring (2 3 P-4 3 S) in a dense plasma are investigated. Based on a quantum statistical theory, the electronic contributions to the shift and width are considered, using the method of thermodynamic Green functions. Dynamic screening of the electron-atom interaction is included. Compared to the width, the electronic shift is more affected by dynamical screening. This effect increases at high density. A cut-off procedure for strong collisions is used. The contribution of the ions is taken into account in a quasi-static approximation, with both the quadratic Stark effect and the quadrupole interaction included. The results for shift and width agree well with the available experimental and theoretical data
Deterministic dense coding and entanglement entropy
International Nuclear Information System (INIS)
Bourdon, P. S.; Gerjuoy, E.; McDonald, J. P.; Williams, H. T.
2008-01-01
We present an analytical study of the standard two-party deterministic dense-coding protocol, under which communication of perfectly distinguishable messages takes place via a qudit from a pair of nonmaximally entangled qudits in a pure state |ψ>. Our results include the following: (i) We prove that it is possible for a state |ψ> with lower entanglement entropy to support the sending of a greater number of perfectly distinguishable messages than one with higher entanglement entropy, confirming a result suggested via numerical analysis in Mozes et al. [Phys. Rev. A 71, 012311 (2005)]. (ii) By explicit construction of families of local unitary operators, we verify, for dimensions d=3 and d=4, a conjecture of Mozes et al. about the minimum entanglement entropy that supports the sending of d+j messages, 2≤j≤d-1; moreover, we show that the j=2 and j=d-1 cases of the conjecture are valid in all dimensions. (iii) Given that |ψ> allows the sending of K messages and has √(λ 0 ) as its largest Schmidt coefficient, we show that the inequality λ 0 ≤d/K, established by Wu et al. [Phys. Rev. A 73, 042311 (2006)], must actually take the form λ 0 < d/K if K=d+1, while our constructions of local unitaries show that equality can be realized if K=d+2 or K=2d-1
Thermochemistry of dense hydrous magnesium silicates
Bose, Kunal; Burnley, Pamela; Navrotsky, Alexandra
1994-01-01
Recent experimental investigations under mantle conditions have identified a suite of dense hydrous magnesium silicate (DHMS) phases that could be conduits to transport water to at least the 660 km discontinuity via mature, relatively cold, subducting slabs. Water released from successive dehydration of these phases during subduction could be responsible for deep focus earthquakes, mantle metasomatism and a host of other physico-chemical processes central to our understanding of the earth's deep interior. In order to construct a thermodynamic data base that can delineate and predict the stability ranges for DHMS phases, reliable thermochemical and thermophysical data are required. One of the major obstacles in calorimetric studies of phases synthesized under high pressure conditions has been limitation due to the small (less than 5 mg) sample mass. Our refinement of calorimeter techniques now allow precise determination of enthalpies of solution of less than 5 mg samples of hydrous magnesium silicates. For example, high temperature solution calorimetry of natural talc (Mg(0.99) Fe(0.01)Si4O10(OH)2), periclase (MgO) and quartz (SiO2) yield enthalpies of drop solution at 1044 K to be 592.2 (2.2), 52.01 (0.12) and 45.76 (0.4) kJ/mol respectively. The corresponding enthalpy of formation from oxides at 298 K for talc is minus 5908.2 kJ/mol agreeing within 0.1 percent to literature values.
Borehole stability in densely welded tuffs
International Nuclear Information System (INIS)
Fuenkajorn, K.; Daemen, J.J.K.
1992-07-01
The stability of boreholes, or more generally of underground openings (i.e. including shafts, ramps, drifts, tunnels, etc.) at locations where seals or plugs are to be placed is an important consideration in seal design for a repository (Juhlin and Sandstedt, 1989). Borehole instability or borehole breakouts induced by stress redistribution could negate the effectiveness of seals or plugs. Breakout fractures along the wall of repository excavations or exploratory holes could provide a preferential flowpath for groundwater or gaseous radionuclides to bypass the plugs. After plug installation, swelling pressures exerted by a plug could induce radial cracks or could open or widen preexisting cracks in the rock at the bottom of the breakouts where the tangential compressive stresses have been released by the breakout process. The purpose of the work reported here is to determine experimentally the stability of a circular hole in a welded tuff sample subjected to various external boundary loads. Triaxial and biaxial borehole stability tests have been performed on densely welded Apache Leap tuff samples and Topopah Spring tuff samples. The nominal diameter of the test hole is 13.3 or 14.4 mm for triaxial testing, and 25.4 mm for biaxial testing. The borehole axis is parallel to one of the principal stress axes. The boreholes are drilled through the samples prior to applying external boundary loads. The boundary loads are progressively increased until breakouts occur or until the maximum load capacity of the loading system has been reached. 74 refs
Packing frustration in dense confined fluids.
Nygård, Kim; Sarman, Sten; Kjellander, Roland
2014-09-07
Packing frustration for confined fluids, i.e., the incompatibility between the preferred packing of the fluid particles and the packing constraints imposed by the confining surfaces, is studied for a dense hard-sphere fluid confined between planar hard surfaces at short separations. The detailed mechanism for the frustration is investigated via an analysis of the anisotropic pair distributions of the confined fluid, as obtained from integral equation theory for inhomogeneous fluids at pair correlation level within the anisotropic Percus-Yevick approximation. By examining the mean forces that arise from interparticle collisions around the periphery of each particle in the slit, we calculate the principal components of the mean force for the density profile--each component being the sum of collisional forces on a particle's hemisphere facing either surface. The variations of these components with the slit width give rise to rather intricate changes in the layer structure between the surfaces, but, as shown in this paper, the basis of these variations can be easily understood qualitatively and often also semi-quantitatively. It is found that the ordering of the fluid is in essence governed locally by the packing constraints at each single solid-fluid interface. A simple superposition of forces due to the presence of each surface gives surprisingly good estimates of the density profiles, but there remain nontrivial confinement effects that cannot be explained by superposition, most notably the magnitude of the excess adsorption of particles in the slit relative to bulk.
Deuterium fractionation in dense interstellar clouds
International Nuclear Information System (INIS)
Millar, T.J.; Bennett, A.; Herbst, E.
1989-01-01
The time-dependent gas-phase chemistry of deuterium fractionation in dense interstellar clouds ranging in temperature between 10 and 70 K was investigated using a pseudo-time-dependent model similar to that of Brown and Rice (1986). The present approach, however, considers much more complex species, uses more deuterium fractionation reactions, and includes the use of new branching ratios for dissociative recombinations reactions. Results indicate that, in cold clouds, the major and most global source of deuterium fractionation is H2D(+) and ions derived from it, such as DCO(+) and H2DO(+). In warmer clouds, reactions of CH2D(+), C2HD(+), and associated species lead to significant fractionation even at 70 K, which is the assumed Orion temperature. The deuterium abundance ratios calculated at 10 K are consistent with those observed in TMC-1 for most species. However, a comparison between theory and observatiom for Orion, indicates that, for species in the ambient molecular cloud, the early-time results obtained with the old dissociative recombination branching ratios are superior if a temperature of 70 K is utilized. 60 refs
Deuterium fractionation in dense interstellar clouds
Millar, T. J.; Bennett, A.; Herbst, Eric
1989-05-01
The time-dependent gas-phase chemistry of deuterium fractionation in dense interstellar clouds ranging in temperature between 10 and 70 K was investigated using a pseudo-time-dependent model similar to that of Brown and Rice (1986). The present approach, however, considers much more complex species, uses more deuterium fractionation reactions, and includes the use of new branching ratios for dissociative recombinations reactions. Results indicate that, in cold clouds, the major and most global source of deuterium fractionation is H2D(+) and ions derived from it, such as DCO(+) and H2DO(+). In warmer clouds, reactions of CH2D(+), C2HD(+), and associated species lead to significant fractionation even at 70 K, which is the assumed Orion temperature. The deuterium abundance ratios calculated at 10 K are consistent with those observed in TMC-1 for most species. However, a comparison between theory and observatiom for Orion, indicates that, for species in the ambient molecular cloud, the early-time results obtained with the old dissociative recombination branching ratios are superior if a temperature of 70 K is utilized.
DEFF Research Database (Denmark)
Hattel, Jesper; Hansen, Preben
1995-01-01
This paper presents a novel control volume based FD method for solving the equilibrium equations in terms of displacements, i.e. the generalized Navier equations. The method is based on the widely used cv-FDM solution of heat conduction and fluid flow problems involving a staggered grid formulati....... The resulting linear algebraic equations are solved by line-Gauss-Seidel....
Funke, Joachim
2013-01-01
This paper presents a bibliography of 263 references related to human problem solving, arranged by subject matter. The references were taken from PsycInfo and Academic Premier data-base. Journal papers, book chapters, and dissertations are included. The topics include human development, education, neuroscience, and research in applied settings. It…
Solved problems in classical electromagnetism
Franklin, Jerrold
2018-01-01
This original Dover publication is the companion to a new edition of the author's Classical Electromagnetism: Second Edition. The latter volume will feature only basic answers; this book will contain some problems from the reissue as well as many other new ones. All feature complete, worked-out solutions and form a valuable source of problem-solving material for students.
Error Patterns in Problem Solving.
Babbitt, Beatrice C.
Although many common problem-solving errors within the realm of school mathematics have been previously identified, a compilation of such errors is not readily available within learning disabilities textbooks, mathematics education texts, or teacher's manuals for school mathematics texts. Using data on error frequencies drawn from both the Fourth…
Quantitative Reasoning in Problem Solving
Ramful, Ajay; Ho, Siew Yin
2015-01-01
In this article, Ajay Ramful and Siew Yin Ho explain the meaning of quantitative reasoning, describing how it is used in the to solve mathematical problems. They also describe a diagrammatic approach to represent relationships among quantities and provide examples of problems and their solutions.
Students' Problem Solving and Justification
Glass, Barbara; Maher, Carolyn A.
2004-01-01
This paper reports on methods of students' justifications of their solution to a problem in the area of combinatorics. From the analysis of the problem solving of 150 students in a variety of settings from high-school to graduate study, four major forms of reasoning evolved: (1) Justification by Cases, (2) Inductive Argument, (3) Elimination…
Solving Differential Equations in R: Package deSolve
Directory of Open Access Journals (Sweden)
Karline Soetaert
2010-02-01
Full Text Available In this paper we present the R package deSolve to solve initial value problems (IVP written as ordinary differential equations (ODE, differential algebraic equations (DAE of index 0 or 1 and partial differential equations (PDE, the latter solved using the method of lines approach. The differential equations can be represented in R code or as compiled code. In the latter case, R is used as a tool to trigger the integration and post-process the results, which facilitates model development and application, whilst the compiled code significantly increases simulation speed. The methods implemented are efficient, robust, and well documented public-domain Fortran routines. They include four integrators from the ODEPACK package (LSODE, LSODES, LSODA, LSODAR, DVODE and DASPK2.0. In addition, a suite of Runge-Kutta integrators and special-purpose solvers to efficiently integrate 1-, 2- and 3-dimensional partial differential equations are available. The routines solve both stiff and non-stiff systems, and include many options, e.g., to deal in an efficient way with the sparsity of the Jacobian matrix, or finding the root of equations. In this article, our objectives are threefold: (1 to demonstrate the potential of using R for dynamic modeling, (2 to highlight typical uses of the different methods implemented and (3 to compare the performance of models specified in R code and in compiled code for a number of test cases. These comparisons demonstrate that, if the use of loops is avoided, R code can efficiently integrate problems comprising several thousands of state variables. Nevertheless, the same problem may be solved from 2 to more than 50 times faster by using compiled code compared to an implementation using only R code. Still, amongst the benefits of R are a more flexible and interactive implementation, better readability of the code, and access to R’s high-level procedures. deSolve is the successor of package odesolve which will be deprecated in
Chen, Xiao; Yang, Yang; Cai, Xiaoying; Auger, Daniel A; Meyer, Craig H; Salerno, Michael; Epstein, Frederick H
2016-06-14
Cine Displacement Encoding with Stimulated Echoes (DENSE) provides accurate quantitative imaging of cardiac mechanics with rapid displacement and strain analysis; however, image acquisition times are relatively long. Compressed sensing (CS) with parallel imaging (PI) can generally provide high-quality images recovered from data sampled below the Nyquist rate. The purposes of the present study were to develop CS-PI-accelerated acquisition and reconstruction methods for cine DENSE, to assess their accuracy for cardiac imaging using retrospective undersampling, and to demonstrate their feasibility for prospectively-accelerated 2D cine DENSE imaging in a single breathhold. An accelerated cine DENSE sequence with variable-density spiral k-space sampling and golden angle rotations through time was implemented. A CS method, Block LOw-rank Sparsity with Motion-guidance (BLOSM), was combined with sensitivity encoding (SENSE) for the reconstruction of under-sampled multi-coil spiral data. Seven healthy volunteers and 7 patients underwent 2D cine DENSE imaging with fully-sampled acquisitions (14-26 heartbeats in duration) and with prospectively rate-2 and rate-4 accelerated acquisitions (14 and 8 heartbeats in duration). Retrospectively- and prospectively-accelerated data were reconstructed using BLOSM-SENSE and SENSE. Image quality of retrospectively-undersampled data was quantified using the relative root mean square error (rRMSE). Myocardial displacement and circumferential strain were computed for functional assessment, and linear correlation and Bland-Altman analyses were used to compare accelerated acquisitions to fully-sampled reference datasets. For retrospectively-undersampled data, BLOSM-SENSE provided similar or lower rRMSE at rate-2 and lower rRMSE at rate-4 acceleration compared to SENSE (p cine DENSE provided good image quality and expected values of displacement and strain. BLOSM-SENSE-accelerated spiral cine DENSE imaging with 2D displacement encoding can be
Multicontextual correlates of energy-dense, nutrient-poor snack food consumption by adolescents.
Larson, Nicole; Miller, Jonathan M; Eisenberg, Marla E; Watts, Allison W; Story, Mary; Neumark-Sztainer, Dianne
2017-05-01
Frequent consumption of energy-dense, nutrient-poor snack foods is an eating behavior of public health concern. This study was designed to inform strategies for reducing adolescent intake of energy-dense snack foods by identifying individual and environmental influences. Surveys were completed in 2009-2010 by 2540 adolescents (54% females, mean age = 14.5 ± 2.0, 80% nonwhite) in Minneapolis-St. Paul, Minnesota schools. Daily servings of energy-dense snack food was assessed using a food frequency questionnaire that asked about consumption of 21 common snack food items, such as potato chips, cookies, and candy. Data representing characteristics of adolescents' environments were collected from parents/caregivers, friends, school personnel, Geographic Information System sources, and a content analysis of favorite television shows. Linear regression was used to examine relationships between each individual or environmental characteristic and snack food consumption in separate models and also to examine relationships in a model including all of the characteristics simultaneously. The factors found to be significantly associated with higher energy-dense snack food intake represented individual attitudes/behaviors (e.g., snacking while watching television) and characteristics of home/family (e.g., home unhealthy food availability), peer (friends' energy-dense snack food consumption), and school (e.g., student snack consumption norms) environments. In total, 25.5% of the variance in adolescents' energy-dense snack food consumption was explained when factors from within each context were examined together. The results suggest that the design of interventions targeting improvement in the dietary quality of adolescents' snack food choices should address relevant individual factors (e.g., eating while watching television) along with characteristics of their home/family (e.g., limiting the availability of unhealthy foods), peer (e.g., guiding the efforts of a peer leader in
Cognitive functioning and social problem-solving skills in schizophrenia.
Hatashita-Wong, Michi; Smith, Thomas E; Silverstein, Steven M; Hull, James W; Willson, Deborah F
2002-05-01
This study examined the relationships between symptoms, cognitive functioning, and social skill deficits in schizophrenia. Few studies have incorporated measures of cognitive functioning and symptoms in predictive models for social problem solving. For our study, 44 participants were recruited from consecutive outpatient admissions. Neuropsychological tests were given to assess cognitive function, and social problem solving was assessed using structured vignettes designed to evoke the participant's ability to generate, evaluate, and apply solutions to social problems. A sequential model-fitting method of analysis was used to incorporate social problem solving, symptom presentation, and cognitive impairment into linear regression models. Predictor variables were drawn from demographic, cognitive, and symptom domains. Because this method of analysis was exploratory and not intended as hierarchical modelling, no a priori hypotheses were proposed. Participants with higher scores on tests of cognitive flexibility were better able to generate accurate, appropriate, and relevant responses to the social problem-solving vignettes. The results suggest that cognitive flexibility is a potentially important mediating factor in social problem-solving competence. While other factors are related to social problem-solving skill, this study supports the importance of cognition and understanding how it relates to the complex and multifaceted nature of social functioning.
Problem solving skills for schizophrenia.
Xia, J; Li, Chunbo
2007-04-18
The severe and long-lasting symptoms of schizophrenia are often the cause of severe disability. Environmental stress such as life events and the practical problems people face in their daily can worsen the symptoms of schizophrenia. Deficits in problem solving skills in people with schizophrenia affect their independent and interpersonal functioning and impair their quality of life. As a result, therapies such as problem solving therapy have been developed to improve problem solving skills for people with schizophrenia. To review the effectiveness of problem solving therapy compared with other comparable therapies or routine care for those with schizophrenia. We searched the Cochrane Schizophrenia Group's Register (September 2006), which is based on regular searches of BIOSIS, CENTRAL, CINAHL, EMBASE, MEDLINE and PsycINFO. We inspected references of all identified studies for further trials. We included all clinical randomised trials comparing problem solving therapy with other comparable therapies or routine care. We extracted data independently. For homogenous dichotomous data we calculated random effects, relative risk (RR), 95% confidence intervals (CI) and, where appropriate, numbers needed to treat (NNT) on an intention-to-treat basis. For continuous data, we calculated weighted mean differences (WMD) using a random effects statistical model. We included only three small trials (n=52) that evaluated problem solving versus routine care, coping skills training or non-specific interaction. Inadequate reporting of data rendered many outcomes unusable. We were unable to undertake meta-analysis. Overall results were limited and inconclusive with no significant differences between treatment groups for hospital admission, mental state, behaviour, social skills or leaving the study early. No data were presented for global state, quality of life or satisfaction. We found insufficient evidence to confirm or refute the benefits of problem solving therapy as an additional
Foundations of linear and generalized linear models
Agresti, Alan
2015-01-01
A valuable overview of the most important ideas and results in statistical analysis Written by a highly-experienced author, Foundations of Linear and Generalized Linear Models is a clear and comprehensive guide to the key concepts and results of linear statistical models. The book presents a broad, in-depth overview of the most commonly used statistical models by discussing the theory underlying the models, R software applications, and examples with crafted models to elucidate key ideas and promote practical model building. The book begins by illustrating the fundamentals of linear models,
Applied linear algebra and matrix analysis
Shores, Thomas S
2018-01-01
In its second edition, this textbook offers a fresh approach to matrix and linear algebra. Its blend of theory, computational exercises, and analytical writing projects is designed to highlight the interplay between these aspects of an application. This approach places special emphasis on linear algebra as an experimental science that provides tools for solving concrete problems. The second edition’s revised text discusses applications of linear algebra like graph theory and network modeling methods used in Google’s PageRank algorithm. Other new materials include modeling examples of diffusive processes, linear programming, image processing, digital signal processing, and Fourier analysis. These topics are woven into the core material of Gaussian elimination and other matrix operations; eigenvalues, eigenvectors, and discrete dynamical systems; and the geometrical aspects of vector spaces. Intended for a one-semester undergraduate course without a strict calculus prerequisite, Applied Linear Algebra and M...
Genetics problem solving and worldview
Dale, Esther
The research goal was to determine whether worldview relates to traditional and real-world genetics problem solving. Traditionally, scientific literacy emphasized content knowledge alone because it was sufficient to solve traditional problems. The contemporary definition of scientific literacy is, "The knowledge and understanding of scientific concepts and processes required for personal decision-making, participation in civic and cultural affairs and economic productivity" (NRC, 1996). An expanded definition of scientific literacy is needed to solve socioscientific issues (SSI), complex social issues with conceptual, procedural, or technological associations with science. Teaching content knowledge alone assumes that students will find the scientific explanation of a phenomenon to be superior to a non-science explanation. Formal science and everyday ways of thinking about science are two different cultures (Palmer, 1999). Students address this rift with cognitive apartheid, the boxing away of science knowledge from other types of knowledge (Jedege & Aikenhead, 1999). By addressing worldview, cognitive apartheid may decrease and scientific literacy may increase. Introductory biology students at the University of Minnesota during fall semester 2005 completed a written questionnaire-including a genetics content-knowledge test, four genetic dilemmas, the Worldview Assessment Instrument (WAI) and some items about demographics and religiosity. Six students responded to the interview protocol. Based on statistical analysis and interview data, this study concluded the following: (1) Worldview, in the form of metaphysics, relates to solving traditional genetic dilemmas. (2) Worldview, in the form of agency, relates to solving traditional genetics problems. (3) Thus, worldview must be addressed in curriculum, instruction, and assessment.
Mining connected global and local dense subgraphs for bigdata
Wu, Bo; Shen, Haiying
2016-01-01
The problem of discovering connected dense subgraphs of natural graphs is important in data analysis. Discovering dense subgraphs that do not contain denser subgraphs or are not contained in denser subgraphs (called significant dense subgraphs) is also critical for wide-ranging applications. In spite of many works on discovering dense subgraphs, there are no algorithms that can guarantee the connectivity of the returned subgraphs or discover significant dense subgraphs. Hence, in this paper, we define two subgraph discovery problems to discover connected and significant dense subgraphs, propose polynomial-time algorithms and theoretically prove their validity. We also propose an algorithm to further improve the time and space efficiency of our basic algorithm for discovering significant dense subgraphs in big data by taking advantage of the unique features of large natural graphs. In the experiments, we use massive natural graphs to evaluate our algorithms in comparison with previous algorithms. The experimental results show the effectiveness of our algorithms for the two problems and their efficiency. This work is also the first that reveals the physical significance of significant dense subgraphs in natural graphs from different domains.
Dense chlorinated solvents and other DNAPLs in groundwater
DEFF Research Database (Denmark)
Broholm, K.
1996-01-01
Anmeldelse af Pankow,J.F. & Cherry,J.A.: Dense chlorinated solvents and other DNAPLs in groundwater. Waterloo Press, Portland, Oregon, USA, 1996......Anmeldelse af Pankow,J.F. & Cherry,J.A.: Dense chlorinated solvents and other DNAPLs in groundwater. Waterloo Press, Portland, Oregon, USA, 1996...
Dry processing versus dense medium processing for preparing thermal coal
CSIR Research Space (South Africa)
De Korte, GJ
2013-10-01
Full Text Available of the final product. The separation efficiency of dry processes is, however, not nearly as good as that of dense medium and, as a result, it is difficult to effectively beneficiate coals with a high near-dense content. The product yield obtained from some raw...
Interparticle interaction and transport processes in dense semiclassical plasmas
International Nuclear Information System (INIS)
Baimbetov, F.B.; Giniyatova, Sh.G.
2005-01-01
On the basis of the density response formalism an expression for the pseudopotential of dense semiclassical plasma, which takes account of quantum-mechanical effects, local field corrections, and electronic screening effects is obtained. The static structure factors taking into account both local fields and quantum-mechanical effects are calculated. An electrical conductivity, thermal conductivity, and viscosity of dense semiclassical plasma are studied
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.
Review on solving the forward problem in EEG source analysis
Directory of Open Access Journals (Sweden)
Vergult Anneleen
2007-11-01
Full Text Available Abstract Background The aim of electroencephalogram (EEG source localization is to find the brain areas responsible for EEG waves of interest. It consists of solving forward and inverse problems. The forward problem is solved by starting from a given electrical source and calculating the potentials at the electrodes. These evaluations are necessary to solve the inverse problem which is defined as finding brain sources which are responsible for the measured potentials at the EEG electrodes. Methods While other reviews give an extensive summary of the both forward and inverse problem, this review article focuses on different aspects of solving the forward problem and it is intended for newcomers in this research field. Results It starts with focusing on the generators of the EEG: the post-synaptic potentials in the apical dendrites of pyramidal neurons. These cells generate an extracellular current which can be modeled by Poisson's differential equation, and Neumann and Dirichlet boundary conditions. The compartments in which these currents flow can be anisotropic (e.g. skull and white matter. In a three-shell spherical head model an analytical expression exists to solve the forward problem. During the last two decades researchers have tried to solve Poisson's equation in a realistically shaped head model obtained from 3D medical images, which requires numerical methods. The following methods are compared with each other: the boundary element method (BEM, the finite element method (FEM and the finite difference method (FDM. In the last two methods anisotropic conducting compartments can conveniently be introduced. Then the focus will be set on the use of reciprocity in EEG source localization. It is introduced to speed up the forward calculations which are here performed for each electrode position rather than for each dipole position. Solving Poisson's equation utilizing FEM and FDM corresponds to solving a large sparse linear system. Iterative
Acoustic modes in dense dusty plasmas
International Nuclear Information System (INIS)
Avinash, K.; Bhattacharjee, A.; Hu, S.
2002-01-01
Properties of acoustic modes in high dust density dusty plasmas are studied. The solutions of fluid equations for electrons, ions, and dust grains with collisional and ionization effects are solved along with an equation for grain charging. The high dust density effects on the acoustic modes are interpreted in terms of a change in the screening properties of the grain charge. At low dust density, the grain charge is screened due to electrons and ions. However, at high dust density, the screening of the grain charge due to other grains also becomes important. This leads to a reduction of the phase-velocity, which in turn is shown to make the plasma more unstable at high dust density. In this regime the role of the ion acoustic mode is replaced by the charging mode. The relevance of these results to earlier theoretical studies and experimental results are discussed
16. Hot dense plasma atomic processes
International Nuclear Information System (INIS)
Werner, Dappen; Totsuji, H.; Nishii, Y.
2002-01-01
This document gathers 13 articles whose common feature is to deal with atomic processes in hot plasmas. Density functional molecular dynamics method is applied to the hydrogen plasma in the domain of liquid metallic hydrogen. The effects of the density gradient are taken into account in both the electronic kinetic energy and the exchange energy and it is shown that they almost cancel with each other, extending the applicability of the Thomas-Fermi-Dirac approximation to the cases where the density gradient is not negligible. Another article reports about space and time resolved M-shell X-ray measurements of a laser-produced gas jet xenon plasma. Plasma parameters have been measured by ion acoustic and electron plasma waves Thomson scattering. Photo-ionization becomes a dominant atomic process when the density and the temperature of plasmas are relatively low and when the plasma is submitted to intense external radiation. It is shown that 2 plasmas which have a very different density but have the same ionization parameters, are found in a similar ionization state. Most radiation hydrodynamics codes use radiative opacity data from available libraries of atomic data. Several articles are focused on the determination of one group Rosseland and Planck mean analytical formulas for several single elements used in inertial fusion targets. In another paper the plasma density effect on population densities, effective ionization, recombination rate coefficients and on emission lines from carbon and Al ions in hot dense plasma, is studied. The last article is devoted to a new atomic model in plasmas that considers the occupation probability of the bound state and free state density in the presence of the plasma micro-field. (A.C.)
DENSE MOLECULAR CORES BEING EXTERNALLY HEATED
Energy Technology Data Exchange (ETDEWEB)
Kim, Gwanjeong; Lee, Chang Won; Kim, Mi-Ryang [Radio Astronomy division, Korea Astronomy and Space Science Institute, 776 Daedeokdae-ro, Yuseong-gu, Daejeon, 34055 (Korea, Republic of); Gopinathan, Maheswar [Aryabhatta Research Institute of Observational Sciences, Manora Peak, Nainital 263129 (India); Jeong, Woong-Seob, E-mail: archer81@kasi.re.kr [Department of Astronomy and Space Science, University of Science and Technology, 217 Gajungro, Yuseong-gu, Daejeon, 34113 (Korea, Republic of)
2016-06-20
We present results of our study of eight dense cores, previously classified as starless, using infrared (3–160 μ m) imaging observations with the AKARI telescope and molecular line (HCN and N{sub 2}H{sup +}) mapping observations with the KVN telescope. Combining our results with the archival IR to millimeter continuum data, we examined the starless nature of these eight cores. Two of the eight cores are found to harbor faint protostars having luminosities of ∼0.3–4.4 L {sub ⊙}. The other six cores are found to remain starless and probably are in a dynamically transitional state. The temperature maps produced using multi-wavelength images show an enhancement of about 3–6 K toward the outer boundary of these cores, suggesting that they are most likely being heated externally by nearby stars and/or interstellar radiation fields. Large virial parameters and an overdominance of red asymmetric line profiles over the cores may indicate that the cores are set into either an expansion or an oscillatory motion, probably due to the external heating. Most of the starless cores show a coreshine effect due to the scattering of light by the micron-sized dust grains. This may imply that the age of the cores is of the order of ∼10{sup 5} years, which is consistent with the timescale required for the cores to evolve into an oscillatory stage due to external perturbation. Our observational results support the idea that the external feedback from nearby stars and/or interstellar radiation fields may play an important role in the dynamical evolution of the cores.
Energy Technology Data Exchange (ETDEWEB)
Farcy, P.; Roger, J.; Pointud, R.
1958-04-15
The authors report a study aimed at the fabrication of large and dense lithium fluoride panels. This sintered lithium fluoride is then supposed to be used for the construction of barriers of protection against a flow of thermal neutrons. They briefly present the raw material which is used under the form of chamotte obtained through a pre-sintering process which is also described. Grain size measurements and sample preparation are indicated. Shaping, drying, and thermal treatment are briefly described, and characteristics of the sintered product are indicated.
Directory of Open Access Journals (Sweden)
Franco Mazzenga
2017-10-01
Full Text Available One distinctive feature of the next 5G systems is the presence of a dense/ultra-dense wireless access network with a large number of access points (or nodes at short distances from each other. Dense/ultra-dense access networks allow for providing very high transmission capacity to terminals. However, the deployment of dense/ultra-dense networks is slowed down by the cost of the fiber-based infrastructure required to connect radio nodes to the central processing units and then to the core network. In this paper, we investigate the possibility for existing FttC access networks to provide fronthaul capabilities for dense/ultra-dense 5G wireless networks. The analysis is realistic in that it is carried out considering an actual access network scenario, i.e., the Italian FttC deployment. It is assumed that access nodes are connected to the Cabinets and to the corresponding distributors by a number of copper pairs. Different types of cities grouped in terms of population have been considered. Results focus on fronthaul transport capacity provided by the FttC network and have been expressed in terms of the available fronthaul bit rate per node and of the achievable coverage.
CSIR Research Space (South Africa)
Motara, YM
2017-09-01
Full Text Available the intersection between the SHA-1 preimage problem, the encoding of that problem for SAT-solving, and SAT-solving. The results demonstrate that SAT-solving is not yet a viable approach to take to solve the preimage problem, and also indicate that some...
Assessing Algebraic Solving Ability: A Theoretical Framework
Lian, Lim Hooi; Yew, Wun Thiam
2012-01-01
Algebraic solving ability had been discussed by many educators and researchers. There exists no definite definition for algebraic solving ability as it can be viewed from different perspectives. In this paper, the nature of algebraic solving ability in terms of algebraic processes that demonstrate the ability in solving algebraic problem is…
Methods of solving nonstandard problems
Grigorieva, Ellina
2015-01-01
This book, written by an accomplished female mathematician, is the second to explore nonstandard mathematical problems – those that are not directly solved by standard mathematical methods but instead rely on insight and the synthesis of a variety of mathematical ideas. It promotes mental activity as well as greater mathematical skills, and is an ideal resource for successful preparation for the mathematics Olympiad. Numerous strategies and techniques are presented that can be used to solve intriguing and challenging problems of the type often found in competitions. The author uses a friendly, non-intimidating approach to emphasize connections between different fields of mathematics and often proposes several different ways to attack the same problem. Topics covered include functions and their properties, polynomials, trigonometric and transcendental equations and inequalities, optimization, differential equations, nonlinear systems, and word problems. Over 360 problems are included with hints, ...
Confluent-Functional solving systems
Directory of Open Access Journals (Sweden)
V.N. Koval
2001-08-01
Full Text Available The paper proposes a statistical knowledge-acquision approach. The solving systems are considered, which are able to find unknown structural dependences between situational and transforming variables on the basis of statistically analyzed input information. Situational variables describe features, states and relations between environment objects. Transforming variables describe transforming influences, exerted by a goal-oriented system onto an environment. Unknown environment rules are simulated by a structural equations system, associating situational and transforming variables.
The deviatoric response of three dense glasses under shock loading conditions
International Nuclear Information System (INIS)
Radford, D.D.; Proud, W.G.; Field, J.E.
2002-01-01
In-material longitudinal and lateral stress histories in three dense, silica-based glasses were directly measured by embedded manganin stress gauges during plate impact experiments. Lateral stress profiles in all of the materials show evidence of failure fronts that behave in a similar manner to those observed in open-structured glasses. The measured stress histories were used to calculate the deviatoric responses and results indicate that ahead of the failure front the shear stress increases linearly along the estimated elastic response. Behind the failure front, however, the shear stress appears to first decrease and then increase as the pressure increases, contrary to a previous interpretation
International Nuclear Information System (INIS)
Holst, Bastian; French, Martin; Redmer, Ronald
2011-01-01
Using Kubo's linear response theory, we derive expressions for the frequency-dependent electrical conductivity (Kubo-Greenwood formula), thermopower, and thermal conductivity in a strongly correlated electron system. These are evaluated within ab initio molecular dynamics simulations in order to study the thermoelectric transport coefficients in dense liquid hydrogen, especially near the nonmetal-to-metal transition region. We also observe significant deviations from the widely used Wiedemann-Franz law, which is strictly valid only for degenerate systems, and give an estimate for its valid scope of application toward lower densities.
Embodied, Symbolic and Formal Thinking in Linear Algebra
Stewart, Sepideh; Thomas, Michael O. J.
2007-01-01
Students often find their first university linear algebra experience very challenging. While coping with procedural aspects of the subject, solving linear systems and manipulating matrices, they may struggle with crucial conceptual ideas underpinning them, making it very difficult to progress in more advanced courses. This research has sought to…
A Fuzzy Linear Programming Approach for Aggregate Production Planning
DEFF Research Database (Denmark)
Iris, Cagatay; Cevikcan, Emre
2014-01-01
a mathematical programming framework for aggregate production planning problem under imprecise data environment. After providing background information about APP problem, together with fuzzy linear programming, the fuzzy linear programming model of APP is solved on an illustrative example for different a...
A property of assignment type mixed integer linear programming problems
Benders, J.F.; van Nunen, J.A.E.E.
1982-01-01
In this paper we will proof that rather tight upper bounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer linear assignment problems. Since in these cases the number of splitted assignments is
Dense magnetized plasma associated with a fast radio burst.
Masui, Kiyoshi; Lin, Hsiu-Hsien; Sievers, Jonathan; Anderson, Christopher J; Chang, Tzu-Ching; Chen, Xuelei; Ganguly, Apratim; Jarvis, Miranda; Kuo, Cheng-Yu; Li, Yi-Chao; Liao, Yu-Wei; McLaughlin, Maura; Pen, Ue-Li; Peterson, Jeffrey B; Roman, Alexander; Timbie, Peter T; Voytek, Tabitha; Yadav, Jaswant K
2015-12-24
Fast radio bursts are bright, unresolved, non-repeating, broadband, millisecond flashes, found primarily at high Galactic latitudes, with dispersion measures much larger than expected for a Galactic source. The inferred all-sky burst rate is comparable to the core-collapse supernova rate out to redshift 0.5. If the observed dispersion measures are assumed to be dominated by the intergalactic medium, the sources are at cosmological distances with redshifts of 0.2 to 1 (refs 10 and 11). These parameters are consistent with a wide range of source models. One fast burst revealed circular polarization of the radio emission, but no linear polarization was detected, and hence no Faraday rotation measure could be determined. Here we report the examination of archival data revealing Faraday rotation in the fast radio burst FRB 110523. Its radio flux and dispersion measure are consistent with values from previously reported bursts and, accounting for a Galactic contribution to the dispersion and using a model of intergalactic electron density, we place the source at a maximum redshift of 0.5. The burst has a much higher rotation measure than expected for this line of sight through the Milky Way and the intergalactic medium, indicating magnetization in the vicinity of the source itself or within a host galaxy. The pulse was scattered by two distinct plasma screens during propagation, which requires either a dense nebula associated with the source or a location within the central region of its host galaxy. The detection in this instance of magnetization and scattering that are both local to the source favours models involving young stellar populations such as magnetars over models involving the mergers of older neutron stars, which are more likely to be located in low-density regions of the host galaxy.
Induction linear accelerators for commercial photon irradiation processing
International Nuclear Information System (INIS)
Matthews, S.M.
1989-01-01
A number of proposed irradiation processes requires bulk rather than surface exposure with intense applications of ionizing radiation. Typical examples are irradiation of food packaged into pallet size containers, processing of sewer sludge for recycling as landfill and fertilizer, sterilization of prepackaged medical disposals, treatment of municipal water supplies for pathogen reduction, etc. Volumetric processing of dense, bulky products with ionizing radiation requires high energy photon sources because electrons are not penetrating enough to provide uniform bulk dose deposition in thick, dense samples. Induction Linear Accelerator (ILA) technology developed at the Lawrence Livermore National Laboratory promises to play a key role in providing solutions to this problem. This is discussed in this paper
Rates of Thermonuclear Reactions in Dense Plasmas
International Nuclear Information System (INIS)
Tsytovich, V.N.; Bornatici, M.
2000-01-01
The problem of plasma screening of thermonuclear reactions has attracted considerable scientific interest ever since Salpeter's seminal paper, but it is still faced with controversial statements and without any definite conclusion. It is of relevant importance to thermonuclear reactions in dense astrophysical plasmas, for which charge screening can substantially affect the reaction rates. Whereas Salpeter and a number of subsequent investigations have dealt with static screening, Carraro, Schafer, and Koonin have drawn attention to the fact that plasma screening of thermonuclear reactions is an essentially dynamic effect. In addressing the issue of collective plasma effects on the thermonuclear reaction rates, the first critical overview of most of the work carried out so far is presented and the validity of the test particle approach is assessed. In contrast to previous investigations, we base our description on the kinetic equation for nonequilibrium plasmas, which accounts for the effects on the rates of thermonuclear reactions of both plasma fluctuations and screening and allows one to analyze explicitly the effects of the fluctuations on the reaction rates. Such a kinetic formulation is more general than both Salpeter's approach and the recently developed statistical approaches and makes it possible to obtain a more comprehensive understanding of the problem. A noticeable result of the fluctuation approach is that the static screening, which affects both the interaction and the self-energy of the reacting nuclei, does not affect the reaction rates, in contrast with the results obtained so far. Instead, a reduction of the thermonuclear reaction rates is obtained as a result of the effect of plasma fluctuations related to the free self-energy of the reacting nuclei. A simple physical explanation of the slowing down of the reaction rates is given, and the relation to the dynamically screened test particle approach is discussed. Corrections to the reaction rates
Neutrino reactions in hot and dense matter
International Nuclear Information System (INIS)
Lohs, Andreas
2015-01-01
In this thesis, neutrino reactions in hot and dense matter are studied. In particular, this work is concerned with neutrino-matter interactions that are relevant for neutrino transport in core-collapse supernovae (CCSNe). The majority of the energy from a CCSN is released in the form of neutrinos. Accurate understanding and computation of these interactions is most relevant to achieve sufficiently reliable predictions for the evolution of CCSNe and other related question such as the production of heavy elements or neutrino oscillations. For this purpose this work follows the combined approach of searching for new important neutrino reactions and improving the computation of those reactions that are already implemented. First we estimate the relevance of charged-current weak interactions that include muon-neutrinos or muons, as well as the role of neutron decay for neutrino transport in CCSNe. All of these reactions were previously neglected in CCSN-simulations. We derive and compute the matrix element and subsequent semi-analytic expressions for transport properties like the inverse mean free path of the new reactions. It is found that these reactions are important for muon neutrinos and low energy electron antineutrinos at very high densities in the protoneutron star surface. Consequently their implementation might lead to several changes in the prediction of CCSNe signatures such as the nucleosynthesis yields. Second we improve the precision in the computation of well known neutrino-nucleon reactions like neutrino absorption on neutrons. We derive semi-analytic expressions for transport properties that use less restrictive approximations while keeping the computational demand constant. Therefore we consider the full relativistic kinematics of all participating particles i.e. allowing for relativistic nucleons and finite lepton masses. Also the weak magnetism terms of the matrix elements are explicitly included to all orders. From our results we suggest that the
Neutrino reactions in hot and dense matter
Energy Technology Data Exchange (ETDEWEB)
Lohs, Andreas
2015-04-13
In this thesis, neutrino reactions in hot and dense matter are studied. In particular, this work is concerned with neutrino-matter interactions that are relevant for neutrino transport in core-collapse supernovae (CCSNe). The majority of the energy from a CCSN is released in the form of neutrinos. Accurate understanding and computation of these interactions is most relevant to achieve sufficiently reliable predictions for the evolution of CCSNe and other related question such as the production of heavy elements or neutrino oscillations. For this purpose this work follows the combined approach of searching for new important neutrino reactions and improving the computation of those reactions that are already implemented. First we estimate the relevance of charged-current weak interactions that include muon-neutrinos or muons, as well as the role of neutron decay for neutrino transport in CCSNe. All of these reactions were previously neglected in CCSN-simulations. We derive and compute the matrix element and subsequent semi-analytic expressions for transport properties like the inverse mean free path of the new reactions. It is found that these reactions are important for muon neutrinos and low energy electron antineutrinos at very high densities in the protoneutron star surface. Consequently their implementation might lead to several changes in the prediction of CCSNe signatures such as the nucleosynthesis yields. Second we improve the precision in the computation of well known neutrino-nucleon reactions like neutrino absorption on neutrons. We derive semi-analytic expressions for transport properties that use less restrictive approximations while keeping the computational demand constant. Therefore we consider the full relativistic kinematics of all participating particles i.e. allowing for relativistic nucleons and finite lepton masses. Also the weak magnetism terms of the matrix elements are explicitly included to all orders. From our results we suggest that the
Dense-gas dispersion advection-diffusion model
International Nuclear Information System (INIS)
Ermak, D.L.
1992-07-01
A dense-gas version of the ADPIC particle-in-cell, advection- diffusion model was developed to simulate the atmospheric dispersion of denser-than-air releases. In developing the model, it was assumed that the dense-gas effects could be described in terms of the vertically-averaged thermodynamic properties and the local height of the cloud. The dense-gas effects were treated as a perturbation to the ambient thermodynamic properties (density and temperature), ground level heat flux, turbulence level (diffusivity), and windfield (gravity flow) within the local region of the dense-gas cloud. These perturbations were calculated from conservation of energy and conservation of momentum principles along with the ideal gas law equation of state for a mixture of gases. ADPIC, which is generally run in conjunction with a mass-conserving wind flow model to provide the advection field, contains all the dense-gas modifications within it. This feature provides the versatility of coupling the new dense-gas ADPIC with alternative wind flow models. The new dense-gas ADPIC has been used to simulate the atmospheric dispersion of ground-level, colder-than-ambient, denser-than-air releases and has compared favorably with the results of field-scale experiments
Finding Hierarchical and Overlapping Dense Subgraphs using Nucleus Decompositions
Energy Technology Data Exchange (ETDEWEB)
Seshadhri, Comandur [The Ohio State Univ., Columbus, OH (United States); Pinar, Ali [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sariyuce, Ahmet Erdem [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Catalyurek, Umit [The Ohio State Univ., Columbus, OH (United States)
2014-11-01
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique, k-densest subgraph) are NP-hard. Furthermore, the goal is rarely to nd the \\true optimum", but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine a hierarchical structure among them. Current dense subgraph nding algorithms usually optimize some objective, and only nd a few such subgraphs without providing any hierarchy. It is also not clear how to account for overlaps in dense substructures. We de ne the nucleus decomposition of a graph, which represents the graph as a forest of nuclei. Each nucleus is a subgraph where smaller cliques are present in many larger cliques. The forest of nuclei is a hierarchy by containment, where the edge density increases as we proceed towards leaf nuclei. Sibling nuclei can have limited intersections, which allows for discovery of overlapping dense subgraphs. With the right parameters, the nuclear decomposition generalizes the classic notions of k-cores and k-trusses. We give provable e cient algorithms for nuclear decompositions, and empirically evaluate their behavior in a variety of real graphs. The tree of nuclei consistently gives a global, hierarchical snapshot of dense substructures, and outputs dense subgraphs of higher quality than other state-of-theart solutions. Our algorithm can process graphs with tens of millions of edges in less than an hour.
Sloss, J. M.; Kranzler, S. K.
1972-01-01
The equivalence of a considered integral equation form with an infinite system of linear equations is proved, and the localization of the eigenvalues of the infinite system is expressed. Error estimates are derived, and the problems of finding upper bounds and lower bounds for the eigenvalues are solved simultaneously.