Knowledge based method for solving complexity in design problems
Vermeulen, B.
2007-01-01
The process of design aircraft systems is becoming more and more complex, due to an increasing amount of requirements. Moreover, the knowledge on how to solve these complex design problems becomes less readily available, because of a decrease in availability of intellectual resources and reduced
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....
Developing a Blended Learning-Based Method for Problem-Solving in Capability Learning
Dwiyogo, Wasis D.
2018-01-01
The main objectives of the study were to develop and investigate the implementation of blended learning based method for problem-solving. Three experts were involved in the study and all three had stated that the model was ready to be applied in the classroom. The implementation of the blended learning-based design for problem-solving was…
EP BASED PSO METHOD FOR SOLVING PROFIT BASED MULTI AREA UNIT COMMITMENT PROBLEM
Directory of Open Access Journals (Sweden)
K. VENKATESAN
2015-04-01
Full Text Available This paper presents a new approach to solve the profit based multi area unit commitment problem (PBMAUCP using an evolutionary programming based particle swarm optimization (EPPSO method. The objective of this paper is to maximize the profit of generation companies (GENCOs with considering system social benefit. The proposed method helps GENCOs to make a decision, how much power and reserve should be sold in markets, and how to schedule generators in order to receive the maximum profit. Joint operation of generation resources can result in significant operational cost savings. Power transfer between the areas through the tie lines depends upon the operating cost of generation at each hour and tie line transfer limits. The tie line transfer limits were considered as a set of constraints during optimization process to ensure the system security and reliability. The overall algorithm can be implemented on an IBM PC, which can process a fairly large system in a reasonable period of time. Case study of four areas with different load pattern each containing 7 units (NTPS and 26 units connected via tie lines have been taken for analysis. Numerical results showed comparing the profit of evolutionary programming-based particle swarm optimization method (EPPSO with conventional dynamic programming (DP, evolutionary programming (EP, and particle swarm optimization (PSO method. Experimental results shows that the application of this evolutionary programming based particle swarm optimization method have the potential to solve profit based multi area unit commitment problem with lesser computation time.
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
Gomez, Fernando
1989-01-01
It is shown how certain kinds of domain independent expert systems based on classification problem-solving methods can be constructed directly from natural language descriptions by a human expert. The expert knowledge is not translated into production rules. Rather, it is mapped into conceptual structures which are integrated into long-term memory (LTM). The resulting system is one in which problem-solving, retrieval and memory organization are integrated processes. In other words, the same algorithm and knowledge representation structures are shared by these processes. As a result of this, the system can answer questions, solve problems or reorganize LTM.
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.
Teaching genetics using hands-on models, problem solving, and inquiry-based methods
Hoppe, Stephanie Ann
Teaching genetics can be challenging because of the difficulty of the content and misconceptions students might hold. This thesis focused on using hands-on model activities, problem solving, and inquiry-based teaching/learning methods in order to increase student understanding in an introductory biology class in the area of genetics. Various activities using these three methods were implemented into the classes to address any misconceptions and increase student learning of the difficult concepts. The activities that were implemented were shown to be successful based on pre-post assessment score comparison. The students were assessed on the subjects of inheritance patterns, meiosis, and protein synthesis and demonstrated growth in all of the areas. It was found that hands-on models, problem solving, and inquiry-based activities were more successful in learning concepts in genetics and the students were more engaged than tradition styles of lecture.
Energy Technology Data Exchange (ETDEWEB)
Wu Hongchun [Nuclear Engineering Department, Xi' an Jiaotong University, Xi' an 710049, Shaanxi (China)]. E-mail: hongchun@mail.xjtu.edu.cn; Liu Pingping [Nuclear Engineering Department, Xi' an Jiaotong University, Xi' an 710049, Shaanxi (China); Zhou Yongqiang [Nuclear Engineering Department, Xi' an Jiaotong University, Xi' an 710049, Shaanxi (China); Cao Liangzhi [Nuclear Engineering Department, Xi' an Jiaotong University, Xi' an 710049, Shaanxi (China)
2007-01-15
In the advanced reactor, the fuel assembly or core with unstructured geometry is frequently used and for calculating its fuel assembly, the transmission probability method (TPM) has been used widely. However, the rectangle or hexagon meshes are mainly used in the TPM codes for the normal core structure. The triangle meshes are most useful for expressing the complicated unstructured geometry. Even though finite element method and Monte Carlo method is very good at solving unstructured geometry problem, they are very time consuming. So we developed the TPM code based on the triangle meshes. The TPM code based on the triangle meshes was applied to the hybrid fuel geometry, and compared with the results of the MCNP code and other codes. The results of comparison were consistent with each other. The TPM with triangle meshes would thus be expected to be able to apply to the two-dimensional arbitrary fuel assembly.
Penalty Algorithm Based on Conjugate Gradient Method for Solving Portfolio Management Problem
Directory of Open Access Journals (Sweden)
Wang YaLin
2009-01-01
Full Text Available A new approach was proposed to reformulate the biobjectives optimization model of portfolio management into an unconstrained minimization problem, where the objective function is a piecewise quadratic polynomial. We presented some properties of such an objective function. Then, a class of penalty algorithms based on the well-known conjugate gradient methods was developed to find the solution of portfolio management problem. By implementing the proposed algorithm to solve the real problems from the stock market in China, it was shown that this algorithm is promising.
Model-based verification method for solving the parameter uncertainty in the train control system
International Nuclear Information System (INIS)
Cheng, Ruijun; Zhou, Jin; Chen, Dewang; Song, Yongduan
2016-01-01
This paper presents a parameter analysis method to solve the parameter uncertainty problem for hybrid system and explore the correlation of key parameters for distributed control system. For improving the reusability of control model, the proposed approach provides the support for obtaining the constraint sets of all uncertain parameters in the abstract linear hybrid automata (LHA) model when satisfying the safety requirements of the train control system. Then, in order to solve the state space explosion problem, the online verification method is proposed to monitor the operating status of high-speed trains online because of the real-time property of the train control system. Furthermore, we construct the LHA formal models of train tracking model and movement authority (MA) generation process as cases to illustrate the effectiveness and efficiency of the proposed method. In the first case, we obtain the constraint sets of uncertain parameters to avoid collision between trains. In the second case, the correlation of position report cycle and MA generation cycle is analyzed under both the normal and the abnormal condition influenced by packet-loss factor. Finally, considering stochastic characterization of time distributions and real-time feature of moving block control system, the transient probabilities of wireless communication process are obtained by stochastic time petri nets. - Highlights: • We solve the parameters uncertainty problem by using model-based method. • We acquire the parameter constraint sets by verifying linear hybrid automata models. • Online verification algorithms are designed to monitor the high-speed trains. • We analyze the correlation of key parameters and uncritical parameters. • The transient probabilities are obtained by using reliability analysis.
Problem Solving Method Based on E-Learning System for Engineering Education
Khazaal, Hasan F.
2015-01-01
Encouraging engineering students to handle advanced technology with multimedia, as well as motivate them to have the skills of solving the problem, are the missions of the teacher in preparing students for a modern professional career. This research proposes a scenario of problem solving in basic electrical circuits based on an e-learning system…
A method to solve the aircraft magnetic field model basing on geomagnetic environment simulation
International Nuclear Information System (INIS)
Lin, Chunsheng; Zhou, Jian-jun; Yang, Zhen-yu
2015-01-01
In aeromagnetic survey, it is difficult to solve the aircraft magnetic field model by flying for some unman controlled or disposable aircrafts. So a model solving method on the ground is proposed. The method simulates the geomagnetic environment where the aircraft is flying and creates the background magnetic field samples which is the same as the magnetic field arose by aircraft’s maneuvering. Then the aircraft magnetic field model can be solved by collecting the magnetic field samples. The method to simulate the magnetic environment and the method to control the errors are presented as well. Finally, an experiment is done for verification. The result shows that the model solving precision and stability by the method is well. The calculated model parameters by the method in one district can be used in worldwide districts as well. - Highlights: • A method to solve the aircraft magnetic field model on the ground is proposed. • The method solves the model by simulating dynamic geomagnetic environment as in the real flying. • The way to control the error of the method was analyzed. • An experiment is done for verification
A domain derivative-based method for solving elastodynamic inverse obstacle scattering problems
International Nuclear Information System (INIS)
Le Louër, Frédérique
2015-01-01
The present work is concerned with the shape reconstruction problem of isotropic elastic inclusions from far-field data obtained by the scattering of a finite number of time-harmonic incident plane waves. This paper aims at completing the theoretical framework which is necessary for the application of geometric optimization tools to the inverse transmission problem in elastodynamics. The forward problem is reduced to systems of boundary integral equations following the direct and indirect methods initially developed for solving acoustic transmission problems. We establish the Fréchet differentiability of the boundary to far-field operator and give a characterization of the first Fréchet derivative and its adjoint operator. Using these results we propose an inverse scattering algorithm based on the iteratively regularized Gauß–Newton method and show numerical experiments in the special case of star-shaped obstacles. (paper)
Neural Based Tabu Search method for solving unit commitment problem with cooling-banking constraints
Directory of Open Access Journals (Sweden)
Rajan Asir Christober Gnanakkan Charles
2009-01-01
Full Text Available This paper presents a new approach to solve short-term unit commitment problem (UCP using Neural Based Tabu Search (NBTS with cooling and banking constraints. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for next H hours. A 7-unit utility power system in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different IEEE test systems consist of 10, 26 and 34 units. Numerical results are shown to compare the superiority of the cost solutions obtained using the Tabu Search (TS method, Dynamic Programming (DP and Lagrangian Relaxation (LR methods in reaching proper unit commitment.
Jewpanich, Chaiwat; Piriyasurawong, Pallop
2015-01-01
This research aims to 1) develop the project-based learning using discussion and lesson-learned methods via social media model (PBL-DLL SoMe Model) used for enhancing problem solving skills of undergraduate in education student, and 2) evaluate the PBL-DLL SoMe Model used for enhancing problem solving skills of undergraduate in education student.…
An evolutionary programming based simulated annealing method for solving the unit commitment problem
Energy Technology Data Exchange (ETDEWEB)
Christober Asir Rajan, C. [Department of EEE, Pondicherry Engineering College, Pondicherry 605014 (India); Mohan, M.R. [Department of EEE, Anna University, Chennai 600 025 (India)
2007-09-15
This paper presents a new approach to solve the short-term unit commitment problem using an evolutionary programming based simulated annealing method. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimisation technique for solving unit commitment Problem, operates on a system, which is designed to encode each unit's operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all the units according to their initial status (''flat start''). Here the parents are obtained from a pre-defined set of solution's, i.e. each and every solution is adjusted to meet the requirements. Then, a random recommitment is carried out with respect to the unit's minimum down times. And SA improves the status. The best population is selected by evolutionary strategy. The Neyveli Thermal Power Station (NTPS) Unit-II in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different power systems consists of 10, 26, 34 generating units. Numerical results are shown comparing the cost solutions and computation time obtained by using the Evolutionary Programming method and other conventional methods like Dynamic Programming, Lagrangian Relaxation and Simulated Annealing and Tabu Search in reaching proper unit commitment. (author)
Finite element method for solving Kohn-Sham equations based on self-adaptive tetrahedral mesh
International Nuclear Information System (INIS)
Zhang Dier; Shen Lihua; Zhou Aihui; Gong Xingao
2008-01-01
A finite element (FE) method with self-adaptive mesh-refinement technique is developed for solving the density functional Kohn-Sham equations. The FE method adopts local piecewise polynomials basis functions, which produces sparsely structured matrices of Hamiltonian. The method is well suitable for parallel implementation without using Fourier transform. In addition, the self-adaptive mesh-refinement technique can control the computational accuracy and efficiency with optimal mesh density in different regions
Chen, Meixiong; Yuan, Jie; Long, Xingwu; Kang, Zhenglong; Wang, Zhiguo; Li, Yingying
2013-12-01
A general beam position controlling method for 3D optical systems based on the method of solving ray matrix equations has been proposed in this paper. As a typical 3D optical system, nonplanar ring resonator of Zero-Lock Laser Gyroscopes has been chosen as an example to show its application. The total mismatching error induced by Faraday-wedge in nonplanar ring resonator has been defined and eliminated quite accurately with the error less than 1 μm. Compared with the method proposed in Ref. [14], the precision of the beam position controlling has been improved by two orders of magnitude. The novel method can be used to implement automatic beam position controlling in 3D optical systems with servo circuit. All those results have been confirmed by related alignment experiments. The results in this paper are important for beam controlling, ray tracing, cavity design and alignment in 3D optical systems.
Alam Khan, Najeeb; Razzaq, Oyoon Abdul
2016-03-01
In the present work a wavelets approximation method is employed to solve fuzzy boundary value differential equations (FBVDEs). Essentially, a truncated Legendre wavelets series together with the Legendre wavelets operational matrix of derivative are utilized to convert FB- VDE into a simple computational problem by reducing it into a system of fuzzy algebraic linear equations. The capability of scheme is investigated on second order FB- VDE considered under generalized H-differentiability. Solutions are represented graphically showing competency and accuracy of this method.
Photonic band structures solved by a plane-wave-based transfer-matrix method.
Li, Zhi-Yuan; Lin, Lan-Lan
2003-04-01
Transfer-matrix methods adopting a plane-wave basis have been routinely used to calculate the scattering of electromagnetic waves by general multilayer gratings and photonic crystal slabs. In this paper we show that this technique, when combined with Bloch's theorem, can be extended to solve the photonic band structure for 2D and 3D photonic crystal structures. Three different eigensolution schemes to solve the traditional band diagrams along high-symmetry lines in the first Brillouin zone of the crystal are discussed. Optimal rules for the Fourier expansion over the dielectric function and electromagnetic fields with discontinuities occurring at the boundary of different material domains have been employed to accelerate the convergence of numerical computation. Application of this method to an important class of 3D layer-by-layer photonic crystals reveals the superior convergency of this different approach over the conventional plane-wave expansion method.
Photonic band structures solved by a plane-wave-based transfer-matrix method
International Nuclear Information System (INIS)
Li Zhiyuan; Lin Lanlan
2003-01-01
Transfer-matrix methods adopting a plane-wave basis have been routinely used to calculate the scattering of electromagnetic waves by general multilayer gratings and photonic crystal slabs. In this paper we show that this technique, when combined with Bloch's theorem, can be extended to solve the photonic band structure for 2D and 3D photonic crystal structures. Three different eigensolution schemes to solve the traditional band diagrams along high-symmetry lines in the first Brillouin zone of the crystal are discussed. Optimal rules for the Fourier expansion over the dielectric function and electromagnetic fields with discontinuities occurring at the boundary of different material domains have been employed to accelerate the convergence of numerical computation. Application of this method to an important class of 3D layer-by-layer photonic crystals reveals the superior convergency of this different approach over the conventional plane-wave expansion method
2012-09-03
27] introduced a new smoothness indicator, which removed the slight post- shock oscillations and improved the convergence . A Newton- iteration method... Gauss - Seidel algorithm for steady Euler equation on unstructured grids, Numer. Math. Theor. Meth. Appl., Vol. 1, pp. 92–112, (2008). [14] G.-S. Jiang...was adopted to solve the steady two dimensional Euler equations [10, 11, 13]. The matrix-free Squared Preconditioning is applied to a Newton iteration
Problem Solving Methods in Engineering Design
DEFF Research Database (Denmark)
Hartvig, Susanne C
1999-01-01
This short paper discusses typical engineering tasks and problem solving methods, based on a field study of engineering tasks at a Danish engineering firm. The field study has identified ten classes of design tasks and in this paper these classes are related to problem solving methods. The descri...
The complexity of interior point methods for solving discounted turn-based stochastic games
DEFF Research Database (Denmark)
Hansen, Thomas Dueholm; Ibsen-Jensen, Rasmus
2013-01-01
for general 2TBSGs. This implies that a number of interior point methods can be used to solve 2TBSGs. We consider two such algorithms: the unified interior point method of Kojima, Megiddo, Noma, and Yoshise, and the interior point potential reduction algorithm of Kojima, Megiddo, and Ye. The algorithms run...... states and discount factor γ we get κ=Θ(n(1−γ)2) , −δ=Θ(n√1−γ) , and 1/θ=Θ(n(1−γ)2) in the worst case. The lower bounds for κ, − δ, and 1/θ are all obtained using the same family of deterministic games....
International Nuclear Information System (INIS)
Zamirian, M.; Kamyad, A.V.; Farahi, M.H.
2009-01-01
In this Letter a new approach for solving optimal path planning problems for a single rigid and free moving object in a two and three dimensional space in the presence of stationary or moving obstacles is presented. In this approach the path planning problems have some incompatible objectives such as the length of path that must be minimized, the distance between the path and obstacles that must be maximized and etc., then a multi-objective dynamic optimization problem (MODOP) is achieved. Considering the imprecise nature of decision maker's (DM) judgment, these multiple objectives are viewed as fuzzy variables. By determining intervals for the values of these fuzzy variables, flexible monotonic decreasing or increasing membership functions are determined as the degrees of satisfaction of these fuzzy variables on their intervals. Then, the optimal path planning policy is searched by maximizing the aggregated fuzzy decision values, resulting in a fuzzy multi-objective dynamic optimization problem (FMODOP). Using a suitable t-norm, the FMODOP is converted into a non-linear dynamic optimization problem (NLDOP). By using parametrization method and some calculations, the NLDOP is converted into the sequence of conventional non-linear programming problems (NLPP). It is proved that the solution of this sequence of the NLPPs tends to a Pareto optimal solution which, among other Pareto optimal solutions, has the best satisfaction of DM for the MODOP. Finally, the above procedure as a novel algorithm integrating parametrization method and fuzzy aggregation to solve the MODOP is proposed. Efficiency of our approach is confirmed by some numerical examples.
Hai An; Ling Zhou; Hui Sun
2016-01-01
Aiming to resolve the problems of a variety of uncertainty variables that coexist in the engineering structure reliability analysis, a new hybrid reliability index to evaluate structural hybrid reliability, based on the random–fuzzy–interval model, is proposed in this article. The convergent solving method is also presented. First, the truncated probability reliability model, the fuzzy random reliability model, and the non-probabilistic interval reliability model are introduced. Then, the new...
A Decomposition-Based Pricing Method for Solving a Large-Scale MILP Model for an Integrated Fishery
Directory of Open Access Journals (Sweden)
M. Babul Hasan
2007-01-01
The IFP can be decomposed into a trawler-scheduling subproblem and a fish-processing subproblem in two different ways by relaxing different sets of constraints. We tried conventional decomposition techniques including subgradient optimization and Dantzig-Wolfe decomposition, both of which were unacceptably slow. We then developed a decomposition-based pricing method for solving the large fishery model, which gives excellent computation times. Numerical results for several planning horizon models are presented.
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, ...
Collaborative Problem Solving Methods towards Critical Thinking
Yin, Khoo Yin; Abdullah, Abdul Ghani Kanesan; Alazidiyeen, Naser Jamil
2011-01-01
This research attempts to examine the collaborative problem solving methods towards critical thinking based on economy (AE) and non economy (TE) in the SPM level among students in the lower sixth form. The quasi experiment method that uses the modal of 3X2 factorial is applied. 294 lower sixth form students from ten schools are distributed…
Parand, K.; Nikarya, M.
2017-11-01
In this paper a novel method will be introduced to solve a nonlinear partial differential equation (PDE). In the proposed method, we use the spectral collocation method based on Bessel functions of the first kind and the Jacobian free Newton-generalized minimum residual (JFNGMRes) method with adaptive preconditioner. In this work a nonlinear PDE has been converted to a nonlinear system of algebraic equations using the collocation method based on Bessel functions without any linearization, discretization or getting the help of any other methods. Finally, by using JFNGMRes, the solution of the nonlinear algebraic system is achieved. To illustrate the reliability and efficiency of the proposed method, we solve some examples of the famous Fisher equation. We compare our results with other methods.
PMU Placement Based on Heuristic Methods, when Solving the Problem of EPS State Estimation
I. N. Kolosok; E. S. Korkina; A. M. Glazunova
2014-01-01
Creation of satellite communication systems gave rise to a new generation of measurement equipment â€“ Phasor Measurement Unit (PMU). Integrated into the measurement system WAMS, the PMU sensors provide a real picture of state of energy power system (EPS). The issues of PMU placement when solving the problem of EPS state estimation (SE) are discussed in many papers. PMU placement is a complex combinatorial problem, and there is not any analytical function to optimize its variables. Therefore,...
Directory of Open Access Journals (Sweden)
Yi-Cong Gao
2013-01-01
Full Text Available Recently, there has been growing interest in composition of cloud manufacturing resources (CMRs. Composition of CMRs is a feasible innovation to fulfill the user request while single cloud manufacturing resource cannot satisfy the functionality required by the user. In this paper, we propose a new case-based approach for the composition of CMRs. The basic idea of the present approach is to provide a computational framework for the composition of CMRs by imitating the common design method of reviewing past designs to obtain solution concepts for a new composite cloud manufacturing resource (CCMR. A notion of virtual cloud manufacturing resource generators (VCMRGs is introduced to conceptualize and represent underlying CCMRs contained in existing CCMRs. VCMRGs are derived from previous CCMRs and serve as new conceptual building blocks for the composition of CMRs. Feasible composite CMRs are generated by combining VCMRGs using some adaptation rules. The reuse of prior CCMRs is accomplished via VCMRGs within the framework of case-based reasoning. We demonstrate that the proposed approach yields lower execution time for fulfilling user request and shows good scalability.
Directory of Open Access Journals (Sweden)
Mishra Vinod
2016-01-01
Full Text Available Numerical Laplace transform method is applied to approximate the solution of nonlinear (quadratic Riccati differential equations mingled with Adomian decomposition method. A new technique is proposed in this work by reintroducing the unknown function in Adomian polynomial with that of well known Newton-Raphson formula. The solutions obtained by the iterative algorithm are exhibited in an infinite series. The simplicity and efficacy of method is manifested with some examples in which comparisons are made among the exact solutions, ADM (Adomian decomposition method, HPM (Homotopy perturbation method, Taylor series method and the proposed scheme.
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.
Directory of Open Access Journals (Sweden)
Hai An
2016-08-01
Full Text Available Aiming to resolve the problems of a variety of uncertainty variables that coexist in the engineering structure reliability analysis, a new hybrid reliability index to evaluate structural hybrid reliability, based on the random–fuzzy–interval model, is proposed in this article. The convergent solving method is also presented. First, the truncated probability reliability model, the fuzzy random reliability model, and the non-probabilistic interval reliability model are introduced. Then, the new hybrid reliability index definition is presented based on the random–fuzzy–interval model. Furthermore, the calculation flowchart of the hybrid reliability index is presented and it is solved using the modified limit-step length iterative algorithm, which ensures convergence. And the validity of convergent algorithm for the hybrid reliability model is verified through the calculation examples in literature. In the end, a numerical example is demonstrated to show that the hybrid reliability index is applicable for the wear reliability assessment of mechanisms, where truncated random variables, fuzzy random variables, and interval variables coexist. The demonstration also shows the good convergence of the iterative algorithm proposed in this article.
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...
Clark, Joseph Warren
2012-01-01
In turbulent business environments, change is rapid, continuous, and unpredictable. Turbulence undermines those adaptive problem solving methods that generate solutions by extrapolating from what worked (or did not work) in the past. To cope with this challenge, organizations utilize trial-based problem solving (TBPS) approaches in which they…
Tu, S W; Eriksson, H; Gennari, J H; Shahar, Y; Musen, M A
1995-06-01
PROTEGE-II is a suite of tools and a methodology for building knowledge-based systems and domain-specific knowledge-acquisition tools. In this paper, we show how PROTEGE-II can be applied to the task of providing protocol-based decision support in the domain of treating HIV-infected patients. To apply PROTEGE-II, (1) we construct a decomposable problem-solving method called episodic skeletal-plan refinement, (2) we build an application ontology that consists of the terms and relations in the domain, and of method-specific distinctions not already captured in the domain terms, and (3) we specify mapping relations that link terms from the application ontology to the domain-independent terms used in the problem-solving method. From the application ontology, we automatically generate a domain-specific knowledge-acquisition tool that is custom-tailored for the application. The knowledge-acquisition tool is used for the creation and maintenance of domain knowledge used by the problem-solving method. The general goal of the PROTEGE-II approach is to produce systems and components that are reusable and easily maintained. This is the rationale for constructing ontologies and problem-solving methods that can be composed from a set of smaller-grained methods and mechanisms. This is also why we tightly couple the knowledge-acquisition tools to the application ontology that specifies the domain terms used in the problem-solving systems. Although our evaluation is still preliminary, for the application task of providing protocol-based decision support, we show that these goals of reusability and easy maintenance can be achieved. We discuss design decisions and the tradeoffs that have to be made in the development of the system.
The Unified Problem-Solving Method Development Language UPML
Fensel, Dieter; Motta, Enrico; van Harmelen, Frank; Benjamins, V. Richard; Crubezy, Monica; Decker, Stefan; Gaspari, Mauro; Groenboom, Rix; Grosso, William; Musen, Mark; Plaza, Enric; Schreiber, Guus; Studer, Rudi; Wielinga, Bob
2003-01-01
Problem-solving methods provide reusable architectures and components for implementing the reasoning part of knowledge-based systems. The UNIFIED PROBLEM-SOLVING METHOD DESCRIPTION LANGUAGE (UPML) has been developed to describe and implement such architectures and components to facilitate their semi-automatic reuse and adaptation. In a nutshell, UPML is a framework for developing knowledge-intensive reasoning systems based on libraries ofg eneric problem-solving components. The paper describe...
Bhrawy, A. H.; Zaky, M. A.
2015-01-01
In this paper, we propose and analyze an efficient operational formulation of spectral tau method for multi-term time-space fractional differential equation with Dirichlet boundary conditions. The shifted Jacobi operational matrices of Riemann-Liouville fractional integral, left-sided and right-sided Caputo fractional derivatives are presented. By using these operational matrices, we propose a shifted Jacobi tau method for both temporal and spatial discretizations, which allows us to present an efficient spectral method for solving such problem. Furthermore, the error is estimated and the proposed method has reasonable convergence rates in spatial and temporal discretizations. In addition, some known spectral tau approximations can be derived as special cases from our algorithm if we suitably choose the corresponding special cases of Jacobi parameters θ and ϑ. Finally, in order to demonstrate its accuracy, we compare our method with those reported in the literature.
Multistage Spectral Relaxation Method for Solving the Hyperchaotic Complex Systems
Directory of Open Access Journals (Sweden)
Hassan Saberi Nik
2014-01-01
Full Text Available We present a pseudospectral method application for solving the hyperchaotic complex systems. The proposed method, called the multistage spectral relaxation method (MSRM is based on a technique of extending Gauss-Seidel type relaxation ideas to systems of nonlinear differential equations and using the Chebyshev pseudospectral methods to solve the resulting system on a sequence of multiple intervals. In this new application, the MSRM is used to solve famous hyperchaotic complex systems such as hyperchaotic complex Lorenz system and the complex permanent magnet synchronous motor. We compare this approach to the Runge-Kutta based ode45 solver to show that the MSRM gives accurate results.
Energy Technology Data Exchange (ETDEWEB)
Mei, Lijie, E-mail: bxhanm@126.com; Wu, Xinyuan, E-mail: xywu@nju.edu.cn
2016-10-15
In general, extended Runge–Kutta–Nyström (ERKN) methods are more effective than traditional Runge–Kutta–Nyström (RKN) methods in dealing with oscillatory Hamiltonian systems. However, the theoretical analysis for ERKN methods, such as the order conditions, the symplectic conditions and the symmetric conditions, becomes much more complicated than that for RKN methods. Therefore, it is a bottleneck to construct high-order ERKN methods efficiently. In this paper, we first establish the ERKN group Ω for ERKN methods and the RKN group G for RKN methods, respectively. We then rigorously show that ERKN methods are a natural extension of RKN methods, that is, there exists an epimorphism η of the ERKN group Ω onto the RKN group G. This epimorphism gives a global insight into the structure of the ERKN group by the analysis of its kernel and the corresponding RKN group G. Meanwhile, we establish a particular mapping φ of G into Ω so that each image element is an ideal representative element of the congruence class in Ω. Furthermore, an elementary theoretical analysis shows that this map φ can preserve many structure-preserving properties, such as the order, the symmetry and the symplecticity. From the epimorphism η together with its section φ, we may gain knowledge about the structure of the ERKN group Ω via the RKN group G. In light of the theoretical analysis of this paper, we obtain high-order structure-preserving ERKN methods in an effective way for solving oscillatory Hamiltonian systems. Numerical experiments are carried out and the results are very promising, which strongly support our theoretical analysis presented in this paper.
New method for solving multidimensional scattering problem
International Nuclear Information System (INIS)
Melezhik, V.S.
1991-01-01
A new method is developed for solving the quantum mechanical problem of scattering of a particle with internal structure. The multichannel scattering problem is formulated as a system of nonlinear functional equations for the wave function and reaction matrix. The method is successfully tested for the scattering from a nonspherical potential well and a long-range nonspherical scatterer. The method is also applicable to solving the multidimensional Schroedinger equation with a discrete spectrum. As an example the known problem of a hydrogen atom in a homogeneous magnetic field is analyzed
Wang, Meng; Zhang, Huaiqiang; Zhang, Kan
2017-10-01
Focused on the circumstance that the equipment using demand in the short term and the development demand in the long term should be made overall plans and took into consideration in the weapons portfolio planning and the practical problem of the fuzziness in the definition of equipment capacity demand. The expression of demand is assumed to be an interval number or a discrete number. With the analysis method of epoch-era, a long planning cycle is broke into several short planning cycles with different demand value. The multi-stage stochastic programming model is built aimed at maximize long-term planning cycle demand under the constraint of budget, equipment development time and short planning cycle demand. The scenario tree is used to discretize the interval value of the demand, and genetic algorithm is designed to solve the problem. At last, a case is studied to demonstrate the feasibility and effectiveness of the proposed mode.
Analytical method for solving radioactive transformations
International Nuclear Information System (INIS)
Vukadin, Z.
1999-01-01
The exact method of solving radioactive transformations is presented. Nonsingular Bateman coefficients, which can be computed using recurrence formulas, greatly reduce computational time and eliminate singularities that often arise in problems involving nuclide transmutations. Depletion function power series expansion enables high accuracy of the performed calculations, specially in a case of a decay constants with closely spaced values. Generality and simplicity of the method make the method useful for many practical applications. (author)
Analytical method for solving radioactive transformations
International Nuclear Information System (INIS)
Vudakin, Z.
1999-01-01
Analytical method for solving radioactive transformations is presented in this paper. High accuracy series expansion of the depletion function and nonsingular Bateman coefficients are used to overcome numerical difficulties when applying well-known Bateman solution of a simple radioactive decay. Generality and simplicity of the method are found to be useful in evaluating nuclide chains with one hundred or more nuclides in the chain. Method enables evaluation of complete chain, without elimination of short-lives nuclides. It is efficient and accurate
Methods of solving sequence and series problems
Grigorieva, Ellina
2016-01-01
This book aims to dispel the mystery and fear experienced by students surrounding sequences, series, convergence, and their applications. The author, an accomplished female mathematician, achieves this by taking a problem solving approach, starting with fascinating problems and solving them step by step with clear explanations and illuminating diagrams. The reader will find the problems interesting, unusual, and fun, yet solved with the rigor expected in a competition. Some problems are taken directly from mathematics competitions, with the name and year of the exam provided for reference. Proof techniques are emphasized, with a variety of methods presented. The text aims to expand the mind of the reader by often presenting multiple ways to attack the same problem, as well as drawing connections with different fields of mathematics. Intuitive and visual arguments are presented alongside technical proofs to provide a well-rounded methodology. With nearly 300 problems including hints, answers, and solutions,Met...
Directory of Open Access Journals (Sweden)
Mustafa Bayram
2017-01-01
Full Text Available In this study, we have applied a generalized successive numerical technique to solve the elasticity problem of based on the elastic ground with variable coefficient. In the first stage, we have calculated the generalized successive approximation of being given BVP and in the second stage we have transformed it into Padé series. At the end of study a test problem has been given to clarify the method.
Regularization method for solving the inverse scattering problem
International Nuclear Information System (INIS)
Denisov, A.M.; Krylov, A.S.
1985-01-01
The inverse scattering problem for the Schroedinger radial equation consisting in determining the potential according to the scattering phase is considered. The problem of potential restoration according to the phase specified with fixed error in a finite range is solved by the regularization method based on minimization of the Tikhonov's smoothing functional. The regularization method is used for solving the problem of neutron-proton potential restoration according to the scattering phases. The determined potentials are given in the table
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
Directory of Open Access Journals (Sweden)
Aliasghar Baziar
2015-03-01
Full Text Available Abstract In order to handle large scale problems this study has used shuffled frog leaping algorithm. This algorithm is an optimization method based on natural memetics that uses a new two-phase modification to it to have a better search in the problem space. The suggested algorithm is evaluated by comparing to some well known algorithms using several benchmark optimization problems. The simulation results have clearly shown the superiority of this algorithm over other well-known methods in the area.
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.
Dimensional analysis and qualitative methods in problem solving: II
International Nuclear Information System (INIS)
Pescetti, D
2009-01-01
We show that the underlying mathematical structure of dimensional analysis (DA), in the qualitative methods in problem-solving context, is the algebra of the affine spaces. In particular, we show that the qualitative problem-solving procedure based on the parallel decomposition of a problem into simple special cases yields the new original mathematical concepts of special points and special representations of affine spaces. A qualitative problem-solving algorithm piloted by the mathematics of DA is illustrated by a set of examples.
Multiparameter extrapolation and deflation methods for solving equation systems
Directory of Open Access Journals (Sweden)
A. J. Hughes Hallett
1984-01-01
Full Text Available Most models in economics and the applied sciences are solved by first order iterative techniques, usually those based on the Gauss-Seidel algorithm. This paper examines the convergence of multiparameter extrapolations (accelerations of first order iterations, as an improved approximation to the Newton method for solving arbitrary nonlinear equation systems. It generalises my earlier results on single parameter extrapolations. Richardson's generalised method and the deflation method for detecting successive solutions in nonlinear equation systems are also presented as multiparameter extrapolations of first order iterations. New convergence results are obtained for those methods.
Directory of Open Access Journals (Sweden)
Ouafa Herbadji
2016-03-01
Full Text Available This paper proposes a new hybrid metaheuristique algorithm based on the hybridization of Biogeography-based optimization with the Differential Evolution for solving the optimal power flow problem with emission control. The biogeography-based optimization (BBO algorithm is strongly influenced by equilibrium theory of island biogeography, mainly through two steps: Migration and Mutation. Differential Evolution (DE is one of the best Evolutionary Algorithms for global optimization. The hybridization of these two methods is used to overcome traps of local optimal solutions and problems of time consumption. The objective of this paper is to minimize the total fuel cost of generation, total emission, total real power loss and also maintain an acceptable system performance in terms of limits on generator real power, bus voltages and power flow of transmission lines. In the present work, BBO/DE has been applied to solve the optimal power flow problems on IEEE 30-bus test system and the Algerian electrical network 114 bus. The results obtained from this method show better performances compared with DE, BBO and other well known metaheuristique and evolutionary optimization methods.
Directory of Open Access Journals (Sweden)
V. A. Baturin
2017-03-01
Full Text Available An optimal control problem for discrete systems is considered. A method of successive improvements along with its modernization based on the expansion of the main structures of the core algorithm about the parameter is suggested. The idea of the method is based on local approximation of attainability set, which is described by the zeros of the Bellman function in the special problem of optimal control. The essence of the problem is as follows: from the end point of the phase is required to find a path that minimizes functional deviations of the norm from the initial state. If the initial point belongs to the attainability set of the original controlled system, the value of the Bellman function equal to zero, otherwise the value of the Bellman function is greater than zero. For this special task Bellman equation is considered. The support approximation and Bellman equation are selected. The Bellman function is approximated by quadratic terms. Along the allowable trajectory, this approximation gives nothing, because Bellman function and its expansion coefficients are zero. We used a special trick: an additional variable is introduced, which characterizes the degree of deviation of the system from the initial state, thus it is obtained expanded original chain. For the new variable initial nonzero conditions is selected, thus obtained trajectory is lying outside attainability set and relevant Bellman function is greater than zero, which allows it to hold a non-trivial approximation. As a result of these procedures algorithms of successive improvements is designed. Conditions for relaxation algorithms and conditions for the necessary conditions of optimality are also obtained.
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.
Domain decomposition method for solving the neutron diffusion equation
International Nuclear Information System (INIS)
Coulomb, F.
1989-03-01
The aim of this work is to study methods for solving the neutron diffusion equation; we are interested in methods based on a classical finite element discretization and well suited for use on parallel computers. Domain decomposition methods seem to answer this preoccupation. This study deals with a decomposition of the domain. A theoretical study is carried out for Lagrange finite elements and some examples are given; in the case of mixed dual finite elements, the study is based on examples [fr
Domain decomposition methods for solving an image problem
Energy Technology Data Exchange (ETDEWEB)
Tsui, W.K.; Tong, C.S. [Hong Kong Baptist College (Hong Kong)
1994-12-31
The domain decomposition method is a technique to break up a problem so that ensuing sub-problems can be solved on a parallel computer. In order to improve the convergence rate of the capacitance systems, pre-conditioned conjugate gradient methods are commonly used. In the last decade, most of the efficient preconditioners are based on elliptic partial differential equations which are particularly useful for solving elliptic partial differential equations. In this paper, the authors apply the so called covering preconditioner, which is based on the information of the operator under investigation. Therefore, it is good for various kinds of applications, specifically, they shall apply the preconditioned domain decomposition method for solving an image restoration problem. The image restoration problem is to extract an original image which has been degraded by a known convolution process and additive Gaussian noise.
Thamareerat, N; Luadsong, A; Aschariyaphotha, N
2016-01-01
In this paper, we present a numerical scheme used to solve the nonlinear time fractional Navier-Stokes equations in two dimensions. We first employ the meshless local Petrov-Galerkin (MLPG) method based on a local weak formulation to form the system of discretized equations and then we will approximate the time fractional derivative interpreted in the sense of Caputo by a simple quadrature formula. The moving Kriging interpolation which possesses the Kronecker delta property is applied to construct shape functions. This research aims to extend and develop further the applicability of the truly MLPG method to the generalized incompressible Navier-Stokes equations. Two numerical examples are provided to illustrate the accuracy and efficiency of the proposed algorithm. Very good agreement between the numerically and analytically computed solutions can be observed in the verification. The present MLPG method has proved its efficiency and reliability for solving the two-dimensional time fractional Navier-Stokes equations arising in fluid dynamics as well as several other problems in science and engineering.
Domain decomposition method for solving elliptic problems in unbounded domains
International Nuclear Information System (INIS)
Khoromskij, B.N.; Mazurkevich, G.E.; Zhidkov, E.P.
1991-01-01
Computational aspects of the box domain decomposition (DD) method for solving boundary value problems in an unbounded domain are discussed. A new variant of the DD-method for elliptic problems in unbounded domains is suggested. It is based on the partitioning of an unbounded domain adapted to the given asymptotic decay of an unknown function at infinity. The comparison of computational expenditures is given for boundary integral method and the suggested DD-algorithm. 29 refs.; 2 figs.; 2 tabs
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.
Welland, M. J.; Tenuta, E.; Prudil, A. A.
2017-06-01
This article describes a phase-field model for an isothermal multicomponent, multiphase system which avoids implicit interfacial energy contributions by starting from a grand potential formulation. A method is developed for incorporating arbitrary forms of the equilibrium thermodynamic potentials in all phases to determine an explicit relationship between chemical potentials and species concentrations. The model incorporates variable densities between adjacent phases, defect migration, and dependence of internal pressure on object dimensions ranging from the macro- to nanoscale. A demonstrative simulation of an overpressurized nanoscopic intragranular bubble in nuclear fuel migrating to a grain boundary under kinetically limited vacancy diffusion is shown.
New method for solving three-dimensional Schroedinger equation
International Nuclear Information System (INIS)
Melezhik, V.S.
1992-01-01
A new method is developed for solving the multidimensional Schroedinger equation without the variable separation. To solve the Schroedinger equation in a multidimensional coordinate space X, a difference grid Ω i (i=1,2,...,N) for some of variables, Ω, from X={R,Ω} is introduced and the initial partial-differential equation is reduced to a system of N differential-difference equations in terms of one of the variables R. The arising multi-channel scattering (or eigenvalue) problem is solved by the algorithm based on a continuous analog of the Newton method. The approach has been successfully tested for several two-dimensional problems (scattering on a nonspherical potential well and 'dipole' scatterer, a hydrogen atom in a homogenous magnetic field) and for a three-dimensional problem of the helium-atom bound states. (author)
A Predictor-Corrector Method for Solving Equilibrium Problems
Directory of Open Access Journals (Sweden)
Zong-Ke Bao
2014-01-01
Full Text Available We suggest and analyze a predictor-corrector method for solving nonsmooth convex equilibrium problems based on the auxiliary problem principle. In the main algorithm each stage of computation requires two proximal steps. One step serves to predict the next point; the other helps to correct the new prediction. At the same time, we present convergence analysis under perfect foresight and imperfect one. In particular, we introduce a stopping criterion which gives rise to Δ-stationary points. Moreover, we apply this algorithm for solving the particular case: variational inequalities.
Applying homotopy analysis method for solving differential-difference equation
International Nuclear Information System (INIS)
Wang Zhen; Zou Li; Zhang Hongqing
2007-01-01
In this Letter, we apply the homotopy analysis method to solving the differential-difference equations. A simple but typical example is applied to illustrate the validity and the great potential of the generalized homotopy analysis method in solving differential-difference equation. Comparisons are made between the results of the proposed method and exact solutions. The results show that the homotopy analysis method is an attractive method in solving the differential-difference equations
Solving hyperbolic equations with finite volume methods
Vázquez-Cendón, M Elena
2015-01-01
Finite volume methods are used in numerous applications and by a broad multidisciplinary scientific community. The book communicates this important tool to students, researchers in training and academics involved in the training of students in different science and technology fields. The selection of content is based on the author’s experience giving PhD and master courses in different universities. In the book the introduction of new concepts and numerical methods go together with simple exercises, examples and applications that contribute to reinforce them. In addition, some of them involve the execution of MATLAB codes. The author promotes an understanding of common terminology with a balance between mathematical rigor and physical intuition that characterizes the origin of the methods. This book aims to be a first contact with finite volume methods. Once readers have studied it, they will be able to follow more specific bibliographical references and use commercial programs or open source software withi...
Nodal spectrum method for solving neutron diffusion equation
International Nuclear Information System (INIS)
Sanchez, D.; Garcia, C. R.; Barros, R. C. de; Milian, D.E.
1999-01-01
Presented here is a new numerical nodal method for solving static multidimensional neutron diffusion equation in rectangular geometry. Our method is based on a spectral analysis of the nodal diffusion equations. These equations are obtained by integrating the diffusion equation in X, Y directions and then considering flat approximations for the current. These flat approximations are the only approximations that are considered in this method, as a result the numerical solutions are completely free from truncation errors. We show numerical results to illustrate the methods accuracy for coarse mesh calculations
Inquiry-based problem solving in introductory physics
Koleci, Carolann
What makes problem solving in physics difficult? How do students solve physics problems, and how does this compare to an expert physicist's strategy? Over the past twenty years, physics education research has revealed several differences between novice and expert problem solving. The work of Chi, Feltovich, and Glaser demonstrates that novices tend to categorize problems based on surface features, while experts categorize according to theory, principles, or concepts1. If there are differences between how problems are categorized, then are there differences between how physics problems are solved? Learning more about the problem solving process, including how students like to learn and what is most effective, requires both qualitative and quantitative analysis. In an effort to learn how novices and experts solve introductory electricity problems, a series of in-depth interviews were conducted, transcribed, and analyzed, using both qualitative and quantitative methods. One-way ANOVA tests were performed in order to learn if there are any significant problem solving differences between: (a) novices and experts, (b) genders, (c) students who like to answer questions in class and those who don't, (d) students who like to ask questions in class and those who don't, (e) students employing an interrogative approach to problem solving and those who don't, and (f) those who like physics and those who dislike it. The results of both the qualitative and quantitative methods reveal that inquiry-based problem solving is prevalent among novices and experts, and frequently leads to the correct physics. These findings serve as impetus for the third dimension of this work: the development of Choose Your Own Adventure Physics(c) (CYOAP), an innovative teaching tool in physics which encourages inquiry-based problem solving. 1Chi, M., P. Feltovich, R. Glaser, "Categorization and Representation of Physics Problems by Experts and Novices", Cognitive Science, 5, 121--152 (1981).
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)
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
Taylor's series method for solving the nonlinear point kinetics equations
International Nuclear Information System (INIS)
Nahla, Abdallah A.
2011-01-01
Highlights: → Taylor's series method for nonlinear point kinetics equations is applied. → The general order of derivatives are derived for this system. → Stability of Taylor's series method is studied. → Taylor's series method is A-stable for negative reactivity. → Taylor's series method is an accurate computational technique. - Abstract: Taylor's series method for solving the point reactor kinetics equations with multi-group of delayed neutrons in the presence of Newtonian temperature feedback reactivity is applied and programmed by FORTRAN. This system is the couples of the stiff nonlinear ordinary differential equations. This numerical method is based on the different order derivatives of the neutron density, the precursor concentrations of i-group of delayed neutrons and the reactivity. The r th order of derivatives are derived. The stability of Taylor's series method is discussed. Three sets of applications: step, ramp and temperature feedback reactivities are computed. Taylor's series method is an accurate computational technique and stable for negative step, negative ramp and temperature feedback reactivities. This method is useful than the traditional methods for solving the nonlinear point kinetics equations.
Two pricing methods for solving an integrated commercial fishery ...
African Journals Online (AJOL)
In this paper, we develop two novel pricing methods for solving an integer program. We demonstrate the methods by solving an integrated commercial fishery planning model (IFPM). In this problem, a fishery manager must schedule fishing trawlers (determine when and where the trawlers should go fishing, and when the ...
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
students' preference of method of solving simultaneous equations
African Journals Online (AJOL)
Ugboduma,Samuel.O.
substitution method irrespective of their gender for solving simultaneous equations. A recommendation ... advantage given to one method over others. Students' interest .... from two (2) single girls' schools, two (2) single boys schools and ten.
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 Method for Solving Combinatoral Optimization Problems
National Research Council Canada - National Science Library
Ruffa, Anthony A
2008-01-01
.... The method discloses that when the boundaries create zones with boundary vertices confined to the adjacent zones, the sets of candidate HPs are found by advancing one zone at a time, considering...
Numerical method for solving integral equations of neutron transport. II
International Nuclear Information System (INIS)
Loyalka, S.K.; Tsai, R.W.
1975-01-01
In a recent paper it was pointed out that the weakly singular integral equations of neutron transport can be quite conveniently solved by a method based on subtraction of singularity. This previous paper was devoted entirely to the consideration of simple one-dimensional isotropic-scattering and one-group problems. The present paper constitutes interesting extensions of the previous work in that in addition to a typical two-group anisotropic-scattering albedo problem in the slab geometry, the method is also applied to an isotropic-scattering problem in the x-y geometry. These results are compared with discrete S/sub N/ (ANISN or TWOTRAN-II) results, and for the problems considered here, the proposed method is found to be quite effective. Thus, the method appears to hold considerable potential for future applications. (auth)
Khataybeh, S. N.; Hashim, I.
2018-04-01
In this paper, we propose for the first time a method based on Bernstein polynomials for solving directly a class of third-order ordinary differential equations (ODEs). This method gives a numerical solution by converting the equation into a system of algebraic equations which is solved directly. Some numerical examples are given to show the applicability of the method.
Exponential function method for solving nonlinear ordinary ...
Indian Academy of Sciences (India)
[14] introduced a new system of rational. 79 ..... Also, for k-power of function f (η), by induction, we have ..... reliability and efficiency of the method. .... electric field and the polarization effects are negligible and B(x) is assumed by Chaim [8] as.
Galerkin method for solving diffusion equations
International Nuclear Information System (INIS)
Tsapelkin, E.S.
1975-01-01
A programme for the solution of the three-dimensional two-group multizone neutron diffusion problem in (x, y, z)-geometry is described. The programme XYZ-5 gives the currents of both groups, the effective neutron multiplication coefficient and several integral properties of the reactor. The solution was found with the Galerkin method using speciallly constructed and chosen coordinate functions. The programme is written in ALGOL-60 and consists of 5 parts. Its text is given
Finite element method for solving neutron transport problems
International Nuclear Information System (INIS)
Ferguson, J.M.; Greenbaum, A.
1984-01-01
A finite element method is introduced for solving the neutron transport equations. Our method falls into the category of Petrov-Galerkin solution, since the trial space differs from the test space. The close relationship between this method and the discrete ordinate method is discussed, and the methods are compared for simple test problems
Using Lin's method to solve Bykov's problems
Knobloch, Jürgen; Lamb, Jeroen S. W.; Webster, Kevin N.
2014-10-01
We consider nonwandering dynamics near heteroclinic cycles between two hyperbolic equilibria. The constituting heteroclinic connections are assumed to be such that one of them is transverse and isolated. Such heteroclinic cycles are associated with the termination of a branch of homoclinic solutions, and called T-points in this context. We study codimension-two T-points and their unfoldings in Rn. In our consideration we distinguish between cases with real and complex leading eigenvalues of the equilibria. In doing so we establish Lin's method as a unified approach to (re)gain and extend results of Bykov's seminal studies and related works. To a large extent our approach reduces the study to the discussion of intersections of lines and spirals in the plane. Case (RR): Under open conditions on the eigenvalues, there exist open sets in parameter space for which there exist periodic orbits close to the heteroclinic cycle. In addition, there exist two one-parameter families of homoclinic orbits to each of the saddle points p1 and p2.See Theorem 2.1 and Proposition 2.2 for precise statements and Fig. 2 for bifurcation diagrams. Cases (RC) and (CC): At the bifurcation point μ=0 and for each N≥2, there exists an invariant set S0N close to the heteroclinic cycle on which the first return map is topologically conjugated to a full shift on N symbols. For any fixed N≥2, the invariant set SμN persists for |μ| sufficiently small.In addition, there exist infinitely many transversal and non-transversal heteroclinic orbits connecting the saddle points p1 and p2 in a neighbourhood of μ=0, as well as infinitely many one-parameter families of homoclinic orbits to each of the saddle points.For full statements of the results see Theorem 2.3 and Propositions 2.4, 2.5 and Fig. 3 for bifurcation diagrams. The dynamics near T-points has been studied previously by Bykov [6-10], Glendinning and Sparrow [20], Kokubu [27,28] and Labouriau and Rodrigues [30,31,38]. See also the surveys
Two pricing methods for solving an integrated commercial fishery ...
African Journals Online (AJOL)
a model (Hasan and Raffensperger, 2006) to solve this problem: the integrated ... planning and labour allocation for that processing firm, but did not consider any fleet- .... the DBONP method actually finds such price information, and uses it.
New high order FDTD method to solve EMC problems
Directory of Open Access Journals (Sweden)
N. Deymier
2015-10-01
Full Text Available In electromagnetic compatibility (EMC context, we are interested in developing new ac- curate methods to solve efficiently and accurately Maxwell’s equations in the time domain. Indeed, usual methods such as FDTD or FVTD present im- portant dissipative and/or dispersive errors which prevent to obtain a good numerical approximation of the physical solution for a given industrial scene unless we use a mesh with a very small cell size. To avoid this problem, schemes like the Discontinuous Galerkin (DG method, based on higher order spa- tial approximations, have been introduced and stud- ied on unstructured meshes. However the cost of this kind of method can become prohibitive accord- ing to the mesh used. In this paper, we first present a higher order spatial approximation method on carte- sian meshes. It is based on a finite element ap- proach and recovers at the order 1 the well-known Yee’s schema. Next, to deal with EMC problem, a non-oriented thin wire formalism is proposed for this method. Finally, several examples are given to present the benefits of this new method by compar- ison with both Yee’s schema and DG approaches.
Problem Solving Reasoning and Problem Based Instruction in Geometry Learning
Sulistyowati, F.; Budiyono, B.; Slamet, I.
2017-09-01
This research aims to analyze the comparison Problem Solving Reasoning (PSR) and Problem Based Instruction (PBI) on problem solving and mathematical communication abilities viewed from Self-Regulated Learning (SRL). Learning was given to grade 8th junior high school students. This research uses quasi experimental method, and then with descriptive analysis. Data were analyzed using two-ways multivariate analysis of variance (MANOVA) and one-way analysis of variance (ANOVA) with different cells. The result of data analysis were learning model gives different effect, level of SRL gives the same effect, and there is no interaction between the learning model with the SRL on the problem solving and mathematical communication abilities. The t-test statistic was used to find out more effective learning model. Based on the test, regardless of the level of SRL, PSR is more effective than PBI for problemsolving ability. The result of descriptive analysis was PSR had the advantage in creating learning that optimizing the ability of learners in reasoning to solve a mathematical problem. Consequently, the PSR is the right learning model to be applied in the classroom to improve problem solving ability of learners.
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
Approximate analytical methods for solving ordinary differential equations
Radhika, TSL; Rani, T Raja
2015-01-01
Approximate Analytical Methods for Solving Ordinary Differential Equations (ODEs) is the first book to present all of the available approximate methods for solving ODEs, eliminating the need to wade through multiple books and articles. It covers both well-established techniques and recently developed procedures, including the classical series solution method, diverse perturbation methods, pioneering asymptotic methods, and the latest homotopy methods.The book is suitable not only for mathematicians and engineers but also for biologists, physicists, and economists. It gives a complete descripti
A New Method for Solving Supervised Data Classification Problems
Directory of Open Access Journals (Sweden)
Parvaneh Shabanzadeh
2014-01-01
Full Text Available Supervised data classification is one of the techniques used to extract nontrivial information from data. Classification is a widely used technique in various fields, including data mining, industry, medicine, science, and law. This paper considers a new algorithm for supervised data classification problems associated with the cluster analysis. The mathematical formulations for this algorithm are based on nonsmooth, nonconvex optimization. A new algorithm for solving this optimization problem is utilized. The new algorithm uses a derivative-free technique, with robustness and efficiency. To improve classification performance and efficiency in generating classification model, a new feature selection algorithm based on techniques of convex programming is suggested. Proposed methods are tested on real-world datasets. Results of numerical experiments have been presented which demonstrate the effectiveness of the proposed algorithms.
A highly accurate method to solve Fisher's equation
Indian Academy of Sciences (India)
The solution of the Helmholtz equation was approximated by a sixth-order compact finite difference. (CFD6) method in [29]. In [30], a CFD6 scheme has been presented to ... efficiency of the proposed method are reported in §3. Finally .... our discussion, one can apply the proposed method to solve the more general problem.
Glow discharge based device for solving mazes
Energy Technology Data Exchange (ETDEWEB)
Dubinov, Alexander E., E-mail: dubinov-ae@yandex.ru; Mironenko, Maxim S.; Selemir, Victor D. [Russian Federal Nuclear Center − All-Russian Scientific and Research Institute of Experimental Physics (RFNC-VNIIEF), Sarov, Nizhni Novgorod region 607188 (Russian Federation); Sarov Institute of Physics and Technology (SarFTI) of National Research Nuclear University “MEPhI,” Sarov, Nizhni Novgorod region 607188 (Russian Federation); Maksimov, Artem N.; Pylayev, Nikolay A. [Russian Federal Nuclear Center − All-Russian Scientific and Research Institute of Experimental Physics (RFNC-VNIIEF), Sarov, Nizhni Novgorod region 607188 (Russian Federation)
2014-09-15
A glow discharge based device for solving mazes has been designed and tested. The device consists of a gas discharge chamber and maze-transformer of radial-azimuth type. It allows changing of the maze pattern in a short period of time (within several minutes). The device has been tested with low pressure air. Once switched on, a glow discharge has been shown to find the shortest way through the maze from the very first attempt, even if there is a section with potential barrier for electrons on the way. It has been found that ionization waves (striations) can be excited in the maze along the length of the plasma channel. The dependancy of discharge voltage on the length of the optimal path through the maze has been measured. A reduction in discharge voltage with one or two potential barriers present has been found and explained. The dependency of the magnitude of discharge ignition voltage on the length of the optimal path through the maze has been measured. The reduction of the ignition voltage with the presence of one or two potential barriers has been observed and explained.
Deterministic methods to solve the integral transport equation in neutronic
International Nuclear Information System (INIS)
Warin, X.
1993-11-01
We present a synthesis of the methods used to solve the integral transport equation in neutronic. This formulation is above all used to compute solutions in 2D in heterogeneous assemblies. Three kinds of methods are described: - the collision probability method; - the interface current method; - the current coupling collision probability method. These methods don't seem to be the most effective in 3D. (author). 9 figs
Sukoriyanto; Nusantara, Toto; Subanji; Chandra, Tjang Daniel
2016-01-01
This article was written based on the results of a study evaluating students' errors in problem solving of permutation and combination in terms of problem solving steps according to Polya. Twenty-five students were asked to do four problems related to permutation and combination. The research results showed that the students still did a mistake in…
ACTIVE AND PARTICIPATORY METHODS IN BIOLOGY: PROBLEM-SOLVING
Directory of Open Access Journals (Sweden)
Adela NEMEŞ
2010-01-01
Full Text Available We face with considerable challenge of developing students’ problem solving skills in our difficult environment. Good problem solving skills empower managers in their professional and personal lives. Problem solving skills are valued by academics and employers. The informations in Biology are often presented in abstract forms without contextualisation. Creative problem-solving process involves a few steps, which together provide a structured procedure for identifying challenges, generating ideas and implementing innovative solutions: identifying the problem, searching for possible solutions, selecting the most optimal solution and implementing a possible solution. Each aspect of personality has a different orientation to problem solving, different criteria for judging the effectiveness of the process and different associated strengths. Using real-world data in sample problems will also help facilitate the transfer process, since students can more easily identify with the context of a given situation. The paper describes the use of the Problem-Solving in Biology and the method of its administration. It also presents the results of a study undertaken to evaluate the value in teaching Biology. Problem-solving is seen as an essential skill that is developed in biology education.
International Nuclear Information System (INIS)
Sharifi, M. J.; Adibi, A.
2000-01-01
In this paper, we have extended and completed our previous work, that was introducing a new method for finite differentiation. We show the applicability of the method for solving a wide variety of equations such as poisson, Laplace and Schrodinger. These equations are fundamental to the most semiconductor device simulators. In a section, we solve the Shordinger equation by this method in several cases including the problem of finding electron concentration profile in the channel of a HEMT. In another section, we solve the Poisson equation by this method, choosing the problem of SBD as an example. Finally we solve the Laplace equation in two dimensions and as an example, we focus on the VED. In this paper, we have shown that, the method can get stable and precise results in solving all of these problems. Also the programs which have been written based on this method become considerably faster, more clear, and more abstract
New Efficient Fourth Order Method for Solving Nonlinear Equations
Directory of Open Access Journals (Sweden)
Farooq Ahmad
2013-12-01
Full Text Available In a paper [Appl. Math. Comput., 188 (2 (2007 1587--1591], authors have suggested and analyzed a method for solving nonlinear equations. In the present work, we modified this method by using the finite difference scheme, which has a quintic convergence. We have compared this modified Halley method with some other iterative of fifth-orders convergence methods, which shows that this new method having convergence of fourth order, is efficient.
[Methods for teaching problem-solving in medical schools].
Shumway, J M; Vargas, M E; Heller, L E
1984-01-01
The need to include in the medical curriculum instructional activities to promote the development of problem-solving abilities has been asserted at the national and international levels. In research on the mental process involved in the solution of problems in medicine, problem-solving has been defined as a hypothetical-deductive activity engaged in by experienced physicians, in which the early generation of hypotheses influences the subsequent gathering of information. This article comments briefly on research on the mental process by which medical problems are solved. It describes the methods that research has shown to be most applicable in instruction to develop problem-solving abilities, and presents some educational principles that justify their application. The "trail-following" approach is the method that has been most commonly used to study the physician's problem-solving behavior. The salient conclusions from this research are that in the problem-solving process the diagnostic hypothesis is generated very early on and with limited data; the number of hypotheses is small; the problem-solving approach is specific to the type of medical problem and case in hand; and the accumulation of medical knowledge and experience forms the basis of clinical competence. Four methods for teaching the solution of problems are described: case presentation, the rain of ideas, the nominal groups technique and decision-making consensus, the census and analysis of forces in the field, and the analysis of clinical decisions. These methods are carried out in small groups. The advantages of the small groups are that the students are active participants in the learning process, they receive formative evaluation of their performance in a setting conductive to learning, and are able to interact with their instructor if he makes proper use of the right questioning techniques. While no single problem-solving method can be useful to all students or in all the problems they encounter
Some Implicit Methods for Solving Harmonic Variational Inequalities
Directory of Open Access Journals (Sweden)
Muhammad Aslam Noor
2016-08-01
Full Text Available In this paper, we use the auxiliary principle technique to suggest an implicit method for solving the harmonic variational inequalities. It is shown that the convergence of the proposed method only needs pseudo monotonicity of the operator, which is a weaker condition than monotonicity.
Sinc-collocation method for solving the Blasius equation
International Nuclear Information System (INIS)
Parand, K.; Dehghan, Mehdi; Pirkhedri, A.
2009-01-01
Sinc-collocation method is applied for solving Blasius equation which comes from boundary layer equations. It is well known that sinc procedure converges to the solution at an exponential rate. Comparison with Howarth and Asaithambi's numerical solutions reveals that the proposed method is of high accuracy and reduces the solution of Blasius' equation to the solution of a system of algebraic equations.
AI tools in computer based problem solving
Beane, Arthur J.
1988-01-01
The use of computers to solve value oriented, deterministic, algorithmic problems, has evolved a structured life cycle model of the software process. The symbolic processing techniques used, primarily in research, for solving nondeterministic problems, and those for which an algorithmic solution is unknown, have evolved a different model, much less structured. Traditionally, the two approaches have been used completely independently. With the advent of low cost, high performance 32 bit workstations executing identical software with large minicomputers and mainframes, it became possible to begin to merge both models into a single extended model of computer problem solving. The implementation of such an extended model on a VAX family of micro/mini/mainframe systems is described. Examples in both development and deployment of applications involving a blending of AI and traditional techniques are given.
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.
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.
Exp-function method for solving Maccari's system
International Nuclear Information System (INIS)
Zhang Sheng
2007-01-01
In this Letter, the Exp-function method is used to seek exact solutions of Maccari's system. As a result, single and combined generalized solitonary solutions are obtained, from which some known solutions obtained by extended sine-Gordon equation method and improved hyperbolic function method are recovered as special cases. It is shown that the Exp-function method provides a very effective and powerful mathematical tool for solving nonlinear evolution equations in mathematical physics
Reproducing Kernel Method for Solving Nonlinear Differential-Difference Equations
Directory of Open Access Journals (Sweden)
Reza Mokhtari
2012-01-01
Full Text Available On the basis of reproducing kernel Hilbert spaces theory, an iterative algorithm for solving some nonlinear differential-difference equations (NDDEs is presented. The analytical solution is shown in a series form in a reproducing kernel space, and the approximate solution , is constructed by truncating the series to terms. The convergence of , to the analytical solution is also proved. Results obtained by the proposed method imply that it can be considered as a simple and accurate method for solving such differential-difference problems.
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.
On Solving the Lorenz System by Differential Transformation Method
International Nuclear Information System (INIS)
Al-Sawalha, M. Mossa; Noorani, M. S. M.
2008-01-01
The differential transformation method (DTM) is employed to solve a nonlinear differential equation, namely the Lorenz system. Numerical results are compared to those obtained by the Runge–Kutta method to illustrate the preciseness and effectiveness of the proposed method. In particular, we examine the accuracy of the (DTM) as the Lorenz system changes from a non-chaotic system to a chaotic one. It is shown that the (DTM) is robust, accurate and easy to apply
Solving a molecular docking problem by the modified PSO method
Directory of Open Access Journals (Sweden)
A. P. Karpenko
2014-01-01
Full Text Available The paper presents an canonical method of the swarm particles in two modifications to raise this method efficiency in solving multi-extreme problems of high dimension optimization. The essence of PSO-M1 modification is to form two new points to attract swarm particles (along with the points which are responsible for inertial, cognitive, and social components of canonical method. These new points represent the best points of sets of particles-neighbours of a given point. The modification aims to diversify search. All free parameters of the PSO-M1 method (as well as an canonical method are static. In contrast, one of such parameters of PSO-M2 modification is dynamic. So this modification represents an example of a self-adaptive method of optimization. The modification aims to intensify search. A computing experiment to study the method efficiency and its abovementioned modifications at solving the test problems of optimization showed advantages of offered modifications in comparison with canonical method, revealed a superiority of PSO-M2 modification both over canonical method, and over PSO-M1 modification. Using the PSO-M2 method allows us to solve the 28-dimensional molecular docking problem of HIV1 protease and darunaviry 3U7S as the molecules of receptor and a ligand, respectively. Results of computing experiment have shown that the PSO-M2 method successfully finds the position of ligand close to native and can be recommended for solving the molecular docking problems as an alternative to genetic algorithm.
Leikin, Roza; Waisman, Ilana; Leikin, Mark
2016-01-01
We asked: "What are the similarities and differences in mathematical processing associated with solving learning-based and insight-based problems?" To answer this question, the ERP research procedure was employed with 69 male adolescent subjects who solved specially designed insight-based and learning-based tests. Solutions of…
New method for solving three-dimensional Schroedinger equation
International Nuclear Information System (INIS)
Melezhik, V.S.
1990-01-01
The method derived recently for solving a multidimensional scattering problem is applied to a three-dimensional Schroedinger equation. As compared with direct three-dimensional calculations of finite elements and finite differences, this approach gives sufficiently accurate upper and lower approximations to the helium-atom binding energy, which demonstrates its efficiency. 15 refs.; 1 fig.; 2 tabs
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 ...
Various Newton-type iterative methods for solving nonlinear equations
Directory of Open Access Journals (Sweden)
Manoj Kumar
2013-10-01
Full Text Available The aim of the present paper is to introduce and investigate new ninth and seventh order convergent Newton-type iterative methods for solving nonlinear equations. The ninth order convergent Newton-type iterative method is made derivative free to obtain seventh-order convergent Newton-type iterative method. These new with and without derivative methods have efficiency indices 1.5518 and 1.6266, respectively. The error equations are used to establish the order of convergence of these proposed iterative methods. Finally, various numerical comparisons are implemented by MATLAB to demonstrate the performance of the developed methods.
A novel method to solve functional differential equations
International Nuclear Information System (INIS)
Tapia, V.
1990-01-01
A method to solve differential equations containing the variational operator as the derivation operation is presented. They are called variational differential equations (VDE). The solution to a VDE should be a function containing the derivatives, with respect to the base space coordinates, of the fields up to a generic order s: a s-th-order function. The variational operator doubles the order of the function on which it acts. Therefore, in order to make compatible the orders of the different terms appearing in a VDE, the solution should be a function containing the derivatives of the fields at all orders. But this takes us again back to the functional methods. In order to avoid this, one must restrict the considerations, in the case of second-order VDEs, to the space of s-th-order functions on which the variational operator acts transitively. These functions have been characterized for a one-dimensional base space for the first- and second-order cases. These functions turn out to be polynomial in the highest-order derivatives of the fields with functions of the lower-order derivatives as coefficients. Then VDEs reduce to a system of coupled partial differential equations for the coefficients above mentioned. The importance of the method lies on the fact that the solutions to VDEs are in a one-to-one correspondence with the solutions of functional differential equations. The previous method finds direct applications in quantum field theory, where the Schroedinger equation plays a central role. Since the Schroedinger equation is reduced to a system of coupled partial differential equations, this provides a nonperturbative scheme for quantum field theory. As an example, the massless scalar field is considered
Application of Monte Carlo method to solving boundary value problem of differential equations
International Nuclear Information System (INIS)
Zuo Yinghong; Wang Jianguo
2012-01-01
This paper introduces the foundation of the Monte Carlo method and the way how to generate the random numbers. Based on the basic thought of the Monte Carlo method and finite differential method, the stochastic model for solving the boundary value problem of differential equations is built. To investigate the application of the Monte Carlo method to solving the boundary value problem of differential equations, the model is used to solve Laplace's equations with the first boundary condition and the unsteady heat transfer equation with initial values and boundary conditions. The results show that the boundary value problem of differential equations can be effectively solved with the Monte Carlo method, and the differential equations with initial condition can also be calculated by using a stochastic probability model which is based on the time-domain finite differential equations. Both the simulation results and theoretical analyses show that the errors of numerical results are lowered as the number of simulation particles is increased. (authors)
Exact Methods for Solving the Train Departure Matching Problem
DEFF Research Database (Denmark)
Haahr, Jørgen Thorlund; Bull, Simon Henry
In this paper we consider the train departure matching problem which is an important subproblem of the Rolling Stock Unit Management on Railway Sites problem introduced in the ROADEF/EURO Challenge 2014. The subproblem entails matching arriving train units to scheduled departing trains at a railway...... site while respecting multiple physical and operational constraints. In this paper we formally define that subproblem, prove its NP- hardness, and present two exact method approaches for solving the problem. First, we present a compact Mixed Integer Program formulation which we solve using a MIP solver...
Fibonacci-regularization method for solving Cauchy integral equations of the first kind
Directory of Open Access Journals (Sweden)
Mohammad Ali Fariborzi Araghi
2017-09-01
Full Text Available In this paper, a novel scheme is proposed to solve the first kind Cauchy integral equation over a finite interval. For this purpose, the regularization method is considered. Then, the collocation method with Fibonacci base function is applied to solve the obtained second kind singular integral equation. Also, the error estimate of the proposed scheme is discussed. Finally, some sample Cauchy integral equations stem from the theory of airfoils in fluid mechanics are presented and solved to illustrate the importance and applicability of the given algorithm. The tables in the examples show the efficiency of the method.
Flexibility in Mathematics Problem Solving Based on Adversity Quotient
Dina, N. A.; Amin, S. M.; Masriyah
2018-01-01
Flexibility is an ability which is needed in problem solving. One of the ways in problem solving is influenced by Adversity Quotient (AQ). AQ is the power of facing difficulties. There are three categories of AQ namely climber, camper, and quitter. This research is a descriptive research using qualitative approach. The aim of this research is to describe flexibility in mathematics problem solving based on Adversity Quotient. The subjects of this research are climber student, camper student, and quitter student. This research was started by giving Adversity Response Profile (ARP) questioner continued by giving problem solving task and interviews. The validity of data measurement was using time triangulation. The results of this research shows that climber student uses two strategies in solving problem and doesn’t have difficulty. The camper student uses two strategies in solving problem but has difficulty to finish the second strategies. The quitter student uses one strategy in solving problem and has difficulty to finish it.
New numerical method for solving the solute transport equation
International Nuclear Information System (INIS)
Ross, B.; Koplik, C.M.
1978-01-01
The solute transport equation can be solved numerically by approximating the water flow field by a network of stream tubes and using a Green's function solution within each stream tube. Compared to previous methods, this approach permits greater computational efficiency and easier representation of small discontinuities, and the results are easier to interpret physically. The method has been used to study hypothetical sites for disposal of high-level radioactive waste
Kuncoro, K. S.; Junaedi, I.; Dwijanto
2018-03-01
This study aimed to reveal the effectiveness of Project Based Learning with Resource Based Learning approach computer-aided program and analyzed problem-solving abilities in terms of problem-solving steps based on Polya stages. The research method used was mixed method with sequential explanatory design. The subject of this research was the students of math semester 4. The results showed that the S-TPS (Strong Top Problem Solving) and W-TPS (Weak Top Problem Solving) had good problem-solving abilities in each problem-solving indicator. The problem-solving ability of S-MPS (Strong Middle Problem Solving) and (Weak Middle Problem Solving) in each indicator was good. The subject of S-BPS (Strong Bottom Problem Solving) had a difficulty in solving the problem with computer program, less precise in writing the final conclusion and could not reflect the problem-solving process using Polya’s step. While the Subject of W-BPS (Weak Bottom Problem Solving) had not been able to meet almost all the indicators of problem-solving. The subject of W-BPS could not precisely made the initial table of completion so that the completion phase with Polya’s step was constrained.
Nisar, Ubaid Ahmed; Ashraf, Waqas; Qamar, Shamsul
2016-08-01
Numerical solutions of the hydrodynamical model of semiconductor devices are presented in one and two-space dimension. The model describes the charge transport in semiconductor devices. Mathematically, the models can be written as a convection-diffusion type system with a right hand side describing the relaxation effects and interaction with a self consistent electric field. The proposed numerical scheme is a splitting scheme based on the conservation element and solution element (CE/SE) method for hyperbolic step, and a semi-implicit scheme for the relaxation step. The numerical results of the suggested scheme are compared with the splitting scheme based on Nessyahu-Tadmor (NT) central scheme for convection step and the same semi-implicit scheme for the relaxation step. The effects of various parameters such as low field mobility, device length, lattice temperature and voltages for one-space dimensional hydrodynamic model are explored to further validate the generic applicability of the CE/SE method for the current model equations. A two dimensional simulation is also performed by CE/SE method for a MESFET device, producing results in good agreement with those obtained by NT-central scheme.
Modified Chebyshev Collocation Method for Solving Differential Equations
Directory of Open Access Journals (Sweden)
M Ziaul Arif
2015-05-01
Full Text Available This paper presents derivation of alternative numerical scheme for solving differential equations, which is modified Chebyshev (Vieta-Lucas Polynomial collocation differentiation matrices. The Scheme of modified Chebyshev (Vieta-Lucas Polynomial collocation method is applied to both Ordinary Differential Equations (ODEs and Partial Differential Equations (PDEs cases. Finally, the performance of the proposed method is compared with finite difference method and the exact solution of the example. It is shown that modified Chebyshev collocation method more effective and accurate than FDM for some example given.
Canonical Primal-Dual Method for Solving Non-convex Minimization Problems
Wu, Changzhi; Li, Chaojie; Gao, David Yang
2012-01-01
A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing...
Isotope decay equations solved by means of a recursive method
International Nuclear Information System (INIS)
Grant, Carlos
2009-01-01
The isotope decay equations have been solved using forward finite differences taking small time steps, among other methods. This is the case of the cell code WIMS, where it is assumed that concentrations of all fissionable isotopes remain constant during the integration interval among other simplifications. Even when the problem could be solved running through a logical tree, all algorithms used for resolution of these equations used an iterative programming formulation. That happened because nearly all computer languages used up to a recent past by the scientific programmers did not support recursion, such as the case of the old versions of FORTRAN or BASIC. Nowadays also an integral form of the depletion equations is used in Monte Carlo simulation. In this paper we propose another programming solution using a recursive algorithm, running through all descendants of each isotope and adding their contributions to all isotopes in each generation. The only assumption made for this solution is that fluxes remain constant during the whole time step. Recursive process is interrupted when a stable isotope was attained or the calculated contributions are smaller than a given precision. These algorithms can be solved by means an exact analytic method that can have some problems when circular loops appear for isotopes with alpha decay, and a more general polynomial method. Both methods are shown. (author)
[Reason for dormancy of Cuscuta chinensis seed and solving method].
Wang, Xuemin; He, Jiaqing; Cai, Jing; Dong, Zhenguo
2010-02-01
To study the reason for the deep dormancy of the aged Cuscuta chinensis seed and find the solving method. The separated and combined treatments were applied in the orthogonal designed experiments. The aged seed had well water-absorbency; the water and ethanol extracts of the seeds showed an inhibition effect on germination capacity of the seeds. The main reason for the deep dormancy of aged C. chinensis seed is the inhibitors existed in seed. There are two methods to solve the problem. The seeds is immersed in 98% of H2SO4 for 2 min followed by 500 mg x L(-1) of GA3 treatment for 60 min, or in 100 mg x L(-1) of NaOH for 20 min followed by 500 mg x L(-1) of GA3 treatment for 120 min.
An exact method for solving logical loops in reliability analysis
International Nuclear Information System (INIS)
Matsuoka, Takeshi
2009-01-01
This paper presents an exact method for solving logical loops in reliability analysis. The systems that include logical loops are usually described by simultaneous Boolean equations. First, present a basic rule of solving simultaneous Boolean equations. Next, show the analysis procedures for three-component system with external supports. Third, more detailed discussions are given for the establishment of logical loop relation. Finally, take up two typical structures which include more than one logical loop. Their analysis results and corresponding GO-FLOW charts are given. The proposed analytical method is applicable to loop structures that can be described by simultaneous Boolean equations, and it is very useful in evaluating the reliability of complex engineering systems.
Instructional Design-Based Research on Problem Solving Strategies
Emre-Akdogan, Elçin; Argün, Ziya
2016-01-01
The main goal of this study is to find out the effect of the instructional design method on the enhancement of problem solving abilities of students. Teaching sessions were applied to ten students who are in 11th grade, to teach them problem solving strategies which are working backwards, finding pattern, adopting a different point of view,…
Wavelet Methods for Solving Fractional Order Differential Equations
A. K. Gupta; S. Saha Ray
2014-01-01
Fractional calculus is a field of applied mathematics which deals with derivatives and integrals of arbitrary orders. The fractional calculus has gained considerable importance during the past decades mainly due to its application in diverse fields of science and engineering such as viscoelasticity, diffusion of biological population, signal processing, electromagnetism, fluid mechanics, electrochemistry, and many more. In this paper, we review different wavelet methods for solving both linea...
Qin, Yulin; Xiang, Jie; Wang, Rifeng; Zhou, Haiyan; Li, Kuncheng; Zhong, Ning
2012-12-01
Newell and Simon postulated that the basic steps in human problem-solving involve iteratively applying operators to transform the state of the problem to eventually achieve a goal. To check the neural basis of this framework, the present study focused on the basic processes in human heuristic problem-solving that the participants identified the current problem state and then recalled and applied the corresponding heuristic rules to change the problem state. A new paradigm, solving simplified Sudoku puzzles, was developed for an event-related functional magnetic resonance imaging (fMRI) study in problem solving. Regions of interest (ROIs), including the left prefrontal cortex, the bilateral posterior parietal cortex, the anterior cingulated cortex, the bilateral caudate nuclei, the bilateral fusiform, as well as the bilateral frontal eye fields, were found to be involved in the task. To obtain convergent evidence, in addition to traditional statistical analysis, we used the multivariate voxel classification method to check the accuracy of the predictions for the condition of the task from the blood oxygen level dependent (BOLD) response of the ROIs, using a new classifier developed in this study for fMRI data. To reveal the roles that the ROIs play in problem solving, we developed an ACT-R computational model of the information-processing processes in human problem solving, and tried to predict the BOLD response of the ROIs from the task. Advances in human problem-solving research after Newell and Simon are then briefly discussed. © 2012 The Institute of Psychology, Chinese Academy of Sciences and Blackwell Publishing Asia Pty Ltd.
Numerical method for solving the inverse problem of quantum scattering theory
International Nuclear Information System (INIS)
Ajrapetyan, R.G.; Puzynin, I.V.; Zhidkov, E.P.
1996-01-01
A new numerical method for solving the problem of the reconstruction of interaction potential by a phase shift given on a set of closed intervals in (l,k)-plane, satisfying certain geometrical 'Staircase Condition', is suggested. The method is based on the Variable Phase Approach and on the modification of the Continuous Analogy of the Newton Method. 22 refs., 1 fig
SOLVING ENGINEERING OPTIMIZATION PROBLEMS WITH THE SWARM INTELLIGENCE METHODS
Directory of Open Access Journals (Sweden)
V. Panteleev Andrei
2017-01-01
Full Text Available An important stage in problem solving process for aerospace and aerostructures designing is calculating their main charac- teristics optimization. The results of the four constrained optimization problems related to the design of various technical systems: such as determining the best parameters of welded beams, pressure vessel, gear, spring are presented. The purpose of each task is to minimize the cost and weight of the construction. The object functions in optimization practical problem are nonlinear functions with a lot of variables and a complex layer surface indentations. That is why using classical approach for extremum seeking is not efficient. Here comes the necessity of using such methods of optimization that allow to find a near optimal solution in acceptable amount of time with the minimum waste of computer power. Such methods include the methods of Swarm Intelligence: spiral dy- namics algorithm, stochastic diffusion search, hybrid seeker optimization algorithm. The Swarm Intelligence methods are designed in such a way that a swarm consisting of agents carries out the search for extremum. In search for the point of extremum, the parti- cles exchange information and consider their experience as well as the experience of population leader and the neighbors in some area. To solve the listed problems there has been designed a program complex, which efficiency is illustrated by the solutions of four applied problems. Each of the considered applied optimization problems is solved with all the three chosen methods. The ob- tained numerical results can be compared with the ones found in a swarm with a particle method. The author gives recommenda- tions on how to choose methods parameters and penalty function value, which consider inequality constraints.
A Meshfree Quasi-Interpolation Method for Solving Burgers’ Equation
Directory of Open Access Journals (Sweden)
Mingzhu Li
2014-01-01
Full Text Available The main aim of this work is to consider a meshfree algorithm for solving Burgers’ equation with the quartic B-spline quasi-interpolation. Quasi-interpolation is very useful in the study of approximation theory and its applications, since it can yield solutions directly without the need to solve any linear system of equations and overcome the ill-conditioning problem resulting from using the B-spline as a global interpolant. The numerical scheme is presented, by using the derivative of the quasi-interpolation to approximate the spatial derivative of the dependent variable and a low order forward difference to approximate the time derivative of the dependent variable. Compared to other numerical methods, the main advantages of our scheme are higher accuracy and lower computational complexity. Meanwhile, the algorithm is very simple and easy to implement and the numerical experiments show that it is feasible and valid.
Solving nonlinear evolution equation system using two different methods
Kaplan, Melike; Bekir, Ahmet; Ozer, Mehmet N.
2015-12-01
This paper deals with constructing more general exact solutions of the coupled Higgs equation by using the (G0/G, 1/G)-expansion and (1/G0)-expansion methods. The obtained solutions are expressed by three types of functions: hyperbolic, trigonometric and rational functions with free parameters. It has been shown that the suggested methods are productive and will be used to solve nonlinear partial differential equations in applied mathematics and engineering. Throughout the paper, all the calculations are made with the aid of the Maple software.
An Unconditionally Stable Method for Solving the Acoustic Wave Equation
Directory of Open Access Journals (Sweden)
Zhi-Kai Fu
2015-01-01
Full Text Available An unconditionally stable method for solving the time-domain acoustic wave equation using Associated Hermit orthogonal functions is proposed. The second-order time derivatives in acoustic wave equation are expanded by these orthogonal basis functions. By applying Galerkin temporal testing procedure, the time variable can be eliminated from the calculations. The restriction of Courant-Friedrichs-Levy (CFL condition in selecting time step for analyzing thin layer can be avoided. Numerical results show the accuracy and the efficiency of the proposed method.
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
International Nuclear Information System (INIS)
Coulomb, F.
1989-06-01
The aim of this work is to study methods for solving the diffusion equation, based on a primal or mixed-dual finite elements discretization and well suited for use on multiprocessors computers; domain decomposition methods are the subject of the main part of this study, the linear systems being solved by the block-Jacobi method. The origin of the diffusion equation is explained in short, and various variational formulations are reminded. A survey of iterative methods is given. The elemination of the flux or current is treated in the case of a mixed method. Numerical tests are performed on two examples of reactors, in order to compare mixed elements and Lagrange elements. A theoretical study of domain decomposition is led in the case of Lagrange finite elements, and convergence conditions for the block-Jacobi method are derived; the dissection decomposition is previously the purpose of a particular numerical analysis. In the case of mixed-dual finite elements, a study is led on examples and is confirmed by numerical tests performed for the dissection decomposition; furthermore, after being justified, decompositions along axes of symmetry are numerically tested. In the case of a decomposition into two subdomains, the dissection decomposition and the decomposition with an integrated interface are compared. Alternative directions methods are defined; the convergence of those relative to Lagrange elements is shown; in the case of mixed elements, convergence conditions are found [fr
Toward solving the sign problem with path optimization method
Mori, Yuto; Kashiwa, Kouji; Ohnishi, Akira
2017-12-01
We propose a new approach to circumvent the sign problem in which the integration path is optimized to control the sign problem. We give a trial function specifying the integration path in the complex plane and tune it to optimize the cost function which represents the seriousness of the sign problem. We call it the path optimization method. In this method, we do not need to solve the gradient flow required in the Lefschetz-thimble method and then the construction of the integration-path contour arrives at the optimization problem where several efficient methods can be applied. In a simple model with a serious sign problem, the path optimization method is demonstrated to work well; the residual sign problem is resolved and precise results can be obtained even in the region where the global sign problem is serious.
Analysis of mathematical problem-solving ability based on metacognition on problem-based learning
Mulyono; Hadiyanti, R.
2018-03-01
Problem-solving is the primary purpose of the mathematics curriculum. Problem-solving abilities influenced beliefs and metacognition. Metacognition as superordinate capabilities can direct, regulate cognition and motivation and then problem-solving processes. This study aims to (1) test and analyzes the quality of problem-based learning and (2) investigate the problem-solving capabilities based on metacognition. This research uses mixed method study with The subject research are class XI students of Mathematics and Science at High School Kesatrian 2 Semarang which divided into tacit use, aware use, strategic use and reflective use level. The collecting data using scale, interviews, and tests. The data processed with the proportion of test, t-test, and paired samples t-test. The result shows that the students with levels tacit use were able to complete the whole matter given, but do not understand what and why a strategy is used. Students with aware use level were able to solve the problem, be able to build new knowledge through problem-solving to the indicators, understand the problem, determine the strategies used, although not right. Students on the Strategic ladder Use can be applied and adopt a wide variety of appropriate strategies to solve the issues and achieved re-examine indicators of process and outcome. The student with reflective use level is not found in this study. Based on the results suggested that study about the identification of metacognition in problem-solving so that the characteristics of each level of metacognition more clearly in a more significant sampling. Teachers need to know in depth about the student metacognitive activity and its relationship with mathematical problem solving and another problem resolution.
ENGAGE: A Game Based Learning and Problem Solving Framework
2012-07-13
Gamification Summit 2012 Mensa Colloquium 2012.2: Social and Video Games Seattle Science Festival TED Salon Vancouver : http...From - To) 6/1/2012 – 6/30/2012 4. TITLE AND SUBTITLE ENGAGE: A Game Based Learning and Problem Solving Framework 5a. CONTRACT NUMBER N/A 5b...Popović ENGAGE: A Game Based Learning and Problem Solving Framework (Task 1 Month 4) Progress, Status and Management Report Monthly Progress
How to solve it a new aspect of mathematical method
Polya, G
2014-01-01
A perennial bestseller by eminent mathematician G. Polya, How to Solve It will show anyone in any field how to think straight. In lucid and appealing prose, Polya reveals how the mathematical method of demonstrating a proof or finding an unknown can be of help in attacking any problem that can be "reasoned" out-from building a bridge to winning a game of anagrams. Generations of readers have relished Polya's deft-indeed, brilliant-instructions on stripping away irrelevancies and going straight to the heart of the problem.
Gabor Wave Packet Method to Solve Plasma Wave Equations
International Nuclear Information System (INIS)
Pletzer, A.; Phillips, C.K.; Smithe, D.N.
2003-01-01
A numerical method for solving plasma wave equations arising in the context of mode conversion between the fast magnetosonic and the slow (e.g ion Bernstein) wave is presented. The numerical algorithm relies on the expansion of the solution in Gaussian wave packets known as Gabor functions, which have good resolution properties in both real and Fourier space. The wave packets are ideally suited to capture both the large and small wavelength features that characterize mode conversion problems. The accuracy of the scheme is compared with a standard finite element approach
Application of the Generalized Differential Quadrature Method in Solving Burgers' Equations
International Nuclear Information System (INIS)
Mokhtari, R.; Toodar, A. Samadi; Chegini, N.G.
2011-01-01
The aim of this paper is to obtain numerical solutions of the one-dimensional, two-dimensional and coupled Burgers' equations through the generalized differential quadrature method (GDQM). The polynomial-based differential quadrature (PDQ) method is employed and the obtained system of ordinary differential equations is solved via the total variation diminishing Runge-Kutta (TVD-RK) method. The numerical solutions are satisfactorily coincident with the exact solutions. The method can compete against the methods applied in the literature. (general)
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...
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.
International Nuclear Information System (INIS)
Khader, M. M.; Kumar, Sunil; Abbasbandy, S.
2013-01-01
We present a new reliable analytical study for solving the discontinued problems arising in nanotechnology. Such problems are presented as nonlinear differential—difference equations. The proposed method is based on the Laplace transform with the homotopy analysis method (HAM). This method is a powerful tool for solving a large amount of problems. This technique provides a series of functions which may converge to the exact solution of the problem. A good agreement between the obtained solution and some well-known results is obtained
An L-stable method for solving stiff hydrodynamics
Li, Shengtai
2017-07-01
We develop a new method for simulating the coupled dynamics of gas and multi-species dust grains. The dust grains are treated as pressure-less fluids and their coupling with gas is through stiff drag terms. If an explicit method is used, the numerical time step is subject to the stopping time of the dust particles, which can become extremely small for small grains. The previous semi-implicit method [1] uses second-order trapezoidal rule (TR) on the stiff drag terms and it works only for moderately small size of the dust particles. This is because TR method is only A-stable not L-stable. In this work, we use TR-BDF2 method [2] for the stiff terms in the coupled hydrodynamic equations. The L-stability of TR-BDF2 proves essential in treating a number of dust species. The combination of TR-BDF2 method with the explicit discretization of other hydro terms can solve a wide variety of stiff hydrodynamics equations accurately and efficiently. We have implemented our method in our LA-COMPASS (Los Alamos Computational Astrophysics Suite) package. We have applied the code to simulate some dusty proto-planetary disks and obtained very good match with astronomical observations.
A method of solving simple harmonic oscillator Schroedinger equation
Maury, Juan Carlos F.
1995-01-01
A usual step in solving totally Schrodinger equation is to try first the case when dimensionless position independent variable w is large. In this case the Harmonic Oscillator equation takes the form (d(exp 2)/dw(exp 2) - w(exp 2))F = 0, and following W.K.B. method, it gives the intermediate corresponding solution F = exp(-w(exp 2)/2), which actually satisfies exactly another equation, (d(exp 2)/dw(exp 2) + 1 - w(exp 2))F = 0. We apply a different method, useful in anharmonic oscillator equations, similar to that of Rampal and Datta, and although it is slightly more complicated however it is also more general and systematic.
A New Method for Solving Multiobjective Bilevel Programs
Directory of Open Access Journals (Sweden)
Ying Ji
2017-01-01
Full Text Available We study a class of multiobjective bilevel programs with the weights of objectives being uncertain and assumed to belong to convex and compact set. To the best of our knowledge, there is no study about this class of problems. We use a worst-case weighted approach to solve this class of problems. Our “worst-case weighted multiobjective bilevel programs” model supposes that each player (leader or follower has a set of weights to their objectives and wishes to minimize their maximum weighted sum objective where the maximization is with respect to the set of weights. This new model gives rise to a new Pareto optimum concept, which we call “robust-weighted Pareto optimum”; for the worst-case weighted multiobjective optimization with the weight set of each player given as a polytope, we show that a robust-weighted Pareto optimum can be obtained by solving mathematical programing with equilibrium constraints (MPEC. For an application, we illustrate the usefulness of the worst-case weighted multiobjective optimization to a supply chain risk management under demand uncertainty. By the comparison with the existing weighted approach, we show that our method is more robust and can be more efficiently applied to real-world problems.
Solving point reactor kinetic equations by time step-size adaptable numerical methods
International Nuclear Information System (INIS)
Liao Chaqing
2007-01-01
Based on the analysis of effects of time step-size on numerical solutions, this paper showed the necessity of step-size adaptation. Based on the relationship between error and step-size, two-step adaptation methods for solving initial value problems (IVPs) were introduced. They are Two-Step Method and Embedded Runge-Kutta Method. PRKEs were solved by implicit Euler method with step-sizes optimized by using Two-Step Method. It was observed that the control error has important influence on the step-size and the accuracy of solutions. With suitable control errors, the solutions of PRKEs computed by the above mentioned method are accurate reasonably. The accuracy and usage of MATLAB built-in ODE solvers ode23 and ode45, both of which adopt Runge-Kutta-Fehlberg method, were also studied and discussed. (authors)
Method for solving quantum field theory in the Heisenberg picture
International Nuclear Information System (INIS)
Nakanishi, Noboru
2004-01-01
This paper is a review of the method for solving quantum field theory in the Heisenberg picture, developed by Abe and Nakanishi since 1991. Starting from field equations and canonical (anti) commutation relations, one sets up a (q-number) Cauchy problem for the totality of d-dimensional (anti) commutators between the fundamental fields, where d is the number of spacetime dimensions. Solving this Cauchy problem, one obtains the operator solution of the theory. Then one calculates all multiple commutators. A representation of the operator solution is obtained by constructing the set of all Wightman functions for the fundamental fields; the truncated Wightman functions are constructed so as to be consistent with all vacuum expectation values of the multiple commutators mentioned above and with the energy-positivity condition. By applying the method described above, exact solutions to various 2-dimensional gauge-theory and quantum-gravity models are found explicitly. The validity of these solutions is confirmed by comparing them with the conventional perturbation-theoretical results. However, a new anomalous feature, called the ''field-equation anomaly'', is often found to appear, and its perturbation-theoretical counterpart, unnoticed previously, is discussed. The conventional notion of an anomaly with respect to symmetry is reconsidered on the basis of the field-equation anomaly, and the derivation of the critical dimension in the BRS-formulated bosonic string theory is criticized. The method outlined above is applied to more realistic theories by expanding everything in powers of the relevant parameter, but this expansion is not equivalent to the conventional perturbative expansion. The new expansion is BRS-invariant at each order, in contrast to that in the conventional perturbation theory. Higher-order calculations are generally extremely laborious to perform explicitly. (author)
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.
New Method for Solving Inductive Electric Fields in the Ionosphere
Vanhamäki, H.
2005-12-01
We present a new method for calculating inductive electric fields in the ionosphere. It is well established that on large scales the ionospheric electric field is a potential field. This is understandable, since the temporal variations of large scale current systems are generally quite slow, in the timescales of several minutes, so inductive effects should be small. However, studies of Alfven wave reflection have indicated that in some situations inductive phenomena could well play a significant role in the reflection process, and thus modify the nature of ionosphere-magnetosphere coupling. The input to our calculation method are the time series of the potential part of the ionospheric electric field together with the Hall and Pedersen conductances. The output is the time series of the induced rotational part of the ionospheric electric field. The calculation method works in the time-domain and can be used with non-uniform, time-dependent conductances. In addition no particular symmetry requirements are imposed on the input potential electric field. The presented method makes use of special non-local vector basis functions called Cartesian Elementary Current Systems (CECS). This vector basis offers a convenient way of representing curl-free and divergence-free parts of 2-dimensional vector fields and makes it possible to solve the induction problem using simple linear algebra. The new calculation method is validated by comparing it with previously published results for Alfven wave reflection from uniformly conducting ionosphere.
Solving some problems of engineering seismology by structural method
International Nuclear Information System (INIS)
Ishtev, K.G.; Hadjikov, L.M.; Dineva, P.S.; Jordanov, P.P.
1983-01-01
The work suggests a method for solving the direct and inverse problems of the engineer seismology by means of the structural approach of the systems theory. This approach gives a possibility for a simultaneous accounting of the two basic types of damping of the seismic signals in the earth foundation-geometrical damping and a damping in consequence of a dissipative energy loss. By the structural scheme an automatic account is made of the geometric damping of the signals. The damping from a dissipative energy loss on the other hand is accounted for through a choice of the type of frequency characteristics or the transmission functions of the different layers. With a few examples the advantages of the model including the two types of attenuation of the seismic signal are illustrated. An integral coefficient of damping is calculated which analogously to the frequency functions represents a generalized characteristic of is the whole earth foundation. (orig./HP)
Efficient Method to Approximately Solve Retrial Systems with Impatience
Directory of Open Access Journals (Sweden)
Jose Manuel Gimenez-Guzman
2012-01-01
Full Text Available We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it considers the system in its Markov Decision Process setting. This technique, known as value extrapolation, truncates the infinite state space using a polynomial extrapolation method to approach the states outside the truncated state space. A numerical evaluation is carried out to evaluate this technique and to compare its performance with previous techniques. The obtained results show that value extrapolation greatly outperforms the previous approaches appeared in the literature not only in terms of accuracy but also in terms of computational cost.
DEFF Research Database (Denmark)
Reck, Kasper; Thomsen, Erik Vilain; Hansen, Ole
2011-01-01
. The solution of the mapped Helmholtz equation is found by solving an infinite series of Poisson equations using two dimensional Fourier series. The solution is entirely based on analytical expressions and is not mesh dependent. The analytical results are compared to a numerical (finite element method) solution......The scalar wave equation, or Helmholtz equation, describes within a certain approximation the electromagnetic field distribution in a given system. In this paper we show how to solve the Helmholtz equation in complex geometries using conformal mapping and the homotopy perturbation method...
On a numereeical method for solving the Faddv integral equation without deformation of contour
International Nuclear Information System (INIS)
Belyaev, V.O.; Moller, K.
1976-01-01
A numerical method is proposed for solving the Faddeev equation for separable potentials at positive total energy. The method is based on the fact that after applying a simple interpolation procedure the logarithmic singularities in the kernel of the integral equation can be extracted in the same way as usually the pole singularity is extracted. The method has been applied to calculate the eigenvalues of the Faddeev kernel
[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (2)].
Murase, Kenya
2015-01-01
In this issue, symbolic methods for solving differential equations were firstly introduced. Of the symbolic methods, Laplace transform method was also introduced together with some examples, in which this method was applied to solving the differential equations derived from a two-compartment kinetic model and an equivalent circuit model for membrane potential. Second, series expansion methods for solving differential equations were introduced together with some examples, in which these methods were used to solve Bessel's and Legendre's differential equations. In the next issue, simultaneous differential equations and various methods for solving these differential equations will be introduced together with some examples in medical physics.
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.
Decision-making and problem-solving methods in automation technology
Hankins, W. W.; Pennington, J. E.; Barker, L. K.
1983-01-01
The state of the art in the automation of decision making and problem solving is reviewed. The information upon which the report is based was derived from literature searches, visits to university and government laboratories performing basic research in the area, and a 1980 Langley Research Center sponsored conferences on the subject. It is the contention of the authors that the technology in this area is being generated by research primarily in the three disciplines of Artificial Intelligence, Control Theory, and Operations Research. Under the assumption that the state of the art in decision making and problem solving is reflected in the problems being solved, specific problems and methods of their solution are often discussed to elucidate particular aspects of the subject. Synopses of the following major topic areas comprise most of the report: (1) detection and recognition; (2) planning; and scheduling; (3) learning; (4) theorem proving; (5) distributed systems; (6) knowledge bases; (7) search; (8) heuristics; and (9) evolutionary programming.
Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
Liu, Kunqi; Zhang, Jingmin; Liu, Gang; Kang, Lishan
Satisfiability (SAT) problem is an NP-complete problem. Based on the analysis about it, SAT problem is translated equally into an optimization problem on the minimum of objective function. A hybrid differential evolution algorithm is proposed to solve the Satisfiability problem. It makes full use of strong local search capacity of hill-climbing algorithm and strong global search capability of differential evolution algorithm, which makes up their disadvantages, improves the efficiency of algorithm and avoids the stagnation phenomenon. The experiment results show that the hybrid algorithm is efficient in solving SAT problem.
Solving the interval type-2 fuzzy polynomial equation using the ranking method
Rahman, Nurhakimah Ab.; Abdullah, Lazim
2014-07-01
Polynomial equations with trapezoidal and triangular fuzzy numbers have attracted some interest among researchers in mathematics, engineering and social sciences. There are some methods that have been developed in order to solve these equations. In this study we are interested in introducing the interval type-2 fuzzy polynomial equation and solving it using the ranking method of fuzzy numbers. The ranking method concept was firstly proposed to find real roots of fuzzy polynomial equation. Therefore, the ranking method is applied to find real roots of the interval type-2 fuzzy polynomial equation. We transform the interval type-2 fuzzy polynomial equation to a system of crisp interval type-2 fuzzy polynomial equation. This transformation is performed using the ranking method of fuzzy numbers based on three parameters, namely value, ambiguity and fuzziness. Finally, we illustrate our approach by numerical example.
International Nuclear Information System (INIS)
Potemki, Valeri G.; Borisevich, Valentine D.; Yupatov, Sergei V.
1996-01-01
This paper describes the the next evolution step in development of the direct method for solving systems of Nonlinear Algebraic Equations (SNAE). These equations arise from the finite difference approximation of original nonlinear partial differential equations (PDE). This method has been extended on the SNAE with three variables. The solving SNAE bases on Reiterating General Singular Value Decomposition of rectangular matrix pencils (RGSVD-algorithm). In contrast to the computer algebra algorithm in integer arithmetic based on the reduction to the Groebner's basis that algorithm is working in floating point arithmetic and realizes the reduction to the Kronecker's form. The possibilities of the method are illustrated on the example of solving the one-dimensional diffusion equation for 3-component model isotope mixture in a ga centrifuge. The implicit scheme for the finite difference equations without simplifying the nonlinear properties of the original equations is realized. The technique offered provides convergence to the solution for the single run. The Toolbox SNAE is developed in the framework of the high performance numeric computation and visualization software MATLAB. It includes more than 30 modules in MATLAB language for solving SNAE with two and three variables. (author)
A New Method to Solve Numeric Solution of Nonlinear Dynamic System
Directory of Open Access Journals (Sweden)
Min Hu
2016-01-01
Full Text Available It is well known that the cubic spline function has advantages of simple forms, good convergence, approximation, and second-order smoothness. A particular class of cubic spline function is constructed and an effective method to solve the numerical solution of nonlinear dynamic system is proposed based on the cubic spline function. Compared with existing methods, this method not only has high approximation precision, but also avoids the Runge phenomenon. The error analysis of several methods is given via two numeric examples, which turned out that the proposed method is a much more feasible tool applied to the engineering practice.
Exp-function method for solving fractional partial differential equations.
Zheng, Bin
2013-01-01
We extend the Exp-function method to fractional partial differential equations in the sense of modified Riemann-Liouville derivative based on nonlinear fractional complex transformation. For illustrating the validity of this method, we apply it to the space-time fractional Fokas equation and the nonlinear fractional Sharma-Tasso-Olver (STO) equation. As a result, some new exact solutions for them are successfully established.
Directory of Open Access Journals (Sweden)
Xiaolin Zhu
2014-01-01
Full Text Available This paper studies the T-stability of the Heun method and balanced method for solving stochastic differential delay equations (SDDEs. Two T-stable conditions of the Heun method are obtained for two kinds of linear SDDEs. Moreover, two conditions under which the balanced method is T-stable are obtained for two kinds of linear SDDEs. Some numerical examples verify the theoretical results proposed.
A meta-heuristic method for solving scheduling problem: crow search algorithm
Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi
2018-04-01
Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.
Piret, Cécile
2012-05-01
Much work has been done on reconstructing arbitrary surfaces using the radial basis function (RBF) method, but one can hardly find any work done on the use of RBFs to solve partial differential equations (PDEs) on arbitrary surfaces. In this paper, we investigate methods to solve PDEs on arbitrary stationary surfaces embedded in . R3 using the RBF method. We present three RBF-based methods that easily discretize surface differential operators. We take advantage of the meshfree character of RBFs, which give us a high accuracy and the flexibility to represent the most complex geometries in any dimension. Two out of the three methods, which we call the orthogonal gradients (OGr) methods are the result of our work and are hereby presented for the first time. © 2012 Elsevier Inc.
Efficient methods for solving discrete topology design problems in the PLATO-N project
DEFF Research Database (Denmark)
Canh, Nam Nguyen; Stolpe, Mathias
This paper considers the general multiple load structural topology design problems in the framework of the PLATO-N project. The problems involve a large number of discrete design variables and were modeled as a non-convex mixed 0–1 program. For the class of problems considered, a global...... optimization method based on the branch-and-cut concept was developed and implemented. In the method a large number of continuous relaxations were solved. We also present an algorithm for generating cuts to strengthen the quality of the relaxations. Several heuristics were also investigated to obtain efficient...... algorithms. The branch and cut method is used to solve benchmark examples which can be used to validate other methods and heuristics....
International Nuclear Information System (INIS)
Tao Ganqiang; Yu Qing; Xiao Xiao
2011-01-01
Viscous and incompressible fluid flow is important for numerous engineering mechanics problems. Because of high non linear and incompressibility for Navier-Stokes equation, it is very difficult to solve Navier-Stokes equation by numerical method. According to its characters of Navier-Stokes equation, quartic derivation controlling equation of the two dimensional incompressible Navier-Stokes equation is set up firstly. The method solves the problem for dealing with vorticity boundary and automatically meets incompressibility condition. Then Finite Element equation for Navier-Stokes equation is proposed by using quadratic quadrilateral unit with 8 nodes in which the unit function is quadratic and non linear.-Based on it, the Finite Element program of quadratic quadrilateral unit with 8 nodes is developed. Lastly, numerical experiment proves the accuracy and dependability of the method and also shows the method has good application prospect in computational fluid mechanics. (authors)
Modern architectures for intelligent systems: reusable ontologies and problem-solving methods.
Musen, M A
1998-01-01
When interest in intelligent systems for clinical medicine soared in the 1970s, workers in medical informatics became particularly attracted to rule-based systems. Although many successful rule-based applications were constructed, development and maintenance of large rule bases remained quite problematic. In the 1980s, an entire industry dedicated to the marketing of tools for creating rule-based systems rose and fell, as workers in medical informatics began to appreciate deeply why knowledge acquisition and maintenance for such systems are difficult problems. During this time period, investigators began to explore alternative programming abstractions that could be used to develop intelligent systems. The notions of "generic tasks" and of reusable problem-solving methods became extremely influential. By the 1990s, academic centers were experimenting with architectures for intelligent systems based on two classes of reusable components: (1) domain-independent problem-solving methods-standard algorithms for automating stereotypical tasks--and (2) domain ontologies that captured the essential concepts (and relationships among those concepts) in particular application areas. This paper will highlight how intelligent systems for diverse tasks can be efficiently automated using these kinds of building blocks. The creation of domain ontologies and problem-solving methods is the fundamental end product of basic research in medical informatics. Consequently, these concepts need more attention by our scientific community.
A Comparative Study of Three Different Mathematical Methods for Solving the Unit Commitment Problem
Directory of Open Access Journals (Sweden)
Mehmet Kurban
2009-01-01
Full Text Available The unit commitment (UC problem which is an important subject in power system engineering is solved by using Lagragian relaxation (LR, penalty function (PF, and augmented Lagrangian penalty function (ALPF methods due to their higher solution quality and faster computational time than metaheuristic approaches. This problem is considered to be a nonlinear programming-(NP- hard problem because it is nonlinear, mixed-integer, and nonconvex. These three methods used for solving the problem are based on dual optimization techniques. ALPF method which combines the algorithmic aspects of both LR and PF methods is firstly used for solving the UC problem. These methods are compared to each other based on feasible schedule for each stage, feasible cost, dual cost, duality gap, duration time, and number of iterations. The numerical results show that the ALPF method gives the best duality gap, feasible and dual cost instead of worse duration time and the number of iterations. The four-unit Tuncbilek thermal plant which is located in Kutahya region in Turkey is chosen as a test system in this study. The programs used for all the analyses are coded and implemented using general algebraic modeling system (GAMS.
An Efficient Approach for Solving Mesh Optimization Problems Using Newton’s Method
Directory of Open Access Journals (Sweden)
Jibum Kim
2014-01-01
Full Text Available We present an efficient approach for solving various mesh optimization problems. Our approach is based on Newton’s method, which uses both first-order (gradient and second-order (Hessian derivatives of the nonlinear objective function. The volume and surface mesh optimization algorithms are developed such that mesh validity and surface constraints are satisfied. We also propose several Hessian modification methods when the Hessian matrix is not positive definite. We demonstrate our approach by comparing our method with nonlinear conjugate gradient and steepest descent methods in terms of both efficiency and mesh quality.
Khader, M M
2013-10-01
In this paper, an efficient numerical method for solving the fractional delay differential equations (FDDEs) is considered. The fractional derivative is described in the Caputo sense. The proposed method is based on the derived approximate formula of the Laguerre polynomials. The properties of Laguerre polynomials are utilized to reduce FDDEs to a linear or nonlinear system of algebraic equations. Special attention is given to study the error and the convergence analysis of the proposed method. Several numerical examples are provided to confirm that the proposed method is in excellent agreement with the exact solution.
Karatas, Ilhan; Baki, Adnan
2013-01-01
Problem solving is recognized as an important life skill involving a range of processes including analyzing, interpreting, reasoning, predicting, evaluating and reflecting. For that reason educating students as efficient problem solvers is an important role of mathematics education. Problem solving skill is the centre of mathematics curriculum.…
An effortless hybrid method to solve economic load dispatch problem in power systems
International Nuclear Information System (INIS)
Pourakbari-Kasmaei, M.; Rashidi-Nejad, M.
2011-01-01
Highlights: → We proposed a fast method to get feasible solution and avoid futile search. → The method dramatically improves search efficiency and solution quality. → Applied to solve constrained ED problems of power systems with 6 and 15 unit. → Superiority of this method in both aspects of financial and CPU time is remarkable. - Abstract: This paper proposes a new approach and coding scheme for solving economic dispatch problems (ED) in power systems through an effortless hybrid method (EHM). This novel coding scheme can effectively prevent futile searching and also prevents obtaining infeasible solutions through the application of stochastic search methods, consequently dramatically improves search efficiency and solution quality. The dominant constraint of an economic dispatch problem is power balance. The operational constraints, such as generation limitations, ramp rate limits, prohibited operating zones (POZ), network loss are considered for practical operation. Firstly, in the EHM procedure, the output of generator is obtained with a lambda iteration method and without considering POZ and later in a genetic based algorithm this constraint is satisfied. To demonstrate its efficiency, feasibility and fastness, the EHM algorithm was applied to solve constrained ED problems of power systems with 6 and 15 units. The simulation results obtained from the EHM were compared to those achieved from previous literature in terms of solution quality and computational efficiency. Results reveal that the superiority of this method in both aspects of financial and CPU time.
Mei, Shu-Li; Lv, Hong-Liang; Ma, Qin
2008-01-01
Based on restricted variational principle, a novel method for interval wavelet construction is proposed. For the excellent local property of quasi-Shannon wavelet, its interval wavelet is constructed, and then applied to solve ordinary differential equations. Parameter choices for the interval wavelet method are discussed and its numerical performance is demonstrated.
International Nuclear Information System (INIS)
Feit, M.D.; Fleck, J.A. Jr.
1989-01-01
We describe a spectral method for solving the paraxial wave equation in cylindrical geometry that is based on expansion of the exponential evolution operator in a Taylor series and use of fast Fourier transforms to evaluate derivatives. A fourth-order expansion gives excellent agreement with a two-transverse-dimensional split-operator calculation at a fraction of the cost in computation time per z step and at a considerable savings in storage
Problem solving - an interactive active method for teaching the thermokinetic concept
Directory of Open Access Journals (Sweden)
Odochian Lucia
2014-07-01
Full Text Available The paper describes a strategy that uses problem solving to teach the thermokinetic concept, based on student’s previously established proficiency in thermochemistry and kinetics. Chemistry teachers often use this method because it ensures easy achievement of both formative and informative science skills. This teaching strategy is tailored for students that prove special intellectual resources, Olympiad participants and to those who find chemistry a potential professional route
Mossuto, Mark
2009-01-01
The adoption of problem-based learning as a teaching method in the advertising and public relations programs offered by the Business TAFE (Technical and Further Education) School at RMIT University is explored in this paper. The effect of problem-based learning on student engagement, student learning and contextualised problem-solving was…
S-bases as a tool to solve reduction problems for Feynman integrals
International Nuclear Information System (INIS)
Smirnov, A.V.; Smirnov, V.A.
2006-01-01
We suggest a mathematical definition of the notion of master integrals and present a brief review of algorithmic methods to solve reduction problems for Feynman integrals based on integration by parts relations. In particular, we discuss a recently suggested reduction algorithm which uses Groebner bases. New results obtained with its help for a family of three-loop Feynman integrals are outlined
S-bases as a tool to solve reduction problems for Feynman integrals
Energy Technology Data Exchange (ETDEWEB)
Smirnov, A.V. [Scientific Research Computing Center of Moscow State University, Moscow 119992 (Russian Federation); Smirnov, V.A. [Nuclear Physics Institute of Moscow State University, Moscow 119992 (Russian Federation)
2006-10-15
We suggest a mathematical definition of the notion of master integrals and present a brief review of algorithmic methods to solve reduction problems for Feynman integrals based on integration by parts relations. In particular, we discuss a recently suggested reduction algorithm which uses Groebner bases. New results obtained with its help for a family of three-loop Feynman integrals are outlined.
Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun
2017-03-01
H ∞ control is a powerful method to solve the disturbance attenuation problems that occur in some control systems. The design of such controllers relies on solving the zero-sum game (ZSG). But in practical applications, the exact dynamics is mostly unknown. Identification of dynamics also produces errors that are detrimental to the control performance. To overcome this problem, an iterative adaptive dynamic programming algorithm is proposed in this paper to solve the continuous-time, unknown nonlinear ZSG with only online data. A model-free approach to the Hamilton-Jacobi-Isaacs equation is developed based on the policy iteration method. Control and disturbance policies and value are approximated by neural networks (NNs) under the critic-actor-disturber structure. The NN weights are solved by the least-squares method. According to the theoretical analysis, our algorithm is equivalent to a Gauss-Newton method solving an optimization problem, and it converges uniformly to the optimal solution. The online data can also be used repeatedly, which is highly efficient. Simulation results demonstrate its feasibility to solve the unknown nonlinear ZSG. When compared with other algorithms, it saves a significant amount of online measurement time.
Development of Smartphone e-Modul by Problem Solving Method for Biot-Savart Theory
Prastyaningrum, Ihtiari; Handhika, Jeffry
2017-11-01
Biot-Savart law is an equation that describes the magnetic field created by a current-carrying wire and allows you to calculate its strength at various points. Biot-Savart law is too difficult to be understood, especially about the mathematics concept. Based on the situation, developed an interactive media that’s an Electronic Module. This module based on the problem-solving method and can be accessed by smartphone. This research by using a development method, where is, an electronic module is created by Adobe Flash software. By the development of this module is expected that can improve the ability of mathematics concept analytical.
Workflow Agents vs. Expert Systems: Problem Solving Methods in Work Systems Design
Clancey, William J.; Sierhuis, Maarten; Seah, Chin
2009-01-01
During the 1980s, a community of artificial intelligence researchers became interested in formalizing problem solving methods as part of an effort called "second generation expert systems" (2nd GES). How do the motivations and results of this research relate to building tools for the workplace today? We provide an historical review of how the theory of expertise has developed, a progress report on a tool for designing and implementing model-based automation (Brahms), and a concrete example how we apply 2nd GES concepts today in an agent-based system for space flight operations (OCAMS). Brahms incorporates an ontology for modeling work practices, what people are doing in the course of a day, characterized as "activities." OCAMS was developed using a simulation-to-implementation methodology, in which a prototype tool was embedded in a simulation of future work practices. OCAMS uses model-based methods to interactively plan its actions and keep track of the work to be done. The problem solving methods of practice are interactive, employing reasoning for and through action in the real world. Analogously, it is as if a medical expert system were charged not just with interpreting culture results, but actually interacting with a patient. Our perspective shifts from building a "problem solving" (expert) system to building an actor in the world. The reusable components in work system designs include entire "problem solvers" (e.g., a planning subsystem), interoperability frameworks, and workflow agents that use and revise models dynamically in a network of people and tools. Consequently, the research focus shifts so "problem solving methods" include ways of knowing that models do not fit the world, and ways of interacting with other agents and people to gain or verify information and (ultimately) adapt rules and procedures to resolve problematic situations.
Activity based costing (ABC Method
Directory of Open Access Journals (Sweden)
Prof. Ph.D. Saveta Tudorache
2008-05-01
Full Text Available In the present paper the need and advantages are presented of using the Activity BasedCosting method, need arising from the need of solving the information pertinence issue. This issue has occurreddue to the limitation of classic methods in this field, limitation also reflected by the disadvantages ofsuch classic methods in establishing complete costs.
An algebraic method to solve the Tavis-Cummings problem
International Nuclear Information System (INIS)
Vadejko, I.P.; Miroshnichenko, G.P.; Rybin, A.V.; Timonen, J.
2003-01-01
We study cooperative behaviour of the system of two-level atoms coupled to a single mode of the electromagnetic field in the resonator. We have developed a general procedure allowing one to rewrite a polynomial deformed SU(2) algebra in terms of another polynomial deformation. Using these methods, we have constructed a perturbation series for the Tavis-Cummings Hamiltonian and diagonalized it in the third order. Based on the zero-order Hamiltonian we calculate the intensity of spontaneous emission of N two-level atoms inside a cavity, which are in thermal equilibrium with the reservoir. The atom-atom correlation determining superradiance in the system is analyzed
[Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (1)].
Murase, Kenya
2014-01-01
Utilization of differential equations and methods for solving them in medical physics are presented. First, the basic concept and the kinds of differential equations were overviewed. Second, separable differential equations and well-known first-order and second-order differential equations were introduced, and the methods for solving them were described together with several examples. In the next issue, the symbolic and series expansion methods for solving differential equations will be mainly introduced.
A rational function based scheme for solving advection equation
International Nuclear Information System (INIS)
Xiao, Feng; Yabe, Takashi.
1995-07-01
A numerical scheme for solving advection equations is presented. The scheme is derived from a rational interpolation function. Some properties of the scheme with respect to convex-concave preserving and monotone preserving are discussed. We find that the scheme is attractive in surpressinging overshoots and undershoots even in the vicinities of discontinuity. The scheme can also be easily swicthed as the CIP (Cubic interpolated Pseudo-Particle) method to get a third-order accuracy in smooth region. Numbers of numerical tests are carried out to show the non-oscillatory and less diffusive nature of the scheme. (author)
The role of problem solving method on the improvement of mathematical learning
Directory of Open Access Journals (Sweden)
Saeed Mokhtari-Hassanabad
2012-10-01
Full Text Available In history of education, problem solving is one of the important educational goals and teachers or parents have intended that their students have capacity of problem solving. In present research, it is tried that study the problem solving method for mathematical learning. This research is implemented via quasi-experimental method on 49 boy students at high school. The results of Leven test and T-test indicated that problem solving method has more effective on the improvement of mathematical learning than traditional instruction method. Therefore it seems that teachers of mathematics must apply the problem solving method in educational systems till students became self-efficiency in mathematical problem solving.
An analysis of the Six Sigma DMAIC method from the perspective of problem solving
de Mast, J.; Lokkerbol, J.
2012-01-01
The DMAIC (Define-Measure-Analyze-Improve-Control) method in Six Sigma is often described as an approach for problem solving. This paper compares critically the DMAIC method with insights from scientific theories in the field of problem solving. As a single authoritative account of the DMAIC method
Directory of Open Access Journals (Sweden)
San-Yang Liu
2014-01-01
Full Text Available Two unified frameworks of some sufficient descent conjugate gradient methods are considered. Combined with the hyperplane projection method of Solodov and Svaiter, they are extended to solve convex constrained nonlinear monotone equations. Their global convergence is proven under some mild conditions. Numerical results illustrate that these methods are efficient and can be applied to solve large-scale nonsmooth equations.
Application of Homotopy Analysis Method to Solve Relativistic Toda Lattice System
International Nuclear Information System (INIS)
Wang Qi
2010-01-01
In this letter, the homotopy analysis method is successfully applied to solve the Relativistic Toda lattice system. Comparisons are made between the results of the proposed method and exact solutions. Analysis results show that homotopy analysis method is a powerful and easy-to-use analytic tool to solve systems of differential-difference equations. (general)
Web-Based Problem-Solving Assignment and Grading System
Brereton, Giles; Rosenberg, Ronald
2014-11-01
In engineering courses with very specific learning objectives, such as fluid mechanics and thermodynamics, it is conventional to reinforce concepts and principles with problem-solving assignments and to measure success in problem solving as an indicator of student achievement. While the modern-day ease of copying and searching for online solutions can undermine the value of traditional assignments, web-based technologies also provide opportunities to generate individualized well-posed problems with an infinite number of different combinations of initial/final/boundary conditions, so that the probability of any two students being assigned identical problems in a course is vanishingly small. Such problems can be designed and programmed to be: single or multiple-step, self-grading, allow students single or multiple attempts; provide feedback when incorrect; selectable according to difficulty; incorporated within gaming packages; etc. In this talk, we discuss the use of a homework/exam generating program of this kind in a single-semester course, within a web-based client-server system that ensures secure operation.
Solving Inventory Routing Problems Using Location Based Heuristics
Directory of Open Access Journals (Sweden)
Paweł Hanczar
2014-01-01
Full Text Available Inventory routing problems (IRPs occur where vendor managed inventory replenishment strategies are implemented in supply chains. These problems are characterized by the presence of both transportation and inventory considerations, either as parameters or constraints. The research presented in this paper aims at extending IRP formulation developed on the basis of location based heuristics proposed by Bramel and Simchi-Levi and continued by Hanczar. In the first phase of proposed algorithms, mixed integer programming is used to determine the partitioning of customers as well as dates and quantities of deliveries. Then, using 2-opt algorithm for solving the traveling sales-person problem the optimal routes for each partition are determined. In the main part of research the classical formulation is extended by additional constraints (visit spacing, vehicle filling rate, driver (vehicle consistency, and heterogeneous fleet of vehicles as well as the additional criteria are discussed. Then the impact of using each of proposed extensions for solution possibilities is evaluated. The results of computational tests are presented and discussed. Obtained results allow to conclude that the location based heuristics should be considered when solving real life instances of IRP. (original abstract
Solving nonlinear nonstationary problem of heat-conductivity by finite element method
Directory of Open Access Journals (Sweden)
Антон Янович Карвацький
2016-11-01
Full Text Available Methodology and effective solving algorithm of non-linear dynamic problems of thermal and electric conductivity with significant temperature dependence of thermal and physical properties are given on the basis of finite element method (FEM and Newton linearization method. Discrete equations system FEM was obtained with the use of Galerkin method, where the main function is the finite element form function. The methodology based on successive solving problems of thermal and electrical conductivity has been examined in the work in order to minimize the requirements for calculating resources (RAM. in particular. Having used Mathcad software original programming code was developed to solve the given problem. After investigation of the received results, comparative analyses of accurate solution data and results of numerical solutions, obtained with the use of Matlab programming products, was held. The geometry of one fourth part of the finite sized cylinder was used to test the given numerical model. The discretization of the calculation part was fulfilled using the open programming software for automated Gmsh nets with tetrahedral units, while ParaView, which is an open programming code as well, was used to visualize the calculation results. It was found out that the maximum value violation of potential and temperature determination doesn`t exceed 0,2-0,83% in the given work according to the problem conditions
Günüşen, Neslihan Partlak; Serçekuş, Pınar; Edeer, Aylin Durmaz
2014-06-01
The purpose of this study is to compare the locus of control and problem-solving skills of nursing students studying with the problem-based learning method with those of nursing students studying with the traditional method. This is a descriptive and comparative study. For data collection, the Problem-Solving Skills Inventory and the Locus of Control Scale were used. The study sample included 680 nursing students. It was determined that the problem-based learning method was more effective in the development of problem-solving skills and internal locus of control than was the traditional method. © 2014 NANDA International.
Weighted particle method for solving the Boltzmann equation
International Nuclear Information System (INIS)
Tohyama, M.; Suraud, E.
1990-01-01
We propose a new, deterministic, method of solution of the nuclear Boltzmann equation. In this Weighted Particle Method two-body collisions are treated by a Master equation for an occupation probability of each numerical particle. We apply the method to the quadrupole motion of 12 C. A comparison with usual stochastic methods is made. Advantages and disadvantages of the Weighted Particle Method are discussed
International Nuclear Information System (INIS)
Bosevski, T.
1971-01-01
The polynomial interpolation of neutron flux between the chosen space and energy variables enabled transformation of the integral transport equation into a system of linear equations with constant coefficients. Solutions of this system are the needed values of flux for chosen values of space and energy variables. The proposed improved method for solving the neutron transport problem including the mathematical formalism is simple and efficient since the number of needed input data is decreased both in treating the spatial and energy variables. Mathematical method based on this approach gives more stable solutions with significantly decreased probability of numerical errors. Computer code based on the proposed method was used for calculations of one heavy water and one light water reactor cell, and the results were compared to results of other very precise calculations. The proposed method was better concerning convergence rate, decreased computing time and needed computer memory. Discretization of variables enabled direct comparison of theoretical and experimental results
Algebraic Reasoning in Solving Mathematical Problem Based on Learning Style
Indraswari, N. F.; Budayasa, I. K.; Ekawati, R.
2018-01-01
This study aimed to describe algebraic reasoning of secondary school’s pupils with different learning styles in solving mathematical problem. This study begins by giving the questionnaire to find out the learning styles and followed by mathematical ability test to get three subjects of 8th-grade whereas the learning styles of each pupil is visual, auditory, kinesthetic and had similar mathematical abilities. Then it continued with given algebraic problems and interviews. The data is validated using triangulation of time. The result showed that in the pattern of seeking indicator, subjects identified the things that were known and asked based on them observations. The visual and kinesthetic learners represented the known information in a chart, whereas the auditory learner in a table. In addition, they found the elements which makes the pattern and made a relationship between two quantities. In the pattern recognition indicator, they created conjectures on the relationship between two quantities and proved it. In the generalization indicator, they were determining the general rule of pattern found on each element of pattern using algebraic symbols and created a mathematical model. Visual and kinesthetic learners determined the general rule of equations which was used to solve problems using algebraic symbols, but auditory learner in a sentence.
A simple method for solving the inverse scattering problem
International Nuclear Information System (INIS)
Melnikov, V.N.; Rudyak, B.V.; Zakhariev, V.N.
1977-01-01
A new method is proposed for approximate reconstruction of a potential as a step function from scattering data using the completeness relation of solutions of the Schroedinger equation. The suggested method allows one to take into account exactly the additional centrifugal barrier for partial waves with angular momentum l>0, and also the Coulomb potential. The method admits different generalizations. Numerical calculations for checking the method have been performed
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 ...
A Hybrid Optimization Method for Solving Bayesian Inverse Problems under Uncertainty.
Directory of Open Access Journals (Sweden)
Kai Zhang
Full Text Available In this paper, we investigate the application of a new method, the Finite Difference and Stochastic Gradient (Hybrid method, for history matching in reservoir models. History matching is one of the processes of solving an inverse problem by calibrating reservoir models to dynamic behaviour of the reservoir in which an objective function is formulated based on a Bayesian approach for optimization. The goal of history matching is to identify the minimum value of an objective function that expresses the misfit between the predicted and measured data of a reservoir. To address the optimization problem, we present a novel application using a combination of the stochastic gradient and finite difference methods for solving inverse problems. The optimization is constrained by a linear equation that contains the reservoir parameters. We reformulate the reservoir model's parameters and dynamic data by operating the objective function, the approximate gradient of which can guarantee convergence. At each iteration step, we obtain the relatively 'important' elements of the gradient, which are subsequently substituted by the values from the Finite Difference method through comparing the magnitude of the components of the stochastic gradient, which forms a new gradient, and we subsequently iterate with the new gradient. Through the application of the Hybrid method, we efficiently and accurately optimize the objective function. We present a number numerical simulations in this paper that show that the method is accurate and computationally efficient.
An inherently parallel method for solving discretized diffusion equations
International Nuclear Information System (INIS)
Eccleston, B.R.; Palmer, T.S.
1999-01-01
A Monte Carlo approach to solving linear systems of equations is being investigated in the context of the solution of discretized diffusion equations. While the technique was originally devised decades ago, changes in computer architectures (namely, massively parallel machines) have driven the authors to revisit this technique. There are a number of potential advantages to this approach: (1) Analog Monte Carlo techniques are inherently parallel; this is not necessarily true to today's more advanced linear equation solvers (multigrid, conjugate gradient, etc.); (2) Some forms of this technique are adaptive in that they allow the user to specify locations in the problem where resolution is of particular importance and to concentrate the work at those locations; and (3) These techniques permit the solution of very large systems of equations in that matrix elements need not be stored. The user could trade calculational speed for storage if elements of the matrix are calculated on the fly. The goal of this study is to compare the parallel performance of Monte Carlo linear solvers to that of a more traditional parallelized linear solver. The authors observe the linear speedup that they expect from the Monte Carlo algorithm, given that there is no domain decomposition to cause significant communication overhead. Overall, PETSc outperforms the Monte Carlo solver for the test problem. The PETSc parallel performance improves with larger numbers of unknowns for a given number of processors. Parallel performance of the Monte Carlo technique is independent of the size of the matrix and the number of processes. They are investigating modifications to the scheme to accommodate matrix problems with positive off-diagonal elements. They are also currently coding an on-the-fly version of the algorithm to investigate the solution of very large linear systems
Variable-mesh method of solving differential equations
Van Wyk, R.
1969-01-01
Multistep predictor-corrector method for numerical solution of ordinary differential equations retains high local accuracy and convergence properties. In addition, the method was developed in a form conducive to the generation of effective criteria for the selection of subsequent step sizes in step-by-step solution of differential equations.
Auxiliary equation method for solving nonlinear partial differential equations
International Nuclear Information System (INIS)
Sirendaoreji,; Jiong, Sun
2003-01-01
By using the solutions of an auxiliary ordinary differential equation, a direct algebraic method is described to construct several kinds of exact travelling wave solutions for some nonlinear partial differential equations. By this method some physically important nonlinear equations are investigated and new exact travelling wave solutions are explicitly obtained with the aid of symbolic computation
PROBLEM SOLVING IN SCHOOL MATHEMATICS BASED ON HEURISTIC STRATEGIES
Directory of Open Access Journals (Sweden)
NOVOTNÁ, Jarmila
2014-03-01
Full Text Available The paper describes one of the ways of developing pupils’ creative approach to problem solving. The described experiment is a part of a longitudinal research focusing on improvement of culture of problem solving by pupils. It deals with solving of problems using the following heuristic strategies: Analogy, Guess – check – revise, Systematic experimentation, Problem reformulation, Solution drawing, Way back and Use of graphs of functions. Most attention is paid to the question whether short-term work, in this case only over the period of three months, can result in improvement of pupils’ abilities to solve problems whose solving algorithms are easily accessible. It also answers the question which strategies pupils will prefer and with what results. The experiment shows that even short-term work can bear positive results as far as pupils’ approach to problem solving is concerned.
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.
Exp-function method for solving Fisher's equation
Energy Technology Data Exchange (ETDEWEB)
Zhou, X-W [Department of Mathematics, Kunming Teacher' s College, Kunming, Yunnan 650031 (China)], E-mail: km_xwzhou@163.com
2008-02-15
There are many methods to solve Fisher's equation, but each method can only lead to a special solution. In this paper, a new method, namely the exp-function method, is employed to solve the Fisher's equation. The obtained result includes all solutions in open literature as special cases, and the generalized solution with some free parameters might imply some fascinating meanings hidden in the Fisher's equation.
Understanding adults’ strong problem-solving skills based on PIAAC
Hämäläinen, Raija; De Wever, Bram; Nissinen, Kari; Cincinnato, Sebastiano
2017-01-01
Purpose Research has shown that the problem-solving skills of adults with a vocational education and training (VET) background in technology-rich environments (TREs) are often inadequate. However, some adults with a VET background do have sound problem-solving skills. The present study aims to provide insight into the socio-demographic, work-related and everyday life factors that are associated with a strong problem-solving performance. Design/methodology/approach The study builds...
Application of autoradiography methods for solving problems of microelectronics
International Nuclear Information System (INIS)
Frejer, K.; Trojtler, Kh.-Kh.; Birkgol'ts, V.
1979-01-01
Methods of contact autoradiography with halogen-silver emulsions and autoradiography, caused by the interaction of neutrons with solid track detectors, are successfully used for determination of lateral and longitudal distributions of matter in the basic semiconductor material as well as in the frameworks of its preparation. Possibilities for application and power parameters of some autoradiographic methods related to sensitivity of detection and local resolution are considered on the example of the basic material - silicon. In this case, special attention was paid on investigation of elements combibation, for example: boron/phosphorus as well as on the methods of correlation of solid track and halogen-silver autoradiogrammes [ru
Hobri; Suharto; Rifqi Naja, Ahmad
2018-04-01
This research aims to determine students’ creative thinking level in problem solving based on NCTM in function subject. The research type is descriptive with qualitative approach. Data collection methods which were used are test and interview. Creative thinking level in problem solving based on NCTM indicators consists of (1) Make mathematical model from a contextual problem and solve the problem, (2) Solve problem using various possible alternatives, (3) Find new alternative(s) to solve the problem, (4) Determine the most efficient and effective alternative for that problem, (5) Review and correct mistake(s) on the process of problem solving. Result of the research showed that 10 students categorized in very satisfying level, 23 students categorized in satisfying level and 1 students categorized in less satisfying level. Students in very satisfying level meet all indicators, students in satisfying level meet first, second, fourth, and fifth indicator, while students in less satisfying level only meet first and fifth indicator.
Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (3).
Murase, Kenya
2016-01-01
In this issue, simultaneous differential equations were introduced. These differential equations are often used in the field of medical physics. The methods for solving them were also introduced, which include Laplace transform and matrix methods. Some examples were also introduced, in which Laplace transform and matrix methods were applied to solving simultaneous differential equations derived from a three-compartment kinetic model for analyzing the glucose metabolism in tissues and Bloch equations for describing the behavior of the macroscopic magnetization in magnetic resonance imaging.In the next (final) issue, partial differential equations and various methods for solving them will be introduced together with some examples in medical physics.
Solving system of DAEs by homotopy analysis method
International Nuclear Information System (INIS)
Awawdeh, Fadi; Jaradat, H.M.; Alsayyed, O.
2009-01-01
Homotopy analysis method (HAM) is applied to systems of differential-algebraic equations (DAEs). The HAM is proved to be very effective, simple and convenient to give approximate analytical solutions to DAEs.
Extensions of the auxiliary field method to solve Schroedinger equations
International Nuclear Information System (INIS)
Silvestre-Brac, Bernard; Semay, Claude; Buisseret, Fabien
2008-01-01
It has recently been shown that the auxiliary field method is an interesting tool to compute approximate analytical solutions of the Schroedinger equation. This technique can generate the spectrum associated with an arbitrary potential V(r) starting from the analytically known spectrum of a particular potential P(r). In the present work, general important properties of the auxiliary field method are proved, such as scaling laws and independence of the results on the choice of P(r). The method is extended in order to find accurate analytical energy formulae for radial potentials of the form aP(r) + V(r), and several explicit examples are studied. Connections existing between the perturbation theory and the auxiliary field method are also discussed
Extensions of the auxiliary field method to solve Schroedinger equations
Energy Technology Data Exchange (ETDEWEB)
Silvestre-Brac, Bernard [LPSC Universite Joseph Fourier, Grenoble 1, CNRS/IN2P3, Institut Polytechnique de Grenoble, Avenue des Martyrs 53, F-38026 Grenoble-Cedex (France); Semay, Claude; Buisseret, Fabien [Groupe de Physique Nucleaire Theorique, Universite de Mons-Hainaut, Academie universitaire Wallonie-Bruxelles, Place du Parc 20, B-7000 Mons (Belgium)], E-mail: silvestre@lpsc.in2p3.fr, E-mail: claude.semay@umh.ac.be, E-mail: fabien.buisseret@umh.ac.be
2008-10-24
It has recently been shown that the auxiliary field method is an interesting tool to compute approximate analytical solutions of the Schroedinger equation. This technique can generate the spectrum associated with an arbitrary potential V(r) starting from the analytically known spectrum of a particular potential P(r). In the present work, general important properties of the auxiliary field method are proved, such as scaling laws and independence of the results on the choice of P(r). The method is extended in order to find accurate analytical energy formulae for radial potentials of the form aP(r) + V(r), and several explicit examples are studied. Connections existing between the perturbation theory and the auxiliary field method are also discussed.
Discrete gradient methods for solving variational image regularisation models
International Nuclear Information System (INIS)
Grimm, V; McLachlan, Robert I; McLaren, David I; Quispel, G R W; Schönlieb, C-B
2017-01-01
Discrete gradient methods are well-known methods of geometric numerical integration, which preserve the dissipation of gradient systems. In this paper we show that this property of discrete gradient methods can be interesting in the context of variational models for image processing, that is where the processed image is computed as a minimiser of an energy functional. Numerical schemes for computing minimisers of such energies are desired to inherit the dissipative property of the gradient system associated to the energy and consequently guarantee a monotonic decrease of the energy along iterations, avoiding situations in which more computational work might lead to less optimal solutions. Under appropriate smoothness assumptions on the energy functional we prove that discrete gradient methods guarantee a monotonic decrease of the energy towards stationary states, and we promote their use in image processing by exhibiting experiments with convex and non-convex variational models for image deblurring, denoising, and inpainting. (paper)
The functional variable method for solving the fractional Korteweg ...
Indian Academy of Sciences (India)
The physical and engineering processes have been modelled by means of fractional ... very important role in various fields such as economics, chemistry, notably control the- .... In §3, the functional variable method is applied for finding exact.
Energy Technology Data Exchange (ETDEWEB)
Liu Guoming [Department of Nuclear Engineering, Xi' an Jiaotong University, Xi' an, Shaanxi 710049 (China)], E-mail: gmliusy@gmail.com; Wu Hongchun; Cao Liangzhi [Department of Nuclear Engineering, Xi' an Jiaotong University, Xi' an, Shaanxi 710049 (China)
2008-09-15
This paper presents a transmission probability method (TPM) to solve the neutron transport equation in three-dimensional triangular-z geometry. The source within the mesh is assumed to be spatially uniform and isotropic. At the mesh surface, the constant and the simplified P{sub 1} approximation are invoked for the anisotropic angular flux distribution. Based on this model, a code TPMTDT is encoded. It was verified by three 3D Takeda benchmark problems, in which the first two problems are in XYZ geometry and the last one is in hexagonal-z geometry, and an unstructured geometry problem. The results of the present method agree well with those of Monte-Carlo calculation method and Spherical Harmonics (P{sub N}) method.
Effectiveness of a problem-solving based intervention to prolong the working life of ageing workers
Koolhaas, Wendy; Groothoff, Johan W; de Boer, Michiel R; van der Klink, Jac JL; Brouwer, Sandra
2015-01-01
Background An ageing workforce combined with increasing health problems in ageing workers implies the importance of evidence-based interventions to enhance sustainable employability. The aim of this study is to evaluate the effectiveness of the ‘Staying healthy at work’ problem-solving based intervention compared to business as usual. Methods This study was designed as a quasi-experimental trial with a one-year follow-up. Measurements were performed at baseline, three and twelve months. The p...
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...
The modified simple equation method for solving some fractional ...
Indian Academy of Sciences (India)
... and processes in various areas of natural science. Thus, many effective and powerful methods have been established and improved. In this study, we establish exact solutions of the time fractional biological population model equation and nonlinearfractional Klein–Gordon equation by using the modified simple equation ...
Projection-iteration methods for solving nonlinear operator equations
International Nuclear Information System (INIS)
Nguyen Minh Chuong; Tran thi Lan Anh; Tran Quoc Binh
1989-09-01
In this paper, the authors investigate a nonlinear operator equation in uniformly convex Banach spaces as in metric spaces by using stationary and nonstationary generalized projection-iteration methods. Convergence theorems in the strong and weak sense were established. (author). 7 refs
Methodical approaches to solving special problems of testing. Seminar papers
International Nuclear Information System (INIS)
1996-01-01
This Seminar volume introduces concepts and applications from different areas of application of ultrasonic testing and other non-destructive test methods in 18 lectures, in order to give an idea of new trends in development and stimuli for special solutions to problems. 3 articles were recorded separately for the ENERGY data bank. (orig./MM) [de
An efficient method for solving fractional Sturm-Liouville problems
International Nuclear Information System (INIS)
Al-Mdallal, Qasem M.
2009-01-01
The numerical approximation of the eigenvalues and the eigenfunctions of the fractional Sturm-Liouville problems, in which the second order derivative is replaced by a fractional derivative, is considered. The present results can be implemented on the numerical solution of the fractional diffusion-wave equation. The results show the simplicity and efficiency of the numerical method.
Application of the trial equation method for solving some nonlinear ...
Indian Academy of Sciences (India)
Therefore, our aim is just to find the function F. Liu has obtained a number of exact solutions to many nonlinear differential equations when F(u) is a polynomial or a rational function. ... In this study, we apply the trial equation method to seek exact solutions of the ... twice and setting the integration constant to zero, we have.
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
Solving the nuclear shell model with an algebraic method
International Nuclear Information System (INIS)
Feng, D.H.; Pan, X.W.; Guidry, M.
1997-01-01
We illustrate algebraic methods in the nuclear shell model through a concrete example, the fermion dynamical symmetry model (FDSM). We use this model to introduce important concepts such as dynamical symmetry, symmetry breaking, effective symmetry, and diagonalization within a higher-symmetry basis. (orig.)
Simplified method to solve sound transmission through structures lined with elastic porous material.
Lee, J H; Kim, J
2001-11-01
An approximate analysis method is developed to calculate sound transmission through structures lined with porous material. Because the porous material has both the solid phase and fluid phase, three wave components exist in the material, which makes the related analysis very complicated. The main idea in developing the approximate method is very simple: modeling the porous material using only the strongest of the three waves, which in effect idealizes the material as an equivalent fluid. The analysis procedure has to be conducted in two steps. In the first step, sound transmission through a flat double panel with a porous liner of infinite extents, which has the same cross sectional construction as the actual structure, is solved based on the full theory and the strongest wave component is identified. In the second step sound transmission through the actual structure is solved modeling the porous material as an equivalent fluid while using the actual geometry of the structure. The development and validation of the method are discussed in detail. As an application example, the transmission loss through double walled cylindrical shells with a porous core is calculated utilizing the simplified method.
Logo Programming, Problem Solving, and Knowledge-Based Instruction.
Swan, Karen; Black, John B.
The research reported in this paper was designed to investigate the hypothesis that computer programming may support the teaching and learning of problem solving, but that to do so, problem solving must be explicitly taught. Three studies involved students in several grades: 4th, 6th, 8th, 11th, and 12th. Findings collectively show that five…
Solving the Rational Polynomial Coefficients Based on L Curve
Zhou, G.; Li, X.; Yue, T.; Huang, W.; He, C.; Huang, Y.
2018-05-01
The rational polynomial coefficients (RPC) model is a generalized sensor model, which can achieve high approximation accuracy. And it is widely used in the field of photogrammetry and remote sensing. Least square method is usually used to determine the optimal parameter solution of the rational function model. However the distribution of control points is not uniform or the model is over-parameterized, which leads to the singularity of the coefficient matrix of the normal equation. So the normal equation becomes ill conditioned equation. The obtained solutions are extremely unstable and even wrong. The Tikhonov regularization can effectively improve and solve the ill conditioned equation. In this paper, we calculate pathological equations by regularization method, and determine the regularization parameters by L curve. The results of the experiments on aerial format photos show that the accuracy of the first-order RPC with the equal denominators has the highest accuracy. The high order RPC model is not necessary in the processing of dealing with frame images, as the RPC model and the projective model are almost the same. The result shows that the first-order RPC model is basically consistent with the strict sensor model of photogrammetry. Orthorectification results both the firstorder RPC model and Camera Model (ERDAS9.2 platform) are similar to each other, and the maximum residuals of X and Y are 0.8174 feet and 0.9272 feet respectively. This result shows that RPC model can be used in the aerial photographic compensation replacement sensor model.
A generalized trial solution method for solving the aerosol equation
International Nuclear Information System (INIS)
Simons, S.; Simpson, D.R.
1988-01-01
It is shown how the introduction of orthogonal functions together with a time-dependent scaling factor may be used to develop a generalized trial solution method for tackling the aerosol equation. The approach is worked out in detail for the case where the initial particle size spectrum follows a γ-distribution, and it is shown to be a viable technique as long as the initial volume fraction of particulate material is not too large. The method is applied to several situations of interest, and is shown to give more accurate results (with marginally shorter computing times) than are given by the three-parameter log-normal or γ distribution trial functions. (author)
Lattice Boltzmann method for solving the bioheat equation
International Nuclear Information System (INIS)
Zhang Haifeng
2008-01-01
In this work, we develop the lattice Boltzmann method (LBM) as a potential solver for the bioheat problems. The accuracy of the present LBM algorithm is validated through comparison with the analytical solution and the finite element simulation. The results show that the LBM can give a precise prediction of the temperature distribution, and it is efficient to deal with the space- and time-dependent heat source, which are often encountered in the treatment planning of tumor hyperthermia. (note)
METHOD FOR SOLVING FUZZY ASSIGNMENT PROBLEM USING MAGNITUDE RANKING TECHNIQUE
D. Selvi; R. Queen Mary; G. Velammal
2017-01-01
Assignment problems have various applications in the real world because of their wide applicability in industry, commerce, management science, etc. Traditional classical assignment problems cannot be successfully used for real life problem, hence the use of fuzzy assignment problems is more appropriate. In this paper, the fuzzy assignment problem is formulated to crisp assignment problem using Magnitude Ranking technique and Hungarian method has been applied to find an optimal solution. The N...
International Nuclear Information System (INIS)
Mohammadi, A.; Varahram, M.H.
2007-01-01
In this study, two methods for solving economic dispatch problems, namely Hopfield neural network and lambda iteration method are compared. Three sample of power system with 3, 6 and 20 units have been considered. The time required for CPU, for solving economic dispatch of these two systems has been calculated. It has been Shown that for on-line economic dispatch, Hopfield neural network is more efficient and the time required for Convergence is considerably smaller compared to classical methods. (author)
Integral transform method for solving time fractional systems and fractional heat equation
Directory of Open Access Journals (Sweden)
Arman Aghili
2014-01-01
Full Text Available In the present paper, time fractional partial differential equation is considered, where the fractional derivative is defined in the Caputo sense. Laplace transform method has been applied to obtain an exact solution. The authors solved certain homogeneous and nonhomogeneous time fractional heat equations using integral transform. Transform method is a powerful tool for solving fractional singular Integro - differential equations and PDEs. The result reveals that the transform method is very convenient and effective.
Directory of Open Access Journals (Sweden)
Behzad Ghanbari
2014-01-01
Full Text Available We aim to study the convergence of the homotopy analysis method (HAM in short for solving special nonlinear Volterra-Fredholm integrodifferential equations. The sufficient condition for the convergence of the method is briefly addressed. Some illustrative examples are also presented to demonstrate the validity and applicability of the technique. Comparison of the obtained results HAM with exact solution shows that the method is reliable and capable of providing analytic treatment for solving such equations.
An Efficient Optimization Method for Solving Unsupervised Data Classification Problems
Directory of Open Access Journals (Sweden)
Parvaneh Shabanzadeh
2015-01-01
Full Text Available Unsupervised data classification (or clustering analysis is one of the most useful tools and a descriptive task in data mining that seeks to classify homogeneous groups of objects based on similarity and is used in many medical disciplines and various applications. In general, there is no single algorithm that is suitable for all types of data, conditions, and applications. Each algorithm has its own advantages, limitations, and deficiencies. Hence, research for novel and effective approaches for unsupervised data classification is still active. In this paper a heuristic algorithm, Biogeography-Based Optimization (BBO algorithm, was adapted for data clustering problems by modifying the main operators of BBO algorithm, which is inspired from the natural biogeography distribution of different species. Similar to other population-based algorithms, BBO algorithm starts with an initial population of candidate solutions to an optimization problem and an objective function that is calculated for them. To evaluate the performance of the proposed algorithm assessment was carried on six medical and real life datasets and was compared with eight well known and recent unsupervised data classification algorithms. Numerical results demonstrate that the proposed evolutionary optimization algorithm is efficient for unsupervised data classification.
Methods for solving the stochastic point reactor kinetic equations
International Nuclear Information System (INIS)
Quabili, E.R.; Karasulu, M.
1979-01-01
Two new methods are presented for analysis of the statistical properties of nonlinear outputs of a point reactor to stochastic non-white reactivity inputs. They are Bourret's approximation and logarithmic linearization. The results have been compared with the exact results, previously obtained in the case of Gaussian white reactivity input. It was found that when the reactivity noise has short correlation time, Bourret's approximation should be recommended because it yields results superior to those yielded by logarithmic linearization. When the correlation time is long, Bourret's approximation is not valid, but in that case, if one can assume the reactivity noise to be Gaussian, one may use the logarithmic linearization. (author)
Optimal Homotopy Asymptotic Method for Solving System of Fredholm Integral Equations
Directory of Open Access Journals (Sweden)
Bahman Ghazanfari
2013-08-01
Full Text Available In this paper, optimal homotopy asymptotic method (OHAM is applied to solve system of Fredholm integral equations. The effectiveness of optimal homotopy asymptotic method is presented. This method provides easy tools to control the convergence region of approximating solution series wherever necessary. The results of OHAM are compared with homotopy perturbation method (HPM and Taylor series expansion method (TSEM.
Acquisition and understanding of process knowledge using problem solving methods
Gómez-Pérez, JM
2010-01-01
The development of knowledge-based systems is usually approached through the combined skills of knowledge engineers (KEs) and subject matter experts (SMEs). One of the most critical steps in this activity aims at transferring knowledge from SMEs to formal, machine-readable representations, which allow systems to reason with such knowledge. However, this is a costly and error prone task. Alleviating the knowledge acquisition bottleneck requires enabling SMEs with the means to produce the desired knowledge representations without the help of KEs. This is especially difficult in the case of compl
The Elementary School Students’ Mathematical Problem Solving Based on Reading Abilities
Wulandari, R. D.; Lukito, A.; Khabibah, S.
2018-01-01
The aim of this research is to describe the third grade of elementary school students’ mathematical problem in solving skills based on their reading abilities. This research is a descriptive research with qualitative approach. This research was conducted at elementary school Kebraon II Surabaya in second semester of 2016-2017 academic years. The participants of this research consist of third grade students with different reading abilities that are independent level, instructional level and frustration level. The participants of this research were selected with purposive sampling technique. The data of this study were collected using reading the narration texts, the Ekwall and Shanker Informal Reading Inventory, problem solving task and interview guidelines. The collected data were evaluated using a descriptive analysis method. Once the study had been completed, it was concluded that problem solving skills varied according to reading abilities, student with independent level and instructional level can solve the problem and students with frustration level can’t solve the problem because they can’t interpret the problem well.
Model Integrated Problem Solving Based Learning pada Perkuliahan Dasar-dasar Kimia Analitik
Indarini Dwi Pursitasari; Anna Permanasari
2013-01-01
Abstract: Integrated Problem Solving Based Learning Model on Foundation of Analytical Chemistry. This study was conducted to know the effects of Integrated Problem Solving Based Learning (IPSBL) model on problem solving skills and cognitive ability of pre-service teachers. The subjects of the study were 41 pre- service teachers, 21 in the experimental group and 20 in the control group. The data were collected through a test on problem solving skills, a test on cognitive ability, and a questio...
Model Integrated Problem Solving Based Learning Pada Perkuliahan Dasar-dasar Kimia Analitik
Pursitasari, Indarini Dwi; Permanasari, Anna
2012-01-01
: Integrated Problem Solving Based Learning Model on Foundation of Analytical Chemistry. This study was conducted to know the effects of Integrated Problem Solving Based Learning (IPSBL) model on problem solving skills and cognitive ability of pre-service teachers. The subjects of the study were 41 pre- service teachers, 21 in the experimental group and 20 in the control group. The data were collected through a test on problem solving skills, a test on cognitive ability, and a questionnaire o...
Desmal, Abdulla; Bagci, Hakan
2014-01-01
A numerical framework that incorporates recently developed iterative shrinkage thresholding (IST) algorithms within the Born iterative method (BIM) is proposed for solving the two-dimensional inverse electromagnetic scattering problem. IST
Self-Regulation and Problem Solving Ability in 7E-Learning Cycle Based Goal Orientation
Mulyono; Noor, N. L.
2017-04-01
Goal orientation differences between mastery goals and performance goals can be a cause of high and low self-regulation and problem-solving abilities. To overcome these problems applied 7E-learning cycle in which students learn and develop ways to optimise the power of reason through the learning phase elicit, engage, explore, explain, elaborate, evaluate, and extend. This study aimed to test the effectiveness of learning by 7E-learning cycle and describe self-regulation and mathematics problem solving based on goal-orientation after the implementation 7E-learning cycle. This study used mix method design with research subject is graders XII sciences MA NU Nurul Ulum Jekulo Kudus which divided into goal orientation is mastery goal and performance goal. The independent variable of this research is learning model, while the dependent variable is problem solving and self-regulation. Then, collecting data using scale, interviews and tests. The data processed with the proportion of test, t-test, paired samples t-test, and Normality-gain. The results show problem-solving abilities of students through 7E-learning cycle the average of mathematical problem-solving capability class, self-regulation at 7E-learning cycle is better than the traditional model study. The problem-solving skills at 7E-learning cycle are better than the traditional model study, there is an increase in self-regulation through 7E-learning cycle of 0.4 (medium), and there is an increased problem-solving ability through 7E-learning cycle by 0.79 (high). Based on the qualitative analysis, self-regulation and problem-solving ability after the implementation of 7E-learning cycle students of a mastery goal group are better than the performance goal team. It is suggested to implement 7E-learning cycle to improve self-regulation and problem-solving ability as well as directing and fostering mastery goal on the student in the learning process.
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.
Swarm based mean-variance mapping optimization (MVMOS) for solving economic dispatch
Khoa, T. H.; Vasant, P. M.; Singh, M. S. Balbir; Dieu, V. N.
2014-10-01
The economic dispatch (ED) is an essential optimization task in the power generation system. It is defined as the process of allocating the real power output of generation units to meet required load demand so as their total operating cost is minimized while satisfying all physical and operational constraints. This paper introduces a novel optimization which named as Swarm based Mean-variance mapping optimization (MVMOS). The technique is the extension of the original single particle mean-variance mapping optimization (MVMO). Its features make it potentially attractive algorithm for solving optimization problems. The proposed method is implemented for three test power systems, including 3, 13 and 20 thermal generation units with quadratic cost function and the obtained results are compared with many other methods available in the literature. Test results have indicated that the proposed method can efficiently implement for solving economic dispatch.
Azila Che Musa, Nor; Mahmud, Zamalia; Baharun, Norhayati
2017-09-01
One of the important skills that is required from any student who are learning statistics is knowing how to solve statistical problems correctly using appropriate statistical methods. This will enable them to arrive at a conclusion and make a significant contribution and decision for the society. In this study, a group of 22 students majoring in statistics at UiTM Shah Alam were given problems relating to topics on testing of hypothesis which require them to solve the problems using confidence interval, traditional and p-value approach. Hypothesis testing is one of the techniques used in solving real problems and it is listed as one of the difficult concepts for students to grasp. The objectives of this study is to explore students’ perceived and actual ability in solving statistical problems and to determine which item in statistical problem solving that students find difficult to grasp. Students’ perceived and actual ability were measured based on the instruments developed from the respective topics. Rasch measurement tools such as Wright map and item measures for fit statistics were used to accomplish the objectives. Data were collected and analysed using Winsteps 3.90 software which is developed based on the Rasch measurement model. The results showed that students’ perceived themselves as moderately competent in solving the statistical problems using confidence interval and p-value approach even though their actual performance showed otherwise. Item measures for fit statistics also showed that the maximum estimated measures were found on two problems. These measures indicate that none of the students have attempted these problems correctly due to reasons which include their lack of understanding in confidence interval and probability values.
Directory of Open Access Journals (Sweden)
H. Jafari
2010-07-01
Full Text Available In this paper, nonlinear Klein-Gordon equation with quadratic term is solved by means of an analytic technique, namely the Homotopy analysis method (HAM.Comparisons are made between the Adomian decomposition method (ADM, the exact solution and homotopy analysis method. The results reveal that the proposed method is very effective and simple.
APPLICATION OF THE PERFORMANCE SELECTION INDEX METHOD FOR SOLVING MACHINING MCDM PROBLEMS
Directory of Open Access Journals (Sweden)
Dušan Petković
2017-04-01
Full Text Available Complex nature of machining processes requires the use of different methods and techniques for process optimization. Over the past few years a number of different optimization methods have been proposed for solving continuous machining optimization problems. In manufacturing environment, engineers are also facing a number of discrete machining optimization problems. In order to help decision makers in solving this type of optimization problems a number of multi criteria decision making (MCDM methods have been proposed. This paper introduces the use of an almost unexplored MCDM method, i.e. performance selection index (PSI method for solving machining MCDM problems. The main motivation for using the PSI method is that it is not necessary to determine criteria weights as in other MCDM methods. Applicability and effectiveness of the PSI method have been demonstrated while solving two case studies dealing with machinability of materials and selection of the most suitable cutting fluid for the given machining application. The obtained rankings have good correlation with those derived by the past researchers using other MCDM methods which validate the usefulness of this method for solving machining MCDM problems.
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.
Recent symbolic summation methods to solve coupled systems of differential and difference equations
International Nuclear Information System (INIS)
Schneider, Carsten; Bluemlein, Johannes; Freitas, Abilio de
2014-07-01
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable x (resp. coupled difference equations in one discrete variable N) depending on a small parameter ε: given such a system and given sufficiently many initial values, we can determine the first coefficients of the Laurent-series solutions in ε if they are expressible in terms of indefinite nested sums and products. This systematic approach is based on symbolic summation algorithms in the context of difference rings/fields and uncoupling algorithms. The proposed method gives rise to new interesting applications in connection with integration by parts (IBP) methods. As an illustrative example, we will demonstrate how one can calculate the ε-expansion of a ladder graph with 6 massive fermion lines.
Method for Evaluating Information to Solve Problems of Control, Monitoring and Diagnostics
Vasil'ev, V. A.; Dobrynina, N. V.
2017-06-01
The article describes a method for evaluating information to solve problems of control, monitoring and diagnostics. It is necessary for reducing the dimensionality of informational indicators of situations, bringing them to relative units, for calculating generalized information indicators on their basis, ranking them by characteristic levels, for calculating the efficiency criterion of a system functioning in real time. The design of information evaluation system has been developed on its basis that allows analyzing, processing and assessing information about the object. Such object can be a complex technical, economic and social system. The method and the based system thereof can find a wide application in the field of analysis, processing and evaluation of information on the functioning of the systems, regardless of their purpose, goals, tasks and complexity. For example, they can be used to assess the innovation capacities of industrial enterprises and management decisions.
A method for solving a three-body problem with energy-dependent interactions
International Nuclear Information System (INIS)
Safronov, A.N.
1994-01-01
A method is proposed for solving a three-body problem with energy-dependent interactions. This method is based on introducing the dependence of scattering operators and state vectors on an additional external parameter. Effects caused by the energy dependence of the interaction operator are investigated by using the unitary condition for the amplitude of the 2 → 2 and 2 → 3 transitions. It is shown, in particular, that taking this dependence into account leads to a change in the relation between the asymptotic normalization factor of the wave function of the three-body bound state and the vertex constant of virtual dissociation (synthesis) of the system into two fragments. 15 refs
Recent symbolic summation methods to solve coupled systems of differential and difference equations
Energy Technology Data Exchange (ETDEWEB)
Schneider, Carsten [Johannes Kepler Univ., Linz (Austria). Research Inst. for Symbolic Computation (RISC); Bluemlein, Johannes; Freitas, Abilio de [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)
2014-07-15
We outline a new algorithm to solve coupled systems of differential equations in one continuous variable x (resp. coupled difference equations in one discrete variable N) depending on a small parameter ε: given such a system and given sufficiently many initial values, we can determine the first coefficients of the Laurent-series solutions in ε if they are expressible in terms of indefinite nested sums and products. This systematic approach is based on symbolic summation algorithms in the context of difference rings/fields and uncoupling algorithms. The proposed method gives rise to new interesting applications in connection with integration by parts (IBP) methods. As an illustrative example, we will demonstrate how one can calculate the ε-expansion of a ladder graph with 6 massive fermion lines.
An efficient numerical method for solving the Boltzmann equation in multidimensions
Dimarco, Giacomo; Loubère, Raphaël; Narski, Jacek; Rey, Thomas
2018-01-01
In this paper we deal with the extension of the Fast Kinetic Scheme (FKS) (Dimarco and Loubère, 2013 [26]) originally constructed for solving the BGK equation, to the more challenging case of the Boltzmann equation. The scheme combines a robust and fast method for treating the transport part based on an innovative Lagrangian technique supplemented with conservative fast spectral schemes to treat the collisional operator by means of an operator splitting approach. This approach along with several implementation features related to the parallelization of the algorithm permits to construct an efficient simulation tool which is numerically tested against exact and reference solutions on classical problems arising in rarefied gas dynamic. We present results up to the 3 D × 3 D case for unsteady flows for the Variable Hard Sphere model which may serve as benchmark for future comparisons between different numerical methods for solving the multidimensional Boltzmann equation. For this reason, we also provide for each problem studied details on the computational cost and memory consumption as well as comparisons with the BGK model or the limit model of compressible Euler equations.
Eyisi, Daniel
2016-01-01
Research in science education is to discover the truth which involves the combination of reasoning and experiences. In order to find out appropriate teaching methods that are necessary for teaching science students problem-solving skills, different research approaches are used by educational researchers based on the data collection and analysis…
Directory of Open Access Journals (Sweden)
Tunjo Perić
2017-09-01
Full Text Available This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained results indicate a high efficiency of the applied methods in solving the problem.
Agarwal, P.; El-Sayed, A. A.
2018-06-01
In this paper, a new numerical technique for solving the fractional order diffusion equation is introduced. This technique basically depends on the Non-Standard finite difference method (NSFD) and Chebyshev collocation method, where the fractional derivatives are described in terms of the Caputo sense. The Chebyshev collocation method with the (NSFD) method is used to convert the problem into a system of algebraic equations. These equations solved numerically using Newton's iteration method. The applicability, reliability, and efficiency of the presented technique are demonstrated through some given numerical examples.
Directory of Open Access Journals (Sweden)
Chun Hu
2004-04-01
Full Text Available In this paper, we suggest that case-based resources, which are used for assisting cognition during problem solving, can be structured around the work of narratives in social cultural psychology. Theories and other research methods have proposed structures within narratives and stories which may be useful to the design of case-based resources. Moreover, embedded within cases are stories which are contextually rich, supporting the epistemological groundings of situated cognition. Therefore the purposes of this paper are to discuss possible frameworks of case-stories; derive design principles as to what constitutes a good case story or narrative; and suggest how technology can support story-based learning. We adopt video-based Computer-Supported Collaborative Learning (CSCL technology to support problem solving with case-stories learning scenarios. Our hypothesis in this paper is that well-designed case-based resources are able to aid in the cognitive processes undergirding problem solving and meaning making. We also suggest the use of an emerging video-based collaborative learning technology to support such an instructional strategy.
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.
Brehm, Christoph; Barad, Michael F.; Kiris, Cetin C.
2016-01-01
An immersed boundary method for the compressible Navier-Stokes equation and the additional infrastructure that is needed to solve moving boundary problems and fully coupled fluid-structure interaction is described. All the methods described in this paper were implemented in NASA's LAVA solver framework. The underlying immersed boundary method is based on the locally stabilized immersed boundary method that was previously introduced by the authors. In the present paper this method is extended to account for all aspects that are involved for fluid structure interaction simulations, such as fast geometry queries and stencil computations, the treatment of freshly cleared cells, and the coupling of the computational fluid dynamics solver with a linear structural finite element method. The current approach is validated for moving boundary problems with prescribed body motion and fully coupled fluid structure interaction problems in 2D and 3D. As part of the validation procedure, results from the second AIAA aeroelastic prediction workshop are also presented. The current paper is regarded as a proof of concept study, while more advanced methods for fluid structure interaction are currently being investigated, such as geometric and material nonlinearities, and advanced coupling approaches.
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.
Two split cell numerical methods for solving 2-D non-equilibrium radiation transport equations
International Nuclear Information System (INIS)
Feng Tinggui
2004-11-01
Two numerically positive methods, the step characteristic integral method and subcell balance method, for solving radiative transfer equations on quadrilateral grids are presented. Numerical examples shows that the schemes presented are feasible on non-rectangle grid computation, and that the computing results by the schemes presented are comparative to that by the discrete ordinate diamond scheme on rectangle grid. (author)
International Nuclear Information System (INIS)
Biazar, J.; Ghazvini, H.
2009-01-01
In this paper, the He's homotopy perturbation method is applied to solve systems of Volterra integral equations of the second kind. Some examples are presented to illustrate the ability of the method for linear and non-linear such systems. The results reveal that the method is very effective and simple.
International Nuclear Information System (INIS)
Carmo, E.G.D. do; Galeao, A.C.N.R.
1986-01-01
A new method specially designed to solve highly convective transport problems is proposed. Using a variational approach it is shown that this weighted residual method belongs to a class of Petrov-Galerkin's approximation. Some examples are presented in order to demonstrate the adequacy of this method in predicting internal or external boundary layers. (Author) [pt
Series: Utilization of Differential Equations and Methods for Solving Them in Medical Physics (4).
Murase, Kenya
2016-01-01
Partial differential equations are often used in the field of medical physics. In this (final) issue, the methods for solving the partial differential equations were introduced, which include separation of variables, integral transform (Fourier and Fourier-sine transforms), Green's function, and series expansion methods. Some examples were also introduced, in which the integral transform and Green's function methods were applied to solving Pennes' bioheat transfer equation and the Fourier series expansion method was applied to Navier-Stokes equation for analyzing the wall shear stress in blood vessels.Finally, the author hopes that this series will be helpful for people who engage in medical physics.
Solving the Schroedinger equation using the finite difference time domain method
International Nuclear Information System (INIS)
Sudiarta, I Wayan; Geldart, D J Wallace
2007-01-01
In this paper, we solve the Schroedinger equation using the finite difference time domain (FDTD) method to determine energies and eigenfunctions. In order to apply the FDTD method, the Schroedinger equation is first transformed into a diffusion equation by the imaginary time transformation. The resulting time-domain diffusion equation is then solved numerically by the FDTD method. The theory and an algorithm are provided for the procedure. Numerical results are given for illustrative examples in one, two and three dimensions. It is shown that the FDTD method accurately determines eigenfunctions and energies of these systems
Solving inverse problems for biological models using the collage method for differential equations.
Capasso, V; Kunze, H E; La Torre, D; Vrscay, E R
2013-07-01
In the first part of this paper we show how inverse problems for differential equations can be solved using the so-called collage method. Inverse problems can be solved by minimizing the collage distance in an appropriate metric space. We then provide several numerical examples in mathematical biology. We consider applications of this approach to the following areas: population dynamics, mRNA and protein concentration, bacteria and amoeba cells interaction, tumor growth.
A new fuzzy Monte Carlo method for solving SLAE with ergodic fuzzy Markov chains
Directory of Open Access Journals (Sweden)
Maryam Gharehdaghi
2015-05-01
Full Text Available In this paper we introduce a new fuzzy Monte Carlo method for solving system of linear algebraic equations (SLAE over the possibility theory and max-min algebra. To solve the SLAE, we first define a fuzzy estimator and prove that this is an unbiased estimator of the solution. To prove unbiasedness, we apply the ergodic fuzzy Markov chains. This new approach works even for cases with coefficients matrix with a norm greater than one.
An ontological framework for model-based problem-solving
Scholten, H.; Beulens, A.J.M.
2012-01-01
Multidisciplinary projects to solve real world problems of increasing complexity are more and more plagued by obstacles such as miscommunication between modellers with different disciplinary backgrounds and bad modelling practices. To tackle these difficulties, a body of knowledge on problems, on
Directory of Open Access Journals (Sweden)
Zhongfu Tan
2015-01-01
Full Text Available In order to solve the influence of load uncertainty on hydrothermal power system operation and achieve the optimal objectives of system power generation consumption, pollutant emissions, and first-stage hydropower station storage capacity, this paper introduced CVaR method and built a multiobjective optimization model and its solving method. In the optimization model, load demand’s actual values and deviation values are regarded as random variables, scheduling objective is redefined to meet confidence level requirement and system operation constraints and loss function constraints are taken into consideration. To solve the proposed model, this paper linearized nonlinear constraints, applied fuzzy satisfaction, fuzzy entropy, and weighted multiobjective function theories to build a fuzzy entropy multiobjective CVaR model. The model is a mixed integer linear programming problem. Then, six thermal power plants and three cascade hydropower stations are taken as the hydrothermal system for numerical simulation. The results verified that multiobjective CVaR method is applicable to solve hydrothermal scheduling problems. It can better reflect risk level of the scheduling result. The fuzzy entropy satisfaction degree solving algorithm can simplify solving difficulty and get the optimum operation scheduling scheme.
Directory of Open Access Journals (Sweden)
Ziyang Lian
2016-01-01
Full Text Available An enhanced plane wave expansion (PWE method is proposed to solve piezoelectric phononic crystal (PPC connected with resonant shunting circuits (PPC-C, which is named as PWE-PPC-C. The resonant shunting circuits can not only bring about the locally resonant (LR band gap for the PPC-C but also conveniently tune frequency and bandwidth of band gaps through adjusting circuit parameters. However, thus far, more than one-dimensional PPC-C has been studied just by Finite Element method. Compared with other methods, the PWE has great advantages in solving more than one-dimensional PC as well as various lattice types. Nevertheless, the conventional PWE cannot accurately solve coupling between the structure and resonant shunting circuits of the PPC-C since only taking one-way coupling from displacements to electrical parameters into consideration. A two-dimensional PPC-C model of orthorhombic lattice is established to demonstrate the whole solving process of PWE-PPC-C. The PWE-PPC-C method is validated by Transfer Matrix method as well as Finite Element method. The dependence of band gaps on circuit parameters has been investigated in detail by PWE-PPC-C. Its advantage in solving various lattice types is further illustrated by calculating the PPC-C of triangular and hexagonal lattices, respectively.
International Nuclear Information System (INIS)
Kirk, B.L.; Azmy, Y.Y.
1992-01-01
In this paper the one-group, steady-state neutron diffusion equation in two-dimensional Cartesian geometry is solved using the nodal integral method. The discrete variable equations comprise loosely coupled sets of equations representing the nodal balance of neutrons, as well as neutron current continuity along rows or columns of computational cells. An iterative algorithm that is more suitable for solving large problems concurrently is derived based on the decomposition of the spatial domain and is accelerated using successive overrelaxation. This algorithm is very well suited for parallel computers, especially since the spatial domain decomposition occurs naturally, so that the number of iterations required for convergence does not depend on the number of processors participating in the calculation. Implementation of the authors' algorithm on the Intel iPSC/2 hypercube and Sequent Balance 8000 parallel computer is presented, and measured speedup and efficiency for test problems are reported. The results suggest that the efficiency of the hypercube quickly deteriorates when many processors are used, while the Sequent Balance retains very high efficiency for a comparable number of participating processors. This leads to the conjecture that message-passing parallel computers are not as well suited for this algorithm as shared-memory machines
International Nuclear Information System (INIS)
Fernandes, A.
1991-01-01
A method to solve three dimensional neutron transport equation and it is based on the original work suggested by J.K. Fletcher (42, 43). The angular dependence of the flux is approximated by associated Legendre functions and the finite element method is applied to the space components is presented. When the angular flux, the scattering cross section and the neutrons source are expanded in associated Legendre functions, the first order neutron transport equation is reduced to a coupled set of second order diffusion like equations. These equations are solved in an iterative way by the finite element method to the moments. (author)
An accurate anisotropic adaptation method for solving the level set advection equation
International Nuclear Information System (INIS)
Bui, C.; Dapogny, C.; Frey, P.
2012-01-01
In the present paper, a mesh adaptation process for solving the advection equation on a fully unstructured computational mesh is introduced, with a particular interest in the case it implicitly describes an evolving surface. This process mainly relies on a numerical scheme based on the method of characteristics. However, low order, this scheme lends itself to a thorough analysis on the theoretical side. It gives rise to an anisotropic error estimate which enjoys a very natural interpretation in terms of the Hausdorff distance between the exact and approximated surfaces. The computational mesh is then adapted according to the metric supplied by this estimate. The whole process enjoys a good accuracy as far as the interface resolution is concerned. Some numerical features are discussed and several classical examples are presented and commented in two or three dimensions. (authors)
Energy Technology Data Exchange (ETDEWEB)
Tumelero, Fernanda; Petersen, Claudio Zen; Goncalves, Glenio Aguiar [Universidade Federal de Pelotas, Capao do Leao, RS (Brazil). Programa de Pos Graduacao em Modelagem Matematica; Schramm, Marcelo [Universidade Federal do Rio Grande do Sul, Porto Alegre, RS (Brazil). Programa de Pos-Graduacao em Engenharia Mecanica
2016-12-15
In this work, we report a solution to solve the Neutron Point Kinetics Equations applying the Polynomial Approach Method. The main idea is to expand the neutron density and delayed neutron precursors as a power series considering the reactivity as an arbitrary function of the time in a relatively short time interval around an ordinary point. In the first interval one applies the initial conditions and the analytical continuation is used to determine the solutions of the next intervals. A genuine error control is developed based on an analogy with the Rest Theorem. For illustration, we also report simulations for different approaches types (linear, quadratic and cubic). The results obtained by numerical simulations for linear approximation are compared with results in the literature.
Sukmawati, Zuhairoh, Faihatuz
2017-05-01
The purpose of this research was to develop authentic assessment model based on showcase portfolio on learning of mathematical problem solving. This research used research and development Method (R & D) which consists of four stages of development that: Phase I, conducting a preliminary study. Phase II, determining the purpose of developing and preparing the initial model. Phase III, trial test of instrument for the initial draft model and the initial product. The respondents of this research are the students of SMAN 8 and SMAN 20 Makassar. The collection of data was through observation, interviews, documentation, student questionnaire, and instrument tests mathematical solving abilities. The data were analyzed with descriptive and inferential statistics. The results of this research are authentic assessment model design based on showcase portfolio which involves: 1) Steps in implementing the authentic assessment based Showcase, assessment rubric of cognitive aspects, assessment rubric of affective aspects, and assessment rubric of skill aspect. 2) The average ability of the students' problem solving which is scored by using authentic assessment based on showcase portfolio was in high category and the students' response in good category.
Energy Technology Data Exchange (ETDEWEB)
Verdu, G.; Miro, R. [Departamento de Ingenieria Quimica y Nuclear, Universidad Politecnica de Valencia, Valencia (Spain); Ginestar, D. [Departamento de Matematica Aplicada, Universidad Politecnica de Valencia, Valencia (Spain); Vidal, V. [Departamento de Sistemas Informaticos y Computacion, Universidad Politecnica de Valencia, Valencia (Spain)
1999-05-01
To calculate the neutronic steady state of a nuclear power reactor core and its subcritical modes, it is necessary to solve a partial eigenvalue problem. In this paper, an implicit restarted Arnoldi method is presented as an advantageous alternative to classical methods as the Power Iteration method and the Subspace Iteration method. The efficiency of these methods, has been compared calculating the dominant Lambda modes of several configurations of the Three Mile Island reactor core.
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.
Solving Eigenvalue response matrix equations with Jacobian-Free Newton-Krylov methods
International Nuclear Information System (INIS)
Roberts, Jeremy A.; Forget, Benoit
2011-01-01
The response matrix method for reactor eigenvalue problems is motivated as a technique for solving coarse mesh transport equations, and the classical approach of power iteration (PI) for solution is described. The method is then reformulated as a nonlinear system of equations, and the associated Jacobian is derived. A Jacobian-Free Newton-Krylov (JFNK) method is employed to solve the system, using an approximate Jacobian coupled with incomplete factorization as a preconditioner. The unpreconditioned JFNK slightly outperforms PI, and preconditioned JFNK outperforms both PI and Steffensen-accelerated PI significantly. (author)
The Pade approximate method for solving problems in plasma kinetic theory
International Nuclear Information System (INIS)
Jasperse, J.R.; Basu, B.
1992-01-01
The method of Pade Approximates has been a powerful tool in solving for the time dependent propagator (Green function) in model quantum field theories. We have developed a modified Pade method which we feel has promise for solving linearized collisional and weakly nonlinear problems in plasma kinetic theory. In order to illustrate the general applicability of the method, in this paper we discuss Pade solutions for the linearized collisional propagator and the collisional dielectric function for a model collisional problem. (author) 3 refs., 2 tabs
Using the method of ideal point to solve dual-objective problem for production scheduling
Directory of Open Access Journals (Sweden)
Mariia Marko
2016-07-01
Full Text Available In practice, there are often problems, which must simultaneously optimize several criterias. This so-called multi-objective optimization problem. In the article we consider the use of the method ideal point to solve the two-objective optimization problem of production planning. The process of finding solution to the problem consists of a series of steps where using simplex method, we find the ideal point. After that for solving a scalar problems, we use the method of Lagrange multipliers
Teaching nutrition to medical students: a community-based problem-solving approach.
Bhattacharji, S; Joseph, A; Abraham, S; Muliyil, J; John, K R; Ethirajan, N
1990-01-01
This paper presents a community-based problem-solving educational programme which aims at teaching medical and other health science students the importance of nutrition and its application. Through community surveys students assess the nutritional status of children under five using different anthropometric methods. They understand the cultural beliefs and customs related to food fads and the reasons for them. They also acquire the skill to educate the community using the information gathered. They use epidemiological methods such as case control study to find associations between malnutrition and other causative factors. Feedback from students has been positive and evaluation of students' knowledge before and after the programme has shown significant improvement.
Directory of Open Access Journals (Sweden)
Yi-Xiong Feng
2013-01-01
Full Text Available A multicriteria decision-making model was proposed in order to acquire the optimum one among different product design schemes. VIKOR method was introduced to compute the ranking value of each scheme. A multiobjective optimization model for criteria weight was established. In this model, projection pursuit method was employed to identify a criteria weight set which could keep classification information of original schemes to the greatest extent, while PROMETHEE II was adopted to keep sorting information. Dominance based multiobjective simulated annealing algorithm (D-MOSA was introduced to solve the optimization model. Finally, an example was taken to demonstrate the feasibility and efficiency of this model.
Towards a Standard-based Domain-specific Platform to Solve Machine Learning-based Problems
Directory of Open Access Journals (Sweden)
Vicente García-Díaz
2015-12-01
Full Text Available Machine learning is one of the most important subfields of computer science and can be used to solve a variety of interesting artificial intelligence problems. There are different languages, framework and tools to define the data needed to solve machine learning-based problems. However, there is a great number of very diverse alternatives which makes it difficult the intercommunication, portability and re-usability of the definitions, designs or algorithms that any developer may create. In this paper, we take the first step towards a language and a development environment independent of the underlying technologies, allowing developers to design solutions to solve machine learning-based problems in a simple and fast way, automatically generating code for other technologies. That can be considered a transparent bridge among current technologies. We rely on Model-Driven Engineering approach, focusing on the creation of models to abstract the definition of artifacts from the underlying technologies.
Problem Solving-Based Experiment untuk Meningkatkan Keterampilan Penalaran Ilmiah Mahasiswa Fisika
Directory of Open Access Journals (Sweden)
Muhamad Gina Nugraha
2017-12-01
Full Text Available Abstract As one of the foundations in the development of technology, physics must be supported by experimental activities that are able to develop a scientist's skills, such as scientific reasoning skills. Experiments with cookbook methods that have been conducted in various experimental activities are considered not able to maximize the potential of students because it does not provide wide opportunities for students to explore. One of the solutions to develop the scientific reasoning skills of physics students is the problem solving-based experiment approach. The research was conducted by one group pretest-posstest design to 20 physics students as research sample. The research instrument used is the scientific reasoning instrument test developed by Lawson which is known as Lawson Classroom Test of Scientific Reasoning (LCTSR and student work sheet instrument (LKM containing problems in daily life and questions about: tools and materials, prediction, exploration, measurement, analysis and conclusions. The results show all aspects of scientific reasoning being measured, i.e. 1 conservation of matter and volume, 2 proportional thinking, 3 identification and control of variables, 4 probabilistic thinking, 5 correlative thinking, and 6 hypothetic-deductive thinking has increased. Based on the result of research can be concluded that the problem solving-based experiment can improve the scientific reasoning skills of physics students. Keywords: Problem solving, experiment, scientific reasoning skills Abstrak Fisika sebagai salah satu pondasi ilmu dalam perkembangan teknologi harus didukung dengan kegiatan eksperimen yang mampu menumbuhkembangkan keterampilan seorang ilmuwan, diantaranya keterampilan penalaran ilmiah dalam menyikapi fenomena alam. Eksperimen dengan metode cookbook yang selama ini menjamur dalam berbagai kegiatan eksperimen dipandang tidak mampu memaksimalkan potensi mahasiswa karena tidak memberikan kesempatan yang luas kepada
Paper Improving Rule Based Stemmers to Solve Some Special Cases of Arabic Language
Directory of Open Access Journals (Sweden)
Soufiane Farrah
2017-04-01
Full Text Available Analysis of Arabic language has become a necessity because of its big evolution; we propose in this paper a rule based extraction method of Arabic text to solve some weaknesses founded on previous research works. Our approach is divided on preprocessing phase, on which we proceed to the tokenization of the text, and formatting it by removing any punctuation, diacritics and non-letter characters. Treatment phase based on the elimination of several sets of affixes (diacritics, prefixes, and suffixes, and on the application of several patterns. A check phase that verifies if the root extracted is correct, by searching the result in root dictionaries.
Local Fractional Series Expansion Method for Solving Wave and Diffusion Equations on Cantor Sets
Directory of Open Access Journals (Sweden)
Ai-Min Yang
2013-01-01
Full Text Available We proposed a local fractional series expansion method to solve the wave and diffusion equations on Cantor sets. Some examples are given to illustrate the efficiency and accuracy of the proposed method to obtain analytical solutions to differential equations within the local fractional derivatives.
Solving Fokker-Planck Equations on Cantor Sets Using Local Fractional Decomposition Method
Directory of Open Access Journals (Sweden)
Shao-Hong Yan
2014-01-01
Full Text Available The local fractional decomposition method is applied to approximate the solutions for Fokker-Planck equations on Cantor sets with local fractional derivative. The obtained results give the present method that is very effective and simple for solving the differential equations on Cantor set.
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.
Solving Nonlinear Fractional Differential Equation by Generalized Mittag-Leffler Function Method
Arafa, A. A. M.; Rida, S. Z.; Mohammadein, A. A.; Ali, H. M.
2013-06-01
In this paper, we use Mittag—Leffler function method for solving some nonlinear fractional differential equations. A new solution is constructed in power series. The fractional derivatives are described by Caputo's sense. To illustrate the reliability of the method, some examples are provided.
The discontinuous finite element method for solving Eigenvalue problems of transport equations
International Nuclear Information System (INIS)
Yang, Shulin; Wang, Ruihong
2011-01-01
In this paper, the multigroup transport equations for solving the eigenvalues λ and K_e_f_f under two dimensional cylindrical coordinate are discussed. Aimed at the equations, the discretizing way combining discontinuous finite element method (DFE) with discrete ordinate method (SN) is developed, and the iterative algorithms and steps are studied. The numerical results show that the algorithms are efficient. (author)
A symmetrized quasi-diffusion method for solving multidimensional transport problems
International Nuclear Information System (INIS)
Miften, M.M.; Larsen, E.W.
1992-01-01
In this paper, the authors propose a 'symmetrized' QD (SQD) method in which the non-self-adjoint QD diffusion problem is replaced by two self-adjoint diffusion problems. These problems are more easily discretized and more efficiently solved than in the standard QD method. They also give SQD calculational results for transport problems in x-y geometry
The Model Method: Singapore Children's Tool for Representing and Solving Algebraic Word Problems
Ng, Swee Fong; Lee, Kerry
2009-01-01
Solving arithmetic and algebraic word problems is a key component of the Singapore elementary mathematics curriculum. One heuristic taught, the model method, involves drawing a diagram to represent key information in the problem. We describe the model method and a three-phase theoretical framework supporting its use. We conducted 2 studies to…
DEFF Research Database (Denmark)
Hejlesen, Mads Mølholm
ring dynamics is presented based on the alignment of the vorticity vector with the principal axis of the strain rate tensor.A novel iterative implementation of the Brinkman penalisation method is introduced for the enforcement of a fluid-solid interface in re-meshed vortex methods. The iterative scheme...... is included to explicitly fulfil the kinematic constraints of the flow field. The high order, unbounded particle-mesh based vortex method is used to simulate the instability, transition to turbulence and eventual destruction of a single vortex ring. From the simulation data, a novel analysis on the vortex...
A difference quotient-numerical integration method for solving radiative transfer problems
International Nuclear Information System (INIS)
Ding Peizhu
1992-01-01
A difference quotient-numerical integration method is adopted to solve radiative transfer problems in an anisotropic scattering slab medium. By using the method, the radiative transfer problem is separated into a system of linear algebraic equations and the coefficient matrix of the system is a band matrix, so the method is very simple to evaluate on computer and to deduce formulae and easy to master for experimentalists. An example is evaluated and it is shown that the method is precise
Tunjo Perić; Željko Mandić
2017-01-01
This paper presents the production plan optimization in the metal industry considered as a multi-criteria programming problem. We first provided the definition of the multi-criteria programming problem and classification of the multicriteria programming methods. Then we applied two multi-criteria programming methods (the STEM method and the PROMETHEE method) in solving a problem of multi-criteria optimization production plan in a company from the metal industry. The obtained resul...
Solving the discrete KdV equation with homotopy analysis method
International Nuclear Information System (INIS)
Zou, L.; Zong, Z.; Wang, Z.; He, L.
2007-01-01
In this Letter, we apply the homotopy analysis method to differential-difference equations. We take the discrete KdV equation as an example, and successfully obtain double periodic wave solutions and solitary wave solutions. It illustrates the validity and the great potential of the homotopy analysis method in solving discrete KdV equation. Comparisons are made between the results of the proposed method and exact solutions. The results reveal that the proposed method is very effective and convenient
A Legendre Wavelet Spectral Collocation Method for Solving Oscillatory Initial Value Problems
Directory of Open Access Journals (Sweden)
A. Karimi Dizicheh
2013-01-01
wavelet suitable for large intervals, and then the Legendre-Guass collocation points of the Legendre wavelet are derived. Using this strategy, the iterative spectral method converts the differential equation to a set of algebraic equations. Solving these algebraic equations yields an approximate solution for the differential equation. The proposed method is illustrated by some numerical examples, and the result is compared with the exponentially fitted Runge-Kutta method. Our proposed method is simple and highly accurate.
Application of differential transformation method for solving dengue transmission mathematical model
Ndii, Meksianis Z.; Anggriani, Nursanti; Supriatna, Asep K.
2018-03-01
The differential transformation method (DTM) is a semi-analytical numerical technique which depends on Taylor series and has application in many areas including Biomathematics. The aim of this paper is to employ the differential transformation method (DTM) to solve system of non-linear differential equations for dengue transmission mathematical model. Analytical and numerical solutions are determined and the results are compared to that of Runge-Kutta method. We found a good agreement between DTM and Runge-Kutta method.
International Nuclear Information System (INIS)
Gunyasu, Kenzo; Hiramoto, Tsuneyuki; Tanimoto, Mitsumori; Osano, Minetada
2002-01-01
We describe a new method for solving large-scale system of linear equations resulting from discretization of ordinary differential equation and partial differential equation directly. This new method effectively reduces the memory capacity requirements and computing time problems for analyses using finite difference method and finite element method. In this paper we have tried to solve one-million linear equations directly for the case that initial displacement and boundary displacement are known about the finite difference scheme of second order inhomogeneous differential equation for vibration of a 10 story structure. Excellent results were got. (author)
Method of mechanical quadratures for solving singular integral equations of various types
Sahakyan, A. V.; Amirjanyan, H. A.
2018-04-01
The method of mechanical quadratures is proposed as a common approach intended for solving the integral equations defined on finite intervals and containing Cauchy-type singular integrals. This method can be used to solve singular integral equations of the first and second kind, equations with generalized kernel, weakly singular equations, and integro-differential equations. The quadrature rules for several different integrals represented through the same coefficients are presented. This allows one to reduce the integral equations containing integrals of different types to a system of linear algebraic equations.
Energy Technology Data Exchange (ETDEWEB)
Carella, Alfredo Raul
2012-09-15
Quantifying species transport rates is a main concern in chemical and petrochemical industries. In particular, the design and operation of many large-scale industrial chemical processes is as much dependent on diffusion as it is on reaction rates. However, the existing diffusion models sometimes fail to predict experimentally observed behaviors and their accuracy is usually insufficient for process optimization purposes. Fractional diffusion models offer multiple possibilities for generalizing Flick's law in a consistent manner in order to account for history dependence and nonlocal effects. These models have not been extensively applied to the study of real systems, mainly due to their computational cost and mathematical complexity. A least squares spectral formulation was developed for solving fractional differential equations. The proposed method was proven particularly well-suited for dealing with the numerical difficulties inherent to fractional differential operators. The practical implementation was explained in detail in order to enhance reproducibility, and directions were specified for extending it to multiple dimensions and arbitrarily shaped domains. A numerical framework based on the least-squares spectral element method was developed for studying and comparing anomalous diffusion models in pellets. This simulation tool is capable of solving arbitrary integro-differential equations and can be effortlessly adapted to various problems in any number of dimensions. Simulations of the flow around a cylindrical particle were achieved by extending the functionality of the developed framework. A test case was analyzed by coupling the boundary condition yielded by the fluid model with two families of anomalous diffusion models: hyperbolic diffusion and fractional diffusion. Qualitative guidelines for determining the suitability of diffusion models can be formulated by complementing experimental data with the results obtained from this approach.(Author)
Directory of Open Access Journals (Sweden)
Thomas Gomez
2018-04-01
Full Text Available Atomic structure of N-electron atoms is often determined by solving the Hartree-Fock equations, which are a set of integro-differential equations. The integral part of the Hartree-Fock equations treats electron exchange, but the Hartree-Fock equations are not often treated as an integro-differential equation. The exchange term is often approximated as an inhomogeneous or an effective potential so that the Hartree-Fock equations become a set of ordinary differential equations (which can be solved using the usual shooting methods. Because the Hartree-Fock equations are an iterative-refinement method, the inhomogeneous term relies on the previous guess of the wavefunction. In addition, there are numerical complications associated with solving inhomogeneous differential equations. This work uses matrix methods to solve the Hartree-Fock equations as an integro-differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using linear-algebra packages. The integral (exchange part of the Hartree-Fock equation can be approximated as a sum and written as a matrix. The Hartree-Fock equations can be solved as a matrix that is the sum of the differential and integral matrices. We compare calculations using this method against experiment and standard atomic structure calculations. This matrix method can also be used to solve for free-electron wavefunctions, thus improving how the atoms and free electrons interact. This technique is important for spectral line broadening in two ways: it improves the atomic structure calculations, and it improves the motion of the plasma electrons that collide with the atom.
Parand, Kourosh; Latifi, Sobhan; Delkhosh, Mehdi; Moayeri, Mohammad M.
2018-01-01
In the present paper, a new method based on the Generalized Lagrangian Jacobi Gauss (GLJG) collocation method is proposed. The nonlinear Kidder equation, which explains unsteady isothermal gas through a micro-nano porous medium, is a second-order two-point boundary value ordinary differential equation on the unbounded interval [0, ∞). Firstly, using the quasilinearization method, the equation is converted to a sequence of linear ordinary differential equations. Then, by using the GLJG collocation method, the problem is reduced to solving a system of algebraic equations. It must be mentioned that this equation is solved without domain truncation and variable changing. A comparison with some numerical solutions made and the obtained results indicate that the presented solution is highly accurate. The important value of the initial slope, y'(0), is obtained as -1.191790649719421734122828603800159364 for η = 0.5. Comparing to the best result obtained so far, it is accurate up to 36 decimal places.
Removal of round off errors in the matrix exponential method for solving the heavy nuclide chain
International Nuclear Information System (INIS)
Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook
2005-01-01
Many nodal codes for core simulation adopt the micro-depletion procedure for the depletion analysis. Unlike the macro-depletion procedure, the microdepletion procedure uses micro-cross sections and number densities of important nuclides to generate the macro cross section of a spatial calculational node. Therefore, it needs to solve the chain equations of the nuclides of interest to obtain their number densities. There are several methods such as the matrix exponential method (MEM) and the chain linearization method (CLM) for solving the nuclide chain equations. The former solves chain equations exactly even when the cycles that come from the alpha decay exist in the chain while the latter solves the chain approximately when the cycles exist in the chain. The former has another advantage over the latter. Many nodal codes for depletion analysis, such as MASTER, solve only the hard coded nuclide chains with the CLM. Therefore, if we want to extend the chain by adding some more nuclides to the chain, we have to modify the source code. In contrast, we can extend the chain just by modifying the input in the MEM because it is easy to implement the MEM solver for solving an arbitrary nuclide chain. In spite of these advantages of the MEM, many nodal codes adopt the chain linearization because the former has a large round off error when the flux level is very high or short lived or strong absorber nuclides exist in the chain. In this paper, we propose a new technique to remove the round off errors in the MEM and we compared the performance of the two methods
Problem of the Moving Boundary in Continuous Casting Solved by The Analytic-Numerical Method
Directory of Open Access Journals (Sweden)
Grzymkowski R.
2013-03-01
Full Text Available Mathematical modeling of thermal processes combined with the reversible phase transitions of type: solid phase - liquid phase leads to formulation of the parabolic or elliptic moving boundary problem. Solution of such defined problem requires, most often, to use some sophisticated numerical techniques and far advanced mathematical tools. The paper presents an analytic-numerical method, especially attractive from the engineer’s point of view, applied for finding the approximate solutions of the selected class of problems which can be reduced to the one-phase solidification problem of a plate with the unknown a priori, varying in time boundary of the region in which the solution is sought. Proposed method is based on the known formalism of initial expansion of a sought function, describing the field of temperature, into the power series, some coefficients of which are determined with the aid of boundary conditions, and on the approximation of a function defining the freezing front location with the broken line, parameters of which are determined numerically. The method represents a combination of the analytical and numerical techniques and seems to be an effective and relatively easy in using tool for solving problems of considered kind.
Problem of the Moving Boundary in Continuous Casting Solved by the Analytic-Numerical Method
Directory of Open Access Journals (Sweden)
R. Grzymkowski
2013-01-01
Full Text Available Mathematical modeling of thermal processes combined with the reversible phase transitions of type: solid phase – liquid phase leads to formulation of the parabolic or elliptic moving boundary problem. Solution of such defined problem requires, most often, to use some sophisticated numerical techniques and far advanced mathematical tools. The paper presents an analytic-numerical method, especially attractive from the engineer’s point of view, applied for finding the approximate solutions of the selected class of problems which can be reduced to the one-phase solidification problem of a plate with the unknown a priori, varying in time boundary of the region in which the solution is sought. Proposed method is based on the known formalism of initial expansion of a sought function, describing the field of temperature, into the power series, some coefficients of which are determined with the aid of boundary conditions, and on the approximation of a function defining the freezing front location with the broken line, parameters of which are determined numerically. The method represents a combination of the analytical and numerical techniques and seems to be an effective and relatively easy in using tool for solving problems of considered kind.
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.
Lagrange-Noether method for solving second-order differential equations
Institute of Scientific and Technical Information of China (English)
Wu Hui-Bin; Wu Run-Heng
2009-01-01
The purpose of this paper is to provide a new method called the Lagrange-Noether method for solving second-order differential equations. The method is,firstly,to write the second-order differential equations completely or partially in the form of Lagrange equations,and secondly,to obtain the integrals of the equations by using the Noether theory of the Lagrange system. An example is given to illustrate the application of the result.
Iterative Methods for Solving Nonlinear Parabolic Problem in Pension Saving Management
Koleva, M. N.
2011-11-01
In this work we consider a nonlinear parabolic equation, obtained from Riccati like transformation of the Hamilton-Jacobi-Bellman equation, arising in pension saving management. We discuss two numerical iterative methods for solving the model problem—fully implicit Picard method and mixed Picard-Newton method, which preserves the parabolic characteristics of the differential problem. Numerical experiments for comparison the accuracy and effectiveness of the algorithms are discussed. Finally, observations are given.
Jacek Łuczak; Radoslaw Wolniak
2015-01-01
The knowledge about methods and techniques of quality management together with their effective use can be definitely regarded as an indication of high organisational culture. Using such methods and techniques in an effective way can be attributed to certain level of maturity, as far as the quality management system in an organisation is concerned. There is in the paper an analysis of problem-solving methods and techniques of quality management in the automotive sector in Poland. The survey wa...
Miller, Bridget; Taber-Doughty, Teresa
2014-01-01
Three students with mild to moderate intellectual and multiple disability, enrolled in a self-contained functional curriculum class were taught to use a self-monitoring checklist and science notebook to increase independence in inquiry problem-solving skills. Using a single-subject multiple-probe design, all students acquired inquiry…
Analytical derivation: An epistemic game for solving mathematically based physics problems
Bajracharya, Rabindra R.; Thompson, John R.
2016-06-01
Problem solving, which often involves multiple steps, is an integral part of physics learning and teaching. Using the perspective of the epistemic game, we documented a specific game that is commonly pursued by students while solving mathematically based physics problems: the analytical derivation game. This game involves deriving an equation through symbolic manipulations and routine mathematical operations, usually without any physical interpretation of the processes. This game often creates cognitive obstacles in students, preventing them from using alternative resources or better approaches during problem solving. We conducted hour-long, semi-structured, individual interviews with fourteen introductory physics students. Students were asked to solve four "pseudophysics" problems containing algebraic and graphical representations. The problems required the application of the fundamental theorem of calculus (FTC), which is one of the most frequently used mathematical concepts in physics problem solving. We show that the analytical derivation game is necessary, but not sufficient, to solve mathematically based physics problems, specifically those involving graphical representations.
Wu, Zedong
2018-04-05
Numerical simulation of the acoustic wave equation in either isotropic or anisotropic media is crucial to seismic modeling, imaging and inversion. Actually, it represents the core computation cost of these highly advanced seismic processing methods. However, the conventional finite-difference method suffers from severe numerical dispersion errors and S-wave artifacts when solving the acoustic wave equation for anisotropic media. We propose a method to obtain the finite-difference coefficients by comparing its numerical dispersion with the exact form. We find the optimal finite difference coefficients that share the dispersion characteristics of the exact equation with minimal dispersion error. The method is extended to solve the acoustic wave equation in transversely isotropic (TI) media without S-wave artifacts. Numerical examples show that the method is is highly accurate and efficient.
Improved Quasi-Newton method via PSB update for solving systems of nonlinear equations
Mamat, Mustafa; Dauda, M. K.; Waziri, M. Y.; Ahmad, Fadhilah; Mohamad, Fatma Susilawati
2016-10-01
The Newton method has some shortcomings which includes computation of the Jacobian matrix which may be difficult or even impossible to compute and solving the Newton system in every iteration. Also, the common setback with some quasi-Newton methods is that they need to compute and store an n × n matrix at each iteration, this is computationally costly for large scale problems. To overcome such drawbacks, an improved Method for solving systems of nonlinear equations via PSB (Powell-Symmetric-Broyden) update is proposed. In the proposed method, the approximate Jacobian inverse Hk of PSB is updated and its efficiency has improved thereby require low memory storage, hence the main aim of this paper. The preliminary numerical results show that the proposed method is practically efficient when applied on some benchmark problems.
Asymptotic solving method for sea-air coupled oscillator ENSO model
International Nuclear Information System (INIS)
Zhou Xian-Chun; Yao Jing-Sun; Mo Jia-Qi
2012-01-01
The ENSO is an interannual phenomenon involved in the tropical Pacific ocean-atmosphere interaction. In this article, we create an asymptotic solving method for the nonlinear system of the ENSO model. The asymptotic solution is obtained. And then we can furnish weather forecasts theoretically and other behaviors and rules for the atmosphere-ocean oscillator of the ENSO. (general)
Directory of Open Access Journals (Sweden)
Ai-Min Yang
2014-01-01
Full Text Available We use the local fractional series expansion method to solve the Klein-Gordon equations on Cantor sets within the local fractional derivatives. The analytical solutions within the nondifferential terms are discussed. The obtained results show the simplicity and efficiency of the present technique with application to the problems of the liner differential equations on Cantor sets.
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
Yaparova, N.
2017-10-01
We consider the problem of heating a cylindrical body with an internal thermal source when the main characteristics of the material such as specific heat, thermal conductivity and material density depend on the temperature at each point of the body. We can control the surface temperature and the heat flow from the surface inside the cylinder, but it is impossible to measure the temperature on axis and the initial temperature in the entire body. This problem is associated with the temperature measurement challenge and appears in non-destructive testing, in thermal monitoring of heat treatment and technical diagnostics of operating equipment. The mathematical model of heating is represented as nonlinear parabolic PDE with the unknown initial condition. In this problem, both the Dirichlet and Neumann boundary conditions are given and it is required to calculate the temperature values at the internal points of the body. To solve this problem, we propose the numerical method based on using of finite-difference equations and a regularization technique. The computational scheme involves solving the problem at each spatial step. As a result, we obtain the temperature function at each internal point of the cylinder beginning from the surface down to the axis. The application of the regularization technique ensures the stability of the scheme and allows us to significantly simplify the computational procedure. We investigate the stability of the computational scheme and prove the dependence of the stability on the discretization steps and error level of the measurement results. To obtain the experimental temperature error estimates, computational experiments were carried out. The computational results are consistent with the theoretical error estimates and confirm the efficiency and reliability of the proposed computational scheme.
Application of the PDCA Problem-Solving Method in treatment of wastewater from poultry processing
Directory of Open Access Journals (Sweden)
Yovanka Pérez Ginoris
2011-12-01
Full Text Available Amongst the technologies developed for the treatment of industrial waste-water, activated sludge systems deserve special mention. The aim of the present work was to explore the use of PDCA management methods for identifying problems in a system for the biological treatment of effluent from a poultry processing plant and to evaluate the priority solutions adopted or proposed for solving them. To accomplish this objective the following steps are required: analysis of inputs and outputs of the effluent treatment process; identification of operational problems in the system based on the use of performance measures; and identification of fundamental causes leading to problems. Four steps in the PDCA cycle were followed: planning, execution, verification, and corrective action. At the planning stage, the problem was identified by analysis of the historic Sludge Volume Index (SVI record, which gave values of about 500 mL/g in the first half of 2010. Analysis of the phenomenon was achieved by monitoring physical, chemical and biological parameters to give a picture of how the system for waste-water treatment actually worked. The survey of fundamental causes used procedures of brainstorming, Ishakawa diagrams, and prioritization. The results suggest that after partial implantation of the proposed action plan, the problem of sludge sedimentation shown by the SVI was much reduced, its value decreased from about 500 mL/g to about 250 mL/g in the second half of 2010. It is therefore concluded that the PDCA methodology is adequate for solving problems in effluent treatment plants.
Numerical methods to solve the two-dimensional heat conduction equation
International Nuclear Information System (INIS)
Santos, R.S. dos.
1981-09-01
A class of numerical methods, called 'Hopscotch Algorithms', was used to solve the heat conduction equation in cylindrical geometry. Using a time dependent heat source, the temperature versus time behaviour of cylindric rod was analysed. Numerical simulation was used to study the stability and the convergence of each different method. Another test had the temperature specified on the outer surface as boundary condition. The various Hopscotch methods analysed exhibit differing degrees of accuracy, few of them being so accurate as the ADE method, but requiring more computational operations than the later, were observed. Finally, compared with the so called ODD-EVEN method, two other Hopscotch methods, are more time consuming. (Author) [pt
Energy Technology Data Exchange (ETDEWEB)
Ando, J; Matsumoto, D; Maita, S; Nakatake, K [Kyushu University, Fukuoka (Japan). Faculty of Engineering
1997-10-01
This paper describes one method for solving an inverse problem of wing type based on the source and quasi continuous vortex lattice method (SQCM) in designing marine propellers and underwater wings. With the SQCM, vortices and control points are distributed on wing camber according to the QCM, and wing surface is divided into certain number of panels. This is the method to decide vortex intensity and blow-out intensity simultaneously from the condition that vertical speed on the camber and the wing surface is zero, upon having distributed blow-out with certain intensity inside the panel. The method solves the inverse problem with the following process: specific point distribution is so determined that the targeted velocity on the wing surface is satisfied when wing surface pressure distribution and uniform flow velocity are given; and then the panels are so rearranged as in parallel with direction of the flow on the surface of the wing calculated by using these specific points to derive the targeted wing shape. This paper describes the problem solving procedure in great detail. It also introduces examples of numerical calculations. It shows one method for solving the inverse problem in wing type using the SQCM as a simple panel method, whereas its good convergence and stability were verified. Considerations on effects of free surface and expansion of the method into three-dimensional problems will be implemented in the future. 11 refs., 8 figs.
Directory of Open Access Journals (Sweden)
Uswah Qasim
2016-03-01
Full Text Available A homotopy method is presented for the construction of frozen Jacobian iterative methods. The frozen Jacobian iterative methods are attractive because the inversion of the Jacobian is performed in terms of LUfactorization only once, for a single instance of the iterative method. We embedded parameters in the iterative methods with the help of the homotopy method: the values of the parameters are determined in such a way that a better convergence rate is achieved. The proposed homotopy technique is general and has the ability to construct different families of iterative methods, for solving weakly nonlinear systems of equations. Further iterative methods are also proposed for solving general systems of nonlinear equations.
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.
Directory of Open Access Journals (Sweden)
Klin-eam Chakkrid
2009-01-01
Full Text Available Abstract A new approximation method for solving variational inequalities and fixed points of nonexpansive mappings is introduced and studied. We prove strong convergence theorem of the new iterative scheme to a common element of the set of fixed points of nonexpansive mapping and the set of solutions of the variational inequality for the inverse-strongly monotone mapping which solves some variational inequalities. Moreover, we apply our main result to obtain strong convergence to a common fixed point of nonexpansive mapping and strictly pseudocontractive mapping in a Hilbert space.
Effective methods of solving of model equations of certain class of thermal systems
International Nuclear Information System (INIS)
Lach, J.
1985-01-01
A number of topics connected with solving of model equations of certain class of thermal systems by the method of successive approximations is touched. A system of partial differential equations of the first degree, appearing most frequently in practical applications of heat and mass transfer theory is reduced to an equivalent system of Volterra integral equations of the second kind. Among a few sample applications the thermal processes appearing in the fuel channel of nuclear reactor are solved. The theoretical analysis is illustrated by the results of numerical calculations given in tables and diagrams. 111 refs., 17 figs., 16 tabs. (author)
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...
A homotopy method for solving Riccati equations on a shared memory parallel computer
International Nuclear Information System (INIS)
Zigic, D.; Watson, L.T.; Collins, E.G. Jr.; Davis, L.D.
1993-01-01
Although there are numerous algorithms for solving Riccati equations, there still remains a need for algorithms which can operate efficiently on large problems and on parallel machines. This paper gives a new homotopy-based algorithm for solving Riccati equations on a shared memory parallel computer. The central part of the algorithm is the computation of the kernel of the Jacobian matrix, which is essential for the corrector iterations along the homotopy zero curve. Using a Schur decomposition the tensor product structure of various matrices can be efficiently exploited. The algorithm allows for efficient parallelization on shared memory machines
Augmented Lagrangian methods to solve Navier-Stokes equations for a Bingham fluid flow
International Nuclear Information System (INIS)
Boscardin, Laetitia
1999-01-01
The objective of this research thesis is to develop one or more methods for the numerical resolution of equations of movement obtained for a Bingham fluid. The resolution of Navier-Stokes equations is processed by splitting elliptic and hyperbolic operators (Galerkin transport). In this purpose, the author first studied the Stokes problem, and then addressed issues of stability and consistency of the global scheme. The variational formulation of the Stokes problem can be expressed under the form of a minimisation problem under the constraint of non linear and non differentiable functions. Then, the author proposes a discretization of the Stokes problem based on a hybrid finite element method. Then he extends the demonstrations of stability and consistency of the Galerkin-transport scheme which have been established for a Newtonian fluid, to the case of a Bingham fluid. A relaxation algorithm and a Newton-GMRES algorithm are developed to solve the problem, and their convergence is studied. To ensure this convergence, some constraints must be verified. In order to do so, a specific speed element has been developed [fr
Directory of Open Access Journals (Sweden)
Tsugio Fukuchi
2014-06-01
Full Text Available The finite difference method (FDM based on Cartesian coordinate systems can be applied to numerical analyses over any complex domain. A complex domain is usually taken to mean that the geometry of an immersed body in a fluid is complex; here, it means simply an analytical domain of arbitrary configuration. In such an approach, we do not need to treat the outer and inner boundaries differently in numerical calculations; both are treated in the same way. Using a method that adopts algebraic polynomial interpolations in the calculation around near-wall elements, all the calculations over irregular domains reduce to those over regular domains. Discretization of the space differential in the FDM is usually derived using the Taylor series expansion; however, if we use the polynomial interpolation systematically, exceptional advantages are gained in deriving high-order differences. In using the polynomial interpolations, we can numerically solve the Poisson equation freely over any complex domain. Only a particular type of partial differential equation, Poisson's equations, is treated; however, the arguments put forward have wider generality in numerical calculations using the FDM.
International Nuclear Information System (INIS)
Núñez, Jóse; Ramos, Eduardo; Lopez, Juan M
2012-01-01
We describe a hybrid method based on the combined use of the Fourier Galerkin and finite-volume techniques to solve the fluid dynamics equations in cylindrical geometries. A Fourier expansion is used in the angular direction, partially translating the problem to the Fourier space and then solving the resulting equations using a finite-volume technique. We also describe an algorithm required to solve the coupled mass and momentum conservation equations similar to a pressure-correction SIMPLE method that is adapted for the present formulation. Using the Fourier–Galerkin method for the azimuthal direction has two advantages. Firstly, it has a high-order approximation of the partial derivatives in the angular direction, and secondly, it naturally satisfies the azimuthal periodic boundary conditions. Also, using the finite-volume method in the r and z directions allows one to handle boundary conditions with discontinuities in those directions. It is important to remark that with this method, the resulting linear system of equations are band-diagonal, leading to fast and efficient solvers. The benefits of the mixed method are illustrated with example problems. (paper)
Directory of Open Access Journals (Sweden)
Muhammad Aslam Noor
2008-01-01
Full Text Available We suggest and analyze a technique by combining the variational iteration method and the homotopy perturbation method. This method is called the variational homotopy perturbation method (VHPM. We use this method for solving higher dimensional initial boundary value problems with variable coefficients. The developed algorithm is quite efficient and is practically well suited for use in these problems. The proposed scheme finds the solution without any discritization, transformation, or restrictive assumptions and avoids the round-off errors. Several examples are given to check the reliability and efficiency of the proposed technique.
International Nuclear Information System (INIS)
Feng Qing-Hua
2014-01-01
In this paper, a new fractional projective Riccati equation method is proposed to establish exact solutions for fractional partial differential equations in the sense of modified Riemann—Liouville derivative. This method can be seen as the fractional version of the known projective Riccati equation method. For illustrating the validity of this method, we apply this method to solve the space-time fractional Whitham—Broer—Kaup (WBK) equations and the nonlinear fractional Sharma—Tasso—Olever (STO) equation, and as a result, some new exact solutions for them are obtained. (general)
Global Convergence of Schubert’s Method for Solving Sparse Nonlinear Equations
Directory of Open Access Journals (Sweden)
Huiping Cao
2014-01-01
Full Text Available Schubert’s method is an extension of Broyden’s method for solving sparse nonlinear equations, which can preserve the zero-nonzero structure defined by the sparse Jacobian matrix and can retain many good properties of Broyden’s method. In particular, Schubert’s method has been proved to be locally and q-superlinearly convergent. In this paper, we globalize Schubert’s method by using a nonmonotone line search. Under appropriate conditions, we show that the proposed algorithm converges globally and superlinearly. Some preliminary numerical experiments are presented, which demonstrate that our algorithm is effective for large-scale problems.
Numerical methods for solving the governing equations for a seriated continuum
International Nuclear Information System (INIS)
Narum, R.E.; Noble, C.; Mortensen, G.A.; McFadden, J.H.
1976-09-01
A desire to more accurately predict the behavior of transient two-phase flows has resulted in an investigation of the feasibility of computing unequal phase velocities and unequal phase temperatures. The finite difference forms of a set of equations governing a seriated continuum are presented along with two methods developed for solving the resulting systems of simultaneous nonlinear equations. Results from a one-dimensional computer code are presented to illustrate the capabilities of one of the solution methods
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)
El-Sayed, A.M.A. [Faculty of Science University of Alexandria (Egypt)]. E-mail: amasyed@hotmail.com; Gaber, M. [Faculty of Education Al-Arish, Suez Canal University (Egypt)]. E-mail: mghf408@hotmail.com
2006-11-20
The Adomian decomposition method has been successively used to find the explicit and numerical solutions of the time fractional partial differential equations. A different examples of special interest with fractional time and space derivatives of order {alpha}, 0<{alpha}=<1 are considered and solved by means of Adomian decomposition method. The behaviour of Adomian solutions and the effects of different values of {alpha} are shown graphically for some examples.
On Newton-Kantorovich Method for Solving the Nonlinear Operator Equation
Directory of Open Access Journals (Sweden)
Hameed Husam Hameed
2015-01-01
Full Text Available We develop the Newton-Kantorovich method to solve the system of 2×2 nonlinear Volterra integral equations where the unknown function is in logarithmic form. A new majorant function is introduced which leads to the increment of the convergence interval. The existence and uniqueness of approximate solution are proved and a numerical example is provided to show the validation of the method.
Lee, Young-Jin
2017-01-01
Purpose: The purpose of this paper is to develop a quantitative model of problem solving performance of students in the computer-based mathematics learning environment. Design/methodology/approach: Regularized logistic regression was used to create a quantitative model of problem solving performance of students that predicts whether students can…
Knowledge-Based Instruction: Teaching Problem Solving in a Logo Learning Environment.
Swan, Karen; Black, John B.
1993-01-01
Discussion of computer programming and knowledge-based instruction focuses on three studies of elementary and secondary school students which show that five particular problem-solving strategies can be developed in students explicitly taught the strategies and given practice applying them to solve LOGO programming problems. (Contains 53…
One Improvement Method of Reducing Duration Directly to Solve Time-Cost Tradeoff Problem
Jian-xun, Qi; Dedong, Sun
Time and cost are two of the most important factors for project plan and schedule management, and specially, time-cost tradeoff problem is one classical problem in project scheduling, which is also a difficult problem. Methods of solving the problem mainly contain method of network flow and method of mending the minimal cost. Thereinto, for the method of mending the minimal cost is intuitionistic, convenient and lesser computation, these advantages make the method being used widely in practice. But disadvantage of the method is that the result of each step is optimal but the terminal result maybe not optimal. In this paper, firstly, method of confirming the maximal effective quantity of reducing duration is designed; secondly, on the basis of above method and the method of mending the minimal cost, the main method of reducing duration directly is designed to solve time-cost tradeoff problem, and by analyzing validity of the method, the method could obtain more optimal result for the problem.
Directory of Open Access Journals (Sweden)
Imtiaz Wasim
2018-01-01
Full Text Available In this study, we introduce a new numerical technique for solving nonlinear generalized Burgers-Fisher and Burgers-Huxley equations using hybrid B-spline collocation method. This technique is based on usual finite difference scheme and Crank-Nicolson method which are used to discretize the time derivative and spatial derivatives, respectively. Furthermore, hybrid B-spline function is utilized as interpolating functions in spatial dimension. The scheme is verified unconditionally stable using the Von Neumann (Fourier method. Several test problems are considered to check the accuracy of the proposed scheme. The numerical results are in good agreement with known exact solutions and the existing schemes in literature.
SOLVING OPTIMAL ASSEMBLY LINE CONFIGURATION TASK BY MULTIOBJECTIVE DECISION MAKING METHODS
Directory of Open Access Journals (Sweden)
Ján ČABALA
2017-06-01
Full Text Available This paper deals with looking for the optimal configuration of automated assembly line model placed within Department of Cybernetics and Artificial Intelligence (DCAI. In order to solve this problem, Stateflow model of each configuration was created to simulate the behaviour of particular assembly line configuration. Outputs from these models were used as inputs into the multiobjective decision making process. Multi-objective decision-making methods were subsequently used to find the optimal configuration of assembly line. Paper describes the whole process of solving this task, from building the models to choosing the best configuration. Specifically, the problem was resolved using the experts’ evaluation method for evaluating the weights of every decision-making criterion, while the ELECTRE III, TOPSIS and AGREPREF methods were used for ordering the possible solutions from the most to the least suitable alternative. Obtained results were compared and final solution of this multi-objective decisionmaking problem is chosen.
Splitting Method for Solving the Coarse-Mesh Discretized Low-Order Quasi-Diffusion Equations
International Nuclear Information System (INIS)
Hiruta, Hikaru; Anistratov, Dmitriy Y.; Adams, Marvin L.
2005-01-01
In this paper, the development is presented of a splitting method that can efficiently solve coarse-mesh discretized low-order quasi-diffusion (LOQD) equations. The LOQD problem can reproduce exactly the transport scalar flux and current. To solve the LOQD equations efficiently, a splitting method is proposed. The presented method splits the LOQD problem into two parts: (a) the D problem that captures a significant part of the transport solution in the central parts of assemblies and can be reduced to a diffusion-type equation and (b) the Q problem that accounts for the complicated behavior of the transport solution near assembly boundaries. Independent coarse-mesh discretizations are applied: the D problem equations are approximated by means of a finite element method, whereas the Q problem equations are discretized using a finite volume method. Numerical results demonstrate the efficiency of the methodology presented. This methodology can be used to modify existing diffusion codes for full-core calculations (which already solve a version of the D problem) to account for transport effects
Hybrid subgroup decomposition method for solving fine-group eigenvalue transport problems
International Nuclear Information System (INIS)
Yasseri, Saam; Rahnema, Farzad
2014-01-01
Highlights: • An acceleration technique for solving fine-group eigenvalue transport problems. • Coarse-group quasi transport theory to solve coarse-group eigenvalue transport problems. • Consistent and inconsistent formulations for coarse-group quasi transport theory. • Computational efficiency amplified by a factor of 2 using hybrid SGD for 1D BWR problem. - Abstract: In this paper, a new hybrid method for solving fine-group eigenvalue transport problems is developed. This method extends the subgroup decomposition method to efficiently couple a new coarse-group quasi transport theory with a set of fixed-source transport decomposition sweeps to obtain the fine-group transport solution. The advantages of the quasi transport theory are its high accuracy, straight-forward implementation and numerical stability. The hybrid method is analyzed for a 1D benchmark problem characteristic of boiling water reactors (BWR). It is shown that the method reproduces the fine-group transport solution with high accuracy while increasing the computational efficiency up to 12 times compared to direct fine-group transport calculations
Visser, Yusra Laila
This study compared the effect of lecture-based instruction to that of problem-based instruction on learner performance (on near-transfer and far-transfer problems), problem solving processes (reasoning strategy usage and reasoning efficiency), and attitudes (overall motivation and learner confidence) in a Genetics course. The study also analyzed the effect of self-regulatory skills and prior-academic achievement on performance for both instructional strategies. Sixty 11th grade students at a public math and science academy were assigned to either a lecture-based instructional strategy or a problem-based instructional strategy. Both treatment groups received 18 weeks of Genetics instruction through the assigned instructional strategy. In terms of problem solving performance, results revealed that the lecture-based group performed significantly better on near-transfer post-test problems. The problem-based group performed significantly better on far-transfer post-test problems. In addition, results indicated the learners in the lecture-based instructional treatment were significantly more likely to employ data-driven reasoning in the solving of problems, whereas learners in the problem-based instructional treatment were significantly more likely to employ hypothesis-driven reasoning in problem solving. No significant differences in reasoning efficiency were uncovered between treatment groups. Preliminary analysis of the motivation data suggested that there were no significant differences in motivation between treatment groups. However, a post-research exploratory analysis suggests that overall motivation was significantly higher in the lecture-based instructional treatment than in the problem-based instructional treatment. Learner confidence was significantly higher in the lecture-based group than in the problem-based group. A significant positive correlation was detected between self-regulatory skills scores and problem solving performance scores in the problem-based
Nasution, M. L.; Yerizon, Y.; Gusmiyanti, R.
2018-04-01
One of the purpose mathematic learning is to develop problem solving abilities. Problem solving is obtained through experience in questioning non-routine. Improving students’ mathematical problem-solving abilities required an appropriate strategy in learning activities one of them is models problem based learning (PBL). Thus, the purpose of this research is to determine whether the problem solving abilities of mathematical students’ who learn to use PBL better than on the ability of students’ mathematical problem solving by applying conventional learning. This research included quasi experiment with static group design and population is students class XI MIA SMAN 1 Lubuk Alung. Class experiment in the class XI MIA 5 and class control in the class XI MIA 6. The instrument of final test students’ mathematical problem solving used essay form. The result of data final test in analyzed with t-test. The result is students’ mathematical problem solving abilities with PBL better then on the ability of students’ mathematical problem solving by applying conventional learning. It’s seen from the high percentage achieved by the group of students who learn to use PBL for each indicator of students’ mathematical problem solving.
Hamming method for solving the delayed neutron precursor concentration for reactivity calculation
International Nuclear Information System (INIS)
Díaz, Daniel Suescún; Ospina, Juan Felipe Flórez; Sarasty, Jesús Andrés Rodríguez
2012-01-01
Highlights: ► We present a new formulation to calculate the reactivity using the Hamming method. ► This method shows better accuracy than existing methods for reactivity calculation. ► The reactivity is calculated without limitation of the nuclear power form. ► The method can be implemented in reactivity meters with time step of up to 0.1 s. - Abstract: We propose a new method for numerically solving the inverse point kinetic equation for a nuclear reactor using the Hamming method, without requiring the nuclear power history and without using the Laplace transform. This new method converges with accuracy of order h 5 , where h is the step in the computation time. The procedure is validated for different forms of the nuclear power and with different time steps. The results indicate that this method has a better accuracy and lower computational effort compared with other conventional methods that use the nuclear power history.
Piret, Cé cile
2012-01-01
Much work has been done on reconstructing arbitrary surfaces using the radial basis function (RBF) method, but one can hardly find any work done on the use of RBFs to solve partial differential equations (PDEs) on arbitrary surfaces. In this paper
Solving groundwater flow problems by conjugate-gradient methods and the strongly implicit procedure
Hill, Mary C.
1990-01-01
The performance of the preconditioned conjugate-gradient method with three preconditioners is compared with the strongly implicit procedure (SIP) using a scalar computer. The preconditioners considered are the incomplete Cholesky (ICCG) and the modified incomplete Cholesky (MICCG), which require the same computer storage as SIP as programmed for a problem with a symmetric matrix, and a polynomial preconditioner (POLCG), which requires less computer storage than SIP. Although POLCG is usually used on vector computers, it is included here because of its small storage requirements. In this paper, published comparisons of the solvers are evaluated, all four solvers are compared for the first time, and new test cases are presented to provide a more complete basis by which the solvers can be judged for typical groundwater flow problems. Based on nine test cases, the following conclusions are reached: (1) SIP is actually as efficient as ICCG for some of the published, linear, two-dimensional test cases that were reportedly solved much more efficiently by ICCG; (2) SIP is more efficient than other published comparisons would indicate when common convergence criteria are used; and (3) for problems that are three-dimensional, nonlinear, or both, and for which common convergence criteria are used, SIP is often more efficient than ICCG, and is sometimes more efficient than MICCG.
Directory of Open Access Journals (Sweden)
Paweł Sitek
2016-01-01
Full Text Available This paper presents a hybrid method for modeling and solving supply chain optimization problems with soft, hard, and logical constraints. Ability to implement soft and logical constraints is a very important functionality for supply chain optimization models. Such constraints are particularly useful for modeling problems resulting from commercial agreements, contracts, competition, technology, safety, and environmental conditions. Two programming and solving environments, mathematical programming (MP and constraint logic programming (CLP, were combined in the hybrid method. This integration, hybridization, and the adequate multidimensional transformation of the problem (as a presolving method helped to substantially reduce the search space of combinatorial models for supply chain optimization problems. The operation research MP and declarative CLP, where constraints are modeled in different ways and different solving procedures are implemented, were linked together to use the strengths of both. This approach is particularly important for the decision and combinatorial optimization models with the objective function and constraints, there are many decision variables, and these are summed (common in manufacturing, supply chain management, project management, and logistic problems. The ECLiPSe system with Eplex library was proposed to implement a hybrid method. Additionally, the proposed hybrid transformed model is compared with the MILP-Mixed Integer Linear Programming model on the same data instances. For illustrative models, its use allowed finding optimal solutions eight to one hundred times faster and reducing the size of the combinatorial problem to a significant extent.
Development of a set of benchmark problems to verify numerical methods for solving burnup equations
International Nuclear Information System (INIS)
Lago, Daniel; Rahnema, Farzad
2017-01-01
Highlights: • Description transmutation chain benchmark problems. • Problems for validating numerical methods for solving burnup equations. • Analytical solutions for the burnup equations. • Numerical solutions for the burnup equations. - Abstract: A comprehensive set of transmutation chain benchmark problems for numerically validating methods for solving burnup equations was created. These benchmark problems were designed to challenge both traditional and modern numerical methods used to solve the complex set of ordinary differential equations used for tracking the change in nuclide concentrations over time due to nuclear phenomena. Given the development of most burnup solvers is done for the purpose of coupling with an established transport solution method, these problems provide a useful resource in testing and validating the burnup equation solver before coupling for use in a lattice or core depletion code. All the relevant parameters for each benchmark problem are described. Results are also provided in the form of reference solutions generated by the Mathematica tool, as well as additional numerical results from MATLAB.
Model Integrated Problem Solving Based Learning pada Perkuliahan Dasar-dasar Kimia Analitik
Directory of Open Access Journals (Sweden)
Indarini Dwi Pursitasari
2013-07-01
Full Text Available Abstract: Integrated Problem Solving Based Learning Model on Foundation of Analytical Chemistry. This study was conducted to know the effects of Integrated Problem Solving Based Learning (IPSBL model on problem solving skills and cognitive ability of pre-service teachers. The subjects of the study were 41 pre- service teachers, 21 in the experimental group and 20 in the control group. The data were collected through a test on problem solving skills, a test on cognitive ability, and a questionnaire on the students’opinions on the use of IPSBL model. The quantitative data were analyzed using t-test and one-way ANOVA, and the qualitative data were analyzed by counting the percentage. The results of the study show that the implementation of IPSBL model increased the problem solving skills and cognitive ability of the pre-service teachers . The model was also responded positively by the research subjects. Abstrak: Model Integrated Problem Solving Based learning pada Perkuliahan Dasar-dasar Kimia Analitik. Penelitian ini bertujuan menentukan pengaruh model Integrated Problem Solving Based Learning(IPSBL terhadap peningkatan kemampuan problem solving dan kemampuan kognitif mahasiswa calon guru. Subjek penelitian terdiri dari 21 mahasiswa kelas eksperimen dan 20 mahasiswa kelas kontrol. Data dikumpulkan menggunakan tes kemampuan problem solving, tes kemampuan kognitif, dan angket untuk menjaring pendapat mahasiswa terhadap penggunaan model IPSBL . Data kuantitatif dianalisis denga n uji- t dan Anava dengan bantuan program SPSS 16.0. Data kualitatif dihitung persentasenya. Hasil penelitian menunjukkan bahwa model IPSBL dapat meningkatkan kemampuan problem solving dan kemampuan kognitif serta mendapat tanggapan yang positif dari mahasiswa.
Directory of Open Access Journals (Sweden)
Phoorin Thaengnoi
2017-06-01
Full Text Available The purposes of this research were: 1 to develop scientific problem-solving abilities test based on scientific knowledge about atmosphere and weather for seventh grade students and 2 to study the scientific problem-solving abilities of seventh grade students. The samples used in this study were 47 students who were studying in seventh grade in academic year 2015 of a school in Chai Nat province, Thailand. Purposive sampling was applied for identifying the samples. The research instrument of this study was the scientific problem-solving abilities test developed by the researcher. The research data was analyzed by comparing students’ scores with the criteria and considering students’ answers in each element of scientific problem-solving abilities. The results of the study were as follows: The scientific problem-solving abilities test composed of 2 parts. The first part was multiple-choice questions which was composed of 4 situations, a total of 20 questions. The Index of Item Objective Congruence of this part was varied in the range between 0.67 – 1.00. The difficulty and the discrimination level were in the range between 0.33 – 0.63 and 0.27 – 0.67, respectively. The reliability levels of this part was equal to 0.81. The second part of the test was subjective questions which composed of 2 situations, a total of 10 questions. The Index of Item Objective Congruence of this part was varied in the range between 0.67 – 1.00. The reliability level of this part was equal to 0.83. Besides, all questions in the test were covered all elements of scientific problem-solving abilities ; 1 identifying the problem 2 making the hypothesis 3 collecting data and knowledge to solve the problem 4 identifying problem-solving method and 5 predicting the characteristics of the results. The problem-solving abilities of the students revealed that 40.43% of students (n=19 were in a moderate level and 59.57% of students (n=28 were in a low level with the
Implementing Mixed Method of Peer Teaching and Problem Solving on Undergraduate Students
Directory of Open Access Journals (Sweden)
A. Firli
2017-02-01
Full Text Available This study examined the application of problem solving method combined with student centered learning (peer teaching method as a mixed method to improve student’s passing level of financial management course. The object of this study was the 84 students of financial management course separated within two classes during the odd semester period 2014/2015, July until December 2015 with fourteen meeting courses. Data used to measure the results of the application is mid and final exam scores of both classes. Researcher used observation, interview and documentation as data collect technique also triangulation technique as data validity check. This study used problem solving method combined with student centered learning (peer teaching method as a mixed method which included into the Classroom Action Research. The final results show the increase in class A passing level is 17%. Class B passing level increased 3%. From the research we also know that in practical use of mixed method learning, leader’s quality and conducive learning environment are influencing factors in improving student’s learning performance. While the result confirms that mixed method improving learning performance, this study also founds additional factors that might be considerably affecting the results of learning performance when implementing the mixed method.
Methods and Algorithms for Solving Inverse Problems for Fractional Advection-Dispersion Equations
Aldoghaither, Abeer
2015-11-12
observations. An analytic solution for the non-homogeneous case is derived and existence and uniqueness of the solution are established. In addition, the uniqueness and stability of the inverse problem is studied. Moreover, the modulating functions-based method is used to solve the problem and it is compared to a standard Tikhono-based optimization technique.
The verification of the Taylor-expansion moment method in solving aerosol breakage
Directory of Open Access Journals (Sweden)
Yu Ming-Zhou
2012-01-01
Full Text Available The combination of the method of moment, characterizing the particle population balance, and the computational fluid dynamics has been an emerging research issue in the studies on the aerosol science and on the multiphase flow science. The difficulty of solving the moment equation arises mainly from the closure of some fractal moment variables which appears in the transform from the non-linear integral-differential population balance equation to the moment equations. Within the Taylor-expansion moment method, the breakage-dominated Taylor-expansion moment equation is first derived here when the symmetric fragmentation mechanism is involved. Due to the high efficiency and the high precision, this proposed moment model is expected to become an important tool for solving population balance equations.
International Nuclear Information System (INIS)
Dmitriy Y. Anistratov; Adrian Constantinescu; Loren Roberts; William Wieselquist
2007-01-01
This is a project in the field of fundamental research on numerical methods for solving the particle transport equation. Numerous practical problems require to use unstructured meshes, for example, detailed nuclear reactor assembly-level calculations, large-scale reactor core calculations, radiative hydrodynamics problems, where the mesh is determined by hydrodynamic processes, and well-logging problems in which the media structure has very complicated geometry. Currently this is an area of very active research in numerical transport theory. main issues in developing numerical methods for solving the transport equation are the accuracy of the numerical solution and effectiveness of iteration procedure. The problem in case of unstructured grids is that it is very difficult to derive an iteration algorithm that will be unconditionally stable
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.
An improved computational version of the LTSN method to solve transport problems in a slab
International Nuclear Information System (INIS)
Cardona, Augusto V.; Oliveira, Jose Vanderlei P. de; Vilhena, Marco Tullio de; Segatto, Cynthia F.
2008-01-01
In this work, we present an improved computational version of the LTS N method to solve transport problems in a slab. The key feature relies on the reordering of the set of S N equations. This procedure reduces by a factor of two the task of evaluating the eigenvalues of the matrix associated to SN approximations. We present numerical simulations and comparisons with the ones of the classical LTS N approach. (author)
Gintsburg, A L; Zigangirova, N A; Romanova, Iu M
1999-01-01
The article deals with modern methods, viz. PCR, molecular display and genotherapy, which permit the new approach to the solution of problems connected with the identification of infective agents, the study of the mechanisms of the pathogenesis of infectious diseases and their treatment. In this article concrete examples, clearly demonstrating how each of the above-mentioned technologies makes it possible to broaden the circle of problems solved in infectious pathology of man, are presented.
The use of Adomian decomposition method for solving problems in calculus of variations
Directory of Open Access Journals (Sweden)
Mehdi Dehghan
2006-01-01
Full Text Available In this paper, a numerical method is presented for finding the solution of some variational problems. The main objective is to find the solution of an ordinary differential equation which arises from the variational problem. This work is done using Adomian decomposition method which is a powerful tool for solving large amount of problems. In this approach, the solution is found in the form of a convergent power series with easily computed components. To show the efficiency of the method, numerical results are presented.
Comparison of two Ssub(infinity) methods for solving the neutron transport equation
International Nuclear Information System (INIS)
Mennig, J.; Brandt, D.; Haelg, W.
1978-01-01
A semianalytic method (S 0 sub(infinity)) is presented for solving the monoenergetic multi-region transport equation. This method is compared with results from S 1 sub(infinity)-theory given in the literature. Application of S 1 sub(infinity)-theory to reactor shields may lead to negative neutron fluxes and to flux oscillations. These unphysical effects are completely avoided by the new method. Numerical results demonstrate the limitations of S 1 sub(infinity) and confirm the numerical stability of (S 0 sub(infinity)). (Auth.)
A lattice Boltzmann coupled to finite volumes method for solving phase change problems
Directory of Open Access Journals (Sweden)
El Ganaoui Mohammed
2009-01-01
Full Text Available A numerical scheme coupling lattice Boltzmann and finite volumes approaches has been developed and qualified for test cases of phase change problems. In this work, the coupled partial differential equations of momentum conservation equations are solved with a non uniform lattice Boltzmann method. The energy equation is discretized by using a finite volume method. Simulations show the ability of this developed hybrid method to model the effects of convection, and to predict transfers. Benchmarking is operated both for conductive and convective situation dominating solid/liquid transition. Comparisons are achieved with respect to available analytical solutions and experimental results.
Fasni, Nurli; Fatimah, Siti; Yulanda, Syerli
2017-05-01
This research aims to achieve some purposes such as: to know whether mathematical problem solving ability of students who have learned mathematics using Multiple Intelligences based teaching model is higher than the student who have learned mathematics using cooperative learning; to know the improvement of the mathematical problem solving ability of the student who have learned mathematics using Multiple Intelligences based teaching model., to know the improvement of the mathematical problem solving ability of the student who have learned mathematics using cooperative learning; to know the attitude of the students to Multiple Intelligences based teaching model. The method employed here is quasi-experiment which is controlled by pre-test and post-test. The population of this research is all of VII grade in SMP Negeri 14 Bandung even-term 2013/2014, later on two classes of it were taken for the samples of this research. A class was taught using Multiple Intelligences based teaching model and the other one was taught using cooperative learning. The data of this research were gotten from the test in mathematical problem solving, scale questionnaire of the student attitudes, and observation. The results show the mathematical problem solving of the students who have learned mathematics using Multiple Intelligences based teaching model learning is higher than the student who have learned mathematics using cooperative learning, the mathematical problem solving ability of the student who have learned mathematics using cooperative learning and Multiple Intelligences based teaching model are in intermediate level, and the students showed the positive attitude in learning mathematics using Multiple Intelligences based teaching model. As for the recommendation for next author, Multiple Intelligences based teaching model can be tested on other subject and other ability.
Solving the dial-a-ride problem using agent-based simulation
Directory of Open Access Journals (Sweden)
Campbell, Ian
2016-11-01
Full Text Available The ‘dial-a-ride problem’ (DARP requires a set of customers to be transported by a limited fleet of vehicles between unique origins and destinations under several service constraints, including within defined time windows. The problem is considered NP-hard, and has typically been solved using metaheuristic methods. An agent-based simulation (ABS model was developed, where each vehicle bids to service customers based on a weighted objective function that considers the cost to service the customer and the time quality of the service that would be achieved. The approach applied a pre- processing technique to reduce the search space, given the service time window constraints. Tests of the model showed significantly better customer transit and waiting times than the benchmark datasets. The ABS was able to obtain solutions for much larger problem sizes than the benchmark solutions, with this work being the first known application of ABS to the DARP.
A conversational case-based reasoning approach to assisting experts in solving professional problems
Directory of Open Access Journals (Sweden)
Negar Armaghan
2018-03-01
Full Text Available Nowadays, organizations attempt to retrieve, collect, preserve and manage knowledge and experience of experts in order to reuse them later and to promote innovation. In this sense, Experience Management is one of the important organizational issues. This article is discussed the main ideas of a future Conversational Case-Based Reasoning (CCBR intended to assist the experts of after-sales service in a French industrial company. The aim of this research is to formalize the experience of experts in after-sales service in order to better reuse them for similar problems in future. The research opts for an action research method which consists of two main parts: description of failure and proposition of decision protocol. The data were complemented by questionnaires, documentary analysis (including technical reports and other technical documents, observation and many interviews with experts. The findings include several aspects: the formalization of Problem-solving Cards, proposing the structure of case base, as well as the framework of proposed system. These formalizations permit after-sales service experts to provide effective diagnosis and problem-solving.
Processing time tolerance-based ACO algorithm for solving job-shop scheduling problem
Luo, Yabo; Waden, Yongo P.
2017-06-01
Ordinarily, Job Shop Scheduling Problem (JSSP) is known as NP-hard problem which has uncertainty and complexity that cannot be handled by a linear method. Thus, currently studies on JSSP are concentrated mainly on applying different methods of improving the heuristics for optimizing the JSSP. However, there still exist many problems for efficient optimization in the JSSP, namely, low efficiency and poor reliability, which can easily trap the optimization process of JSSP into local optima. Therefore, to solve this problem, a study on Ant Colony Optimization (ACO) algorithm combined with constraint handling tactics is carried out in this paper. Further, the problem is subdivided into three parts: (1) Analysis of processing time tolerance-based constraint features in the JSSP which is performed by the constraint satisfying model; (2) Satisfying the constraints by considering the consistency technology and the constraint spreading algorithm in order to improve the performance of ACO algorithm. Hence, the JSSP model based on the improved ACO algorithm is constructed; (3) The effectiveness of the proposed method based on reliability and efficiency is shown through comparative experiments which are performed on benchmark problems. Consequently, the results obtained by the proposed method are better, and the applied technique can be used in optimizing JSSP.
King, Nathan D.; Ruuth, Steven J.
2017-05-01
Maps from a source manifold M to a target manifold N appear in liquid crystals, color image enhancement, texture mapping, brain mapping, and many other areas. A numerical framework to solve variational problems and partial differential equations (PDEs) that map between manifolds is introduced within this paper. Our approach, the closest point method for manifold mapping, reduces the problem of solving a constrained PDE between manifolds M and N to the simpler problems of solving a PDE on M and projecting to the closest points on N. In our approach, an embedding PDE is formulated in the embedding space using closest point representations of M and N. This enables the use of standard Cartesian numerics for general manifolds that are open or closed, with or without orientation, and of any codimension. An algorithm is presented for the important example of harmonic maps and generalized to a broader class of PDEs, which includes p-harmonic maps. Improved efficiency and robustness are observed in convergence studies relative to the level set embedding methods. Harmonic and p-harmonic maps are computed for a variety of numerical examples. In these examples, we denoise texture maps, diffuse random maps between general manifolds, and enhance color images.
Institute of Scientific and Technical Information of China (English)
Feng Junwen
2006-01-01
To overcome the limitations of the traditional surrogate worth trade-off (SWT) method and solve the multiple criteria decision making problem more efficiently and interactively, a new method labeled dual worth trade-off (DWT) method is proposed. The DWT method dynamically uses the duality theory related to the multiple criteria decision making problem and analytic hierarchy process technique to obtain the decision maker's solution preference information and finally find the satisfactory compromise solution of the decision maker. Through the interactive process between the analyst and the decision maker, trade-off information is solicited and treated properly, the representative subset of efficient solutions and the satisfactory solution to the problem are found. The implementation procedure for the DWT method is presented. The effectiveness and applicability of the DWT method are shown by a practical case study in the field of production scheduling.
Energy Technology Data Exchange (ETDEWEB)
Halawa, E.; Saman, W.; Bruno, F. [Institute for Sustainable Systems and Technologies, School of Advanced Manufacturing and Mechanical Engineering, University of South Australia, Mawson Lakes SA 5095 (Australia)
2010-08-15
A simple yet accurate iterative method for solving a one-dimensional phase change problem with convection boundary is described. The one-dimensional model takes into account the variation in the wall temperature along the direction of the flow as well as the sensible heat during preheating/pre-cooling of the phase change material (PCM). The mathematical derivation of convective boundary conditions has been integrated into a phase change processor (PCP) algorithm that solves the liquid fraction and temperature of the nodes. The algorithm is based on the heat balance at each node as it undergoes heating or cooling which inevitably involves phase change. The paper presents the model and its experimental validation. (author)
Method for the Direct Solve of the Many-Body Schrödinger Wave Equation
Jerke, Jonathan; Tymczak, C. J.; Poirier, Bill
We report on theoretical and computational developments towards a computationally efficient direct solve of the many-body Schrödinger wave equation for electronic systems. This methodology relies on two recent developments pioneered by the authors: 1) the development of a Cardinal Sine basis for electronic structure calculations; and 2) the development of a highly efficient and compact representation of multidimensional functions using the Canonical tensor rank representation developed by Belykin et. al. which we have adapted to electronic structure problems. We then show several relevant examples of the utility and accuracy of this methodology, scaling with system size, and relevant convergence issues of the methodology. Method for the Direct Solve of the Many-Body Schrödinger Wave Equation.
Directory of Open Access Journals (Sweden)
Jacek Łuczak
2015-12-01
Full Text Available The knowledge about methods and techniques of quality management together with their effective use can be definitely regarded as an indication of high organisational culture. Using such methods and techniques in an effective way can be attributed to certain level of maturity, as far as the quality management system in an organisation is concerned. There is in the paper an analysis of problem-solving methods and techniques of quality management in the automotive sector in Poland. The survey was given to the general population, which in case of the study consisted of companies operating in Poland that had certified quality management systems against ISO/TS 16949. The results of the conducted survey and the conclusions of the author can show actual and potential OEM suppliers (both 1st and 2nd tier in which direction their strategies for development and improvement of quality management systems should go in order to be effective. When the universal character of methods and techniques used in the surveyed population of companies is taken into consideration, it can be assumed that the results of the survey are also universal for all organisations realising the TQM strategy. The results of the research confirmed that methods which are also the basis for creating key system documents are the most relevant ones, i.e. flowcharts and FMEA, and moreover process monitoring tools (SPC and problem solving methods -above all 8D.
Imaginary Time Step Method to Solve the Dirac Equation with Nonlocal Potential
International Nuclear Information System (INIS)
Zhang Ying; Liang Haozhao; Meng Jie
2009-01-01
The imaginary time step (ITS) method is applied to solve the Dirac equation with nonlocal potentials in coordinate space. Taking the nucleus 12 C as an example, even with nonlocal potentials, the direct ITS evolution for the Dirac equation still meets the disaster of the Dirac sea. However, following the recipe in our former investigation, the disaster can be avoided by the ITS evolution for the corresponding Schroedinger-like equation without localization, which gives the convergent results exactly the same with those obtained iteratively by the shooting method with localized effective potentials.
Numerical method for solving the three-dimensional time-dependent neutron diffusion equation
International Nuclear Information System (INIS)
Khaled, S.M.; Szatmary, Z.
2005-01-01
A numerical time-implicit method has been developed for solving the coupled three-dimensional time-dependent multi-group neutron diffusion and delayed neutron precursor equations. The numerical stability of the implicit computation scheme and the convergence of the iterative associated processes have been evaluated. The computational scheme requires the solution of large linear systems at each time step. For this purpose, the point over-relaxation Gauss-Seidel method was chosen. A new scheme was introduced instead of the usual source iteration scheme. (author)
Energy Technology Data Exchange (ETDEWEB)
Bouaricha, A. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.; Schnabel, R.B. [Colorado Univ., Boulder, CO (United States). Dept. of Computer Science
1996-12-31
This paper describes a modular software package for solving systems of nonlinear equations and nonlinear least squares problems, using a new class of methods called tensor methods. It is intended for small to medium-sized problems, say with up to 100 equations and unknowns, in cases where it is reasonable to calculate the Jacobian matrix or approximate it by finite differences at each iteration. The software allows the user to select between a tensor method and a standard method based upon a linear model. The tensor method models F({ital x}) by a quadratic model, where the second-order term is chosen so that the model is hardly more expensive to form, store, or solve than the standard linear model. Moreover, the software provides two different global strategies, a line search and a two- dimensional trust region approach. Test results indicate that, in general, tensor methods are significantly more efficient and robust than standard methods on small and medium-sized problems in iterations and function evaluations.
Tayebi, A.; Shekari, Y.; Heydari, M. H.
2017-07-01
Several physical phenomena such as transformation of pollutants, energy, particles and many others can be described by the well-known convection-diffusion equation which is a combination of the diffusion and advection equations. In this paper, this equation is generalized with the concept of variable-order fractional derivatives. The generalized equation is called variable-order time fractional advection-diffusion equation (V-OTFA-DE). An accurate and robust meshless method based on the moving least squares (MLS) approximation and the finite difference scheme is proposed for its numerical solution on two-dimensional (2-D) arbitrary domains. In the time domain, the finite difference technique with a θ-weighted scheme and in the space domain, the MLS approximation are employed to obtain appropriate semi-discrete solutions. Since the newly developed method is a meshless approach, it does not require any background mesh structure to obtain semi-discrete solutions of the problem under consideration, and the numerical solutions are constructed entirely based on a set of scattered nodes. The proposed method is validated in solving three different examples including two benchmark problems and an applied problem of pollutant distribution in the atmosphere. In all such cases, the obtained results show that the proposed method is very accurate and robust. Moreover, a remarkable property so-called positive scheme for the proposed method is observed in solving concentration transport phenomena.
Directory of Open Access Journals (Sweden)
Yahong Zheng
2014-05-01
Full Text Available Purpose: This paper focuses on a classic optimization problem in operations research, the flexible job shop scheduling problem (FJSP, to discuss the method to deal with uncertainty in a manufacturing system.Design/methodology/approach: In this paper, condition based maintenance (CBM, a kind of preventive maintenance, is suggested to reduce unavailability of machines. Different to the simultaneous scheduling algorithm (SSA used in the previous article (Neale & Cameron,1979, an inserting algorithm (IA is applied, in which firstly a pre-schedule is obtained through heuristic algorithm and then maintenance tasks are inserted into the pre-schedule scheme.Findings: It is encouraging that a new better solution for an instance in benchmark of FJSP is obtained in this research. Moreover, factually SSA used in literature for solving normal FJSPPM (FJSP with PM is not suitable for the dynamic FJSPPM. Through application in the benchmark of normal FJSPPM, it is found that although IA obtains inferior results compared to SSA used in literature, it performs much better in executing speed.Originality/value: Different to traditional scheduling of FJSP, uncertainty of machines is taken into account, which increases the complexity of the problem. An inserting algorithm (IA is proposed to solve the dynamic scheduling problem. It is stated that the quality of the final result depends much on the quality of the pre-schedule obtained during the procedure of solving a normal FJSP. In order to find the best solution of FJSP, a comparative study of three heuristics is carried out, the integrated GA, ACO and ABC. In the comparative study, we find that GA performs best in the three heuristic algorithms. Meanwhile, a new better solution for an instance in benchmark of FJSP is obtained in this research.
Buddala, Raviteja; Mahapatra, Siba Sankar
2017-11-01
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having `g' operations is performed on `g' operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem becomes a flexible flow shop problem (FFSP). FFSP which contains all the complexities involved in a simple flow shop and parallel machine scheduling problems is a well-known NP-hard (Non-deterministic polynomial time) problem. Owing to high computational complexity involved in solving these problems, it is not always possible to obtain an optimal solution in a reasonable computation time. To obtain near-optimal solutions in a reasonable computation time, a large variety of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is rather tricky and time consuming. To address this limitation, teaching-learning-based optimization (TLBO) and JAYA algorithm are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm-specific parameters. Although these algorithms seem to be elegant, they lose solution diversity after few iterations and get trapped at the local optima. To alleviate such drawback, a new local search procedure is proposed in this paper to improve the solution quality. Further, mutation strategy (inspired from genetic algorithm) is incorporated in the basic algorithm to maintain solution diversity in the population. Computational experiments have been conducted on standard benchmark problems to calculate makespan and computational time. It is found that the rate of convergence of TLBO is superior to JAYA. From the results, it is found that TLBO and JAYA outperform many algorithms reported in the literature and can be treated as efficient methods for solving the FFSP.
New method for solving inductive electric fields in the non-uniformly conducting ionosphere
Directory of Open Access Journals (Sweden)
H. Vanhamäki
2006-10-01
Full Text Available We present a new calculation method for solving inductive electric fields in the ionosphere. The time series of the potential part of the ionospheric electric field, together with the Hall and Pedersen conductances serves as the input to this method. The output is the time series of the induced rotational part of the ionospheric electric field. The calculation method works in the time-domain and can be used with non-uniform, time-dependent conductances. In addition, no particular symmetry requirements are imposed on the input potential electric field. The presented method makes use of special non-local vector basis functions called the Cartesian Elementary Current Systems (CECS. This vector basis offers a convenient way of representing curl-free and divergence-free parts of 2-dimensional vector fields and makes it possible to solve the induction problem using simple linear algebra. The new calculation method is validated by comparing it with previously published results for Alfvén wave reflection from a uniformly conducting ionosphere.
New method for solving inductive electric fields in the non-uniformly conducting ionosphere
Vanhamäki, H.; Amm, O.; Viljanen, A.
2006-10-01
We present a new calculation method for solving inductive electric fields in the ionosphere. The time series of the potential part of the ionospheric electric field, together with the Hall and Pedersen conductances serves as the input to this method. The output is the time series of the induced rotational part of the ionospheric electric field. The calculation method works in the time-domain and can be used with non-uniform, time-dependent conductances. In addition, no particular symmetry requirements are imposed on the input potential electric field. The presented method makes use of special non-local vector basis functions called the Cartesian Elementary Current Systems (CECS). This vector basis offers a convenient way of representing curl-free and divergence-free parts of 2-dimensional vector fields and makes it possible to solve the induction problem using simple linear algebra. The new calculation method is validated by comparing it with previously published results for Alfvén wave reflection from a uniformly conducting ionosphere.
Problem-based learning for technical students on the base TRIZ (theory of inventive problem solving
Directory of Open Access Journals (Sweden)
Babenko Oksana
2016-01-01
Full Text Available The basis of modern educational technology in teaching is problem-based learning through the use of educational technologies Powerful Thinking - Theory of Inventive Problem Solving (TRIZ, including a systematic approach to the complex organization of independent work of search and research character. Developed by systemic administration of the physical features workshops on the basis TRIZ in the cycle of the natural sciences with the implementation of all aspects of the educational activities - substantive, procedural and motivational. A new model of the physical design of the workshop and its form of organization, which is based on problem-based learning with the use of TRIZ Interactive form of organization of the workshop allows you to get high-quality substantive and personality of the students who have a significant role in the formation of professional competencies and affect the quality of produce practice-oriented specialists.
Zuhaida, A.
2018-04-01
Implementation of the experiment have the three aspects of the goal: 1) develop basic skills of experimenting; 2) develop problem-solving skills with a scientific approach; 3) improve understanding of the subject matter. On the implementation of the experiment, students have some weaknesses include: observing, identifying problems, managing information, analyzing, and evaluating. This weakness is included in the metacognition indicator.The objective of the research is to implementation of Basic Chemistry Experiment based on metacognition to increase problem-solving skills and build concept understanding for students of Science Education Department. The method of this research is a quasi- experimental method with pretest-posttest control group design. Problem-solving skills are measured through performance assessments using rubrics from problem solving reports, and results presentation. The conceptual mastery is measured through a description test. The result of the research: (1) improve the problem solving skills of the students with very high category; (2) increase the students’ concept understanding better than the conventional experiment with the result of N-gain in medium category, and (3) increase student's response positively for learning implementation. The contribution of this research is to extend the implementation of practical learning for some subjects, and to improve the students' competence in science.
Tohir, M.; Abidin, Z.; Dafik; Hobri
2018-04-01
Arithmetics is one of the topics in Mathematics, which deals with logic and detailed process upon generalizing formula. Creativity and flexibility are needed in generalizing formula of arithmetics series. This research aimed at analyzing students creative thinking skills in generalizing arithmetic series. The triangulation method and research-based learning was used in this research. The subjects were students of the Master Program of Mathematics Education in Faculty of Teacher Training and Education at Jember University. The data was collected by giving assignments to the students. The data collection was done by giving open problem-solving task and documentation study to the students to arrange generalization pattern based on the dependent function formula i and the function depend on i and j. Then, the students finished the next problem-solving task to construct arithmetic generalization patterns based on the function formula which depends on i and i + n and the sum formula of functions dependent on i and j of the arithmetic compiled. The data analysis techniques operative in this study was Miles and Huberman analysis model. Based on the result of data analysis on task 1, the levels of students creative thinking skill were classified as follows; 22,22% of the students categorized as “not creative” 38.89% of the students categorized as “less creative” category; 22.22% of the students categorized as “sufficiently creative” and 16.67% of the students categorized as “creative”. By contrast, the results of data analysis on task 2 found that the levels of students creative thinking skills were classified as follows; 22.22% of the students categorized as “sufficiently creative”, 44.44% of the students categorized as “creative” and 33.33% of the students categorized as “very creative”. This analysis result can set the basis for teaching references and actualizing a better teaching model in order to increase students creative thinking skills.
Solving the Bateman equations in CASMO5 using implicit ode numerical methods for stiff systems
International Nuclear Information System (INIS)
Hykes, J. M.; Ferrer, R. M.
2013-01-01
The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is 98 Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)
Uncertainty dimensions of information behaviour in a group based problem solving context
DEFF Research Database (Denmark)
Hyldegård, Jette
2009-01-01
This paper presents a study of uncertainty dimensions of information behaviour in a group based problem solving context. After a presentation of the cognitive uncertainty dimension underlying Kuhlthau's ISP-model, uncertainty factors associated with personality, the work task situation and social...... members' experiences of uncertainty differ from the individual information seeker in Kuhlthau's ISP-model, and how this experience may be related to personal, work task and social factors. A number of methods have been employed to collect data on each group member during the assignment process......: a demographic survey, a personality test, 3 process surveys, 3 diaries and 3 interviews. It was found that group members' experiences of uncertainty did not correspond with the ISP-model in that other factors beyond the mere information searching process seemed to intermingle with the complex process...
The ADO-nodal method for solving two-dimensional discrete ordinates transport problems
International Nuclear Information System (INIS)
Barichello, L.B.; Picoloto, C.B.; Cunha, R.D. da
2017-01-01
Highlights: • Two-dimensional discrete ordinates neutron transport. • Analytical Discrete Ordinates (ADO) nodal method. • Heterogeneous media fixed source problems. • Local solutions. - Abstract: In this work, recent results on the solution of fixed-source two-dimensional transport problems, in Cartesian geometry, are reported. Homogeneous and heterogeneous media problems are considered in order to incorporate the idea of arbitrary number of domain division into regions (nodes) when applying the ADO method, which is a method of analytical features, to those problems. The ADO-nodal formulation is developed, for each node, following previous work devoted to heterogeneous media problem. Here, however, the numerical procedure is extended to higher number of domain divisions. Such extension leads, in some cases, to the use of an iterative method for solving the general linear system which defines the arbitrary constants of the general solution. In addition to solve alternative heterogeneous media configurations than reported in previous works, the present approach allows comparisons with results provided by other metodologies generated with refined meshes. Numerical results indicate the ADO solution may achieve a prescribed accuracy using coarser meshes than other schemes.
Applying the response matrix method for solving coupled neutron diffusion and transport problems
International Nuclear Information System (INIS)
Sibiya, G.S.
1980-01-01
The numerical determination of the flux and power distribution in the design of large power reactors is quite a time-consuming procedure if the space under consideration is to be subdivided into very fine weshes. Many computing methods applied in reactor physics (such as the finite-difference method) require considerable computing time. In this thesis it is shown that the response matrix method can be successfully used as an alternative approach to solving the two-dimension diffusion equation. Furthermore it is shown that sufficient accuracy of the method is achieved by assuming a linear space dependence of the neutron currents on the boundaries of the geometries defined for the given space. (orig.) [de
A multiple-scale power series method for solving nonlinear ordinary differential equations
Directory of Open Access Journals (Sweden)
Chein-Shan Liu
2016-02-01
Full Text Available The power series solution is a cheap and effective method to solve nonlinear problems, like the Duffing-van der Pol oscillator, the Volterra population model and the nonlinear boundary value problems. A novel power series method by considering the multiple scales $R_k$ in the power term $(t/R_k^k$ is developed, which are derived explicitly to reduce the ill-conditioned behavior in the data interpolation. In the method a huge value times a tiny value is avoided, such that we can decrease the numerical instability and which is the main reason to cause the failure of the conventional power series method. The multiple scales derived from an integral can be used in the power series expansion, which provide very accurate numerical solutions of the problems considered in this paper.
A method for solving the KDV equation and some numerical experiments
International Nuclear Information System (INIS)
Chang Jinjiang.
1993-01-01
In this paper, by means of difference method for discretization of space partial derivatives of KDV equation, an initial value problem in ordinary differential equations of large dimensions is produced. By using this ordinary differential equations the existence and the uniqueness of the solution of the KDV equation and the conservation of scheme are proved. This ordinary differential equation can be solved by using implicit Runge-Kutta methods, so a new method for finding the numerical solution of the KDV equation is presented. Numerical experiments not only describe in detail the procedure of two solitons collision, soliton reflex and soliton produce, but also show that this method is very effective. (author). 7 refs, 3 figs
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...
Setiawan, E. P.; Rosadi, D.
2017-01-01
Portfolio selection problems conventionally means ‘minimizing the risk, given the certain level of returns’ from some financial assets. This problem is frequently solved with quadratic or linear programming methods, depending on the risk measure that used in the objective function. However, the solutions obtained by these method are in real numbers, which may give some problem in real application because each asset usually has its minimum transaction lots. In the classical approach considering minimum transaction lots were developed based on linear Mean Absolute Deviation (MAD), variance (like Markowitz’s model), and semi-variance as risk measure. In this paper we investigated the portfolio selection methods with minimum transaction lots with conditional value at risk (CVaR) as risk measure. The mean-CVaR methodology only involves the part of the tail of the distribution that contributed to high losses. This approach looks better when we work with non-symmetric return probability distribution. Solution of this method can be found with Genetic Algorithm (GA) methods. We provide real examples using stocks from Indonesia stocks market.
Directory of Open Access Journals (Sweden)
Sahbi Marrouchi
2018-02-01
Full Text Available Solving the Unit Commitment problem (UCP optimizes the combination of production units operations and determines the appropriate operational scheduling of each production units to satisfy the expected consumption which varies from one day to one month. Besides, each production unit is conducted to constraints that render this problem complex, combinatorial and nonlinear. In this paper, we proposed a new strategy based on the combination three optimization methods: Tabu search, Particle swarm optimization and Lagrangian relaxation methods in order to develop a proper unit commitment scheduling of the production units while reducing the production cost during a definite period. The proposed strategy has been implemented on a the IEEE 9 bus test system containing 3 production unit and the results were promising compared to strategies based on meta-heuristic and deterministic methods.
Multi-level methods for solving multigroup transport eigenvalue problems in 1D slab geometry
International Nuclear Information System (INIS)
Anistratov, D. Y.; Gol'din, V. Y.
2009-01-01
A methodology for solving eigenvalue problems for the multigroup neutron transport equation in 1D slab geometry is presented. In this paper we formulate and compare different variants of nonlinear multi-level iteration methods. They are defined by means of multigroup and effective one-group low-order quasi diffusion (LOQD) equations. We analyze the effects of utilization of the effective one-group LOQD problem for estimating the eigenvalue. We present numerical results to demonstrate the performance of the iteration algorithms in different types of reactor-physics problems. (authors)
Azis, Moh. Ivan; Kasbawati; Haddade, Amiruddin; Astuti Thamrin, Sri
2018-03-01
A boundary element method (BEM) is obtained for solving a boundary value problem of homogeneous anisotropic media governed by diffusion-convection equation. The application of the BEM is shown for two particular pollutant transport problems of Tello river and Unhas lake in Makassar Indonesia. For the two particular problems a variety of the coefficients of diffusion and the velocity components are taken. The results show that the solutions vary as the parameters change. And this suggests that one has to be careful in measuring or determining the values of the parameters.
A new method for solving the two-center problem with relativistic potentials
International Nuclear Information System (INIS)
Gareev, F.A.; Gizzatkulov, M.Ch.
1977-01-01
A method has been proposed for the solution of the two-center problem with realistic potentials. It consists of two steps: first, a separable approximation to the single particle potentials is made and then the two-center problem with these separable potentials is solved exactly. The only approximations are introduced at the first stage in a well controllable way. As an example, we have calculated the single-particle energies and wave functions in the field of two 16 O like the Woods-Saxon potentials as functions of their distance R
Farihah, Umi
2018-04-01
The purpose of this study was to analyze students’ thinking preferences in solving mathematics problems using paper pencil comparing to geogebra based on their learning styles. This research employed a qualitative descriptive study. The subjects of this research was six of eighth grade students of Madrasah Tsanawiyah Negeri 2 Trenggalek, East Java Indonesia academic year 2015-2016 with their difference learning styles; two visual students, two auditory students, and two kinesthetic students.. During the interview, the students presented the Paper and Pencil-based Task (PBTs) and the Geogebra-based Task (GBTs). By investigating students’ solution methods and the representation in solving the problems, the researcher compared their visual and non-visual thinking preferences in solving mathematics problems while they were using Geogebra and without Geogebra. Based on the result of research analysis, it was shown that the comparison between students’ PBTs and GBTs solution either visual, auditory, or kinesthetic represented how Geogebra can influence their solution method. By using Geogebra, they prefer using visual method while presenting GBTs to using non-visual method.
Directory of Open Access Journals (Sweden)
P. G. Klyucharev
2017-01-01
Full Text Available A number of previous author’s papers proposed methods for constructing various cryptographic algorithms, including block ciphers and cryptographic hash functions, based on generalized cellular automata. This one is aimed at studying a possibility to use the algebraic cryptanalysis methods related to the construction of Gröbner bases for the generalized cellular automata to be applied in cryptography, i.e. this paper studies the possibility for using algebraic cryptanalysis methods to solve the problems of inversion of a generalized cellular automaton and recovering the key of such an automaton.If the cryptographic algorithm is represented as a system of polynomial equations over a certain finite field, then its breach is reduced to solving this system with respect to the key. Although the problem of solving a system of polynomial equations in a finite field is NP-difficult in the general case, the solution of a particular system can have low computational cost.Cryptanalysis based on the construction of a system of polynomial equations that links plain text, cipher-text and key, and its solution by algebraic methods, is usually called algebraic cryptanalysis. Among the main methods to solve systems of polynomial equations are those to construct Gröbner bases.Cryptanalysis of ciphers and hash functions based on generalized cellular automata can be reduced to various problems. We will consider two such problems: the problem of inversion of a generalized cellular automaton, which, in case we know the values of the cells after k iterations, enables us to find the initial values. And the task of recovering the key, which is to find the initial values of the remaining cells, using the cell values after k steps and the initial values of a part of the cells.A computational experiment was carried out to solve the two problems above stated in order to determine the maximum size of a generalized cellular automaton for which the solution of these
A new analytical method to solve the heat equation for a multi-dimensional composite slab
International Nuclear Information System (INIS)
Lu, X; Tervola, P; Viljanen, M
2005-01-01
A novel analytical approach has been developed for heat conduction in a multi-dimensional composite slab subject to time-dependent boundary changes of the first kind. Boundary temperatures are represented as Fourier series. Taking advantage of the periodic properties of boundary changes, the analytical solution is obtained and expressed explicitly. Nearly all the published works necessitate searching for associated eigenvalues in solving such a problem even for a one-dimensional composite slab. In this paper, the proposed method involves no iterative computation such as numerically searching for eigenvalues and no residue evaluation. The adopted method is simple which represents an extension of the novel analytical approach derived for the one-dimensional composite slab. Moreover, the method of 'separation of variables' employed in this paper is new. The mathematical formula for solutions is concise and straightforward. The physical parameters are clearly shown in the formula. Further comparison with numerical calculations is presented
Directory of Open Access Journals (Sweden)
MOHAMED KEZZAR
2015-08-01
Full Text Available In this research, an efficient technique of computation considered as a modified decomposition method was proposed and then successfully applied for solving the nonlinear problem of the two dimensional flow of an incompressible viscous fluid between nonparallel plane walls. In fact this method gives the nonlinear term Nu and the solution of the studied problem as a power series. The proposed iterative procedure gives on the one hand a computationally efficient formulation with an acceleration of convergence rate and on the other hand finds the solution without any discretization, linearization or restrictive assumptions. The comparison of our results with those of numerical treatment and other earlier works shows clearly the higher accuracy and efficiency of the used Modified Decomposition Method.
A new three-stage method for solving unit commitment problem
Energy Technology Data Exchange (ETDEWEB)
Khanmohammadi, S.; Amiri, M.; Haque, M. Tarafdar [Faculty of Electrical and Computer Engineering, University of Tabriz, P.O. Box 51665-343, Tabriz (Iran)
2010-07-15
This paper presents a new Three-Stage (THS) approach for solving Unit Commitment (UC) problem. The proposed method has a simple procedure to get at favorite solutions in a feasible duration of time by producing a primal schedule of status of units at the first step. In the second step the operating units take hourly values by doing Economic Dispatch (ED) on them via a hybrid serial algorithm of Artificial Intelligence (AI) including Particle Swarm Optimization (PSO) and Nelder-Mead (NM) algorithms. In spite of the acceptable solutions obtained by these two stages, the presented method takes another step called the solution modification process (SMP) to reach a more suitable solution. The simulation results over some standard cases of UC problem confirm that this method produces robust solutions and generally gets appropriate near-optimal solutions. (author)
Problem-Solving Methods for the Prospective Development of Urban Power Distribution Network
Directory of Open Access Journals (Sweden)
A. P. Karpenko
2014-01-01
Full Text Available This article succeeds the former A. P. K nko’ and A. I. Kuzmina’ ubl t on titled "A mathematical model of urban distribution electro-network considering its future development" (electronic scientific and technical magazine "Science and education" No. 5, 2014.The article offers a model of urban power distribution network as a set of transformer and distribution substations and cable lines. All elements of the network and new consumers are determined owing to vectors of parameters consistent with them.A problem of the urban power distribution network design, taking into account a prospective development of the city, is presented as a problem of discrete programming. It is in deciding on the optimal option to connect new consumers to the power supply network, on the number and sites to build new substations, and on the option to include them in the power supply network.Two methods, namely a reduction method for a set the nested tasks of global minimization and a decomposition method are offered to solve the problem.In reduction method the problem of prospective development of power supply network breaks into three subtasks of smaller dimension: a subtask to define the number and sites of new transformer and distribution substations, a subtask to define the option to connect new consumers to the power supply network, and a subtask to include new substations in the power supply network. The vector of the varied parameters is broken into three subvectors consistent with the subtasks. Each subtask is solved using an area of admissible vector values of the varied parameters at the fixed components of the subvectors obtained when solving the higher subtasks.In decomposition method the task is presented as a set of three, similar to reduction method, reductions of subtasks and a problem of coordination. The problem of coordination specifies a sequence of the subtasks solution, defines the moment of calculation termination. Coordination is realized by
Directory of Open Access Journals (Sweden)
yahya safari
2017-06-01
Full Text Available Background and objective: Studies have indicated that metacognitive strategies control and direct cognitive strategies. Thus, application of metacognitive and cognitive strategies together is essential for successful learning to happen. The present study was conducted to examine the effect of metacognitive-oriented instruction on development of problem solving skills in students of Kermanshah University of Medical Sciences. Materials and Methods: This study was a quasi-experimental research with pretest/posttest and control group design. The study sample included the students of Kermanshah University of Medical Sciences (n=4283 in the academic year of 2013-2014. A total number of 40 students were selected through convenient sampling method as the study sample. The samples were randomly placed in experimental and control groups. For the experimental group, problem solving skills were taught based on metacognitive strategies in 8 sessions, each session for 1 and half hours. For the control group, however, problem solving skills were taught through conventional teaching method. The instrument for data collection was Heppner’s problem solving inventory (1988 whose validity and reliability were confirmed previously. Data were analyzed by descriptive statistics, mean and standard deviation, and the hypotheses were tested through t-test. Results: The results of the posttest showed that the total mean of scores for problem solving skills in the experimental group (99.75 was higher than that of the control group (26.800 (p<0.0001. This difference was significant in the case of confidence, approach/avoidance and personal control components (p<0.0001. Moreover, the mean of students’ scores was not significant in terms of gender and major. Conclusion: Given the positive effect of metacognitive strategies on the students’ performance and the necessity of teaching metacognition for the sake of academic achievement, these strategies are recommended to be
Becerra-Labra, Carlos; Gras-Martí, Albert; Martínez Torregrosa, Joaquín
2012-05-01
A model of teaching/learning is proposed based on a 'problem-based structure' of the contents of the course, in combination with a training in paper and pencil problem solving that emphasizes discussion and quantitative analysis, rather than formulae plug-in. The aim is to reverse the high failure and attrition rate among engineering undergraduates taking physics. A number of tests and questionnaires were administered to a group of students following a traditional lecture-based instruction, as well as to another group that was following an instruction scheme based on the proposed approach and the teaching materials developed ad hoc. The results show that students following the new method can develop scientific reasoning habits in problem-solving skills, and show gains in conceptual learning, attitudes and interests, and that the effects of this approach on learning are noticeable several months after the course is over.
Effectiveness of a problem-solving based intervention to prolong the working life of ageing workers
Koolhaas, W.; Groothoff, J.W.; de Boer, M.R.; van der Klink, J.J.L.; Brouwer, S.
2015-01-01
Background An ageing workforce combined with increasing health problems in ageing workers implies the importance of evidence-based interventions to enhance sustainable employability. The aim of this study is to evaluate the effectiveness of the ‘Staying healthy at work’ problem-solving based
Cheng, Kai Wen
2011-01-01
Background: Facing highly competitive and changing environment, cultivating citizens with problem-solving attitudes is one critical vision of education. In brief, the importance of education is to cultivate students with practical abilities. Realizing the advantages of web-based cooperative learning (web-based CL) and creative problem solving…
Students' Mathematics Word Problem-Solving Achievement in a Computer-Based Story
Gunbas, N.
2015-01-01
The purpose of this study was to investigate the effect of a computer-based story, which was designed in anchored instruction framework, on sixth-grade students' mathematics word problem-solving achievement. Problems were embedded in a story presented on a computer as computer story, and then compared with the paper-based version of the same story…
Effectiveness of a problem-solving based intervention to prolong the working life of ageing workers
Koolhaas, Wendy; Groothoff, Johan W.; de Boer, Michiel R.; van der Klink, Jac J. L.; Brouwer, Sandra
2015-01-01
Background: An ageing workforce combined with increasing health problems in ageing workers implies the importance of evidence-based interventions to enhance sustainable employability. The aim of this study is to evaluate the effectiveness of the 'Staying healthy at work' problem-solving based
Friedman, Robert S.; Deek, Fadi P.
2002-01-01
Discusses how the design and implementation of problem-solving tools used in programming instruction are complementary with both the theories of problem-based learning (PBL), including constructivism, and the practices of distributed education environments. Examines how combining PBL, Web-based distributed education, and a problem-solving…
Eshkuvatov, Z K; Zulkarnain, F S; Nik Long, N M A; Muminov, Z
2016-01-01
Modified homotopy perturbation method (HPM) was used to solve the hypersingular integral equations (HSIEs) of the first kind on the interval [-1,1] with the assumption that the kernel of the hypersingular integral is constant on the diagonal of the domain. Existence of inverse of hypersingular integral operator leads to the convergence of HPM in certain cases. Modified HPM and its norm convergence are obtained in Hilbert space. Comparisons between modified HPM, standard HPM, Bernstein polynomials approach Mandal and Bhattacharya (Appl Math Comput 190:1707-1716, 2007), Chebyshev expansion method Mahiub et al. (Int J Pure Appl Math 69(3):265-274, 2011) and reproducing kernel Chen and Zhou (Appl Math Lett 24:636-641, 2011) are made by solving five examples. Theoretical and practical examples revealed that the modified HPM dominates the standard HPM and others. Finally, it is found that the modified HPM is exact, if the solution of the problem is a product of weights and polynomial functions. For rational solution the absolute error decreases very fast by increasing the number of collocation points.
Solving delay differential equations in S-ADAPT by method of steps.
Bauer, Robert J; Mo, Gary; Krzyzanski, Wojciech
2013-09-01
S-ADAPT is a version of the ADAPT program that contains additional simulation and optimization abilities such as parametric population analysis. S-ADAPT utilizes LSODA to solve ordinary differential equations (ODEs), an algorithm designed for large dimension non-stiff and stiff problems. However, S-ADAPT does not have a solver for delay differential equations (DDEs). Our objective was to implement in S-ADAPT a DDE solver using the methods of steps. The method of steps allows one to solve virtually any DDE system by transforming it to an ODE system. The solver was validated for scalar linear DDEs with one delay and bolus and infusion inputs for which explicit analytic solutions were derived. Solutions of nonlinear DDE problems coded in S-ADAPT were validated by comparing them with ones obtained by the MATLAB DDE solver dde23. The estimation of parameters was tested on the MATLB simulated population pharmacodynamics data. The comparison of S-ADAPT generated solutions for DDE problems with the explicit solutions as well as MATLAB produced solutions which agreed to at least 7 significant digits. The population parameter estimates from using importance sampling expectation-maximization in S-ADAPT agreed with ones used to generate the data. Published by Elsevier Ireland Ltd.
Sari, D. P.; Usodo, B.; Subanti, S.
2018-04-01
This research aims to describe metacognitive experience of mathematics education students with strong, average, and weak intrapersonal intelligence in open start problem solving. Type of this research was qualitative research. The research subject was mathematics education students in Muhammadiyah University of Surakarta in academic year 2017/2018. The selected students consisted of 6 students with details of two students in each intrapersonal intelligence category. The research instruments were questionnaire, open start problem solving task, and interview guidelines. Data validity used time triangulation. Data analyses were done through data collection, data reduction, data presentation, and drawing conclusion. Based on findings, subjects with strong intrapersonal intelligence had high self confidence that they were able to solve problem correctly, able to do planning steps and able to solve the problem appropriately. Subjects with average intrapersonal intelligence had high self-assessment that they were able to solve the problem, able to do planning steps appropriately but they had not maximized in carrying out the plan so that it resulted incorrectness answer. Subjects with weak intrapersonal intelligence had high self confidence in capability of solving math problem, lack of precision in taking plans so their task results incorrectness answer.
Angeli, Charoula; Valanides, Nicos
2013-01-01
The present study investigated the problem-solving performance of 101 university students and their interactions with a computer modeling tool in order to solve a complex problem. Based on their performance on the hidden figures test, students were assigned to three groups of field-dependent (FD), field-mixed (FM), and field-independent (FI)…
Directory of Open Access Journals (Sweden)
Syarifah Fadillah
2017-03-01
Full Text Available The problem in this research is to know how the process of developing mathematics physics instructional book based on inquiry approach and its supporting documents to improve students' mathematical problem-solving ability. The purpose of this research is to provide mathematical physics instruction based on inquiry approach and its supporting documents (semester learning activity plan, lesson plan and mathematical problem-solving test to improve students' mathematical problem-solving ability. The development of textbook refers to the ADDIE model, including analysis, design, development, implementation, and evaluation. The validation result from the expert team shows that the textbook and its supporting documents are valid. The test results of the mathematical problem-solving skills show that all test questions are valid and reliable. The result of the incorporation of the textbook in teaching and learning process revealed that students' mathematical problem-solving ability using mathematical physics instruction based on inquiry approach book was better than the students who use the regular book.
Solving the Vlasov equation in two spatial dimensions with the Schrödinger method
Kopp, Michael; Vattis, Kyriakos; Skordis, Constantinos
2017-12-01
We demonstrate that the Vlasov equation describing collisionless self-gravitating matter may be solved with the so-called Schrödinger method (ScM). With the ScM, one solves the Schrödinger-Poisson system of equations for a complex wave function in d dimensions, rather than the Vlasov equation for a 2 d -dimensional phase space density. The ScM also allows calculating the d -dimensional cumulants directly through quasilocal manipulations of the wave function, avoiding the complexity of 2 d -dimensional phase space. We perform for the first time a quantitative comparison of the ScM and a conventional Vlasov solver in d =2 dimensions. Our numerical tests were carried out using two types of cold cosmological initial conditions: the classic collapse of a sine wave and those of a Gaussian random field as commonly used in cosmological cold dark matter N-body simulations. We compare the first three cumulants, that is, the density, velocity and velocity dispersion, to those obtained by solving the Vlasov equation using the publicly available code ColDICE. We find excellent qualitative and quantitative agreement between these codes, demonstrating the feasibility and advantages of the ScM as an alternative to N-body simulations. We discuss, the emergence of effective vorticity in the ScM through the winding number around the points where the wave function vanishes. As an application we evaluate the background pressure induced by the non-linearity of large scale structure formation, thereby estimating the magnitude of cosmological backreaction. We find that it is negligibly small and has time dependence and magnitude compatible with expectations from the effective field theory of large scale structure.
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.
High-order Path Integral Monte Carlo methods for solving strongly correlated fermion problems
Chin, Siu A.
2015-03-01
In solving for the ground state of a strongly correlated many-fermion system, the conventional second-order Path Integral Monte Carlo method is plagued with the sign problem. This is due to the large number of anti-symmetric free fermion propagators that are needed to extract the square of the ground state wave function at large imaginary time. In this work, I show that optimized fourth-order Path Integral Monte Carlo methods, which uses no more than 5 free-fermion propagators, in conjunction with the use of the Hamiltonian energy estimator, can yield accurate ground state energies for quantum dots with up to 20 polarized electrons. The correlations are directly built-in and no explicit wave functions are needed. This work is supported by the Qatar National Research Fund NPRP GRANT #5-674-1-114.
PROBLEM-SOLVING METHODS OF PROJECT MANAGEMENT OF TECHNICAL DEVELOPMENT FOR AGRICULTURAL PRODUCERS
Directory of Open Access Journals (Sweden)
Александр Васильевич СИДОРЧУК
2015-05-01
Full Text Available There have been proposed projects of technical development for agricultural producers. The conclusions about system features research projects that underlie the problem-solving methods of project management, have been made. There have been proved these projects (systems that can be simulated with the help of the research and formalization of many events. These events are components of the seven main factors of the agricultural production. The conclusion about the using the research method of the probabilistic nature events in the field of the crops projects with the help of the statistical and imitational models, have been developed. There have been considered the relation between the forecasting of functional marks of the technological systems and the estimation of their cost. And there have been found the optimum correspondence between parameters of the technical supply and planned features of the crops projects.
Methods for solving reasoning problems in abstract argumentation – A survey
Charwat, Günther; Dvořák, Wolfgang; Gaggl, Sarah A.; Wallner, Johannes P.; Woltran, Stefan
2015-01-01
Within the last decade, abstract argumentation has emerged as a central field in Artificial Intelligence. Besides providing a core formalism for many advanced argumentation systems, abstract argumentation has also served to capture several non-monotonic logics and other AI related principles. Although the idea of abstract argumentation is appealingly simple, several reasoning problems in this formalism exhibit high computational complexity. This calls for advanced techniques when it comes to implementation issues, a challenge which has been recently faced from different angles. In this survey, we give an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features. Moreover, we highlight available state-of-the-art systems for abstract argumentation, which put these methods to practice. PMID:25737590
Directory of Open Access Journals (Sweden)
Keivan Borna
2015-12-01
Full Text Available Traveling salesman problem (TSP is a well-established NP-complete problem and many evolutionary techniques like particle swarm optimization (PSO are used to optimize existing solutions for that. PSO is a method inspired by the social behavior of birds. In PSO, each member will change its position in the search space, according to personal or social experience of the whole society. In this paper, we combine the principles of PSO and crossover operator of genetic algorithm to propose a heuristic algorithm for solving the TSP more efficiently. Finally, some experimental results on our algorithm are applied in some instances in TSPLIB to demonstrate the effectiveness of our methods which also show that our algorithm can achieve better results than other approaches.
Newton's method for solving a quadratic matrix equation with special coefficient matrices
International Nuclear Information System (INIS)
Seo, Sang-Hyup; Seo, Jong Hyun; Kim, Hyun-Min
2014-01-01
We consider the iterative method for solving a quadratic matrix equation with special coefficient matrices which arises in the quasi-birth-death problem. In this paper, we show that the elementwise minimal positive solvents to quadratic matrix equations can be obtained using Newton's method. We also prove that the convergence rate of the Newton iteration is quadratic if the Fréchet derivative at the elementwise minimal positive solvent is nonsingular. However, if the Fréchet derivative is singular, the convergence rate is at least linear. Numerical experiments of the convergence rate are given.(This is summarized a paper which is to appear in Honam Mathematical Journal.)
Wismans, Luc Johannes Josephus; van Berkum, Eric C.; Bliemer, Michiel C.J.; Viti, F.; Immers, B.; Tampere, C.
2011-01-01
Multi objective optimization of externalities of traffic solving a network design problem in which Dynamic Traffic Management measures are used, is time consuming while heuristics are needed and solving the lower level requires solving the dynamic user equilibrium problem. Use of response surface
da Silva, Anabela; Elias, Mady; Andraud, Christine; Lafait, Jacques
2003-12-01
Two methods for solving the radiative transfer equation are compared with the aim of computing the angular distribution of the light scattered by a heterogeneous scattering medium composed of a single flat layer or a multilayer. The first method [auxiliary function method (AFM)], recently developed, uses an auxiliary function and leads to an exact solution; the second [discrete-ordinate method (DOM)] is based on the channel concept and needs an angular discretization. The comparison is applied to two different media presenting two typical and extreme scattering behaviors: Rayleigh and Mie scattering with smooth or very anisotropic phase functions, respectively. A very good agreement between the predictions of the two methods is observed in both cases. The larger the number of channels used in the DOM, the better the agreement. The principal advantages and limitations of each method are also listed.
Saleem, M. Rehan; Ali, Ishtiaq; Qamar, Shamsul
2018-03-01
In this article, a reduced five-equation two-phase flow model is numerically investigated. The formulation of the model is based on the conservation and energy exchange laws. The model is non-conservative and the governing equations contain two equations for the mass conservation, one for the over all momentum and one for the total energy. The fifth equation is the energy equation for one of the two phases that includes a source term on the right hand side for incorporating energy exchange between the two fluids in the form of mechanical and thermodynamical works. A Runge-Kutta discontinuous Galerkin finite element method is applied to solve the model equations. The main attractive features of the proposed method include its formal higher order accuracy, its nonlinear stability, its ability to handle complicated geometries, and its ability to capture sharp discontinuities or strong gradients in the solutions without producing spurious oscillations. The proposed method is robust and well suited for large-scale time-dependent computational problems. Several case studies of two-phase flows are presented. For validation and comparison of the results, the same model equations are also solved by using a staggered central scheme. It was found that discontinuous Galerkin scheme produces better results as compared to the staggered central scheme.
An extended step characteristic method for solving the transport equation in general geometries
International Nuclear Information System (INIS)
DeHart, M.D.; Pevey, R.E.; Parish, T.A.
1994-01-01
A method for applying the discrete ordinates method to solve the Boltzmann transport equation on arbitrary two-dimensional meshes has been developed. The finite difference approach normally used to approximate spatial derivatives in extrapolating angular fluxes across a cell is replaced by direct solution of the characteristic form of the transport equation for each discrete direction. Thus, computational cells are not restricted to the geometrical shape of a mesh element characteristic of a given coordinate system. However, in terms of the treatment of energy and angular dependencies, this method resembles traditional discrete ordinates techniques. By using the method developed here, a general two-dimensional space can be approximated by an irregular mesh comprised of arbitrary polygons. Results for a number of test problems have been compared with solutions obtained from traditional methods, with good agreement. Comparisons include benchmarks against analytical results for problems with simple geometry, as well as numerical results obtained from traditional discrete ordinates methods by applying the ANISN and TWOTRAN-II computer programs
Modified multiple time scale method for solving strongly nonlinear damped forced vibration systems
Razzak, M. A.; Alam, M. Z.; Sharif, M. N.
2018-03-01
In this paper, modified multiple time scale (MTS) method is employed to solve strongly nonlinear forced vibration systems. The first-order approximation is only considered in order to avoid complexicity. The formulations and the determination of the solution procedure are very easy and straightforward. The classical multiple time scale (MS) and multiple scales Lindstedt-Poincare method (MSLP) do not give desire result for the strongly damped forced vibration systems with strong damping effects. The main aim of this paper is to remove these limitations. Two examples are considered to illustrate the effectiveness and convenience of the present procedure. The approximate external frequencies and the corresponding approximate solutions are determined by the present method. The results give good coincidence with corresponding numerical solution (considered to be exact) and also provide better result than other existing results. For weak nonlinearities with weak damping effect, the absolute relative error measures (first-order approximate external frequency) in this paper is only 0.07% when amplitude A = 1.5 , while the relative error gives MSLP method is surprisingly 28.81%. Furthermore, for strong nonlinearities with strong damping effect, the absolute relative error found in this article is only 0.02%, whereas the relative error obtained by MSLP method is 24.18%. Therefore, the present method is not only valid for weakly nonlinear damped forced systems, but also gives better result for strongly nonlinear systems with both small and strong damping effect.
Solving the Einstein constraint equations on multi-block triangulations using finite element methods
Energy Technology Data Exchange (ETDEWEB)
Korobkin, Oleg; Pazos, Enrique [Department of Physics and Astronomy, Louisiana State University, Baton Rouge, LA 70803 (United States); Aksoylu, Burak [Center for Computation and Technology, Louisiana State University, Baton Rouge, LA 70803 (United States); Holst, Michael [Department of Mathematics, University of California at San Diego 9500 Gilman Drive La Jolla, CA 92093-0112 (United States); Tiglio, Manuel [Department of Physics, University of Maryland, College Park, MD 20742 (United States)
2009-07-21
In order to generate initial data for nonlinear relativistic simulations, one needs to solve the Einstein constraints, which can be cast into a coupled set of nonlinear elliptic equations. Here we present an approach for solving these equations on three-dimensional multi-block domains using finite element methods. We illustrate our approach on a simple example of Brill wave initial data, with the constraints reducing to a single linear elliptic equation for the conformal factor psi. We use quadratic Lagrange elements on semi-structured simplicial meshes, obtained by triangulation of multi-block grids. In the case of uniform refinement the scheme is superconvergent at most mesh vertices, due to local symmetry of the finite element basis with respect to local spatial inversions. We show that in the superconvergent case subsequent unstructured mesh refinements do not improve the quality of our initial data. As proof of concept that this approach is feasible for generating multi-block initial data in three dimensions, after constructing the initial data we evolve them in time using a high-order finite-differencing multi-block approach and extract the gravitational waves from the numerical solution.
Solving the Einstein constraint equations on multi-block triangulations using finite element methods
International Nuclear Information System (INIS)
Korobkin, Oleg; Pazos, Enrique; Aksoylu, Burak; Holst, Michael; Tiglio, Manuel
2009-01-01
In order to generate initial data for nonlinear relativistic simulations, one needs to solve the Einstein constraints, which can be cast into a coupled set of nonlinear elliptic equations. Here we present an approach for solving these equations on three-dimensional multi-block domains using finite element methods. We illustrate our approach on a simple example of Brill wave initial data, with the constraints reducing to a single linear elliptic equation for the conformal factor ψ. We use quadratic Lagrange elements on semi-structured simplicial meshes, obtained by triangulation of multi-block grids. In the case of uniform refinement the scheme is superconvergent at most mesh vertices, due to local symmetry of the finite element basis with respect to local spatial inversions. We show that in the superconvergent case subsequent unstructured mesh refinements do not improve the quality of our initial data. As proof of concept that this approach is feasible for generating multi-block initial data in three dimensions, after constructing the initial data we evolve them in time using a high-order finite-differencing multi-block approach and extract the gravitational waves from the numerical solution.
Solving black box computation problems using expert knowledge theory and methods
International Nuclear Information System (INIS)
Booker, Jane M.; McNamara, Laura A.
2004-01-01
The challenge problems for the Epistemic Uncertainty Workshop at Sandia National Laboratories provide common ground for comparing different mathematical theories of uncertainty, referred to as General Information Theories (GITs). These problems also present the opportunity to discuss the use of expert knowledge as an important constituent of uncertainty quantification. More specifically, how do the principles and methods of eliciting and analyzing expert knowledge apply to these problems and similar ones encountered in complex technical problem solving and decision making? We will address this question, demonstrating how the elicitation issues and the knowledge that experts provide can be used to assess the uncertainty in outputs that emerge from a black box model or computational code represented by the challenge problems. In our experience, the rich collection of GITs provides an opportunity to capture the experts' knowledge and associated uncertainties consistent with their thinking, problem solving, and problem representation. The elicitation process is rightly treated as part of an overall analytical approach, and the information elicited is not simply a source of data. In this paper, we detail how the elicitation process itself impacts the analyst's ability to represent, aggregate, and propagate uncertainty, as well as how to interpret uncertainties in outputs. While this approach does not advocate a specific GIT, answers under uncertainty do result from the elicitation
A Method for Solving the Voltage and Torque Equations of the Split-Phase Induction Machines
Directory of Open Access Journals (Sweden)
G. A. Olarinoye
2013-06-01
Full Text Available Single phase induction machines have been the subject of many researches in recent times. The voltage and torque equations which describe the dynamic characteristics of these machines have been quoted in many papers, including the papers that present the simulation results of these model equations. The way and manner in which these equations are solved is not common in literature. This paper presents a detailed procedure of how these equations are to be solved with respect to the splitphase induction machine which is one of the different types of the single phase induction machines available in the market. In addition, these equations have been used to simulate the start-up response of the split phase induction motor on no-load. The free acceleration characteristics of the motor voltages, currents and electromagnetic torque have been plotted and discussed. The simulation results presented include the instantaneous torque-speed characteristics of the Split phase Induction machine. A block diagram of the method for the solution of the machine equations has also been presented.
Analysis and development of spatial hp-refinement methods for solving the neutron transport equation
International Nuclear Information System (INIS)
Fournier, D.
2011-01-01
The different neutronic parameters have to be calculated with a higher accuracy in order to design the 4. generation reactor cores. As memory storage and computation time are limited, adaptive methods are a solution to solve the neutron transport equation. The neutronic flux, solution of this equation, depends on the energy, angle and space. The different variables are successively discretized. The energy with a multigroup approach, considering the different quantities to be constant on each group, the angle by a collocation method called SN approximation. Once the energy and angle variable are discretized, a system of spatially-dependent hyperbolic equations has to be solved. Discontinuous finite elements are used to make possible the development of hp-refinement methods. Thus, the accuracy of the solution can be improved by spatial refinement (h-refinement), consisting into subdividing a cell into sub-cells, or by order refinement (p-refinement), by increasing the order of the polynomial basis. In this thesis, the properties of this methods are analyzed showing the importance of the regularity of the solution to choose the type of refinement. Thus, two error estimators are used to lead the refinement process. Whereas the first one requires high regularity hypothesis (analytical solution), the second one supposes only the minimal hypothesis required for the solution to exist. The comparison of both estimators is done on benchmarks where the analytic solution is known by the method of manufactured solutions. Thus, the behaviour of the solution as a regard of the regularity can be studied. It leads to a hp-refinement method using the two estimators. Then, a comparison is done with other existing methods on simplified but also realistic benchmarks coming from nuclear cores. These adaptive methods considerably reduces the computational cost and memory footprint. To further improve these two points, an approach with energy-dependent meshes is proposed. Actually, as the
International Nuclear Information System (INIS)
Sun Jun; Fang Wei; Wang Daojun; Xu Wenbo
2009-01-01
In this paper, a modified quantum-behaved particle swarm optimization (QPSO) method is proposed to solve the economic dispatch (ED) problem in power systems, whose objective is to simultaneously minimize the generation cost rate while satisfying various equality and inequality constraints. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability of the algorithm. Many nonlinear characteristics of the generator, such as ramp rate limits, prohibited operating zones, and nonsmooth cost functions are considered when the proposed method is used in practical generator operation. The feasibility of the QPSO-DM method is demonstrated by three different power systems. It is compared with the QPSO, the differential evolution (DE), the particle swarm optimization (PSO), and the genetic algorithm (GA) in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed QPSO-DM method is able to obtain higher quality solutions stably and efficiently in the ED problem than any other tested optimization algorithm.
Energy Technology Data Exchange (ETDEWEB)
Jun Sun; Wei Fang; Daojun Wang; Wenbo Xu [School of Information Technology, Jiangnan Univ., Wuxi, Jiangsu 214122 (China)
2009-12-15
In this paper, a modified quantum-behaved particle swarm optimization (QPSO) method is proposed to solve the economic dispatch (ED) problem in power systems, whose objective is to simultaneously minimize the generation cost rate while satisfying various equality and inequality constraints. The proposed method, denoted as QPSO-DM, combines the QPSO algorithm with differential mutation operation to enhance the global search ability of the algorithm. Many nonlinear characteristics of the generator, such as ramp rate limits, prohibited operating zones, and nonsmooth cost functions are considered when the proposed method is used in practical generator operation. The feasibility of the QPSO-DM method is demonstrated by three different power systems. It is compared with the QPSO, the differential evolution (DE), the particle swarm optimization (PSO), and the genetic algorithm (GA) in terms of the solution quality, robustness and convergence property. The simulation results show that the proposed QPSO-DM method is able to obtain higher quality solutions stably and efficiently in the ED problem than any other tested optimization algorithm. (author)
Asad, Munazza; Iqbal, Khadija; Sabir, Mohammad
2015-01-01
Problem based learning (PBL) is an instructional approach that utilizes problems or cases as a context for students to acquire problem solving skills. It promotes communication skills, active learning, and critical thinking skills. It encourages peer teaching and active participation in a group. It was a cross-sectional study conducted at Al Nafees Medical College, Isra University, Islamabad, in one month duration. This study was conducted on 193 students of both 1st and 2nd year MBBS. Each PBL consists of three sessions, spaced by 2-3 days. In the first session students were provided a PBL case developed by both basic and clinical science faculty. In Session 2 (group discussion), they share, integrate their knowledge with the group and Wrap up (third session), was concluded at the end. A questionnaire based survey was conducted to find out overall effectiveness of PBL sessions. Teaching through PBLs greatly improved the problem solving and critical reasoning skills with 60% students of first year and 71% of 2nd year agreeing that the acquisition of knowledge and its application in solving multiple choice questions (MCQs) was greatly improved by these sessions. They observed that their self-directed learning, intrinsic motivation and skills to relate basic concepts with clinical reasoning which involves higher order thinking have greatly enhanced. Students found PBLs as an effective strategy to promote teamwork and critical thinking skills. PBL is an effective method to improve critical thinking and problem solving skills among medical students.
Kauffman, Douglas F.; Ge, Xun; Xie, Kui; Chen, Ching-Huei
2008-01-01
This study explored Metacognition and how automated instructional support in the form of problem-solving and self-reflection prompts influenced students' capacity to solve complex problems in a Web-based learning environment. Specifically, we examined the independent and interactive effects of problem-solving prompts and reflection prompts on…
She, Hsiao-Ching; Cheng, Meng-Tzu; Li, Ta-Wei; Wang, Chia-Yu; Chiu, Hsin-Tien; Lee, Pei-Zon; Chou, Wen-Chi; Chuang, Ming-Hua
2012-01-01
This study investigates the effect of Web-based Chemistry Problem-Solving, with the attributes of Web-searching and problem-solving scaffolds, on undergraduate students' problem-solving task performance. In addition, the nature and extent of Web-searching strategies students used and its correlation with task performance and domain knowledge also…
Energy Technology Data Exchange (ETDEWEB)
Young, Steven; Montakhab, Mohammad; Nouri, Hassan
2011-07-15
Economic dispatch (ED) is one of the most important problems to be solved in power generation as fractional percentage fuel reductions represent significant cost savings. ED wishes to optimise the power generated by each generating unit in a system in order to find the minimum operating cost at a required load demand, whilst ensuring both equality and inequality constraints are met. For the process of optimisation, a model must be created for each generating unit. The particle swarm optimisation technique is an evolutionary computation technique with one of the most powerful methods for solving global optimisation problems. The aim of this paper is to add in a constriction factor to the particle swarm optimisation algorithm (CFBPSO). Results show that the algorithm is very good at solving the ED problem and that CFBPSO must be able to work in a practical environment and so a valve point effect with transmission losses should be included in future work.
Using spectral element method to solve variational inequalities with applications in finance
International Nuclear Information System (INIS)
Moradipour, M.; Yousefi, S.A.
2015-01-01
Under the Black–Scholes model, the value of an American option solves a time dependent variational inequality problem (VIP). In this paper, first we discretize the variational inequality of American option in temporal direction by applying the Rannacher time stepping and achieve a sequence of elliptic variational inequalities. Second we discretize the spatial domain of variational inequalities by using spectral element methods with high order Lagrangian polynomials introduced on Gauss–Legendre–Lobatto points. Also by computing integrals by the Gauss–Legendre–Lobatto quadrature rule we derive a sequence of the linear complementarity problems (LCPs) having a positive definite sparse coefficient matrix. To find the unique solutions of the LCPs, we use the projected successive over-relaxation (PSOR) algorithm. Furthermore we present some existence and uniqueness theorems for the variational inequalities and LCPs. Finally, theoretical results are verified on the relevant numerical examples.
International Nuclear Information System (INIS)
Chen, Wang Chih; Chen Jahau Lewis
2014-01-01
The work proposes a new design tool that integrates design-around concepts with the algorithm for inventive problem solving (Russian acronym: ARIZ). ARIZ includes a complete procedure for analyzing problems and related resource, resolving conflicts and generating solutions. The combination of ARIZ and design-around concepts and understanding identified principles that govern patent infringements can prevent patent infringements whenever designers innovate, greatly reducing the cost and time associated with the product design stage. The presented tool is developed from an engineering perspective rather than a legal perspective, and so can help designers easily to prevent patent infringements and succeed in innovating by designing around. An example is used to demonstrate the proposed method.
A Simulated Annealing method to solve a generalized maximal covering location problem
Directory of Open Access Journals (Sweden)
M. Saeed Jabalameli
2011-04-01
Full Text Available The maximal covering location problem (MCLP seeks to locate a predefined number of facilities in order to maximize the number of covered demand points. In a classical sense, MCLP has three main implicit assumptions: all or nothing coverage, individual coverage, and fixed coverage radius. By relaxing these assumptions, three classes of modelling formulations are extended: the gradual cover models, the cooperative cover models, and the variable radius models. In this paper, we develop a special form of MCLP which combines the characteristics of gradual cover models, cooperative cover models, and variable radius models. The proposed problem has many applications such as locating cell phone towers. The model is formulated as a mixed integer non-linear programming (MINLP. In addition, a simulated annealing algorithm is used to solve the resulted problem and the performance of the proposed method is evaluated with a set of randomly generated problems.
A restricted Steiner tree problem is solved by Geometric Method II
Lin, Dazhi; Zhang, Youlin; Lu, Xiaoxu
2013-03-01
The minimum Steiner tree problem has wide application background, such as transportation system, communication network, pipeline design and VISL, etc. It is unfortunately that the computational complexity of the problem is NP-hard. People are common to find some special problems to consider. In this paper, we first put forward a restricted Steiner tree problem, which the fixed vertices are in the same side of one line L and we find a vertex on L such the length of the tree is minimal. By the definition and the complexity of the Steiner tree problem, we know that the complexity of this problem is also Np-complete. In the part one, we have considered there are two fixed vertices to find the restricted Steiner tree problem. Naturally, we consider there are three fixed vertices to find the restricted Steiner tree problem. And we also use the geometric method to solve such the problem.
Desmal, Abdulla
2014-07-01
A numerical framework that incorporates recently developed iterative shrinkage thresholding (IST) algorithms within the Born iterative method (BIM) is proposed for solving the two-dimensional inverse electromagnetic scattering problem. IST algorithms minimize a cost function weighted between measurement-data misfit and a zeroth/first-norm penalty term and therefore promote "sharpness" in the solution. Consequently, when applied to domains with sharp variations, discontinuities, or sparse content, the proposed framework is more efficient and accurate than the "classical" BIM that minimizes a cost function with a second-norm penalty term. Indeed, numerical results demonstrate the superiority of the IST-BIM over the classical BIM when they are applied to sparse domains: Permittivity and conductivity profiles recovered using the IST-BIM are sharper and more accurate and converge faster. © 1963-2012 IEEE.
Samo, Damianus Dao; Darhim; Kartasasmita, Bana G.
2018-01-01
The purpose of this study is to show the differences in problem-solving ability between first-year University students who received culture-based contextual learning and conventional learning. This research is a quantitative research using quasi-experimental research design. Samples were the First-year students of mathematics education department;…
Engineering-Based Problem Solving in the Middle School: Design and Construction with Simple Machines
English, Lyn D.; Hudson, Peter; Dawes, Les
2013-01-01
Incorporating engineering concepts into middle school curriculum is seen as an effective way to improve students' problem-solving skills. A selection of findings is reported from a science, technology, engineering and mathematics (STEM)-based unit in which students in the second year (grade 8) of a three-year longitudinal study explored…
Wan Azlinda Wan Mohamed; Badrul Omar; Mohd Faroul Rafiq Romli
2010-01-01
Many training providers are working to improve their curricula to meet the demand of today’s industries. The Malaysian College Communities, one of the major providers for lifelong learning program, had introduced the Work-Based Learning (WBL) concept since 2007 to ensure that their graduates met these demands. One of the key skills required by industry is problem solving skill. The ability to solve a complex or an ill-structured work problem in the workplace is the kind of skill demanded at a...
International Nuclear Information System (INIS)
Mishra, Subhash C.; Roy, Hillol K.
2007-01-01
The lattice Boltzmann method (LBM) was used to solve the energy equation of a transient conduction-radiation heat transfer problem. The finite volume method (FVM) was used to compute the radiative information. To study the compatibility of the LBM for the energy equation and the FVM for the radiative transfer equation, transient conduction and radiation heat transfer problems in 1-D planar and 2-D rectangular geometries were considered. In order to establish the suitability of the LBM, the energy equations of the two problems were also solved using the FVM of the computational fluid dynamics. The FVM used in the radiative heat transfer was employed to compute the radiative information required for the solution of the energy equation using the LBM or the FVM (of the CFD). To study the compatibility and suitability of the LBM for the solution of energy equation and the FVM for the radiative information, results were analyzed for the effects of various parameters such as the scattering albedo, the conduction-radiation parameter and the boundary emissivity. The results of the LBM-FVM combination were found to be in excellent agreement with the FVM-FVM combination. The number of iterations and CPU times in both the combinations were found comparable
Directory of Open Access Journals (Sweden)
Yurii M. Streliaiev
2016-06-01
Full Text Available Three-dimensional quasistatic contact problem of two linearly elastic bodies' interaction with Coulomb friction taken into account is considered. The boundary conditions of the problem have been simplified by the modification of the Coulomb's law of friction. This modification is based on the introducing of a delay in normal contact tractions that bound tangent contact tractions in the Coulomb's law of friction expressions. At this statement the problem is reduced to a sequence of similar systems of nonlinear integral equations describing bodies' interaction at each step of loading. A method for an approximate solution of the integral equations system corresponded to each step of loading is applied. This method consists of system regularization, discretization of regularized system and iterative process application for solving the discretized system. A numerical solution of a contact problem of an elastic sphere with an elastic half-space interaction under increasing and subsequently decreasing normal compressive force has been obtained.
Energy Technology Data Exchange (ETDEWEB)
Angstmann, C.N.; Donnelly, I.C. [School of Mathematics and Statistics, UNSW Australia, Sydney NSW 2052 (Australia); Henry, B.I., E-mail: B.Henry@unsw.edu.au [School of Mathematics and Statistics, UNSW Australia, Sydney NSW 2052 (Australia); Jacobs, B.A. [School of Computer Science and Applied Mathematics, University of the Witwatersrand, Johannesburg, Private Bag 3, Wits 2050 (South Africa); DST–NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS) (South Africa); Langlands, T.A.M. [Department of Mathematics and Computing, University of Southern Queensland, Toowoomba QLD 4350 (Australia); Nichols, J.A. [School of Mathematics and Statistics, UNSW Australia, Sydney NSW 2052 (Australia)
2016-02-15
We have introduced a new explicit numerical method, based on a discrete stochastic process, for solving a class of fractional partial differential equations that model reaction subdiffusion. The scheme is derived from the master equations for the evolution of the probability density of a sum of discrete time random walks. We show that the diffusion limit of the master equations recovers the fractional partial differential equation of interest. This limiting procedure guarantees the consistency of the numerical scheme. The positivity of the solution and stability results are simply obtained, provided that the underlying process is well posed. We also show that the method can be applied to standard reaction–diffusion equations. This work highlights the broader applicability of using discrete stochastic processes to provide numerical schemes for partial differential equations, including fractional partial differential equations.
Energy Technology Data Exchange (ETDEWEB)
Calloo, A.; Vidal, J.F.; Le Tellier, R.; Rimpault, G., E-mail: ansar.calloo@cea.fr, E-mail: jean-francois.vidal@cea.fr, E-mail: romain.le-tellier@cea.fr, E-mail: gerald.rimpault@cea.fr [CEA, DEN, DER/SPRC/LEPh, Saint-Paul-lez-Durance (France)
2011-07-01
This paper deals with the solving of the multigroup integro-differential form of the transport equation for fine energy group structure. In that case, multigroup transfer cross sections display strongly peaked shape for light scatterers and the current Legendre polynomial expansion is not well-suited to represent them. Furthermore, even if considering an exact scattering cross sections representation, the scattering source in the discrete ordinates method (also known as the Sn method) being calculated by sampling the angular flux at given directions, may be wrongly computed due to lack of angular support for the angular flux. Hence, following the work of Gerts and Matthews, an angular finite volume solver has been developed for 2D Cartesian geometries. It integrates the multigroup transport equation over discrete volume elements obtained by meshing the unit sphere with a product grid over the polar and azimuthal coordinates and by considering the integrated flux per solid angle element. The convergence of this method has been compared to the S{sub n} method for a highly anisotropic benchmark. Besides, piecewise-average scattering cross sections have been produced for non-bound Hydrogen atoms using a free gas model for thermal neutrons. LWR lattice calculations comparing Legendre representations of the Hydrogen scattering multigroup cross section at various orders and piecewise-average cross sections for this same atom are carried out (while keeping a Legendre representation for all other isotopes). (author)
Use of the finite element displacement method to solve solid-fluid interaction vibration problems
International Nuclear Information System (INIS)
Brown, S.J.; Hsu, K.H.
1978-01-01
It is shown through comparison to experimental, theoretical, and other finite element formulations that the finite element displacement method can solve accurately and economically a certain class of solid-fluid eigenvalue problems. The problems considered are small displacements in the absence of viscous damping and are 2-D and 3-D in nature. In this study the advantages of the finite element method (in particular the displacement formulation) is apparent in that a large structure consisting of the cylinders, support flanges, fluid, and other experimental boundaries could be modeled to yield good correlation to experimental data. The ability to handle large problems with standard structural programs is the key advantage of the displacement fluid method. The greatest obstacle is the inability of the analyst to inhibit those rotational degrees of freedom that are unnecessary to his fluid-structure vibration problem. With judicious use of element formulation, boundary conditions and modeling, the displacement finite element method can be successfully used to predict solid-fluid response to vibration and seismic loading
International Nuclear Information System (INIS)
Calloo, A.; Vidal, J.F.; Le Tellier, R.; Rimpault, G.
2011-01-01
This paper deals with the solving of the multigroup integro-differential form of the transport equation for fine energy group structure. In that case, multigroup transfer cross sections display strongly peaked shape for light scatterers and the current Legendre polynomial expansion is not well-suited to represent them. Furthermore, even if considering an exact scattering cross sections representation, the scattering source in the discrete ordinates method (also known as the Sn method) being calculated by sampling the angular flux at given directions, may be wrongly computed due to lack of angular support for the angular flux. Hence, following the work of Gerts and Matthews, an angular finite volume solver has been developed for 2D Cartesian geometries. It integrates the multigroup transport equation over discrete volume elements obtained by meshing the unit sphere with a product grid over the polar and azimuthal coordinates and by considering the integrated flux per solid angle element. The convergence of this method has been compared to the S_n method for a highly anisotropic benchmark. Besides, piecewise-average scattering cross sections have been produced for non-bound Hydrogen atoms using a free gas model for thermal neutrons. LWR lattice calculations comparing Legendre representations of the Hydrogen scattering multigroup cross section at various orders and piecewise-average cross sections for this same atom are carried out (while keeping a Legendre representation for all other isotopes). (author)
Energy Technology Data Exchange (ETDEWEB)
Jin Chen
2009-12-07
Efficient and robust Variable Relaxation Solver, based on pseudo-transient continuation, is developed to solve nonlinear anisotropic thermal conduction arising from fusion plasma simulations. By adding first and/or second order artificial time derivatives to the system, this type of method advances the resulting time-dependent nonlinear PDEs to steady state, which is the solution to be sought. In this process, only the stiffness matrix itself is involved so that the numerical complexity and errors can be greatly reduced. In fact, this work is an extension of integrating efficient linear elliptic solvers for fusion simulation on Cray XIE. Two schemes are derived in this work, first and second order Variable Relaxations. Four factors are observed to be critical for efficiency and preservation of solution's symmetric structure arising from periodic boundary condition: refining meshes in different coordinate directions, initializing nonlinear process, varying time steps in both temporal and spatial directions, and accurately generating nonlinear stiffness matrix. First finer mesh scale should be taken in strong transport direction; Next the system is carefully initialized by the solution with linear conductivity; Third, time step and relaxation factor are vertex-based varied and optimized at each time step; Finally, the nonlinear stiffness matrix is updated by just scaling corresponding linear one with the vector generated from nonlinear thermal conductivity.
International Nuclear Information System (INIS)
Chen, Jin
2009-01-01
Efficient and robust Variable Relaxation Solver, based on pseudo-transient continuation, is developed to solve nonlinear anisotropic thermal conduction arising from fusion plasma simulations. By adding first and/or second order artificial time derivatives to the system, this type of method advances the resulting time-dependent nonlinear PDEs to steady state, which is the solution to be sought. In this process, only the stiffness matrix itself is involved so that the numerical complexity and errors can be greatly reduced. In fact, this work is an extension of integrating efficient linear elliptic solvers for fusion simulation on Cray XIE. Two schemes are derived in this work, first and second order Variable Relaxations. Four factors are observed to be critical for efficiency and preservation of solution's symmetric structure arising from periodic boundary condition: refining meshes in different coordinate directions, initializing nonlinear process, varying time steps in both temporal and spatial directions, and accurately generating nonlinear stiffness matrix. First finer mesh scale should be taken in strong transport direction; Next the system is carefully initialized by the solution with linear conductivity; Third, time step and relaxation factor are vertex-based varied and optimized at each time step; Finally, the nonlinear stiffness matrix is updated by just scaling corresponding linear one with the vector generated from nonlinear thermal conductivity.
Solving the scalability issue in quantum-based refinement: Q|R#1.
Zheng, Min; Moriarty, Nigel W; Xu, Yanting; Reimers, Jeffrey R; Afonine, Pavel V; Waller, Mark P
2017-12-01
Accurately refining biomacromolecules using a quantum-chemical method is challenging because the cost of a quantum-chemical calculation scales approximately as n m , where n is the number of atoms and m (≥3) is based on the quantum method of choice. This fundamental problem means that quantum-chemical calculations become intractable when the size of the system requires more computational resources than are available. In the development of the software package called Q|R, this issue is referred to as Q|R#1. A divide-and-conquer approach has been developed that fragments the atomic model into small manageable pieces in order to solve Q|R#1. Firstly, the atomic model of a crystal structure is analyzed to detect noncovalent interactions between residues, and the results of the analysis are represented as an interaction graph. Secondly, a graph-clustering algorithm is used to partition the interaction graph into a set of clusters in such a way as to minimize disruption to the noncovalent interaction network. Thirdly, the environment surrounding each individual cluster is analyzed and any residue that is interacting with a particular cluster is assigned to the buffer region of that particular cluster. A fragment is defined as a cluster plus its buffer region. The gradients for all atoms from each of the fragments are computed, and only the gradients from each cluster are combined to create the total gradients. A quantum-based refinement is carried out using the total gradients as chemical restraints. In order to validate this interaction graph-based fragmentation approach in Q|R, the entire atomic model of an amyloid cross-β spine crystal structure (PDB entry 2oNA) was refined.
A Variant of the Topkis-Veinott Method for Solving Inequality Constrained Optimization Problems
International Nuclear Information System (INIS)
Birge, J. R.; Qi, L.; Wei, Z.
2000-01-01
In this paper we give a variant of the Topkis-Veinott method for solving inequality constrained optimization problems. This method uses a linearly constrained positive semidefinite quadratic problem to generate a feasible descent direction at each iteration. Under mild assumptions, the algorithm is shown to be globally convergent in the sense that every accumulation point of the sequence generated by the algorithm is a Fritz-John point of the problem. We introduce a Fritz-John (FJ) function, an FJ1 strong second-order sufficiency condition (FJ1-SSOSC), and an FJ2 strong second-order sufficiency condition (FJ2-SSOSC), and then show, without any constraint qualification (CQ), that (i) if an FJ point z satisfies the FJ1-SSOSC, then there exists a neighborhood N(z) of z such that, for any FJ point y element of N(z) {z } , f 0 (y) ≠ f 0 (z) , where f 0 is the objective function of the problem; (ii) if an FJ point z satisfies the FJ2-SSOSC, then z is a strict local minimum of the problem. The result (i) implies that the entire iteration point sequence generated by the method converges to an FJ point. We also show that if the parameters are chosen large enough, a unit step length can be accepted by the proposed algorithm
A new numerical method to solve the dispersion relation in multispecies plasma
International Nuclear Information System (INIS)
Cereceda, C.; Puerta, J.
2000-01-01
In this paper a new accurate and fast method for solving the linear dispersion relation for multispecies plasma is introduced. The method uses a four poles fractional approximation for the Z dispersion function, transforming the dispersion relation into a polynomial form. Time and space growth rates are then calculated. Calculations for a single beam - plasma are carried out being in good agreement with several authors. This method is very effective to simplify the calculation of growth rates in multi-ion plasmas. For multispecies plasmas several new modes of propagation arise. For two ion beam - plasma system, two slow modes can propagate, both which are unstable. Two maxima in the growth rates corresponding to each of these modes can be excited. The instability of one of the slow modes is fed by the energy of the light ion beam and the other one is fed by heavy beam ions. Each one of these two maxima is increased when the concentration of the corresponding species increases. But even for a small concentration of the light beam, the growth rate of the mode fed by it is the largest one, because in the single ion beam-plasma system the lighter ion yields the largest growth rate. (orig.)
Different seeds to solve the equations of stochastic point kinetics using the Euler-Maruyama method
International Nuclear Information System (INIS)
Suescun D, D.; Oviedo T, M.
2017-09-01
In this paper, a numerical study of stochastic differential equations that describe the kinetics in a nuclear reactor is presented. These equations, known as the stochastic equations of punctual kinetics they model temporal variations in neutron population density and concentrations of deferred neutron precursors. Because these equations are probabilistic in nature (since random oscillations in the neutrons and population of precursors were considered to be approximately normally distributed, and these equations also possess strong coupling and stiffness properties) the proposed method for the numerical simulations is the Euler-Maruyama scheme that provides very good approximations for calculating the neutron population and concentrations of deferred neutron precursors. The method proposed for this work was computationally tested for different seeds, initial conditions, experimental data and forms of reactivity for a group of precursors and then for six groups of deferred neutron precursors at each time step with 5000 Brownian movements per seed. In a paper reported in the literature, the Euler-Maruyama method was proposed, but there are many doubts about the reported values, in addition to not reporting the seed used, so in this work is expected to rectify the reported values. After taking the average of the different seeds used to generate the pseudo-random numbers the results provided by the Euler-Maruyama scheme will be compared in mean and standard deviation with other methods reported in the literature and results of the deterministic model of the equations of the punctual kinetics. This comparison confirms in particular that the Euler-Maruyama scheme is an efficient method to solve the equations of stochastic point kinetics but different from the values found and reported by another author. The Euler-Maruyama method is simple and easy to implement, provides acceptable results for neutron population density and concentration of deferred neutron precursors and
A Systematic Approach for Solving the Great Circle Track Problems based on Vector Algebra
Directory of Open Access Journals (Sweden)
Chen Chih-Li
2016-04-01
Full Text Available A systematic approach, based on multiple products of the vector algebra (S-VA, is proposed to derive the spherical triangle formulae for solving the great circle track (GCT problems. Because the mathematical properties of the geometry and algebra are both embedded in the S-VA approach, derivations of the spherical triangle formulae become more understandable and more straightforward as compared with those approaches which use the complex linear combination of a vector basis. In addition, the S-VA approach can handle all given initial conditions for solving the GCT problems simpler, clearer and avoid redundant formulae existing in the conventional approaches. With the technique of transforming the Earth coordinates system of latitudes and longitudes into the Cartesian one and adopting the relative longitude concept, the concise governing equations of the S-VA approach can be easily and directly derived. Owing to the advantage of the S-VA approach, it makes the practical navigator quickly adjust to solve the GCT problems. Based on the S-VA approach, a program namely GCTPro_VA is developed for friendly use of the navigator. Several validation examples are provided to show the S-VA approach is simple and versatile to solve the GCT problems.
Directory of Open Access Journals (Sweden)
Mahmoud Paripour
2014-08-01
Full Text Available In this paper, the Bernstein polynomials are used to approximatethe solutions of linear integral equations with multiple time lags (IEMTL through expansion methods (collocation method, partition method, Galerkin method. The method is discussed in detail and illustrated by solving some numerical examples. Comparison between the exact and approximated results obtained from these methods is carried out
International Nuclear Information System (INIS)
Tang Jian; Peng Muzhang; Cao Dongxing
1989-01-01
A new numerical method-nodal green's function method is used for solving heat conduction function. A heat conduction problem in cylindrical geometry with axial conduction is solved in this paper. The Kirchhoff transformation is used to deal with the problem with temperature dependent conductivity. Therefor, the calculation for the function is simplified. On the basis of the formulas developed, the code named NGMEFC is programmed. A sample problem which has been calculated by the code COBRA-IV is chosen as checking. A good agreement between both codes is achieved. The calculation shows that the calculation efficiency of the nodel green's function method is much higher than that of finite difference method
Loji, K.
2012-01-01
Problem solving skills and abilities are critical in life and more specifically in the engineering field. Unfortunately, significant numbers of South African students who are accessing higher education lack problem solving skills and this results in poor academic performance jeopardizing their progress especially from first to second year. On the…
A simple method for solving the Bussian equation for electrical conduction in rocks
Directory of Open Access Journals (Sweden)
P. W. J. Glover
2010-09-01
Full Text Available One of the most general and effective models for calculating the complex electrical conductivity and relative dielectric permittivity of rocks saturated with pore fluids is that of Bussian. Unlike most models, it is non-linear and cannot be solved algebraically. Consequently, researchers use reiterating numerical routines to obtain a solution of the equation, and then only for the real part of the solution. Here we present a different approach to the solution that uses conformal mapping in the complex plane, and implements it within Maple^{TM}. The method is simple and elegant in that it requires, for example, only 3 lines of code in Maple^{TM} 11 and little programming experience. The approach has been shown to be as precise as using the classical reiterating bisection method for real data implemented in C++ on an ordinary desktop computer to within a probability over 1 in 10^{9}. However, the conformal mapping approach is 52 times as fast. We show once more that the Bussian equation breaks down for low fluid conductivities, but recommend it (with the modified Archie's law for use with rocks saturated with high salinity fluids when the matrix is conductive.
Roehl, Edwin A.; Conrads, Paul
2010-01-01
This is the second of two papers that describe how data mining can aid natural-resource managers with the difficult problem of controlling the interactions between hydrologic and man-made systems. Data mining is a new science that assists scientists in converting large databases into knowledge, and is uniquely able to leverage the large amounts of real-time, multivariate data now being collected for hydrologic systems. Part 1 gives a high-level overview of data mining, and describes several applications that have addressed major water resource issues in South Carolina. This Part 2 paper describes how various data mining methods are integrated to produce predictive models for controlling surface- and groundwater hydraulics and quality. The methods include: - signal processing to remove noise and decompose complex signals into simpler components; - time series clustering that optimally groups hundreds of signals into "classes" that behave similarly for data reduction and (or) divide-and-conquer problem solving; - classification which optimally matches new data to behavioral classes; - artificial neural networks which optimally fit multivariate data to create predictive models; - model response surface visualization that greatly aids in understanding data and physical processes; and, - decision support systems that integrate data, models, and graphics into a single package that is easy to use.
Directory of Open Access Journals (Sweden)
Jiacheng Xie
2017-01-01
Full Text Available In a fully mechanized coal-mining face, the positioning and attitude of the shearer and scraper conveyor are inaccurate. To overcome this problem, a joint positioning and attitude solving method that considers the effect of an uneven floor is proposed. In addition, the real-time connection and coupling relationship between the two devices is analyzed. Two types of sensors, namely, the tilt sensor and strapdown inertial navigation system (SINS, are used to measure the shearer body pitch angle and the scraper conveyor shape, respectively. To improve the accuracy, two pieces of information are fused using the adaptive information fusion algorithm. It is observed that, using a marking strategy, the shearer body pitch angle can be reversely mapped to the real-time shape of the scraper conveyor. Then, a virtual-reality (VR software that can visually simulate this entire operation process under different conditions is developed. Finally, experiments are conducted on a prototype experimental platform. The positioning error is found to be less than 0.38 times the middle trough length; moreover, no accumulated error is detected. This method can monitor the operation of the shearer and scraper conveyor in a highly dynamic and precise manner and provide strong technical support for safe and efficient operation of a fully mechanized coal-mining face.
Iterative methods for solving Ax=b, GMRES/FOM versus QMR/BiCG
Energy Technology Data Exchange (ETDEWEB)
Cullum, J. [IBM Research Division, Yorktown Heights, NY (United States)
1996-12-31
We study the convergence of GMRES/FOM and QMR/BiCG methods for solving nonsymmetric Ax=b. We prove that given the results of a BiCG computation on Ax=b, we can obtain a matrix B with the same eigenvalues as A and a vector c such that the residual norms generated by a FOM computation on Bx=c are identical to those generated by the BiCG computations. Using a unitary equivalence for each of these methods, we obtain test problems where we can easily vary certain spectral properties of the matrices. We use these test problems to study the effects of nonnormality on the convergence of GMRES and QMR, to study the effects of eigenvalue outliers on the convergence of QMR, and to compare the convergence of restarted GMRES, QMR, and BiCGSTAB across a family of normal and nonnormal problems. Our GMRES tests on nonnormal test matrices indicate that nonnormality can have unexpected effects upon the residual norm convergence, giving misleading indications of superior convergence over QMR when the error norms for GMRES are not significantly different from those for QMR. Our QMR tests indicate that the convergence of the QMR residual and error norms is influenced predominantly by small and large eigenvalue outliers and by the character, real, complex, or nearly real, of the outliers and the other eigenvalues. In our comparison tests QMR outperformed GMRES(10) and GMRES(20) on both the normal and nonnormal test matrices.
Martín, Andrés; Barrientos, Antonio; Del Cerro, Jaime
2018-03-22
This article presents a new method to solve the inverse kinematics problem of hyper-redundant and soft manipulators. From an engineering perspective, this kind of robots are underdetermined systems. Therefore, they exhibit an infinite number of solutions for the inverse kinematics problem, and to choose the best one can be a great challenge. A new algorithm based on the cyclic coordinate descent (CCD) and named as natural-CCD is proposed to solve this issue. It takes its name as a result of generating very harmonious robot movements and trajectories that also appear in nature, such as the golden spiral. In addition, it has been applied to perform continuous trajectories, to develop whole-body movements, to analyze motion planning in complex environments, and to study fault tolerance, even for both prismatic and rotational joints. The proposed algorithm is very simple, precise, and computationally efficient. It works for robots either in two or three spatial dimensions and handles a large amount of degrees-of-freedom. Because of this, it is aimed to break down barriers between discrete hyper-redundant and continuum soft robots.
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.
Chedjou, Jean Chamberlain; Kyamakya, Kyandoghere
2015-04-01
This paper develops and validates a comprehensive and universally applicable computational concept for solving nonlinear differential equations (NDEs) through a neurocomputing concept based on cellular neural networks (CNNs). High-precision, stability, convergence, and lowest-possible memory requirements are ensured by the CNN processor architecture. A significant challenge solved in this paper is that all these cited computing features are ensured in all system-states (regular or chaotic ones) and in all bifurcation conditions that may be experienced by NDEs.One particular quintessence of this paper is to develop and demonstrate a solver concept that shows and ensures that CNN processors (realized either in hardware or in software) are universal solvers of NDE models. The solving logic or algorithm of given NDEs (possible examples are: Duffing, Mathieu, Van der Pol, Jerk, Chua, Rössler, Lorenz, Burgers, and the transport equations) through a CNN processor system is provided by a set of templates that are computed by our comprehensive templates calculation technique that we call nonlinear adaptive optimization. This paper is therefore a significant contribution and represents a cutting-edge real-time computational engineering approach, especially while considering the various scientific and engineering applications of this ultrafast, energy-and-memory-efficient, and high-precise NDE solver concept. For illustration purposes, three NDE models are demonstratively solved, and related CNN templates are derived and used: the periodically excited Duffing equation, the Mathieu equation, and the transport equation.
Directory of Open Access Journals (Sweden)
Farshid Mirzaee
2014-06-01
Full Text Available In this paper, we present a numerical method for solving two-dimensional Fredholm–Volterra integral equations (F-VIE. The method reduces the solution of these integral equations to the solution of a linear system of algebraic equations. The existence and uniqueness of the solution and error analysis of proposed method are discussed. The method is computationally very simple and attractive. Finally, numerical examples illustrate the efficiency and accuracy of the method.
International Nuclear Information System (INIS)
Le Coq, G.; Boudsocq, G.; Raymond, P.
1983-03-01
The Control Variable Method is extended to multidimensional fluid flow transient computations. In this paper basic principles of the method are given. The method uses a fully implicit space discretization and is based on the decomposition of the momentum flux tensor into scalar, vectorial, and tensorial, terms. Finally some computations about viscous-driven flow and buoyancy-driven flow in cavity are presented
A gradient based algorithm to solve inverse plane bimodular problems of identification
Ran, Chunjiang; Yang, Haitian; Zhang, Guoqing
2018-02-01
This paper presents a gradient based algorithm to solve inverse plane bimodular problems of identifying constitutive parameters, including tensile/compressive moduli and tensile/compressive Poisson's ratios. For the forward bimodular problem, a FE tangent stiffness matrix is derived facilitating the implementation of gradient based algorithms, for the inverse bimodular problem of identification, a two-level sensitivity analysis based strategy is proposed. Numerical verification in term of accuracy and efficiency is provided, and the impacts of initial guess, number of measurement points, regional inhomogeneity, and noisy data on the identification are taken into accounts.
Development of syntax of intuition-based learning model in solving mathematics problems
Yeni Heryaningsih, Nok; Khusna, Hikmatul
2018-01-01
The aim of the research was to produce syntax of Intuition Based Learning (IBL) model in solving mathematics problem for improving mathematics students’ achievement that valid, practical and effective. The subject of the research were 2 classes in grade XI students of SMAN 2 Sragen, Central Java. The type of the research was a Research and Development (R&D). Development process adopted Plomp and Borg & Gall development model, they were preliminary investigation step, design step, realization step, evaluation and revision step. Development steps were as follow: (1) Collected the information and studied of theories in Preliminary Investigation step, studied about intuition, learning model development, students condition, and topic analysis, (2) Designed syntax that could bring up intuition in solving mathematics problem and then designed research instruments. They were several phases that could bring up intuition, Preparation phase, Incubation phase, Illumination phase and Verification phase, (3) Realized syntax of Intuition Based Learning model that has been designed to be the first draft, (4) Did validation of the first draft to the validator, (5) Tested the syntax of Intuition Based Learning model in the classrooms to know the effectiveness of the syntax, (6) Conducted Focus Group Discussion (FGD) to evaluate the result of syntax model testing in the classrooms, and then did the revision on syntax IBL model. The results of the research were produced syntax of IBL model in solving mathematics problems that valid, practical and effective. The syntax of IBL model in the classroom were, (1) Opening with apperception, motivations and build students’ positive perceptions, (2) Teacher explains the material generally, (3) Group discussion about the material, (4) Teacher gives students mathematics problems, (5) Doing exercises individually to solve mathematics problems with steps that could bring up students’ intuition: Preparations, Incubation, Illumination, and
Wachtel, Ruth E; Dexter, Franklin
2010-12-01
Residency programs accredited by the ACGME are required to teach core competencies, including systems-based practice (SBP). Projects are important for satisfying this competency, but the level of knowledge and problem-solving skills required presupposes a basic understanding of the field. The responsibilities of anesthesiologists include the coordination of patient flow in the surgical suite. Familiarity with this topic is crucial for many improvement projects. A course in operations research for surgical services was originally developed for hospital administration students. It satisfies 2 of the Institute of Medicine's core competencies for health professionals: evidence-based practice and work in interdisciplinary teams. The course lasts 3.5 days (eg, 2 weekends) and consists of 45 cognitive objectives taught using 7 published articles, 10 lectures, and 156 computer-assisted problem-solving exercises based on 17 case studies. We tested the hypothesis that the cognitive objectives of the curriculum provide the knowledge and problem-solving skills necessary to perform projects that satisfy the SBP competency. Standardized terminology was used to define each component of the SBP competency for the minimum level of knowledge needed. The 8 components of the competency were examined independently. Most cognitive objectives contributed to at least 4 of the 8 core components of the SBP competency. Each component of SBP is addressed at the minimum requirement level of exemplify by at least 6 objectives. There is at least 1 cognitive objective at the level of summarize for each SBP component. A curriculum in operating room management can provide the knowledge and problem-solving skills anesthesiologists need for participation in projects that satisfy the SBP competency.
An Efficient Higher-Order Quasilinearization Method for Solving Nonlinear BVPs
Directory of Open Access Journals (Sweden)
Eman S. Alaidarous
2013-01-01
Full Text Available In this research paper, we present higher-order quasilinearization methods for the boundary value problems as well as coupled boundary value problems. The construction of higher-order convergent methods depends on a decomposition method which is different from Adomain decomposition method (Motsa and Sibanda, 2013. The reported method is very general and can be extended to desired order of convergence for highly nonlinear differential equations and also computationally superior to proposed iterative method based on Adomain decomposition because our proposed iterative scheme avoids the calculations of Adomain polynomials and achieves the same computational order of convergence as authors have claimed in Motsa and Sibanda, 2013. In order to check the validity and computational performance, the constructed iterative schemes are also successfully applied to bifurcation problems to calculate the values of critical parameters. The numerical performance is also tested for one-dimension Bratu and Frank-Kamenetzkii equations.
Jitendra, Asha K.; Harwell, Michael R.; Dupuis, Danielle N.; Karl, Stacy R.; Lein, Amy E.; Simonson, Gregory; Slater, Susan C.
2015-01-01
This experimental study evaluated the effectiveness of a research-based intervention, schema-based instruction (SBI), on students' proportional problem solving. SBI emphasizes the underlying mathematical structure of problems, uses schematic diagrams to represent information in the problem text, provides explicit problem-solving and metacognitive…
International Nuclear Information System (INIS)
Vrankar, L.; Turk, G.; Runovc, F.; Kansa, E.J.
2006-01-01
Many heat-transfer problems involve a change of phase of material due to solidification or melting. Applications include: the safety studies of nuclear reactors (molten core concrete interaction), the drilling of high ice-content soil, the storage of thermal energy, etc. These problems are often called Stefan's or moving boundary value problems. Mathematically, the interface motion is expressed implicitly in an equation for the conservation of thermal energy at the interface (Stefan's conditions). This introduces a non-linear character to the system which treats each problem somewhat uniquely. The exact solution of phase change problems is limited exclusively to the cases in which e.g. the heat transfer regions are infinite or semi-infinite one dimensional-space. Therefore, solution is obtained either by approximate analytical solution or by numerical methods. Finite-difference methods and finite-element techniques have been used extensively for numerical solution of moving boundary problems. Recently, the numerical methods have focused on the idea of using a mesh-free methodology for the numerical solution of partial differential equations based on radial basis functions. In our case we will study solid-solid transformation. The numerical solutions will be compared with analytical solutions. Actually, in our work we will examine usefulness of radial basis functions (especially multiquadric-MQ) for one-dimensional Stefan's problems. The position of the moving boundary will be simulated by moving grid method. The resultant system of RBF-PDE will be solved by affine space decomposition. (author)
International Nuclear Information System (INIS)
Fournier, D.; Le Tellier, R.; Suteau, C.; Herbin, R.
2011-01-01
The solution of the time-independent neutron transport equation in a deterministic way invariably consists in the successive discretization of the three variables: energy, angle and space. In the SNATCH solver used in this study, the energy and the angle are respectively discretized with a multigroup approach and the discrete ordinate method. A set of spatial coupled transport equations is obtained and solved using the Discontinuous Galerkin Finite Element Method (DGFEM). Within this method, the spatial domain is decomposed into elements and the solution is approximated by a hierarchical polynomial basis in each one. This approach is time and memory consuming when the mesh becomes fine or the basis order high. To improve the computational time and the memory footprint, adaptive algorithms are proposed. These algorithms are based on an error estimation in each cell. If the error is important in a given region, the mesh has to be refined (h−refinement) or the polynomial basis order increased (p−refinement). This paper is related to the choice between the two types of refinement. Two ways to estimate the error are compared on different benchmarks. Analyzing the differences, a hp−refinement method is proposed and tested. (author)
Directory of Open Access Journals (Sweden)
Vasyl Chekurin
2017-01-01
Full Text Available The mathematical model for describing combined conductive-radiative heat transfer in a dielectric layer, which emits, absorbs, and scatters IR radiation both in its volume and on the boundary, has been considered. A nonlinear stationary boundary-value problem for coupled heat and radiation transfer equations for the layer, which exchanges by energy with external medium by convection and radiation, has been formulated. In the case of optically thick layer, when its thickness is much more of photon-free path, the problem becomes a singularly perturbed one. In the inverse case of optically thin layer, the problem is regularly perturbed, and it becomes a regular (unperturbed one, when the layer’s thickness is of order of several photon-free paths. An iterative method for solving of the unperturbed problem has been developed and its convergence has been tested numerically. With the use of the method, the temperature field and radiation fluxes have been studied. The model and method can be used for development of noncontact methods for temperature testing in dielectrics and for nondestructive determination of its radiation properties on the base of the data obtained by remote measuring of IR radiation emitted by the layer.
Student’s Critical Thinking in Solving Open-Ended Problems Based on Their Personality Type
Fitriana, L. D.; Fuad, Y.; Ekawati, R.
2018-01-01
Critical thinking plays an important role for students in solving open-ended problems. This research aims at describing student’s critical thinking in solving open-ended problems based on Keirsey’s personality types, namely rational, idealist, guardian, and artisan. Four students, with the higher rank in the mathematics’ test and representing each type of Keirsey personality, were selected as the research subjects. The data were collected from the geometry problem and interviews. The student’s critical thinking is described based on the FRISCO criteria. The result underlines that rational and idealist students fulfilled all FRISCO criteria, and but not for guardian and artisan students. Related to the inference criteria, guardian and artisan students could not make reasonable conclusions and connect the concepts. Related to the reason of criteria, rational student performed critical thinking by providing logical reason that supported his strategy to solve the problem. In contrast, the idealist student provided subjective reason. This results suggest that teachers should frequently train the students’ logical thinkingin every lesson and activity to develop student’s critical thinking and take the student’s personality character into account, especially for guardian and artisan students.
Haili, Hasnawati; Maknun, Johar; Siahaan, Parsaoran
2017-08-01
Physics is a lessons that related to students' daily experience. Therefore, before the students studying in class formally, actually they have already have a visualization and prior knowledge about natural phenomenon and could wide it themselves. The learning process in class should be aimed to detect, process, construct, and use students' mental model. So, students' mental model agree with and builds in the right concept. The previous study held in MAN 1 Muna informs that in learning process the teacher did not pay attention students' mental model. As a consequence, the learning process has not tried to build students' mental modelling ability (MMA). The purpose of this study is to describe the improvement of students' MMA as a effect of problem solving based learning model with multiple representations approach. This study is pre experimental design with one group pre post. It is conducted in XI IPA MAN 1 Muna 2016/2017. Data collection uses problem solving test concept the kinetic theory of gasses and interview to get students' MMA. The result of this study is clarification students' MMA which is categorized in 3 category; High Mental Modelling Ability (H-MMA) for 7Mental Modelling Ability (M-MMA) for 3Mental Modelling Ability (L-MMA) for 0 ≤ x ≤ 3 score. The result shows that problem solving based learning model with multiple representations approach can be an alternative to be applied in improving students' MMA.
Widhitama, Y. N.; Lukito, A.; Khabibah, S.
2018-01-01
The aim of this research is to develop problem solving based learning materials on fraction for training creativity of elementary school students. Curriculum 2006 states that mathematics should be studied by all learners starting from elementary level in order for them mastering thinking skills, one of them is creative thinking. To our current knowledge, there is no such a research topic being done. To promote this direction, we initiate by developing learning materials with problem solving approach. The developed materials include Lesson Plan, Student Activity Sheet, Mathematical Creativity Test, and Achievement Test. We implemented a slightly modified 4-D model by Thiagajan et al. (1974) consisting of Define, Design, Development, and Disseminate. Techniques of gathering data include observation, test, and questionnaire. We applied three good qualities for the resulted materials; that is, validity, practicality, and effectiveness. The results show that the four mentioned materials meet the corresponding criteria of good quality product.
An analog computer method for solving flux distribution problems in multi region nuclear reactors
Energy Technology Data Exchange (ETDEWEB)
Radanovic, L; Bingulac, S; Lazarevic, B; Matausek, M [Boris Kidric Institute of Nuclear Sciences Vinca, Beograd (Yugoslavia)
1963-04-15
The paper describes a method developed for determining criticality conditions and plotting flux distribution curves in multi region nuclear reactors on a standard analog computer. The method, which is based on the one-dimensional two group treatment, avoids iterative procedures normally used for boundary value problems and is practically insensitive to errors in initial conditions. The amount of analog equipment required is reduced to a minimum and is independent of the number of core regions and reflectors. (author)
SOLVING TRANSPORT LOGISTICS PROBLEMS IN A VIRTUAL ENTERPRISE THROUGH ARTIFICIAL INTELLIGENCE METHODS
PAVLENKO, Vitaliy; PAVLENKO, Tetiana; MOROZOVA, Olga; KUZNETSOVA, Anna; VOROPAI, Olena
2017-01-01
The paper offers a solution to the problem of material flow allocation within a virtual enterprise by using artificial intelligence methods. The research is based on the use of fuzzy relations when planning for optimal transportation modes to deliver components for manufactured products. The Fuzzy Logic Toolbox is used to determine the optimal route for transportation of components for manufactured products. The methods offered have been exemplified in the present research. The authors have b...
Yoo, Moon-Sook; Park, Hyung-Ran
2015-06-01
The purpose of this study was to explore the effects of case-based learning on communication skills, problem-solving ability, and learning motivation in sophomore nursing students. In this prospective, quasi-experimental study, we compared the pretest and post-test scores of an experimental group and a nonequivalent, nonsynchronized control group. Both groups were selected using convenience sampling, and consisted of students enrolled in a health communication course in the fall semesters of 2011 (control group) and 2012 (experimental group) at a nursing college in Suwon, South Korea. The two courses covered the same material, but in 2011 the course was lecture-based, while in 2012, lectures were replaced by case-based learning comprising five authentic cases of patient-nurse communication. At post-test, the case-based learning group showed significantly greater communication skills, problem-solving ability, and learning motivation than the lecture-based learning group. This finding suggests that case-based learning is an effective learning and teaching method. © 2014 Wiley Publishing Asia Pty Ltd.
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.
Fitting method of pseudo-polynomial for solving nonlinear parametric adjustment
Institute of Scientific and Technical Information of China (English)
陶华学; 宫秀军; 郭金运
2001-01-01
The optimal condition and its geometrical characters of the least-square adjustment were proposed. Then the relation between the transformed surface and least-squares was discussed. Based on the above, a non-iterative method, called the fitting method of pseudo-polynomial, was derived in detail. The final least-squares solution can be determined with sufficient accuracy in a single step and is not attained by moving the initial point in the view of iteration. The accuracy of the solution relys wholly on the frequency of Taylor's series. The example verifies the correctness and validness of the method.
GMES: A Python package for solving Maxwell’s equations using the FDTD method
Chun, Kyungwon; Kim, Huioon; Kim, Hyounggyu; Jung, Kil Su; Chung, Youngjoo
2013-04-01
This paper describes GMES, a free Python package for solving Maxwell’s equations using the finite-difference time-domain (FDTD) method. The design of GMES follows the object-oriented programming (OOP) approach and adopts a unique design strategy where the voxels in the computational domain are grouped and then updated according to its material type. This piecewise updating scheme ensures that GMES can adopt OOP without losing its simple structure and time-stepping speed. The users can easily add various material types, sources, and boundary conditions into their code using the Python programming language. The key design features, along with the supported material types, excitation sources, boundary conditions and parallel calculations employed in GMES are also described in detail. Catalog identifier: AEOK_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOK_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: GNU General Public License v3.0 No. of lines in distributed program, including test data, etc.: 17700 No. of bytes in distributed program, including test data, etc.: 89878 Distribution format: tar.gz Programming language: C++, Python. Computer: Any computer with a Unix-like system with a C++ compiler, and a Python interpreter; developed on 2.53 GHz Intel CoreTM i3. Operating system: Any Unix-like system; developed under Ubuntu 12.04 LTS 64 bit. Has the code been vectorized or parallelized?: Yes. Parallelized with MPI directives (optional). RAM: Problem dependent (a simulation with real valued electromagnetic field uses roughly 0.18 KB per Yee cell.) Classification: 10. External routines: SWIG [1], Cython [2], NumPy [3], SciPy [4], matplotlib [5], MPI for Python [6] Nature of problem: Classical electrodynamics Solution method: Finite-difference time-domain (FDTD) method Additional comments: This article describes version 0.9.5. The most recent version can be downloaded at the GMES
Facilitating case reuse during problem solving in algebra-based physics
Mateycik, Frances Ann
This research project investigates students' development of problem solving schemata while using strategies that facilitate the process of using solved examples to assist with a new problem (case reuse). Focus group learning interviews were used to explore students' perceptions and understanding of several problem solving strategies. Individual clinical interviews were conducted and quantitative examination data were collected to assess students' conceptual understanding, knowledge organization, and problem solving performance on a variety of problem tasks. The study began with a short one-time treatment of two independent, research-based strategies chosen to facilitate case reuse. Exploration of students' perceptions and use of the strategies lead investigators to select one of the two strategies to be implemented over a full semester of focus group interviews. The strategy chosen was structure mapping. Structure maps are defined as visual representations of quantities and their associations. They were created by experts to model the appropriate mental organization of knowledge elements for a given physical concept. Students were asked to use these maps as they were comfortable while problem solving. Data obtained from this phase of our study (Phase I) offered no evidence of improved problem solving schema. The 11 contact hour study was barely sufficient time for students to become comfortable using the maps. A set of simpler strategies were selected for their more explicit facilitation of analogical reasoning, and were used together during two more semester long focus group treatments (Phase II and Phase III of this study). These strategies included the use of a step-by-step process aimed at reducing cognitive load associated with mathematical procedure, direct reflection of principles involved in a given set of problems, and the direct comparison of problem pairs designed to be void of surface similarities (similar objects or object orientations) and sharing
A regularization method for solving the Poisson equation for mixed unbounded-periodic domains
DEFF Research Database (Denmark)
Spietz, Henrik Juul; Mølholm Hejlesen, Mads; Walther, Jens Honoré
2018-01-01
the regularized unbounded-periodic Green's functions can be implemented in an FFT-based Poisson solver to obtain a convergence rate corresponding to the regularization order of the Green's function. The high order is achieved without any additional computational cost from the conventional FFT-based Poisson solver...... and enables the calculation of the derivative of the solution to the same high order by direct spectral differentiation. We illustrate an application of the FFT-based Poisson solver by using it with a vortex particle mesh method for the approximation of incompressible flow for a problem with a single periodic...
Directory of Open Access Journals (Sweden)
Zhao-Qing Wang
2014-01-01
Full Text Available Embedding the irregular doubly connected domain into an annular regular region, the unknown functions can be approximated by the barycentric Lagrange interpolation in the regular region. A highly accurate regular domain collocation method is proposed for solving potential problems on the irregular doubly connected domain in polar coordinate system. The formulations of regular domain collocation method are constructed by using barycentric Lagrange interpolation collocation method on the regular domain in polar coordinate system. The boundary conditions are discretized by barycentric Lagrange interpolation within the regular domain. An additional method is used to impose the boundary conditions. The least square method can be used to solve the overconstrained equations. The function values of points in the irregular doubly connected domain can be calculated by barycentric Lagrange interpolation within the regular domain. Some numerical examples demonstrate the effectiveness and accuracy of the presented method.
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.
Students’ Relational Understanding in Quadrilateral Problem Solving Based on Adversity Quotient
Safitri, A. N.; Juniati, D.; Masriyah
2018-01-01
The type of research is qualitative approach which aims to describe how students’ relational understanding of solving mathematic problem that was seen from Adversity Quotient aspect. Research subjects were three 7th grade students of Junior High School. They were taken by category of Adversity Quotient (AQ) such quitter, camper, and climber. Data collected based on problem solving and interview. The research result showed that (1) at the stage of understanding the problem, the subjects were able to state and write down what is known and asked, and able to mention the concepts associated with the quadrilateral problem. (2) The three subjects devise a plan by linking concepts relating to quadrilateral problems. (3) The three subjects were able to solve the problem. (4) The three subjects were able to look back the answers. The three subjects were able to understand the problem, devise a plan, carry out the plan and look back. However, the quitter and camper subjects have not been able to give a reason for the steps they have taken.
Powell, Laurie Ehlhardt; Wild, Michelle R; Glang, Ann; Ibarra, Summer; Gau, Jeff M; Perez, Amanda; Albin, Richard W; O'Neil-Pirozzi, Therese M; Wade, Shari L; Keating, Tom; Saraceno, Carolyn; Slocumb, Jody
2017-10-24
Cognitive impairments following brain injury, including difficulty with problem solving, can pose significant barriers to successful community reintegration. Problem-solving strategy training is well-supported in the cognitive rehabilitation literature. However, limitations in insurance reimbursement have resulted in fewer services to train such skills to mastery and to support generalization of those skills into everyday environments. The purpose of this project was to develop and evaluate an integrated, web-based programme, ProSolv, which uses a small number of coaching sessions to support problem solving in everyday life following brain injury. We used participatory action research to guide the iterative development, usability testing, and within-subject pilot testing of the ProSolv programme. The finalized programme was then evaluated in a between-subjects group study and a non-experimental single case study. Results were mixed across studies. Participants demonstrated that it was feasible to learn and use the ProSolv programme for support in problem solving. They highly recommended the programme to others and singled out the importance of the coach. Limitations in app design were cited as a major reason for infrequent use of the app outside of coaching sessions. Results provide mixed evidence regarding the utility of web-based mobile apps, such as ProSolv to support problem solving following brain injury. Implications for Rehabilitation People with cognitive impairments following brain injury often struggle with problem solving in everyday contexts. Research supports problem solving skills training following brain injury. Assistive technology for cognition (smartphones, selected apps) offers a means of supporting problem solving for this population. This project demonstrated the feasibility of a web-based programme to address this need.
Developing an agent-based model on how different individuals solve complex problems
Directory of Open Access Journals (Sweden)
Ipek Bozkurt
2015-01-01
Full Text Available Purpose: Research that focuses on the emotional, mental, behavioral and cognitive capabilities of individuals has been abundant within disciplines such as psychology, sociology, and anthropology, among others. However, when facing complex problems, a new perspective to understand individuals is necessary. The main purpose of this paper is to develop an agent-based model and simulation to gain understanding on the decision-making and problem-solving abilities of individuals. Design/Methodology/approach: The micro-level analysis modeling and simulation paradigm Agent-Based Modeling Through the use of Agent-Based Modeling, insight is gained on how different individuals with different profiles deal with complex problems. Using previous literature from different bodies of knowledge, established theories and certain assumptions as input parameters, a model is built and executed through a computer simulation. Findings: The results indicate that individuals with certain profiles have better capabilities to deal with complex problems. Moderate profiles could solve the entire complex problem, whereas profiles within extreme conditions could not. This indicates that having a strong predisposition is not the ideal way when approaching complex problems, and there should always be a component from the other perspective. The probability that an individual may use these capabilities provided by the opposite predisposition provides to be a useful option. Originality/value: The originality of the present research stems from how individuals are profiled, and the model and simulation that is built to understand how they solve complex problems. The development of the agent-based model adds value to the existing body of knowledge within both social sciences, and modeling and simulation.
Fast-Solving Quasi-Optimal LS-S3VM Based on an Extended Candidate Set.
Ma, Yuefeng; Liang, Xun; Kwok, James T; Li, Jianping; Zhou, Xiaoping; Zhang, Haiyan
2018-04-01
The semisupervised least squares support vector machine (LS-S 3 VM) is an important enhancement of least squares support vector machines in semisupervised learning. Given that most data collected from the real world are without labels, semisupervised approaches are more applicable than standard supervised approaches. Although a few training methods for LS-S 3 VM exist, the problem of deriving the optimal decision hyperplane efficiently and effectually has not been solved. In this paper, a fully weighted model of LS-S 3 VM is proposed, and a simple integer programming (IP) model is introduced through an equivalent transformation to solve the model. Based on the distances between the unlabeled data and the decision hyperplane, a new indicator is designed to represent the possibility that the label of an unlabeled datum should be reversed in each iteration during training. Using the indicator, we construct an extended candidate set consisting of the indices of unlabeled data with high possibilities, which integrates more information from unlabeled data. Our algorithm is degenerated into a special scenario of the previous algorithm when the extended candidate set is reduced into a set with only one element. Two strategies are utilized to determine the descent directions based on the extended candidate set. Furthermore, we developed a novel method for locating a good starting point based on the properties of the equivalent IP model. Combined with the extended candidate set and the carefully computed starting point, a fast algorithm to solve LS-S 3 VM quasi-optimally is proposed. The choice of quasi-optimal solutions results in low computational cost and avoidance of overfitting. Experiments show that our algorithm equipped with the two designed strategies is more effective than other algorithms in at least one of the following three aspects: 1) computational complexity; 2) generalization ability; and 3) flexibility. However, our algorithm and other algorithms have
Solving the multigroup adjoint transport equations using the method of cyclic characteristics
Energy Technology Data Exchange (ETDEWEB)
Assawaroongruengchot, M.; Marleau, G. [Ecole Polytechnique de Montreal, Inst. de genie nucleaire, Montreal, Quebec (Canada)]. E-mail: monchai.assawar@polymtl.ca
2005-07-01
The adjoint transport solution algorithm based on the method of cyclic characteristics (MOCC) is developed for the heterogeneous 2D geometries. The adjoint characteristics equation associated with a cyclic tracking line is formulated, then a closed form for adjoint angular flux can be determined. The acceleration techniques are implemented using the group-reduction and group-splitting techniques. To demonstrate the efficacy of the algorithm, the calculations are performed on the 37 pin CANDU cell and on the Watanabe-Maynard benchmark problem. Comparisons of adjoint flux and k{sub eff} results obtained by MOCC and collision probability (CP) methods are performed. The mathematical relationship between pseudo-adjoint flux obtained by CP method and adjoint flux by MOCC method is presented. (author)