Nonclassical pseudospectral method for the solution of brachistochrone problem
International Nuclear Information System (INIS)
Alipanah, A.; Razzaghi, M.; Dehghan, M.
2007-01-01
In this paper, nonclassical pseudospectral method is proposed for solving the classic brachistochrone problem. The brachistochrone problem is first formulated as a nonlinear optimal control problem. Properties of nonclassical pseudospectral method are presented, these properties are then utilized to reduce the computation of brachistochrone problem to the solution of algebraic equations. Using this method, the solution to the brachistochrone problem is compared with those in the literature
Properties and solution methods for large location-allocation problems
DEFF Research Database (Denmark)
Juel, Henrik; Love, Robert F.
1982-01-01
Location-allocation with l$ _p$ distances is studied. It is shown that this structure can be expressed as a concave minimization programming problem. Since concave minimization algorithms are not yet well developed, five solution methods are developed which utilize the special properties of the l......Location-allocation with l$ _p$ distances is studied. It is shown that this structure can be expressed as a concave minimization programming problem. Since concave minimization algorithms are not yet well developed, five solution methods are developed which utilize the special properties...... of the location-allocation problem. Using the rectilinear distance measure, two of these algorithms achieved optimal solutions in all 102 test problems for which solutions were known. The algorithms can be applied to much larger problems than any existing exact methods....
ANALYSIS AND PERFORMANCE MEASUREMENT OF EXISTING SOLUTION METHODS OF QUADRATIC ASSIGNMENT PROBLEM
Directory of Open Access Journals (Sweden)
Morteza KARAMI
2014-01-01
Full Text Available Quadratic Assignment Problem (QAP is known as one of the most difficult combinatorial optimization problems that is classified in the category of NP-hard problems. Quadratic Assignment Problem Library (QAPLIB is a full database of QAPs which contains several problems from different authors and different sizes. Many exact and meta-heuristic solution methods have been introduced to solve QAP. In this study we focus on previously introduced solution methods of QAP e.g. Branch and Bound (B&B, Simulated Annealing (SA Algorithm, Greedy Randomized Adaptive Search Procedure (GRASP for dense and sparse QAPs. The codes of FORTRAN for these methods were downloaded from QAPLIB. All problems of QAPLIB were solved by the abovementioned methods. Several results were obtained from the computational experiments part. The Results show that the Branch and Bound method is able to introduce a feasible solution for all problems while Simulated Annealing Algorithm and GRASP methods are not able to find any solution for some problems. On the other hand, Simulated Annealing and GRASP methods have shorter run time comparing to the Branch and Bound method. In addition, the performance of the methods on the objective function value is discussed.
Solution of problems in calculus of variations via He's variational iteration method
International Nuclear Information System (INIS)
Tatari, Mehdi; Dehghan, Mehdi
2007-01-01
In the modeling of a large class of problems in science and engineering, the minimization of a functional is appeared. Finding the solution of these problems needs to solve the corresponding ordinary differential equations which are generally nonlinear. In recent years He's variational iteration method has been attracted a lot of attention of the researchers for solving nonlinear problems. This method finds the solution of the problem without any discretization of the equation. Since this method gives a closed form solution of the problem and avoids the round off errors, it can be considered as an efficient method for solving various kinds of problems. In this research He's variational iteration method will be employed for solving some problems in calculus of variations. Some examples are presented to show the efficiency of the proposed technique
Fundamental solution of the problem of linear programming and method of its determination
Petrunin, S. V.
1978-01-01
The idea of a fundamental solution to a problem in linear programming is introduced. A method of determining the fundamental solution and of applying this method to the solution of a problem in linear programming is proposed. Numerical examples are cited.
Solution Methods for the Periodic Petrol Station Replenishment Problem
Directory of Open Access Journals (Sweden)
C Triki
2013-12-01
Full Text Available In this paper we introduce the Periodic Petrol Station Replenishment Problem (PPSRP over a T-day planning horizon and describe four heuristic methods for its solution. Even though all the proposed heuristics belong to the common partitioning-then-routing paradigm, they differ in assigning the stations to each day of the horizon. The resulting daily routing problems are then solved exactly until achieving optimalization. Moreover, an improvement procedure is also developed with the aim of ensuring a better quality solution. Our heuristics are tested and compared in two real-life cases, and our computational results show encouraging improvements with respect to a human planning solution
Numerical Methods for Solution of the Extended Linear Quadratic Control Problem
DEFF Research Database (Denmark)
Jørgensen, John Bagterp; Frison, Gianluca; Gade-Nielsen, Nicolai Fog
2012-01-01
In this paper we present the extended linear quadratic control problem, its efficient solution, and a discussion of how it arises in the numerical solution of nonlinear model predictive control problems. The extended linear quadratic control problem is the optimal control problem corresponding...... to the Karush-Kuhn-Tucker system that constitute the majority of computational work in constrained nonlinear and linear model predictive control problems solved by efficient MPC-tailored interior-point and active-set algorithms. We state various methods of solving the extended linear quadratic control problem...... and discuss instances in which it arises. The methods discussed in the paper have been implemented in efficient C code for both CPUs and GPUs for a number of test examples....
Woollands, Robyn M.; Read, Julie L.; Probe, Austin B.; Junkins, John L.
2017-12-01
We present a new method for solving the multiple revolution perturbed Lambert problem using the method of particular solutions and modified Chebyshev-Picard iteration. The method of particular solutions differs from the well-known Newton-shooting method in that integration of the state transition matrix (36 additional differential equations) is not required, and instead it makes use of a reference trajectory and a set of n particular solutions. Any numerical integrator can be used for solving two-point boundary problems with the method of particular solutions, however we show that using modified Chebyshev-Picard iteration affords an avenue for increased efficiency that is not available with other step-by-step integrators. We take advantage of the path approximation nature of modified Chebyshev-Picard iteration (nodes iteratively converge to fixed points in space) and utilize a variable fidelity force model for propagating the reference trajectory. Remarkably, we demonstrate that computing the particular solutions with only low fidelity function evaluations greatly increases the efficiency of the algorithm while maintaining machine precision accuracy. Our study reveals that solving the perturbed Lambert's problem using the method of particular solutions with modified Chebyshev-Picard iteration is about an order of magnitude faster compared with the classical shooting method and a tenth-twelfth order Runge-Kutta integrator. It is well known that the solution to Lambert's problem over multiple revolutions is not unique and to ensure that all possible solutions are considered we make use of a reliable preexisting Keplerian Lambert solver to warm start our perturbed algorithm.
Methods of using the quadratic assignment problem solution
Directory of Open Access Journals (Sweden)
Izabela Kudelska
2012-09-01
Full Text Available Background: Quadratic assignment problem (QAP is one of the most interesting of combinatorial optimization. Was presented by Koopman and Beckamanna in 1957, as a mathematical model of the location of indivisible tasks. This problem belongs to the class NP-hard issues. This forces the application to the solution already approximate methods for tasks with a small size (over 30. Even though it is much harder than other combinatorial optimization problems, it enjoys wide interest because it models the important class of decision problems. Material and methods: The discussion was an artificial intelligence tool that allowed to solve the problem QAP, among others are: genetic algorithms, Tabu Search, Branch and Bound. Results and conclusions: QAP did not arise directly as a model for certain actions, but he found its application in many areas. Examples of applications of the problem is: arrangement of buildings on the campus of the university, layout design of electronic components in systems with large scale integration (VLSI, design a hospital, arrangement of keys on the keyboard.
Spectral methods and their implementation to solution of aerodynamic and fluid mechanic problems
Streett, C. L.
1987-01-01
Fundamental concepts underlying spectral collocation methods, especially pertaining to their use in the solution of partial differential equations, are outlined. Theoretical accuracy results are reviewed and compared with results from test problems. A number of practical aspects of the construction and use of spectral methods are detailed, along with several solution schemes which have found utility in applications of spectral methods to practical problems. Results from a few of the successful applications of spectral methods to problems of aerodynamic and fluid mechanic interest are then outlined, followed by a discussion of the problem areas in spectral methods and the current research under way to overcome these difficulties.
Computer methods in physics 250 problems with guided solutions
Landau, Rubin H
2018-01-01
Our future scientists and professionals must be conversant in computational techniques. In order to facilitate integration of computer methods into existing physics courses, this textbook offers a large number of worked examples and problems with fully guided solutions in Python as well as other languages (Mathematica, Java, C, Fortran, and Maple). Its also intended as a self-study guide for learning how to use computer methods in physics. The authors include an introductory chapter on numerical tools and indication of computational and physics difficulty level for each problem.
Efficient numerical methods for the large-scale, parallel solution of elastoplastic contact problems
Frohne, Jö rg; Heister, Timo; Bangerth, Wolfgang
2015-01-01
© 2016 John Wiley & Sons, Ltd. Quasi-static elastoplastic contact problems are ubiquitous in many industrial processes and other contexts, and their numerical simulation is consequently of great interest in accurately describing and optimizing production processes. The key component in these simulations is the solution of a single load step of a time iteration. From a mathematical perspective, the problems to be solved in each time step are characterized by the difficulties of variational inequalities for both the plastic behavior and the contact problem. Computationally, they also often lead to very large problems. In this paper, we present and evaluate a complete set of methods that are (1) designed to work well together and (2) allow for the efficient solution of such problems. In particular, we use adaptive finite element meshes with linear and quadratic elements, a Newton linearization of the plasticity, active set methods for the contact problem, and multigrid-preconditioned linear solvers. Through a sequence of numerical experiments, we show the performance of these methods. This includes highly accurate solutions of a three-dimensional benchmark problem and scaling our methods in parallel to 1024 cores and more than a billion unknowns.
Efficient numerical methods for the large-scale, parallel solution of elastoplastic contact problems
Frohne, Jörg
2015-08-06
© 2016 John Wiley & Sons, Ltd. Quasi-static elastoplastic contact problems are ubiquitous in many industrial processes and other contexts, and their numerical simulation is consequently of great interest in accurately describing and optimizing production processes. The key component in these simulations is the solution of a single load step of a time iteration. From a mathematical perspective, the problems to be solved in each time step are characterized by the difficulties of variational inequalities for both the plastic behavior and the contact problem. Computationally, they also often lead to very large problems. In this paper, we present and evaluate a complete set of methods that are (1) designed to work well together and (2) allow for the efficient solution of such problems. In particular, we use adaptive finite element meshes with linear and quadratic elements, a Newton linearization of the plasticity, active set methods for the contact problem, and multigrid-preconditioned linear solvers. Through a sequence of numerical experiments, we show the performance of these methods. This includes highly accurate solutions of a three-dimensional benchmark problem and scaling our methods in parallel to 1024 cores and more than a billion unknowns.
Solution Methods for the Periodic Petrol Station Replenishment Problem
C Triki
2013-01-01
In this paper we introduce the Periodic Petrol Station Replenishment Problem (PPSRP) over a T-day planning horizon and describe four heuristic methods for its solution. Even though all the proposed heuristics belong to the common partitioning-then-routing paradigm, they differ in assigning the stations to each day of the horizon. The resulting daily routing problems are then solved exactly until achieving optimalization. Moreover, an improvement procedure is also developed with the aim of ens...
The Train Driver Recovery Problem - Solution Method and Decision Support System Framework
DEFF Research Database (Denmark)
Rezanova, Natalia Jurjevna
2009-01-01
the proposed model and solution method is suitable for solving in real-time. Recovery duties are generated as resource constrained paths in duty networks, and the set partitioning problem is solved with a linear programming based branch-and-price algorithm. Dynamic column generation and problem space expansion...... driver decision support system in their operational environment. Besides solving a particular optimization problem, this thesis contributes with a description of the railway planning process, tactical crew scheduling and the real-time dispatching solutions, taking a starting point in DSB S....... Rezanova NJ, Ryan DM. The train driver recovery problem–A set partitioning based model and solution method. Computers and Operations Research, in press, 2009. doi: 10.1016/j.cor.2009.03.023. 2. Clausen J, Larsen A, Larsen J, Rezanova NJ. Disruption management in the airline industry–Concepts, models...
Two numerical methods for the solution of two-dimensional eddy current problems
International Nuclear Information System (INIS)
Biddlecombe, C.S.
1978-07-01
A general method for the solution of eddy current problems in two dimensions - one component of current density and two of magnetic field, is reported. After examining analytical methods two numerical methods are presented. Both solve the two dimensional, low frequency limit of Maxwell's equations for transient eddy currents in conducting material, which may be permeable, in the presence of other non-conducting permeable material. Both solutions are expressed in terms of the magnetic vector potential. The first is an integral equation method, using zero order elements in the discretisation of the unknown source regions. The other is a differential equation method, using a first order finite element mesh, and the Galerkin weighted residual procedure. The resulting equations are solved as initial-value problems. Results from programs based on each method are presented showing the power and limitations of the methods and the range of problems solvable. The methods are compared and recommendations are made for choosing between them. Suggestions are made for improving both methods, involving boundary integral techniques. (author)
Enriched Meshfree Method for an Accurate Numerical Solution of the Motz Problem
Directory of Open Access Journals (Sweden)
Won-Tak Hong
2016-01-01
Full Text Available We present an enriched meshfree solution of the Motz problem. The Motz problem has been known as a benchmark problem to verify the efficiency of numerical methods in the presence of a jump boundary data singularity at a point, where an abrupt change occurs for the boundary condition. We propose a singular basis function enrichment technique in the context of partition of unity based meshfree method. We take the leading terms of the local series expansion at the point singularity and use them as enrichment functions for the local approximation space. As a result, we obtain highly accurate leading coefficients of the Motz problem that are comparable to the most accurate numerical solution. The proposed singular enrichment technique is highly effective in the case of the local series expansion of the solution being known. The enrichment technique that is used in this study can be applied to monotone singularities (of type rα with α<1 as well as oscillating singularities (of type rαsin(ϵlogr. It is the first attempt to apply singular meshfree enrichment technique to the Motz problem.
On solution to the problem of criticality by alternative Monte Carlo method
International Nuclear Information System (INIS)
Kyncl, J.
2005-03-01
The problem of criticality for the neutron transport equation is analyzed. The problem is transformed into an equivalent problem in a suitable set of complex functions, and the existence and uniqueness of its solution is demonstrated. The source iteration method is discussed. It is shown that the final result of the iterative process is strongly affected by the insufficient accuracy of the individual iterations. A modified method is suggested to circumvent this problem based on the theory of positive operators; the criticality problem is solved by the Monte Carlo method constructing special random process and variable so that the difference between the result and the true value can be arbitrarily small. The efficiency of this alternative method is analysed
Direct methods of solution for problems in mechanics from invariance principles
International Nuclear Information System (INIS)
Rajan, M.
1986-01-01
Direct solutions to problems in mechanics are developed from variational statements derived from the principle of invariance of the action integral under a one-parameter family of infinitesimal transformations. Exact, direct solution procedures for linear systems are developed by a careful choice of the arbitrary functions used to generate the infinitesimal transformations. It is demonstrated that the well-known methods for the solution of differential equations can be directly adapted to the required variational statements. Examples in particle and continuum mechanics are presented
Lower and Upper Solutions Method for Positive Solutions of Fractional Boundary Value Problems
Directory of Open Access Journals (Sweden)
R. Darzi
2013-01-01
Full Text Available We apply the lower and upper solutions method and fixed-point theorems to prove the existence of positive solution to fractional boundary value problem D0+αut+ft,ut=0, 0
Directory of Open Access Journals (Sweden)
Xiao-Ying Qin
2014-01-01
Full Text Available An Adomian decomposition method (ADM is applied to solve a two-phase Stefan problem that describes the pure metal solidification process. In contrast to traditional analytical methods, ADM avoids complex mathematical derivations and does not require coordinate transformation for elimination of the unknown moving boundary. Based on polynomial approximations for some known and unknown boundary functions, approximate analytic solutions for the model with undetermined coefficients are obtained using ADM. Substitution of these expressions into other equations and boundary conditions of the model generates some function identities with the undetermined coefficients. By determining these coefficients, approximate analytic solutions for the model are obtained. A concrete example of the solution shows that this method can easily be implemented in MATLAB and has a fast convergence rate. This is an efficient method for finding approximate analytic solutions for the Stefan and the inverse Stefan problems.
Regularization and computational methods for precise solution of perturbed orbit transfer problems
Woollands, Robyn Michele
The author has developed a suite of algorithms for solving the perturbed Lambert's problem in celestial mechanics. These algorithms have been implemented as a parallel computation tool that has broad applicability. This tool is composed of four component algorithms and each provides unique benefits for solving a particular type of orbit transfer problem. The first one utilizes a Keplerian solver (a-iteration) for solving the unperturbed Lambert's problem. This algorithm not only provides a "warm start" for solving the perturbed problem but is also used to identify which of several perturbed solvers is best suited for the job. The second algorithm solves the perturbed Lambert's problem using a variant of the modified Chebyshev-Picard iteration initial value solver that solves two-point boundary value problems. This method converges over about one third of an orbit and does not require a Newton-type shooting method and thus no state transition matrix needs to be computed. The third algorithm makes use of regularization of the differential equations through the Kustaanheimo-Stiefel transformation and extends the domain of convergence over which the modified Chebyshev-Picard iteration two-point boundary value solver will converge, from about one third of an orbit to almost a full orbit. This algorithm also does not require a Newton-type shooting method. The fourth algorithm uses the method of particular solutions and the modified Chebyshev-Picard iteration initial value solver to solve the perturbed two-impulse Lambert problem over multiple revolutions. The method of particular solutions is a shooting method but differs from the Newton-type shooting methods in that it does not require integration of the state transition matrix. The mathematical developments that underlie these four algorithms are derived in the chapters of this dissertation. For each of the algorithms, some orbit transfer test cases are included to provide insight on accuracy and efficiency of these
Monte Carlo methods for flux expansion solutions of transport problems
International Nuclear Information System (INIS)
Spanier, J.
1999-01-01
Adaptive Monte Carlo methods, based on the use of either correlated sampling or importance sampling, to obtain global solutions to certain transport problems have recently been described. The resulting learning algorithms are capable of achieving geometric convergence when applied to the estimation of a finite number of coefficients in a flux expansion representation of the global solution. However, because of the nonphysical nature of the random walk simulations needed to perform importance sampling, conventional transport estimators and source sampling techniques require modification to be used successfully in conjunction with such flux expansion methods. It is shown how these problems can be overcome. First, the traditional path length estimators in wide use in particle transport simulations are generalized to include rather general detector functions (which, in this application, are the individual basis functions chosen for the flus expansion). Second, it is shown how to sample from the signed probabilities that arise as source density functions in these applications, without destroying the zero variance property needed to ensure geometric convergence to zero error
International Nuclear Information System (INIS)
Goncalves, G.A.; Bogado Leite, S.Q.; Vilhena, M.T. de
2009-01-01
An analytical solution has been obtained for the one-speed stationary neutron transport problem, in an infinitely long cylinder with anisotropic scattering by the decomposition method. Series expansions of the angular flux distribution are proposed in terms of suitably constructed functions, recursively obtainable from the isotropic solution, to take into account anisotropy. As for the isotropic problem, an accurate closed-form solution was chosen for the problem with internal source and constant incident radiation, obtained from an integral transformation technique and the F N method
Benchmarking the invariant embedding method against analytical solutions in model transport problems
International Nuclear Information System (INIS)
Malin, Wahlberg; Imre, Pazsit
2005-01-01
The purpose of this paper is to demonstrate the use of the invariant embedding method in a series of model transport problems, for which it is also possible to obtain an analytical solution. Due to the non-linear character of the embedding equations, their solution can only be obtained numerically. However, this can be done via a robust and effective iteration scheme. In return, the domain of applicability is far wider than the model problems investigated in this paper. The use of the invariant embedding method is demonstrated in three different areas. The first is the calculation of the energy spectrum of reflected (sputtered) particles from a multiplying medium, where the multiplication arises from recoil production. Both constant and energy dependent cross sections with a power law dependence were used in the calculations. The second application concerns the calculation of the path length distribution of reflected particles from a medium without multiplication. This is a relatively novel and unexpected application, since the embedding equations do not resolve the depth variable. The third application concerns the demonstration that solutions in an infinite medium and a half-space are interrelated through embedding-like integral equations, by the solution of which the reflected flux from a half-space can be reconstructed from solutions in an infinite medium or vice versa. In all cases the invariant embedding method proved to be robust, fast and monotonically converging to the exact solutions. (authors)
Solution of stochastic media transport problems using a numerical quadrature-based method
International Nuclear Information System (INIS)
Pautz, S. D.; Franke, B. C.; Prinja, A. K.; Olson, A. J.
2013-01-01
We present a new conceptual framework for analyzing transport problems in random media. We decompose such problems into stratified subproblems according to the number of material pseudo-interfaces within realizations. For a given subproblem we assign pseudo-interface locations in each realization according to product quadrature rules, which allows us to deterministically generate a fixed number of realizations. Quadrature integration of the solutions of these realizations thus approximately solves each subproblem; the weighted superposition of solutions of the subproblems approximately solves the general stochastic media transport problem. We revisit some benchmark problems to determine the accuracy and efficiency of this approach in comparison to randomly generated realizations. We find that this method is very accurate and fast when the number of pseudo-interfaces in a problem is generally low, but that these advantages quickly degrade as the number of pseudo-interfaces increases. (authors)
An Adaptive Physics-Based Method for the Solution of One-Dimensional Wave Motion Problems
Directory of Open Access Journals (Sweden)
Masoud Shafiei
2015-12-01
Full Text Available In this paper, an adaptive physics-based method is developed for solving wave motion problems in one dimension (i.e., wave propagation in strings, rods and beams. The solution of the problem includes two main parts. In the first part, after discretization of the domain, a physics-based method is developed considering the conservation of mass and the balance of momentum. In the second part, adaptive points are determined using the wavelet theory. This part is done employing the Deslauries-Dubuc (D-D wavelets. By solving the problem in the first step, the domain of the problem is discretized by the same cells taking into consideration the load and characteristics of the structure. After the first trial solution, the D-D interpolation shows the lack and redundancy of points in the domain. These points will be added or eliminated for the next solution. This process may be repeated for obtaining an adaptive mesh for each step. Also, the smoothing spline fit is used to eliminate the noisy portion of the solution. Finally, the results of the proposed method are compared with the results available in the literature. The comparison shows excellent agreement between the obtained results and those already reported.
Solution of Constrained Optimal Control Problems Using Multiple Shooting and ESDIRK Methods
DEFF Research Database (Denmark)
Capolei, Andrea; Jørgensen, John Bagterp
2012-01-01
of this paper is the use of ESDIRK integration methods for solution of the initial value problems and the corresponding sensitivity equations arising in the multiple shooting algorithm. Compared to BDF-methods, ESDIRK-methods are advantageous in multiple shooting algorithms in which restarts and frequent...... algorithm. As we consider stiff systems, implicit solvers with sensitivity computation capabilities for initial value problems must be used in the multiple shooting algorithm. Traditionally, multi-step methods based on the BDF algorithm have been used for such problems. The main novel contribution...... discontinuities on each shooting interval are present. The ESDIRK methods are implemented using an inexact Newton method that reuses the factorization of the iteration matrix for the integration as well as the sensitivity computation. Numerical experiments are provided to demonstrate the algorithm....
Numerical solution of sixth-order boundary-value problems using Legendre wavelet collocation method
Sohaib, Muhammad; Haq, Sirajul; Mukhtar, Safyan; Khan, Imad
2018-03-01
An efficient method is proposed to approximate sixth order boundary value problems. The proposed method is based on Legendre wavelet in which Legendre polynomial is used. The mechanism of the method is to use collocation points that converts the differential equation into a system of algebraic equations. For validation two test problems are discussed. The results obtained from proposed method are quite accurate, also close to exact solution, and other different methods. The proposed method is computationally more effective and leads to more accurate results as compared to other methods from literature.
The boundary element method for the solution of the multidimensional inverse heat conduction problem
International Nuclear Information System (INIS)
Lagier, Guy-Laurent
1999-01-01
This work focuses on the solution of the inverse heat conduction problem (IHCP), which consists in the determination of boundary conditions from a given set of internal temperature measurements. This problem is difficult to solve due to its ill-posedness and high sensitivity to measurement error. As a consequence, numerical regularization procedures are required to solve this problem. However, most of these methods depend on the dimension and the nature, stationary or transient, of the problem. Furthermore, these methods introduce parameters, called hyper-parameters, which have to be chosen optimally, but can not be determined a priori. So, a new general method is proposed for solving the IHCP. This method is based on a Boundary Element Method formulation, and the use of the Singular Values Decomposition as a regularization procedure. Thanks to this method, it's possible to identify and eliminate the directions of the solution where the measurement error plays the major role. This algorithm is first validated on two-dimensional stationary and one-dimensional transient problems. Some criteria are presented in order to choose the hyper-parameters. Then, the methodology is applied to two-dimensional and three-dimensional, theoretical or experimental, problems. The results are compared with those obtained by a standard method and show the accuracy of the method, its generality, and the validity of the proposed criteria. (author) [fr
International Nuclear Information System (INIS)
Goncalves, Glenio A.; Bodmann, Bardo; Bogado, Sergio; Vilhena, Marco T.
2008-01-01
Analytical solutions for neutron transport in cylindrical geometry is available for isotropic problems, but to the best of our knowledge for anisotropic problems are not available, yet. In this work, an analytical solution for the neutron transport equation in an infinite cylinder assuming anisotropic scattering is reported. Here we specialize the solution, without loss of generality, for the linearly anisotropic problem using the combined decomposition and HTS N methods. The key feature of this method consists in the application of the decomposition method to the anisotropic problem by virtue of the fact that the inverse of the operator associated to isotropic problem is well know and determined by the HTS N approach. So far, following the idea of the decomposition method, we apply this operator to the integral term, assuming that the angular flux appearing in the integrand is considered to be equal to the HTS N solution interpolated by polynomial considering only even powers. This leads to the first approximation for an anisotropic solution. Proceeding further, we replace this solution for the angular flux in the integral and apply again the inverse operator for the isotropic problem in the integral term and obtain a new approximation for the angular flux. This iterative procedure yields a closed form solution for the angular flux. This methodology can be generalized, in a straightforward manner, for transport problems with any degree of anisotropy. For the sake of illustration, we report numerical simulations for linearly anisotropic transport problems. (author)
Enhanced exact solution methods for the Team Orienteering Problem
Keshtkaran, M.; Ziarati, K.; Bettinelli, A.; Vigo, D.
2016-01-01
The Team Orienteering Problem (TOP) is one of the most investigated problems in the family of vehicle routing problems with profits. In this paper, we propose a Branch-and-Price approach to find proven optimal solutions to TOP. The pricing sub-problem is solved by a bounded bidirectional dynamic
The algebraic method of the scattering inverse problem solution under untraditional statements
Popushnoj, M N
2001-01-01
The algebraic method of the scattering inverse problem solution under untraditional statements is proposed consistently in this review, in the framework of which some quantum theory od scattering charged particles problem were researched afterwards. The inverse problem of scattering theory of charged particles on the complex plane of the Coulomb coupling constant (CCC) is considered. A procedure of interaction potential restoration is established for the case when the energy, orbital moment quadrate and CCC are linearly dependent. The relation between one-parametric problems of the potential scattering of charged particles is investigated
International Nuclear Information System (INIS)
Yusufoglu, Elcin; Erbas, Baris
2008-01-01
In this Letter, a mathematical model of the problem of prey and predator is presented and He's variational iteration method is employed to compute an approximation to the solution of the system of nonlinear differential equations governing the problem. The results are compared with the results obtained by Adomian decomposition method and homotopy perturbation method. Comparison of the methods show that He's variational iteration method is a powerful method for obtaining approximate solutions to nonlinear equations and their systems
International Nuclear Information System (INIS)
1994-01-01
Traditional International Conference on programming and mathematical methods for solution of physical problems took place in Dubna in Jun, 14-19, 1993. More than 160 scientists from 14 countries participated in the Conference. They presented about 120 reports, the range of problems including computerized information complexes, experimental data acquisition and processing systems, mathematical simulation and calculation experiment in physics, analytical and numerical methods for solution of physical problems
The Method of Subsuper Solutions for Weighted p(r-Laplacian Equation Boundary Value Problems
Directory of Open Access Journals (Sweden)
Zhimei Qiu
2008-10-01
Full Text Available This paper investigates the existence of solutions for weighted p(r-Laplacian ordinary boundary value problems. Our method is based on Leray-Schauder degree. As an application, we give the existence of weak solutions for p(x-Laplacian partial differential equations.
Multigrid method applied to the solution of an elliptic, generalized eigenvalue problem
Energy Technology Data Exchange (ETDEWEB)
Alchalabi, R.M. [BOC Group, Murray Hill, NJ (United States); Turinsky, P.J. [North Carolina State Univ., Raleigh, NC (United States)
1996-12-31
The work presented in this paper is concerned with the development of an efficient MG algorithm for the solution of an elliptic, generalized eigenvalue problem. The application is specifically applied to the multigroup neutron diffusion equation which is discretized by utilizing the Nodal Expansion Method (NEM). The underlying relaxation method is the Power Method, also known as the (Outer-Inner Method). The inner iterations are completed using Multi-color Line SOR, and the outer iterations are accelerated using Chebyshev Semi-iterative Method. Furthermore, the MG algorithm utilizes the consistent homogenization concept to construct the restriction operator, and a form function as a prolongation operator. The MG algorithm was integrated into the reactor neutronic analysis code NESTLE, and numerical results were obtained from solving production type benchmark problems.
A Fast Condensing Method for Solution of Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
consider a condensing (or state elimination) method to solve an extended version of the LQ control problem, and we show how to exploit the structure of this problem to both factorize the dense Hessian matrix and solve the system. Furthermore, we present two efficient implementations. The first......In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper we...... implementation is formally identical to the Riccati recursion based solver and has a computational complexity that is linear in the control horizon length and cubic in the number of states. The second implementation has a computational complexity that is quadratic in the control horizon length as well...
International Nuclear Information System (INIS)
Anastassi, Z. A.; Simos, T. E.
2010-01-01
We develop a new family of explicit symmetric linear multistep methods for the efficient numerical solution of the Schroedinger equation and related problems with oscillatory solution. The new methods are trigonometrically fitted and have improved intervals of periodicity as compared to the corresponding classical method with constant coefficients and other methods from the literature. We also apply the methods along with other known methods to real periodic problems, in order to measure their efficiency.
The Train Driver Recovery Problem - a Set Partitioning Based Model and Solution Method
DEFF Research Database (Denmark)
Rezanova, Natalia Jurjevna; Ryan, David
The need to recover a train driver schedule occurs during major disruptions in the daily railway operations. Using data from the train driver schedule of the Danish passenger railway operator DSB S-tog A/S, a solution method to the Train Driver Recovery Problem (TDRP) is developed. The TDRP...... the depth-first search of the Branch & Bound tree. Preliminarily results are encouraging, showing that nearly all tested real-life instances produce integer solutions to the LP relaxation and solutions are found within a few seconds....
Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems
Almeida, Regina C.
2010-08-01
A goal-oriented analysis of linear, stochastic advection-diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem. © 2010 Elsevier B.V.
Solution verification, goal-oriented adaptive methods for stochastic advection–diffusion problems
Almeida, Regina C.; Oden, J. Tinsley
2010-01-01
A goal-oriented analysis of linear, stochastic advection-diffusion models is presented which provides both a method for solution verification as well as a basis for improving results through adaptation of both the mesh and the way random variables are approximated. A class of model problems with random coefficients and source terms is cast in a variational setting. Specific quantities of interest are specified which are also random variables. A stochastic adjoint problem associated with the quantities of interest is formulated and a posteriori error estimates are derived. These are used to guide an adaptive algorithm which adjusts the sparse probabilistic grid so as to control the approximation error. Numerical examples are given to demonstrate the methodology for a specific model problem. © 2010 Elsevier B.V.
Heinkenschloss, Matthias
2005-01-01
We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.
International Nuclear Information System (INIS)
Dinh Nho Hao; Nguyen Trung Thanh; Sahli, Hichem
2008-01-01
In this paper we consider a multi-dimensional inverse heat conduction problem with time-dependent coefficients in a box, which is well-known to be severely ill-posed, by a variational method. The gradient of the functional to be minimized is obtained by aids of an adjoint problem and the conjugate gradient method with a stopping rule is then applied to this ill-posed optimization problem. To enhance the stability and the accuracy of the numerical solution to the problem we apply this scheme to the discretized inverse problem rather than to the continuous one. The difficulties with large dimensions of discretized problems are overcome by a splitting method which only requires the solution of easy-to-solve one-dimensional problems. The numerical results provided by our method are very good and the techniques seem to be very promising.
On solution to the problem of reactor kinetics with delayed neutrons by Monte Carlo method
International Nuclear Information System (INIS)
Kyncl, Jan
2013-07-01
The initial value problem is addressed for the neutron transport equation and for the system of equations that describe the behaviour of emitters of delayed neutrons. Examination of the solution to this problem is based on several main assumptions concerning the behaviour of macroscopic effective cross-sections describing the reaction of the neutron with the medium, the temperature of medium and the remaining parameters of the equations. Formulation of these assumptions is adequately general and is in agreement with the properties of all known models of the physical quantities involved. Among others, the assumptions admit dependence of the macroscopic effective cross-sections and temperature on spatial coordinates and time that can be arbitrary to a great extent. The problem starts from a set of integro-differential equations. This problem is first transposed into the equivalent problem of solving a linear integral equation for neutron flux. This integral equation is solved by the method of successive iterations and its uniqueness is demonstrated. Numeric solution to the integral equation by Monte Carlo method consists in finding a functional of the exact solution. For this, a random process is set up and some random variables are proposed. Then it is demonstrated that each of these variables is an unbiased estimator of that functional. (author)
Energy Technology Data Exchange (ETDEWEB)
Zanette, Rodrigo [Universidade Federal do Rio Grande do Sul (UFRGS), Porto Alegre, RS (Brazil). Programa de Pós-Graduação em Matemática Aplicada; Petersen, Claudio Z.; Tavares, Matheus G., E-mail: rodrigozanette@hotmail.com, E-mail: claudiopetersen@yahoo.com.br, E-mail: matheus.gulartetavares@gmail.com [Universidade Federal de Pelotas (UFPEL), RS (Brazil). Programa de Pós-Graduação em Modelagem Matemática
2017-07-01
We describe in this work the application of the modified power method for solve the multigroup neutron diffusion eigenvalue problem in slab geometry considering two-dimensions for nuclear reactor global calculations. It is well known that criticality calculations can often be best approached by solving eigenvalue problems. The criticality in nuclear reactors physics plays a relevant role since establishes the ratio between the numbers of neutrons generated in successive fission reactions. In order to solve the eigenvalue problem, a modified power method is used to obtain the dominant eigenvalue (effective multiplication factor (K{sub eff})) and its corresponding eigenfunction (scalar neutron flux), which is non-negative in every domain, that is, physically relevant. The innovation of this work is solving the neutron diffusion equation in analytical form for each new iteration of the power method. For solve this problem we propose to apply the Finite Fourier Sine Transform on one of the spatial variables obtaining a transformed problem which is resolved by well-established methods for ordinary differential equations. The inverse Fourier transform is used to reconstruct the solution for the original problem. It is known that the power method is an iterative source method in which is updated by the neutron flux expression of previous iteration. Thus, for each new iteration, the neutron flux expression becomes larger and more complex due to analytical solution what makes propose that it be reconstructed through an polynomial interpolation. The methodology is implemented to solve a homogeneous problem and the results are compared with works presents in the literature. (author)
The solution of a coupled system of nonlinear physical problems using the homotopy analysis method
International Nuclear Information System (INIS)
El-Wakil, S A; Abdou, M A
2010-01-01
In this article, the homotopy analysis method (HAM) has been applied to solve coupled nonlinear evolution equations in physics. The validity of this method has been successfully demonstrated by applying it to two nonlinear evolution equations, namely coupled nonlinear diffusion reaction equations and the (2+1)-dimensional Nizhnik-Novikov Veselov system. The results obtained by this method show good agreement with the ones obtained by other methods. The proposed method is a powerful and easy to use analytic tool for nonlinear problems and does not need small parameters in the equations. The HAM solutions contain an auxiliary parameter that provides a convenient way of controlling the convergence region of series solutions. The results obtained here reveal that the proposed method is very effective and simple for solving nonlinear evolution equations. The basic ideas of this approach can be widely employed to solve other strongly nonlinear problems.
An Exact Solution of the Binary Singular Problem
Directory of Open Access Journals (Sweden)
Baiqing Sun
2014-01-01
Full Text Available Singularity problem exists in various branches of applied mathematics. Such ordinary differential equations accompany singular coefficients. In this paper, by using the properties of reproducing kernel, the exact solution expressions of dual singular problem are given in the reproducing kernel space and studied, also for a class of singular problem. For the binary equation of singular points, I put it into the singular problem first, and then reuse some excellent properties which are applied to solve the method of solving differential equations for its exact solution expression of binary singular integral equation in reproducing kernel space, and then obtain its approximate solution through the evaluation of exact solutions. Numerical examples will show the effectiveness of this method.
WYD method for an eigen solution of coupled problems
Directory of Open Access Journals (Sweden)
A Harapin
2016-04-01
Full Text Available Designing efficient and stable algorithm for finding the eigenvalues andeigenvectors is very important from the static as well as the dynamic aspectin coupled problems. Modal analysis requires first few significant eigenvectorsand eigenvalues while direct integration requires the highest value toascertain the length of the time step that satisfies the stability condition.The paper first presents the modification of the well known WYDmethod for a solution of single field problems: an efficient and numericallystable algorithm for computing eigenvalues and the correspondingeigenvectors. The modification is based on the special choice of thestarting vector. The starting vector is the static solution of displacements forthe applied load, defined as the product of the mass matrix and the unitdisplacement vector. The starting vector is very close to the theoreticalsolution, which is important in cases of small subspaces.Additionally, the paper briefly presents the adopted formulation for solvingthe fluid-structure coupled systems problems which is based on a separatesolution for each field. Individual fields (fluid and structure are solvedindependently, taking in consideration the interaction information transferbetween them at every stage of the iterative solution process. The assessmentof eigenvalues and eigenvectors for multiple fields is also presented. This eigenproblem is more complicated than the one for the ordinary structural analysis,as the formulation produces non-symmetrical matrices.Finally, a numerical example for the eigen solution coupled fluidstructureproblem is presented to show the efficiency and the accuracy ofthe developed algorithm.
Gottschlich, Carsten; Schuhmacher, Dominic
2014-01-01
Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is used in a plethora of applications ranging from content-based image retrieval, shape matching, fingerprint recognition, object tracking and phishing web page detection to computing color differences in linguistics and biology. Our starting point is the well-known revised simplex algorithm, which iteratively improves a feasible solution to optimality. The Shortlist Method that we propose substantially reduces the number of candidates inspected for improving the solution, while at the same time balancing the number of pivots required. Tests on simulated benchmarks demonstrate a considerable reduction in computation time for the new method as compared to the usual revised simplex algorithm implemented with state-of-the-art initialization and pivot strategies. As a consequence, the Shortlist Method facilitates the computation of large scale transportation problems in viable time. In addition we describe a novel method for finding an initial feasible solution which we coin Modified Russell's Method.
Solution of adsorption problems involving steep moving profiles
DEFF Research Database (Denmark)
Kiil, Søren; Bhatia, Suresh K.
1998-01-01
The moving finite element collocation method proposed by Kiil et al. (1995) for solution of problems with steep gradients is further developed to solve transient problems arising in the field of adsorption. The technique is applied to a model of adsorption in solids with bidisperse pore structures....... Numerical solutions were found to match the analytical solution when it exists (i.e. when the adsorption isotherm is linear). Results of this application study show that the method is simple yet sufficiently accurate for use in adsorption problems with steep moving gradients, where global collocation...
Approximate solutions of common fixed-point problems
Zaslavski, Alexander J
2016-01-01
This book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take place. We show that our algorithms generate a good approximate solution if computational errors are bounded from above by a small positive constant. Beginning with an introduction, this monograph moves on to study: · dynamic string-averaging methods for common fixed point problems in a Hilbert space · dynamic string methods for common fixed point problems in a metric space · dynamic string-averaging version of the proximal...
New numerical methods for open-loop and feedback solutions to dynamic optimization problems
Ghosh, Pradipto
The topic of the first part of this research is trajectory optimization of dynamical systems via computational swarm intelligence. Particle swarm optimization is a nature-inspired heuristic search method that relies on a group of potential solutions to explore the fitness landscape. Conceptually, each particle in the swarm uses its own memory as well as the knowledge accumulated by the entire swarm to iteratively converge on an optimal or near-optimal solution. It is relatively straightforward to implement and unlike gradient-based solvers, does not require an initial guess or continuity in the problem definition. Although particle swarm optimization has been successfully employed in solving static optimization problems, its application in dynamic optimization, as posed in optimal control theory, is still relatively new. In the first half of this thesis particle swarm optimization is used to generate near-optimal solutions to several nontrivial trajectory optimization problems including thrust programming for minimum fuel, multi-burn spacecraft orbit transfer, and computing minimum-time rest-to-rest trajectories for a robotic manipulator. A distinct feature of the particle swarm optimization implementation in this work is the runtime selection of the optimal solution structure. Optimal trajectories are generated by solving instances of constrained nonlinear mixed-integer programming problems with the swarming technique. For each solved optimal programming problem, the particle swarm optimization result is compared with a nearly exact solution found via a direct method using nonlinear programming. Numerical experiments indicate that swarm search can locate solutions to very great accuracy. The second half of this research develops a new extremal-field approach for synthesizing nearly optimal feedback controllers for optimal control and two-player pursuit-evasion games described by general nonlinear differential equations. A notable revelation from this development
Energy Technology Data Exchange (ETDEWEB)
Trowbridge, C W
1976-06-01
Various integral equation methods are described. For magnetostatic problems three formulations are considered in detail, (a) the direct solution method for the magnetisation distribution in permeable materials, (b) a method based on a scalar potential, and (c) the use of an integral equation derived from Green's Theorem, i.e. the so-called Boundary Integral Method (BIM). In the case of (a) results are given for two-and three-dimensional non-linear problems with comparisons against measurement. For methods (b) and (c), which both lead to a more economical use of the computer than (a), some preliminary results are given for simple cases. For eddy current problems various methods are discussed and some results are given from a computer program based on a vector potential formulation.
International Nuclear Information System (INIS)
Trowbridge, C.W.
1976-06-01
Various integral equation methods are described. For magnetostatic problems three formulations are considered in detail, (a) the direct solution method for the magnetisation distribution in permeable materials, (b) a method based on a scalar potential and (c) the use of an integral equation derived from Green's Theorem, i.e. the so-called Boundary Integral Method (BIM). In the case of (a) results are given for two-and three-dimensional non-linear problems with comparisons against measurement. For methods (b) and (c) which both lead to a more economic use of the computer than (a) some preliminary results are given for simple cases. For eddy current problems various methods are discussed and some results are given from a computer program based on a vector potential formulation. (author)
International Nuclear Information System (INIS)
Shafie-khah, M.; Parsa Moghaddam, M.; Sheikh-El-Eslami, M.K.
2011-01-01
Highlights: → A hybrid SCUC solution is developed to deal with large-scale, real-time and long-term problems. → New formulations are proposed for considering valve point effect and warmth-dependent start-up cost. → A new algorithm is developed for modeling the AC power flow in SCUC problems. → Using the power flow algorithm both steps in traditional SCUC is done simultaneously. → The proposed method provides better solutions than previous ones with a fast speed. - Abstract: In this paper, a new practical method is presented for solving the non-convex security constraint unit commitment (SCUC) problem in power systems. The accuracy of the proposed method is desirable while the shorter computation time makes it useful for SCUC solution of large-scale power systems, real-time market operation and long-term SCUC problems. The proposed framework allows inclusion of the valve point effects, warmth-dependent start-up costs, ramp rates, minimum up/down time constraints, multiple fuels costs, emission costs, prohibited operating zones and AC power flow limits in normal and contingency conditions. To solve the non-convex problem, combination of a modified Branch-and-Bound method with the Quadratic Programming is used as an optimization tool and a developed AC power flow algorithm is applied for considering the security and contingency concerns using the nonlinear/linear AC model. These modifications improve the convergence speed and solution precision of SCUC problem. In the proposed method, in contrast with traditional SCUC algorithms, unit commitment solution, checking and satisfying the security constraints are managed simultaneously. The obtained results are compared with other reported methods for investigating the effectiveness of the proposed method. Also, the proposed method is applied to an Iranian power system including 493 thermal units.
Fast solution of neutron diffusion problem by reduced basis finite element method
International Nuclear Information System (INIS)
Chunyu, Zhang; Gong, Chen
2018-01-01
Highlights: •An extremely efficient method is proposed to solve the neutron diffusion equation with varying the cross sections. •Three orders of speedup is achieved for IAEA benchmark problems. •The method may open a new possibility of efficient high-fidelity modeling of large scale problems in nuclear engineering. -- Abstract: For the important applications which need carry out many times of neutron diffusion calculations such as the fuel depletion analysis and the neutronics-thermohydraulics coupling analysis, fast and accurate solutions of the neutron diffusion equation are demanding but necessary. In the present work, the certified reduced basis finite element method is proposed and implemented to solve the generalized eigenvalue problems of neutron diffusion with variable cross sections. The order reduced model is built upon high-fidelity finite element approximations during the offline stage. During the online stage, both the k eff and the spatical distribution of neutron flux can be obtained very efficiently for any given set of cross sections. Numerical tests show that a speedup of around 1100 is achieved for the IAEA two-dimensional PWR benchmark problem and a speedup of around 3400 is achieved for the three-dimensional counterpart with the fission cross-sections, the absorption cross-sections and the scattering cross-sections treated as parameters.
Directory of Open Access Journals (Sweden)
Salih Yalcinbas
2016-01-01
Full Text Available In this study, a numerical approach is proposed to obtain approximate solutions of nonlinear system of second order boundary value problem. This technique is essentially based on the truncated Fermat series and its matrix representations with collocation points. Using the matrix method, we reduce the problem system of nonlinear algebraic equations. Numerical examples are also given to demonstrate the validity and applicability of the presented technique. The method is easy to implement and produces accurate results.
Methods for measuring risk-aversion: problems and solutions
International Nuclear Information System (INIS)
Thomas, P J
2013-01-01
Risk-aversion is a fundamental parameter determining how humans act when required to operate in situations of risk. Its general applicability has been discussed in a companion presentation, and this paper examines methods that have been used in the past to measure it and their attendant problems. It needs to be borne in mind that risk-aversion varies with the size of the possible loss, growing strongly as the possible loss becomes comparable with the decision maker's assets. Hence measuring risk-aversion when the potential loss or gain is small will produce values close to the risk-neutral value of zero, irrespective of who the decision maker is. It will also be shown how the generally accepted practice of basing a measurement on the results of a three-term Taylor series will estimate a limiting value, minimum or maximum, rather than the value utilised in the decision. A solution is to match the correct utility function to the results instead
Methods for measuring risk-aversion: problems and solutions
Thomas, P. J.
2013-09-01
Risk-aversion is a fundamental parameter determining how humans act when required to operate in situations of risk. Its general applicability has been discussed in a companion presentation, and this paper examines methods that have been used in the past to measure it and their attendant problems. It needs to be borne in mind that risk-aversion varies with the size of the possible loss, growing strongly as the possible loss becomes comparable with the decision maker's assets. Hence measuring risk-aversion when the potential loss or gain is small will produce values close to the risk-neutral value of zero, irrespective of who the decision maker is. It will also be shown how the generally accepted practice of basing a measurement on the results of a three-term Taylor series will estimate a limiting value, minimum or maximum, rather than the value utilised in the decision. A solution is to match the correct utility function to the results instead.
International Nuclear Information System (INIS)
Azimi, A.; Hannani, S.K.; Farhanieh, B.
2005-01-01
In this article, a comparison between two iterative inverse techniques to solve simultaneously two unknown functions of axisymmetric transient inverse heat conduction problems in semi complex geometries is presented. The multi-block structured grid together with blocked-interface nodes is implemented for geometric decomposition of physical domain. Numerical scheme for solution of transient heat conduction equation is the finite element method with frontal technique to solve algebraic system of discrete equations. The inverse heat conduction problem involves simultaneous unknown time varying heat generation and time-space varying boundary condition estimation. Two parameter-estimation techniques are considered, Levenberg-Marquardt scheme and conjugate gradient method with adjoint problem. Numerically computed exact and noisy data are used for the measured transient temperature data needed in the inverse solution. The results of the present study for a configuration including two joined disks with different heights are compared to those of exact heat source and temperature boundary condition, and show good agreement. (author)
Numerical multistep methods for the efficient solution of quantum mechanics and related problems
International Nuclear Information System (INIS)
Anastassi, Z.A.; Simos, T.E.
2009-01-01
In this paper we present the recent development in the numerical integration of the Schroedinger equation and related systems of ordinary differential equations with oscillatory solutions, such as the N-body problem. We examine several types of multistep methods (explicit, implicit, predictor-corrector, hybrid) and several properties (P-stability, trigonometric fitting of various orders, phase fitting, high phase-lag order, algebraic order). We analyze the local truncation error and the stability of the methods. The error for the Schroedinger equation is also presented, which reveals the relation of the error to the energy. The efficiency of the methods is evaluated through the integration of five problems. Figures are presented and analyzed and some general conclusions are made. Code written in Maple is given for the development of all methods analyzed in this paper. Also the subroutines written in Matlab, that concern the integration of the methods, are presented.
A method of solution of the elastic-plastic thermal stress problem
International Nuclear Information System (INIS)
Rafalski, P.
1975-01-01
The purpose of the work is an improvement of the numerical technique for calculating the thermal stress distribution in an elastic-plastic structural element. The work consists of two parts. In the first a new method of solution of the thermal stress problem for the elastic-plastic body is presented. In the second a particular numerical technique, based on the above method, for calculating the stress and strain fields is proposed. A new mathematical approach consists in treating the stress and strain fields as mathematical objects defined in the space-time domain. The methods commonly applied use the stress and strain fields defined in the space domain and establish the relations between them at a given instant t. They reduce the problem to the system of ordinary differential equations with respect to time, which are usually solved with a step-by-step technique. The new method reduces the problem to the system of nonlinear algebraic equations. In the work the Hilbert space of admissible tensor fields is constructed. This space is the orthogonal sum of two subspaces: of statically admissible and kinematically admissible fields. Two alternative orthogonality conditions, which correspond to the equilibrium and compatibility equations with the appropriate boundary conditions, are derived. The results of the work are to be used for construction of the computer program for calculation the stress and strain fields in the elastic-plastic body with a prescribed temperature field in the interior and appropriate displacement and force conditions on the boundary
Efficient solutions to the NDA-NCA low-order eigenvalue problem
International Nuclear Information System (INIS)
Willert, J. A.; Kelley, C. T.
2013-01-01
Recent algorithmic advances combine moment-based acceleration and Jacobian-Free Newton-Krylov (JFNK) methods to accelerate the computation of the dominant eigenvalue in a k-eigenvalue calculation. In particular, NDA-NCA [1], builds a sequence of low-order (LO) diffusion-based eigenvalue problems in which the solution converges to the true eigenvalue solution. Within NDA-NCA, the solution to the LO k-eigenvalue problem is computed by solving a system of nonlinear equation using some variant of Newton's method. We show that we can speed up the solution to the LO problem dramatically by abandoning the JFNK method and exploiting the structure of the Jacobian matrix. (authors)
Asymptotic Method of Solution for a Problem of Construction of Optimal Gas-Lift Process Modes
Directory of Open Access Journals (Sweden)
Fikrat A. Aliev
2010-01-01
Full Text Available Mathematical model in oil extraction by gas-lift method for the case when the reciprocal value of well's depth represents a small parameter is considered. Problem of optimal mode construction (i.e., construction of optimal program trajectories and controls is reduced to the linear-quadratic optimal control problem with a small parameter. Analytic formulae for determining the solutions at the first-order approximation with respect to the small parameter are obtained. Comparison of the obtained results with known ones on a specific example is provided, which makes it, in particular, possible to use obtained results in realizations of oil extraction problems by gas-lift method.
The Train Driver Recovery Problem - a Set Partitioning Based Model and Solution Method
DEFF Research Database (Denmark)
Rezanova, Natalia Jurjevna; Ryan, David
2010-01-01
The need to recover a train driver schedule occurs during major disruptions in the daily railway operations. Based on data from the Danish passenger railway operator DSB S-tog A/S, a solution method to the train driver recovery problem (TDRP) is developed. The TDRP is formulated as a set...... branching strategy using the depth-first search of the Branch & Bound tree. The LP relaxation of the TDRP possesses strong integer properties. We present test scenarios generated from the historical real-life operations data of DSB S-tog A/S. The numerical results show that all but one tested instances...... partitioning problem. We define a disruption neighbourhood by identifying a small set of drivers and train tasks directly affected by the disruption. Based on the disruption neighbourhood, the TDRP model is formed and solved. If the TDRP solution provides a feasible recovery for the drivers within...
International young physicists' tournament problems & solutions 2014
Gao, Wenli
2016-01-01
International Young Physicists' Tournament (Iypt), is one of the most prestigious international physics contests among high school students. This book is based on the solutions of 2014 Iypt problems. The authors are undergraduate students who participated in the Cupt (Chinese Undergraduate Physics Tournament). It is intended as a college level solution to the challenging open-ended problems. It provides original, quantitative solutions in fulfilling seemingly impossible tasks. This book is not limited to the tasks required by the problems and it is not confined to the models and methods in present literatures. Many of the articles include modification and extension to existing models in references, or derivation and computation based on fundamental physics. This book provides quantitative solutions to practical problems in everyday life. This is a good reference book for undergraduates, advanced high-school students, physics educators and curious public interested in the intriguing phenomena in daily life.
Solution to reinforcement learning problems with artificial potential field
Institute of Scientific and Technical Information of China (English)
XIE Li-juan; XIE Guang-rong; CHEN Huan-wen; LI Xiao-li
2008-01-01
A novel method was designed to solve reinforcement learning problems with artificial potential field. Firstly a reinforcement learning problem was transferred to a path planning problem by using artificial potential field(APF), which was a very appropriate method to model a reinforcement learning problem. Secondly, a new APF algorithm was proposed to overcome the local minimum problem in the potential field methods with a virtual water-flow concept. The performance of this new method was tested by a gridworld problem named as key and door maze. The experimental results show that within 45 trials, good and deterministic policies are found in almost all simulations. In comparison with WIERING's HQ-learning system which needs 20 000 trials for stable solution, the proposed new method can obtain optimal and stable policy far more quickly than HQ-learning. Therefore, the new method is simple and effective to give an optimal solution to the reinforcement learning problem.
Vasil'ev, V. I.; Kardashevsky, A. M.; Popov, V. V.; Prokopev, G. A.
2017-10-01
This article presents results of computational experiment carried out using a finite-difference method for solving the inverse Cauchy problem for a two-dimensional elliptic equation. The computational algorithm involves an iterative determination of the missing boundary condition from the override condition using the conjugate gradient method. The results of calculations are carried out on the examples with exact solutions as well as at specifying an additional condition with random errors are presented. Results showed a high efficiency of the iterative method of conjugate gradients for numerical solution
Hajipour, Mojtaba; Jajarmi, Amin
2018-02-01
Using the Pontryagin's maximum principle for a time-delayed optimal control problem results in a system of coupled two-point boundary-value problems (BVPs) involving both time-advance and time-delay arguments. The analytical solution of this advance-delay two-point BVP is extremely difficult, if not impossible. This paper provides a discrete general form of the numerical solution for the derived advance-delay system by applying a finite difference θ-method. This method is also implemented for the infinite-time horizon time-delayed optimal control problems by using a piecewise version of the θ-method. A matrix formulation and the error analysis of the suggested technique are provided. The new scheme is accurate, fast and very effective for the optimal control of linear and nonlinear time-delay systems. Various types of finite- and infinite-time horizon problems are included to demonstrate the accuracy, validity and applicability of the new technique.
Spline-Interpolation Solution of One Elasticity Theory Problem
Shirakova, Elena A
2011-01-01
The book presents methods of approximate solution of the basic problem of elasticity for special types of solids. Engineers can apply the approximate methods (Finite Element Method, Boundary Element Method) to solve the problems but the application of these methods may not be correct for solids with the certain singularities or asymmetrical boundary conditions. The book is recommended for researchers and professionals working on elasticity modeling. It explains methods of solving elasticity problems for special solids. Approximate methods (Finite Element Method, Boundary Element Method) have b
Directory of Open Access Journals (Sweden)
Dauda GuliburYAKUBU
2012-12-01
Full Text Available Accurate solutions to initial value systems of ordinary differential equations may be approximated efficiently by Runge-Kutta methods or linear multistep methods. Each of these has limitations of one sort or another. In this paper we consider, as a middle ground, the derivation of continuous general linear methods for solution of stiff systems of initial value problems in ordinary differential equations. These methods are designed to combine the advantages of both Runge-Kutta and linear multistep methods. Particularly, methods possessing the property of A-stability are identified as promising methods within this large class of general linear methods. We show that the continuous general linear methods are self-starting and have more ability to solve the stiff systems of ordinary differential equations, than the discrete ones. The initial value systems of ordinary differential equations are solved, for instance, without looking for any other method to start the integration process. This desirable feature of the proposed approach leads to obtaining very high accuracy of the solution of the given problem. Illustrative examples are given to demonstrate the novelty and reliability of the methods.
International Nuclear Information System (INIS)
Kılıç, Emre; Eibert, Thomas F.
2015-01-01
An approach combining boundary integral and finite element methods is introduced for the solution of three-dimensional inverse electromagnetic medium scattering problems. Based on the equivalence principle, unknown equivalent electric and magnetic surface current densities on a closed surface are utilized to decompose the inverse medium problem into two parts: a linear radiation problem and a nonlinear cavity problem. The first problem is formulated by a boundary integral equation, the computational burden of which is reduced by employing the multilevel fast multipole method (MLFMM). Reconstructed Cauchy data on the surface allows the utilization of the Lorentz reciprocity and the Poynting's theorems. Exploiting these theorems, the noise level and an initial guess are estimated for the cavity problem. Moreover, it is possible to determine whether the material is lossy or not. In the second problem, the estimated surface currents form inhomogeneous boundary conditions of the cavity problem. The cavity problem is formulated by the finite element technique and solved iteratively by the Gauss–Newton method to reconstruct the properties of the object. Regularization for both the first and the second problems is achieved by a Krylov subspace method. The proposed method is tested against both synthetic and experimental data and promising reconstruction results are obtained
Energy Technology Data Exchange (ETDEWEB)
Kılıç, Emre, E-mail: emre.kilic@tum.de; Eibert, Thomas F.
2015-05-01
An approach combining boundary integral and finite element methods is introduced for the solution of three-dimensional inverse electromagnetic medium scattering problems. Based on the equivalence principle, unknown equivalent electric and magnetic surface current densities on a closed surface are utilized to decompose the inverse medium problem into two parts: a linear radiation problem and a nonlinear cavity problem. The first problem is formulated by a boundary integral equation, the computational burden of which is reduced by employing the multilevel fast multipole method (MLFMM). Reconstructed Cauchy data on the surface allows the utilization of the Lorentz reciprocity and the Poynting's theorems. Exploiting these theorems, the noise level and an initial guess are estimated for the cavity problem. Moreover, it is possible to determine whether the material is lossy or not. In the second problem, the estimated surface currents form inhomogeneous boundary conditions of the cavity problem. The cavity problem is formulated by the finite element technique and solved iteratively by the Gauss–Newton method to reconstruct the properties of the object. Regularization for both the first and the second problems is achieved by a Krylov subspace method. The proposed method is tested against both synthetic and experimental data and promising reconstruction results are obtained.
Analytic Solution to Shell Boundary – Value Problems
Directory of Open Access Journals (Sweden)
Yu. I. Vinogradov
2015-01-01
Full Text Available Object of research is to find analytical solution to the shell boundary – value problems, i.e. to consider the solution for a class of problems concerning the mechanics of hoop closed shells strain.The objective of work is to create an analytical method to define a stress – strain state of shells under non-axisymmetric loading. Thus, a main goal is to derive the formulas – solutions of the linear ordinary differential equations with variable continuous coefficients.The partial derivative differential equations of mechanics of shells strain by Fourier's method of variables division are reduced to the system of the differential equations with ordinary derivatives. The paper presents the obtained formulas to define solutions of the uniform differential equations and received on their basis formulas to define a particular solution depending on a type of the right parts of the differential equations.The analytical algorithm of the solution of a boundary task uses an approach to transfer the boundary conditions to the randomly chosen point of an interval of changing independent variable through the solution of the canonical matrix ordinary differential equation with the subsequent solution of system of algebraic equations for compatibility of boundary conditions at this point. Efficiency of algorithm is based on the fact that the solution of the ordinary differential equations is defined as the values of Cauchy – Krylova functions, which meet initial arbitrary conditions.The results of researches presented in work are useful to experts in the field of calculus mathematics, dealing with solution of systems of linear ordinary differential equations and creation of effective analytical computing methods to solve shell boundary – value problems.
Penalty methods for the numerical solution of American multi-asset option problems
Nielsen, Bjørn Fredrik; Skavhaug, Ola; Tveito, Aslak
2008-12-01
We derive and analyze a penalty method for solving American multi-asset option problems. A small, non-linear penalty term is added to the Black-Scholes equation. This approach gives a fixed solution domain, removing the free and moving boundary imposed by the early exercise feature of the contract. Explicit, implicit and semi-implicit finite difference schemes are derived, and in the case of independent assets, we prove that the approximate option prices satisfy some basic properties of the American option problem. Several numerical experiments are carried out in order to investigate the performance of the schemes. We give examples indicating that our results are sharp. Finally, the experiments indicate that in the case of correlated underlying assets, the same properties are valid as in the independent case.
The world solution for world problems : the problem, its cause, its solution
León, L.
2002-01-01
The book discusses the main world problem of today, which is the gradual, but lethal change of the soil and atmosphere, the main cause, which is the world-wide overpopulation, and the main solution, which is world government by lottocracy. It is a recipe for the solution of the one and only problem
Grolet, Aurelien; Thouverez, Fabrice
2015-02-01
This paper is devoted to the study of vibration of mechanical systems with geometric nonlinearities. The harmonic balance method is used to derive systems of polynomial equations whose solutions give the frequency component of the possible steady states. Groebner basis methods are used for computing all solutions of polynomial systems. This approach allows to reduce the complete system to an unique polynomial equation in one variable driving all solutions of the problem. In addition, in order to decrease the number of variables, we propose to first work on the undamped system, and recover solution of the damped system using a continuation on the damping parameter. The search for multiple solutions is illustrated on a simple system, where the influence of the retained number of harmonic is studied. Finally, the procedure is applied on a simple cyclic system and we give a representation of the multiple states versus frequency.
A finite volume method for cylindrical heat conduction problems based on local analytical solution
Li, Wang
2012-10-01
A new finite volume method for cylindrical heat conduction problems based on local analytical solution is proposed in this paper with detailed derivation. The calculation results of this new method are compared with the traditional second-order finite volume method. The newly proposed method is more accurate than conventional ones, even though the discretized expression of this proposed method is slightly more complex than the second-order central finite volume method, making it cost more calculation time on the same grids. Numerical result shows that the total CPU time of the new method is significantly less than conventional methods for achieving the same level of accuracy. © 2012 Elsevier Ltd. All rights reserved.
A finite volume method for cylindrical heat conduction problems based on local analytical solution
Li, Wang; Yu, Bo; Wang, Xinran; Wang, Peng; Sun, Shuyu
2012-01-01
A new finite volume method for cylindrical heat conduction problems based on local analytical solution is proposed in this paper with detailed derivation. The calculation results of this new method are compared with the traditional second-order finite volume method. The newly proposed method is more accurate than conventional ones, even though the discretized expression of this proposed method is slightly more complex than the second-order central finite volume method, making it cost more calculation time on the same grids. Numerical result shows that the total CPU time of the new method is significantly less than conventional methods for achieving the same level of accuracy. © 2012 Elsevier Ltd. All rights reserved.
International Nuclear Information System (INIS)
Coelho, Pedro J.
2014-01-01
Many methods are available for the solution of radiative heat transfer problems in participating media. Among these, the discrete ordinates method (DOM) and the finite volume method (FVM) are among the most widely used ones. They provide a good compromise between accuracy and computational requirements, and they are relatively easy to integrate in CFD codes. This paper surveys recent advances on these numerical methods. Developments concerning the grid structure (e.g., new formulations for axisymmetrical geometries, body-fitted structured and unstructured meshes, embedded boundaries, multi-block grids, local grid refinement), the spatial discretization scheme, and the angular discretization scheme are described. Progress related to the solution accuracy, solution algorithm, alternative formulations, such as the modified DOM and FVM, even-parity formulation, discrete-ordinates interpolation method and method of lines, and parallelization strategies is addressed. The application to non-gray media, variable refractive index media, and transient problems is also reviewed. - Highlights: • We survey recent advances in the discrete ordinates and finite volume methods. • Developments in spatial and angular discretization schemes are described. • Progress in solution algorithms and parallelization methods is reviewed. • Advances in the transient solution of the radiative transfer equation are appraised. • Non-gray media and variable refractive index media are briefly addressed
Recursive Monte Carlo method for deep-penetration problems
International Nuclear Information System (INIS)
Goldstein, M.; Greenspan, E.
1980-01-01
The Recursive Monte Carlo (RMC) method developed for estimating importance function distributions in deep-penetration problems is described. Unique features of the method, including the ability to infer the importance function distribution pertaining to many detectors from, essentially, a single M.C. run and the ability to use the history tape created for a representative region to calculate the importance function in identical regions, are illustrated. The RMC method is applied to the solution of two realistic deep-penetration problems - a concrete shield problem and a Tokamak major penetration problem. It is found that the RMC method can provide the importance function distributions, required for importance sampling, with accuracy that is suitable for an efficient solution of the deep-penetration problems considered. The use of the RMC method improved, by one to three orders of magnitude, the solution efficiency of the two deep-penetration problems considered: a concrete shield problem and a Tokamak major penetration problem. 8 figures, 4 tables
Comparison of finite-difference and variational solutions to advection-diffusion problems
International Nuclear Information System (INIS)
Lee, C.E.; Washington, K.E.
1984-01-01
Two numerical solution methods are developed for 1-D time-dependent advection-diffusion problems on infinite and finite domains. Numerical solutions are compared with analytical results for constant coefficients and various boundary conditions. A finite-difference spectrum method is solved exactly in time for periodic boundary conditions by a matrix operator method and exhibits excellent accuracy compared with other methods, especially at late times, where it is also computationally more efficient. Finite-system solutions are determined from a conservational variational principle with cubic spatial trial functions and solved in time by a matrix operator method. Comparisons of problems with few nodes show excellent agreement with analytical solutions and exhibit the necessity of implementing Lagrangian conservational constraints for physically-correct solutions. (author)
Numerical solution of pipe flow problems for generalized Newtonian fluids
International Nuclear Information System (INIS)
Samuelsson, K.
1993-01-01
In this work we study the stationary laminar flow of incompressible generalized Newtonian fluids in a pipe with constant arbitrary cross-section. The resulting nonlinear boundary value problems can be written in a variational formulation and solved using finite elements and the augmented Lagrangian method. The solution of the boundary value problem is obtained by finding a saddle point of the augmented Lagrangian. In the algorithm the nonlinear part of the equations is treated locally and the solution is obtained by iteration between this nonlinear problem and a global linear problem. For the solution of the linear problem we use the SSOR preconditioned conjugate gradient method. The approximating problem is solved on a sequence of adaptively refined grids. A scheme for adjusting the value of the crucial penalization parameter of the augmented Lagrangian is proposed. Applications to pipe flow and a problem from the theory of capacities are given. (author) (34 refs.)
A New Iterative Method for Equilibrium Problems and Fixed Point Problems
Directory of Open Access Journals (Sweden)
Abdul Latif
2013-01-01
Full Text Available Introducing a new iterative method, we study the existence of a common element of the set of solutions of equilibrium problems for a family of monotone, Lipschitz-type continuous mappings and the sets of fixed points of two nonexpansive semigroups in a real Hilbert space. We establish strong convergence theorems of the new iterative method for the solution of the variational inequality problem which is the optimality condition for the minimization problem. Our results improve and generalize the corresponding recent results of Anh (2012, Cianciaruso et al. (2010, and many others.
A new modeling and solution approach for the number partitioning problem
Directory of Open Access Journals (Sweden)
Bahram Alidaee
2005-01-01
Full Text Available The number partitioning problem has proven to be a challenging problem for both exact and heuristic solution methods. We present a new modeling and solution approach that consists of recasting the problem as an unconstrained quadratic binary program that can be solved by efficient metaheuristic methods. Our approach readily accommodates both the common two-subset partition case as well as the more general case of multiple subsets. Preliminary computational experience is presented illustrating the attractiveness of the method.
International Nuclear Information System (INIS)
Oliveira, J.V.P. de; Cardona, A.V.; Vilhena, M.T.M.B. de
2002-01-01
In this work, we present a new approach to solve the one-dimensional time-dependent discrete ordinates problem (S N problem) in a slab. The main idea is based upon the application of the spectral method to the set of S N time-dependent differential equations and solution of the resulting coupling equations by the LTS N method. We report numerical simulations
Noniterative Solution of Some Fermat-Weber Location Problems
Directory of Open Access Journals (Sweden)
Reuven Chen
2011-01-01
Full Text Available The Fermat-Weber problem of optimally locating a service facility in the Euclidean continuous two-dimensional space is usually solved by the iterative process first suggested by Weiszfeld or by later versions thereof. The methods are usually rather efficient, but exceptional problems are described in the literature in which the iterative solution is exceedingly long. These problems are such that the solution either coincides with one of the demand points or nearly coincides with it. We describe a noniterative direct alternative, based on the insight that the gradient components of the individual demand points can be considered as pooling forces with respect to the solution point. It is demonstrated that symmetrical problems can thus be optimally solved with no iterations, in analogy to finding the equilibrium point in statics. These include a well-known ill-conditioned problem and its variants, which can now be easily solved to optimality using geometrical considerations.
International Nuclear Information System (INIS)
Suzuki, Shunichi; Motoshima, Takayuki; Naemura, Yumi; Kubo, Shin; Kanie, Shunji
2009-01-01
The authors develop a numerical code based on Local Discontinuous Galerkin Method for transient groundwater flow and reactive solute transport problems in order to make it possible to do three dimensional performance assessment on radioactive waste repositories at the earliest stage possible. Local discontinuous Galerkin Method is one of mixed finite element methods which are more accurate ones than standard finite element methods. In this paper, the developed numerical code is applied to several problems which are provided analytical solutions in order to examine its accuracy and flexibility. The results of the simulations show the new code gives highly accurate numeric solutions. (author)
Energy Technology Data Exchange (ETDEWEB)
Krukovsky, P G [Institute of Engineering Thermophysics, National Academy of Sciences of Ukraine, Kiev (Ukraine)
1998-12-31
The description of method and software FRIEND which provide a possibility of solution of inverse and inverse design problems on the basis of existing (base) CFD-software for solution of direct problems (in particular, heat-transfer and fluid-flow problems using software PHOENICS) are presented. FRIEND is an independent additional module that widens the operational capacities of the base software unified with this module. This unifying does not require any change or addition to the base software. Interfacing of FRIEND and the base software takes place through input and output files of the base software. A brief description of the computational technique applied for the inverse problem solution, same detailed information on the interfacing of FRIEND and CFD-software and solution results for testing inverse and inverse design problems, obtained using the tandem CFD-software PHOENICS and FRIEND, are presented. (author) 9 refs.
Energy Technology Data Exchange (ETDEWEB)
Krukovsky, P.G. [Institute of Engineering Thermophysics, National Academy of Sciences of Ukraine, Kiev (Ukraine)
1997-12-31
The description of method and software FRIEND which provide a possibility of solution of inverse and inverse design problems on the basis of existing (base) CFD-software for solution of direct problems (in particular, heat-transfer and fluid-flow problems using software PHOENICS) are presented. FRIEND is an independent additional module that widens the operational capacities of the base software unified with this module. This unifying does not require any change or addition to the base software. Interfacing of FRIEND and the base software takes place through input and output files of the base software. A brief description of the computational technique applied for the inverse problem solution, same detailed information on the interfacing of FRIEND and CFD-software and solution results for testing inverse and inverse design problems, obtained using the tandem CFD-software PHOENICS and FRIEND, are presented. (author) 9 refs.
Feehan, Paul M. N.
2017-09-01
We prove existence of solutions to boundary value problems and obstacle problems for degenerate-elliptic, linear, second-order partial differential operators with partial Dirichlet boundary conditions using a new version of the Perron method. The elliptic operators considered have a degeneracy along a portion of the domain boundary which is similar to the degeneracy of a model linear operator identified by Daskalopoulos and Hamilton [9] in their study of the porous medium equation or the degeneracy of the Heston operator [21] in mathematical finance. Existence of a solution to the partial Dirichlet problem on a half-ball, where the operator becomes degenerate on the flat boundary and a Dirichlet condition is only imposed on the spherical boundary, provides the key additional ingredient required for our Perron method. Surprisingly, proving existence of a solution to this partial Dirichlet problem with ;mixed; boundary conditions on a half-ball is more challenging than one might expect. Due to the difficulty in developing a global Schauder estimate and due to compatibility conditions arising where the ;degenerate; and ;non-degenerate boundaries; touch, one cannot directly apply the continuity or approximate solution methods. However, in dimension two, there is a holomorphic map from the half-disk onto the infinite strip in the complex plane and one can extend this definition to higher dimensions to give a diffeomorphism from the half-ball onto the infinite ;slab;. The solution to the partial Dirichlet problem on the half-ball can thus be converted to a partial Dirichlet problem on the slab, albeit for an operator which now has exponentially growing coefficients. The required Schauder regularity theory and existence of a solution to the partial Dirichlet problem on the slab can nevertheless be obtained using previous work of the author and C. Pop [16]. Our Perron method relies on weak and strong maximum principles for degenerate-elliptic operators, concepts of
Schilde, M; Doerner, K F; Hartl, R F
2014-10-01
In urban areas, logistic transportation operations often run into problems because travel speeds change, depending on the current traffic situation. If not accounted for, time-dependent and stochastic travel speeds frequently lead to missed time windows and thus poorer service. Especially in the case of passenger transportation, it often leads to excessive passenger ride times as well. Therefore, time-dependent and stochastic influences on travel speeds are relevant for finding feasible and reliable solutions. This study considers the effect of exploiting statistical information available about historical accidents, using stochastic solution approaches for the dynamic dial-a-ride problem (dynamic DARP). The authors propose two pairs of metaheuristic solution approaches, each consisting of a deterministic method (average time-dependent travel speeds for planning) and its corresponding stochastic version (exploiting stochastic information while planning). The results, using test instances with up to 762 requests based on a real-world road network, show that in certain conditions, exploiting stochastic information about travel speeds leads to significant improvements over deterministic approaches.
Directory of Open Access Journals (Sweden)
Chi-Chang Wang
2013-09-01
Full Text Available This paper seeks to use the proposed residual correction method in coordination with the monotone iterative technique to obtain upper and lower approximate solutions of singularly perturbed non-linear boundary value problems. First, the monotonicity of a non-linear differential equation is reinforced using the monotone iterative technique, then the cubic-spline method is applied to discretize and convert the differential equation into the mathematical programming problems of an inequation, and finally based on the residual correction concept, complex constraint solution problems are transformed into simpler questions of equational iteration. As verified by the four examples given in this paper, the method proposed hereof can be utilized to fast obtain the upper and lower solutions of questions of this kind, and to easily identify the error range between mean approximate solutions and exact solutions.
Numerical solution of electrostatic problems of the accelerator project VICKSI
International Nuclear Information System (INIS)
Janetzki, U.
1975-03-01
In this work, the numerical solution to a few of the electrostatic problems is dealt with which have occured within the framework of the heavy ion accelerator project VICKSI. By means of these selected examples, the versatile applicability of the numerical method is to be demonstrated, and simultaneously assistance is given for the solution of similar problems. The numerical process for solving ion-optics problems consists generally of two steps. In the first step, the potential distribution for a given boundary value problem is iteratively calculated for the Laplace equation, and then the image characteristics of the electostatic lense are investigated using the Raytrace method. (orig./LH) [de
Numerical solutions of a three-point boundary value problem with an ...
African Journals Online (AJOL)
Numerical solutions of a three-point boundary value problem with an integral condition for a third-order partial differential equation by using Laplace transform method Solutions numeriques d'un probleme pour une classe d'equations differentielles d'ordr.
Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques
Directory of Open Access Journals (Sweden)
Xiaoqian Sun
2017-01-01
Full Text Available Hub location problems have been studied by many researchers for almost 30 years, and, accordingly, various solution methods have been proposed. In this paper, we implement and evaluate several widely used methods for solving five standard hub location problems. To assess the scalability and solution qualities of these methods, three well-known datasets are used as case studies: Turkish Postal System, Australia Post, and Civil Aeronautics Board. Classical problems in small networks can be solved efficiently using CPLEX because of their low complexity. Genetic algorithms perform well for solving three types of single allocation problems, since the problem formulations can be neatly encoded with chromosomes of reasonable size. Lagrangian relaxation is the only technique that solves reliable multiple allocation problems in large networks. We believe that our work helps other researchers to get an overview on the best solution techniques for the problems investigated in our study and also stipulates further interest on cross-comparing solution techniques for more expressive problem formulations.
On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems
Directory of Open Access Journals (Sweden)
El-Sayed M. E. Mostafa
2017-01-01
Full Text Available The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.
Tsiveriotis, K.; Brown, R. A.
1993-01-01
A new method is presented for the solution of free-boundary problems using Lagrangian finite element approximations defined on locally refined grids. The formulation allows for direct transition from coarse to fine grids without introducing non-conforming basis functions. The calculation of elemental stiffness matrices and residual vectors are unaffected by changes in the refinement level, which are accounted for in the loading of elemental data to the global stiffness matrix and residual vector. This technique for local mesh refinement is combined with recently developed mapping methods and Newton's method to form an efficient algorithm for the solution of free-boundary problems, as demonstrated here by sample calculations of cellular interfacial microstructure during directional solidification of a binary alloy.
ASP.NET MVC 4 recipes a problem-solution approach
Ciliberti, John
2013-01-01
ASP.NET MVC 4 Recipes is a practical guide for developers creating modern web applications, cutting through the complexities of ASP.NET, jQuery, Knockout.js and HTML 5 to provide straightforward solutions to common web development problems using proven methods based on best practices. The problem-solution approach gets you in, out, and back to work quickly while deepening your understanding of the underlying platform and how to develop with it. Author John Ciliberti guides you through the framework and development tools, presenting typical challenges, along with code solutions and clear, conci
Directory of Open Access Journals (Sweden)
A. L. Lapikov
2014-01-01
Full Text Available This paper considers creation of methods for research of multi-section manipulators of parallel structure. To solve this task it is necessary, firstly, to carry out generalization, systematization, and enhancement of existing models of platform manipulators with six degrees of freedom; secondly, it is necessary to modify previously suggested methods for solving the kinematic tasks for the specified type of manipulation mechanisms. The paper presents detailed domain analysis, describes major issues appearing in the course of research, and suggests basic methods of their solution. The paper demonstrates the necessity for modification of existing models through supplementing new parameters. Modification and generalization of the previously suggested method for solution of direct kinematic problem for the specified type of manipulators were carried out. Method for solution of this problem consists in establishing the dependence of functional relationship of Cartesian coordinates and orientation of the moving platform center on the values of generalized coordinates of manipulator (in case of platform manipulators, these are the lengths of telescopic legs connecting the base and the moving platform of the manipulator. The method is created in such a way that solution of direct kinematic problem results in finding of the analytical equation of the plane where the moving platform lies. The equation of the required plane is described through three points (attachment points of the moving platform joints. To define coordinate values of the joints, the system of nine non-linear equations is generated. It should be noted that the system of equations is composed of one-type equations with the same type of nonlinearity. The physical meaning of all the nine equations of the system is Euclidean distance between the points of the manipulator. The location and orientation of the manipulator are depicted as a homogenous transformation matrix. Vectors of translation
Problem solution as a guided activity with Mexican schoolchildren
Directory of Open Access Journals (Sweden)
Solovieva, Yulia
2016-09-01
Full Text Available The goal of the present study was to describe the organization of a guided activity for problem solution in primary school. The method, which was applied to mathematical problems, allowed us to propose a specific orientation for the proper solution of arithmetic problems by pupils. The study was based on the activity-theory approach applied to the process of teaching and learning. It was carried out with pupils in the second grade of a private school in the city of Puebla (Mexico. The method was used in the classroom during 30 school sessions of 1 hour per day. The methodology of formative experiment was used in the study. Qualitative analysis of the pedagogical process of teaching and learning was conducted. The results show that, after participation in the formative process, the schoolchildren became able to identify essential elements, data, and all relationships among them in order to solve mathematical problems. At the end of the program the verbal external level was raised for the process of orientation and the solution of problems together with the ability to use logarithms independently. We conclude that orientation, as a guided form of activity in primary school, is essential for the development of the ability to analyze problems.
Positive solutions for a nonlocal boundary-value problem with vector-valued response
Directory of Open Access Journals (Sweden)
Andrzej Nowakowski
2002-05-01
Full Text Available Using variational methods, we study the existence of positive solutions for a nonlocal boundary-value problem with vector-valued response. We develop duality and variational principles for this problem and present a numerical version which enables the approximation of solutions and gives a measure of a duality gap between primal and dual functional for approximate solutions for this problem.
Penkov, V. B.; Ivanychev, D. A.; Novikova, O. S.; Levina, L. V.
2018-03-01
The article substantiates the possibility of building full parametric analytical solutions of mathematical physics problems in arbitrary regions by means of computer systems. The suggested effective means for such solutions is the method of boundary states with perturbations, which aptly incorporates all parameters of an orthotropic medium in a general solution. We performed check calculations of elastic fields of an anisotropic rectangular region (test and calculation problems) for a generalized plane stress state.
International Nuclear Information System (INIS)
Taboada, Heidi A.; Baheranwala, Fatema; Coit, David W.; Wattanapongsakorn, Naruemon
2007-01-01
For multiple-objective optimization problems, a common solution methodology is to determine a Pareto optimal set. Unfortunately, these sets are often large and can become difficult to comprehend and consider. Two methods are presented as practical approaches to reduce the size of the Pareto optimal set for multiple-objective system reliability design problems. The first method is a pseudo-ranking scheme that helps the decision maker select solutions that reflect his/her objective function priorities. In the second approach, we used data mining clustering techniques to group the data by using the k-means algorithm to find clusters of similar solutions. This provides the decision maker with just k general solutions to choose from. With this second method, from the clustered Pareto optimal set, we attempted to find solutions which are likely to be more relevant to the decision maker. These are solutions where a small improvement in one objective would lead to a large deterioration in at least one other objective. To demonstrate how these methods work, the well-known redundancy allocation problem was solved as a multiple objective problem by using the NSGA genetic algorithm to initially find the Pareto optimal solutions, and then, the two proposed methods are applied to prune the Pareto set
Solution of Contact Problems for Nonlinear Gao Beam and Obstacle
Directory of Open Access Journals (Sweden)
J. Machalová
2015-01-01
Full Text Available Contact problem for a large deformed beam with an elastic obstacle is formulated, analyzed, and numerically solved. The beam model is governed by a nonlinear fourth-order differential equation developed by Gao, while the obstacle is considered as the elastic foundation of Winkler’s type in some distance under the beam. The problem is static without a friction and modeled either using Signorini conditions or by means of normal compliance contact conditions. The problems are then reformulated as optimal control problems which is useful both for theoretical aspects and for solution methods. Discretization is based on using the mixed finite element method with independent discretization and interpolations for foundation and beam elements. Numerical examples demonstrate usefulness of the presented solution method. Results for the nonlinear Gao beam are compared with results for the classical Euler-Bernoulli beam model.
Algebraic solution of the synthesis problem for coded sequences
International Nuclear Information System (INIS)
Leukhin, Anatolii N
2005-01-01
The algebraic solution of a 'complex' problem of synthesis of phase-coded (PC) sequences with the zero level of side lobes of the cyclic autocorrelation function (ACF) is proposed. It is shown that the solution of the synthesis problem is connected with the existence of difference sets for a given code dimension. The problem of estimating the number of possible code combinations for a given code dimension is solved. It is pointed out that the problem of synthesis of PC sequences is related to the fundamental problems of discrete mathematics and, first of all, to a number of combinatorial problems, which can be solved, as the number factorisation problem, by algebraic methods by using the theory of Galois fields and groups. (fourth seminar to the memory of d.n. klyshko)
Numerical solution of large nonlinear boundary value problems by quadratic minimization techniques
International Nuclear Information System (INIS)
Glowinski, R.; Le Tallec, P.
1984-01-01
The objective of this paper is to describe the numerical treatment of large highly nonlinear two or three dimensional boundary value problems by quadratic minimization techniques. In all the different situations where these techniques were applied, the methodology remains the same and is organized as follows: 1) derive a variational formulation of the original boundary value problem, and approximate it by Galerkin methods; 2) transform this variational formulation into a quadratic minimization problem (least squares methods) or into a sequence of quadratic minimization problems (augmented lagrangian decomposition); 3) solve each quadratic minimization problem by a conjugate gradient method with preconditioning, the preconditioning matrix being sparse, positive definite, and fixed once for all in the iterative process. This paper will illustrate the methodology above on two different examples: the description of least squares solution methods and their application to the solution of the unsteady Navier-Stokes equations for incompressible viscous fluids; the description of augmented lagrangian decomposition techniques and their application to the solution of equilibrium problems in finite elasticity
Solution of large nonlinear time-dependent problems using reduced coordinates
International Nuclear Information System (INIS)
Mish, K.D.
1987-01-01
This research is concerned with the idea of reducing a large time-dependent problem, such as one obtained from a finite-element discretization, down to a more manageable size while preserving the most-important physical behavior of the solution. This reduction process is motivated by the concept of a projection operator on a Hilbert Space, and leads to the Lanczos Algorithm for generation of approximate eigenvectors of a large symmetric matrix. The Lanczos Algorithm is then used to develop a reduced form of the spatial component of a time-dependent problem. The solution of the remaining temporal part of the problem is considered from the standpoint of numerical-integration schemes in the time domain. All of these theoretical results are combined to motivate the proposed reduced coordinate algorithm. This algorithm is then developed, discussed, and compared to related methods from the mechanics literature. The proposed reduced coordinate method is then applied to the solution of some representative problems in mechanics. The results of these problems are discussed, conclusions are drawn, and suggestions are made for related future research
Efficient solution of a multi objective fuzzy transportation problem
Vidhya, V.; Ganesan, K.
2018-04-01
In this paper we present a methodology for the solution of multi-objective fuzzy transportation problem when all the cost and time coefficients are trapezoidal fuzzy numbers and the supply and demand are crisp numbers. Using a new fuzzy arithmetic on parametric form of trapezoidal fuzzy numbers and a new ranking method all efficient solutions are obtained. The proposed method is illustrated with an example.
FAST LABEL: Easy and efficient solution of joint multi-label and estimation problems
Sundaramoorthi, Ganesh
2014-06-01
We derive an easy-to-implement and efficient algorithm for solving multi-label image partitioning problems in the form of the problem addressed by Region Competition. These problems jointly determine a parameter for each of the regions in the partition. Given an estimate of the parameters, a fast approximate solution to the multi-label sub-problem is derived by a global update that uses smoothing and thresholding. The method is empirically validated to be robust to fine details of the image that plague local solutions. Further, in comparison to global methods for the multi-label problem, the method is more efficient and it is easy for a non-specialist to implement. We give sample Matlab code for the multi-label Chan-Vese problem in this paper! Experimental comparison to the state-of-the-art in multi-label solutions to Region Competition shows that our method achieves equal or better accuracy, with the main advantage being speed and ease of implementation.
A numerical method for finding sign-changing solutions of superlinear Dirichlet problems
Energy Technology Data Exchange (ETDEWEB)
Neuberger, J.M.
1996-12-31
In a recent result it was shown via a variational argument that a class of superlinear elliptic boundary value problems has at least three nontrivial solutions, a pair of one sign and one which sign changes exactly once. These three and all other nontrivial solutions are saddle points of an action functional, and are characterized as local minima of that functional restricted to a codimension one submanifold of the Hilbert space H-0-1-2, or an appropriate higher codimension subset of that manifold. In this paper, we present a numerical Sobolev steepest descent algorithm for finding these three solutions.
International Nuclear Information System (INIS)
Lubuma, M.S.
1991-05-01
The non uniquely solvable Radon boundary integral equation for the two-dimensional Stokes-Dirichlet problem on a non smooth domain is transformed into a well posed one by a suitable compact perturbation of the velocity double layer potential operator. The solution to the modified equation is decomposed into a regular part and a finite linear combination of intrinsic singular functions whose coefficients are computed from explicit formulae. Using these formulae, the classical collocation method, defined by continuous piecewise linear vector-valued basis functions, which converges slowly because of the lack of regularity of the solution, is improved into a collocation dual singular function method with optimal rates of convergence for the solution and for the coefficients of singularities. (author). 34 refs
DeBonis, James R.
2013-01-01
A computational fluid dynamics code that solves the compressible Navier-Stokes equations was applied to the Taylor-Green vortex problem to examine the code s ability to accurately simulate the vortex decay and subsequent turbulence. The code, WRLES (Wave Resolving Large-Eddy Simulation), uses explicit central-differencing to compute the spatial derivatives and explicit Low Dispersion Runge-Kutta methods for the temporal discretization. The flow was first studied and characterized using Bogey & Bailley s 13-point dispersion relation preserving (DRP) scheme. The kinetic energy dissipation rate, computed both directly and from the enstrophy field, vorticity contours, and the energy spectra are examined. Results are in excellent agreement with a reference solution obtained using a spectral method and provide insight into computations of turbulent flows. In addition the following studies were performed: a comparison of 4th-, 8th-, 12th- and DRP spatial differencing schemes, the effect of the solution filtering on the results, the effect of large-eddy simulation sub-grid scale models, and the effect of high-order discretization of the viscous terms.
Kutepov, A. A.; Kunze, D.; Hummer, D. G.; Rybicki, G. B.
1991-01-01
An iterative method based on the use of approximate transfer operators, which was designed initially to solve multilevel NLTE line formation problems in stellar atmospheres, is adapted and applied to the solution of the NLTE molecular band radiative transfer in planetary atmospheres. The matrices to be constructed and inverted are much smaller than those used in the traditional Curtis matrix technique, which makes possible the treatment of more realistic problems using relatively small computers. This technique converges much more rapidly than straightforward iteration between the transfer equation and the equations of statistical equilibrium. A test application of this new technique to the solution of NLTE radiative transfer problems for optically thick and thin bands (the 4.3 micron CO2 band in the Venusian atmosphere and the 4.7 and 2.3 micron CO bands in the earth's atmosphere) is described.
Iterative solution to the optimal poison management problem in pressurized water reactors
International Nuclear Information System (INIS)
Colletti, J.P.; Levine, S.H.; Lewis, J.B.
1983-01-01
A new method for solving the optimal poison management problem for a multiregion pressurized water reactor has been developed. The optimization objective is to maximize the end-of-cycle core excess reactivity for any given beginning-of-cycle fuel loading. The problem is treated as an optimal control problem with the region burnup and control absorber concentrations acting as the state and control variables, respectively. Constraints are placed on the power peaking, soluble boron concentration, and control absorber concentrations. The solution method consists of successive relinearizations of the system equations resulting in a sequence of nonlinear programming problems whose solutions converge to the desired optimal control solution. Application of the method to several test problems based on a simplified three-region reactor suggests a bang-bang optimal control strategy with the peak power location switching between the inner and outer regions of the core and the critical soluble boron concentration as low as possible throughout the cycle
Directory of Open Access Journals (Sweden)
Nahed S. Hussein
2014-01-01
Full Text Available A numerical boundary integral scheme is proposed for the solution to the system of eld equations of plane. The stresses are prescribed on one-half of the circle, while the displacements are given. The considered problem with mixed boundary conditions in the circle is replaced by two problems with homogeneous boundary conditions, one of each type, having a common solution. The equations are reduced to a system of boundary integral equations, which is then discretized in the usual way, and the problem at this stage is reduced to the solution to a rectangular linear system of algebraic equations. The unknowns in this system of equations are the boundary values of four harmonic functions which define the full elastic solution and the unknown boundary values of stresses or displacements on proper parts of the boundary. On the basis of the obtained results, it is inferred that a stress component has a singularity at each of the two separation points, thought to be of logarithmic type. The results are discussed and boundary plots are given. We have also calculated the unknown functions in the bulk directly from the given boundary conditions using the boundary collocation method. The obtained results in the bulk are discussed and three-dimensional plots are given. A tentative form for the singular solution is proposed and the corresponding singular stresses and displacements are plotted in the bulk. The form of the singular tangential stress is seen to be compatible with the boundary values obtained earlier. The efficiency of the used numerical schemes is discussed.
Calculus problems and solutions
Ginzburg, Abraham
2011-01-01
Ideal for self-instruction as well as for classroom use, this text helps students improve their understanding and problem-solving skills in analysis, analytic geometry, and higher algebra. More than 1,200 problems appear in the text, with concise explanations of the basic notions and theorems to be used in their solution. Many are followed by complete answers; solutions for the others appear at the end of the book. Topics include sequences, functions of a single variable, limit of a function, differential calculus for functions of a single variable, fundamental theorems and applications of dif
Entropy landscape and non-Gibbs solutions in constraint satisfaction problems
International Nuclear Information System (INIS)
Dall'Asta, L.; Ramezanpour, A.; Zecchina, R.
2008-05-01
We study the entropy landscape of solutions for the bicoloring problem in random graphs, a representative difficult constraint satisfaction problem. Our goal is to classify which type of clusters of solutions are addressed by different algorithms. In the first part of the study we use the cavity method to obtain the number of clusters with a given internal entropy and determine the phase diagram of the problem, e.g. dynamical, rigidity and SAT-UNSAT transitions. In the second part of the paper we analyze different algorithms and locate their behavior in the entropy landscape of the problem. For instance we show that a smoothed version of a decimation strategy based on Belief Propagation is able to find solutions belonging to sub-dominant clusters even beyond the so called rigidity transition where the thermodynamically relevant clusters become frozen. These non-equilibrium solutions belong to the most probable unfrozen clusters. (author)
Positive Solutions of Two-Point Boundary Value Problems for Monge-Ampère Equations
Directory of Open Access Journals (Sweden)
Baoqiang Yan
2015-01-01
Full Text Available This paper considers the following boundary value problem: ((-u'(tn'=ntn-1f(u(t, 01 is odd. We establish the method of lower and upper solutions for some boundary value problems which generalizes the above equations and using this method we present a necessary and sufficient condition for the existence of positive solutions to the above boundary value problem and some sufficient conditions for the existence of positive solutions.
Directory of Open Access Journals (Sweden)
Pratibha Joshi
2014-12-01
Full Text Available In this paper, we have achieved high order solution of a three dimensional nonlinear diffusive-convective problem using modified variational iteration method. The efficiency of this approach has been shown by solving two examples. All computational work has been performed in MATHEMATICA.
On solution to the problem of criticality
International Nuclear Information System (INIS)
Kyncl, Jan
2012-05-01
The problem of criticality for the neutron transport equation was treated. The problem was examined in Lebesgue space L ∞ and was based on some basic assumptions, which are sufficiently general and are in agreement with the spatial behaviour of both temperature and atomic densities of the materials as well as with the properties of all known models of neutron reactions with the medium. The criticality problem was transformed to one of determining the time-asymptotic behaviour of the solution with an initial condition. The initial-value problem was solved numerically by the Monte Carlo method, for which a specific random process and a random variable were constructed
Ingenious mathematical problems and methods
Graham, Louis A
2013-01-01
Collection of 100 of the best submissions to a math puzzle column features problems in engineering situations, logic, number theory, and geometry. Most solutions include details of several different methods.
Modelling and solution of contact problem for infinite plate and cross-shaped embedment
Directory of Open Access Journals (Sweden)
O.B. Kozin
2016-09-01
Full Text Available Development of efficient methods of determination of an intense-strained state of thin-walled constructional designs with inclusions, reinforcements and other stress raisers is an important problem both with theoretical, and from the practical point of view, considering their wide practical application. Aim: The aim of this research is to develop the analytical mathematical method of studying of an intense-strained state of infinite plate with cross-shaped embedment at a bend. Materials and Methods: The method of boundary elements is an efficient way of the boundary value problems solution for systems of differential equations. The methods based on boundary integral equations get wide application in many branches of science and technique, calculation of plates and shells. One of methods of solution of a numerous class of the integral equations and systems arising on the basis of a method of boundary integral equations is the analytical method of construction of these equations and systems to Riemann problems with their forthcoming decision. Results: The integral equation for the analysis of deflections and the analysis of an intense-strained state of a thin rigid plate with rigid cross-shaped embedment is received. The precise solution of this boundary value problem is received by reduction to a Riemann problem and its forthcoming solution. An asymptotical behavior of contact efforts at the ends of embedment is investigated.
Solution of the Lambda modes problem of a nuclear power reactor using an h–p finite element method
International Nuclear Information System (INIS)
Vidal-Ferrandiz, A.; Fayez, R.; Ginestar, D.; Verdú, G.
2014-01-01
Highlights: • An hp finite element method is proposed for the Lambda modes problem of a nuclear reactor. • Different strategies can be implemented for increasing the accuracy of the solutions. • 2D and 3D benchmarks have been studied obtaining accurate results. - Abstract: Lambda modes of a nuclear power reactor have interest in reactor physics since they have been used to develop modal methods and to study BWR reactor instabilities. An h–p-Adaptation finite element method has been implemented to compute the dominant modes the fundamental mode and the next subcritical modes of a nuclear reactor. The performance of this method has been studied in three benchmark problems, a homogeneous 2D reactor, the 2D BIBLIS reactor and the 3D IAEA reactor
Numerical solution of non-linear diffusion problems
International Nuclear Information System (INIS)
Carmen, A. del; Ferreri, J.C.
1998-01-01
This paper presents a method for the numerical solution of non-linear diffusion problems using finite-differences in moving grids. Due to the presence of steep fronts in the solution domain and to the presence of advective terms originating in the grid movement, an implicit TVD scheme, first order in time and second order in space has been developed. Some algebraic details of the derivation are given. Results are shown for the pure advection of a scalar as a test case and an example dealing with the slow spreading of viscous fluids over plane surfaces. The agreement between numerical and analytical solutions is excellent. (author). 8 refs., 3 figs
Multigrid methods for S/sub N/ problems
International Nuclear Information System (INIS)
Nowak, P.F.; Larsen, E.W.; Martin, W.R.
1987-01-01
It has long been known that the standard source iteration (SI) method for obtaining iterative solutions of S/sub N/ problems is very slowly converging in optically thick regions with low absorption. The rebalance and diffusion synthetic acceleration (DSA) methods are generalizations of SI that have been developed to accelerate convergence, but neither of these methods has been completely successful. In particular, the rebalance method tends to become unstable in problems where it is needed most (problems with high scattering ratios c = 1), while the DSA method, to be implemented in a stable fashion, requires the solution of a particular system of acceleration equations, and this has been done efficiently in two-dimensional geometries only for the diamond difference S/sub N/ equations. This paper discusses another extension of the SI method, namely, SI combined with the spatial multigrid algorithm (SIMG). This appears to be a viable way to accelerate many S/sub N/ problems in multidimensional geometries, provided the finest mesh consists of cells that are not optically thick
Analytical solutions to matrix diffusion problems
Energy Technology Data Exchange (ETDEWEB)
Kekäläinen, Pekka, E-mail: pekka.kekalainen@helsinki.fi [Laboratory of Radiochemistry, Department of Chemistry, P.O. Box 55, FIN-00014 University of Helsinki (Finland)
2014-10-06
We report an analytical method to solve in a few cases of practical interest the equations which have traditionally been proposed for the matrix diffusion problem. In matrix diffusion, elements dissolved in ground water can penetrate the porous rock surronuding the advective flow paths. In the context of radioactive waste repositories this phenomenon provides a mechanism by which the area of rock surface in contact with advecting elements is greatly enhanced, and can thus be an important delay mechanism. The cases solved are relevant for laboratory as well for in situ experiments. Solutions are given as integral representations well suited for easy numerical solution.
Solution of a Complex Least Squares Problem with Constrained Phase.
Bydder, Mark
2010-12-30
The least squares solution of a complex linear equation is in general a complex vector with independent real and imaginary parts. In certain applications in magnetic resonance imaging, a solution is desired such that each element has the same phase. A direct method for obtaining the least squares solution to the phase constrained problem is described.
Iterative methods for tomography problems: implementation to a cross-well tomography problem
Karadeniz, M. F.; Weber, G. W.
2018-01-01
The velocity distribution between two boreholes is reconstructed by cross-well tomography, which is commonly used in geology. In this paper, iterative methods, Kaczmarz’s algorithm, algebraic reconstruction technique (ART), and simultaneous iterative reconstruction technique (SIRT), are implemented to a specific cross-well tomography problem. Convergence to the solution of these methods and their CPU time for the cross-well tomography problem are compared. Furthermore, these three methods for this problem are compared for different tolerance values.
Fymat, A. L.
1976-01-01
The paper studies the inversion of the radiative transfer equation describing the interaction of electromagnetic radiation with atmospheric aerosols. The interaction can be considered as the propagation in the aerosol medium of two light beams: the direct beam in the line-of-sight attenuated by absorption and scattering, and the diffuse beam arising from scattering into the viewing direction, which propagates more or less in random fashion. The latter beam has single scattering and multiple scattering contributions. In the former case and for single scattering, the problem is reducible to first-kind Fredholm equations, while for multiple scattering it is necessary to invert partial integrodifferential equations. A nonlinear minimization search method, applicable to the solution of both types of problems has been developed, and is applied here to the problem of monitoring aerosol pollution, namely the complex refractive index and size distribution of aerosol particles.
D'Ambrosio, Raffaele; Moccaldi, Martina; Paternoster, Beatrice
2018-05-01
In this paper, an adapted numerical scheme for reaction-diffusion problems generating periodic wavefronts is introduced. Adapted numerical methods for such evolutionary problems are specially tuned to follow prescribed qualitative behaviors of the solutions, making the numerical scheme more accurate and efficient as compared with traditional schemes already known in the literature. Adaptation through the so-called exponential fitting technique leads to methods whose coefficients depend on unknown parameters related to the dynamics and aimed to be numerically computed. Here we propose a strategy for a cheap and accurate estimation of such parameters, which consists essentially in minimizing the leading term of the local truncation error whose expression is provided in a rigorous accuracy analysis. In particular, the presented estimation technique has been applied to a numerical scheme based on combining an adapted finite difference discretization in space with an implicit-explicit time discretization. Numerical experiments confirming the effectiveness of the approach are also provided.
Analytical methods for heat transfer and fluid flow problems
Weigand, Bernhard
2015-01-01
This book describes useful analytical methods by applying them to real-world problems rather than solving the usual over-simplified classroom problems. The book demonstrates the applicability of analytical methods even for complex problems and guides the reader to a more intuitive understanding of approaches and solutions. Although the solution of Partial Differential Equations by numerical methods is the standard practice in industries, analytical methods are still important for the critical assessment of results derived from advanced computer simulations and the improvement of the underlying numerical techniques. Literature devoted to analytical methods, however, often focuses on theoretical and mathematical aspects and is therefore useless to most engineers. Analytical Methods for Heat Transfer and Fluid Flow Problems addresses engineers and engineering students. The second edition has been updated, the chapters on non-linear problems and on axial heat conduction problems were extended. And worked out exam...
Ishida, Junichi
1997-01-01
Examines the effects of a teaching strategy in which fifth-grade students evaluated the strengths or weaknesses of solution methods to pattern finding problems, including an experimental and control group each consisting of 34 elementary students, in Japan. The experimental group showed a significantly better performance on the retention test…
Sterilization of solutions for parenterals products. Problem analysis
Directory of Open Access Journals (Sweden)
Yanelys Montes-González
2017-09-01
Full Text Available The solutions for the formulation of parenteral products must be sterile before the aseptic formulation process. For this reason, different methods of sterilization referred in the literature are analyzed. Thermodynamic criteria that rule the sterilization are presented. Furthermore, previous experiences in the sterilization of solutions for the formulation of parental products in an autoclave are analyzed, that take large time of processing and only low volumes of solution can be handled. Using jacketed stirred tanks for the sterilization may solve the problem and, therefore, criteria for the design of the later that allow to process high volumes of solution for the formulation of parenteral products are shown.
Efficient Solutions to Two-Party and Multiparty Millionaires’ Problem
Directory of Open Access Journals (Sweden)
Xin Liu
2017-01-01
Full Text Available The millionaires’ problem is the basis of secure multiparty computation and has many applications. Using a vectorization method and the Paillier encryption scheme, we first propose a secure two-party solution to the millionaires’ problem, which can determine x=y, xy in one execution. Subsequently, using the vectorization and secret splitting methods, we propose an information-theoretically secure protocol to solve the multiparty millionaires’ problem (a.k.a. secure sorting problem, and this protocol can resist collusion attacks. We analyze the accuracy and security of our protocols in the semihonest model and compare the computational and communication complexities between the proposed protocols and the existing ones.
Nodal methods for problems in fluid mechanics and neutron transport
International Nuclear Information System (INIS)
Azmy, Y.Y.
1985-01-01
A new high-accuracy, coarse-mesh, nodal integral approach is developed for the efficient numerical solution of linear partial differential equations. It is shown that various special cases of this general nodal integral approach correspond to several high efficiency nodal methods developed recently for the numerical solution of neutron diffusion and neutron transport problems. The new approach is extended to the nonlinear Navier-Stokes equations of fluid mechanics; its extension to these equations leads to a new computational method, the nodal integral method which is implemented for the numerical solution of these equations. Application to several test problems demonstrates the superior computational efficiency of this new method over previously developed methods. The solutions obtained for several driven cavity problems are compared with the available experimental data and are shown to be in very good agreement with experiment. Additional comparisons also show that the coarse-mesh, nodal integral method results agree very well with the results of definitive ultra-fine-mesh, finite-difference calculations for the driven cavity problem up to fairly high Reynolds numbers
Solutions of the Noh Problem for Various Equations of State Using Lie Groups
International Nuclear Information System (INIS)
Axford, R.A.
1998-01-01
A method for developing invariant equations of state for which solutions of the Noh problem will exist is developed. The ideal gas equation of state is shown to be a special case of the general method. Explicit solutions of the Noh problem in planar, cylindrical and spherical geometry are determined for a Mie-Gruneisen and the stiff gas equation of state
International Nuclear Information System (INIS)
Kuddusi, Luetfullah; Denton, Jesse C.
2007-01-01
The constructal solution for cooling of electronics requires solution of a fundamental heat conduction problem in a composite slab composed of a heat generating slab and a thin strip of high conductivity material that is responsible for discharging the generated heat to a heat sink located at one end of the strip. The fundamental 2D heat conduction problem is solved analytically by applying an integral transform method. The analytical solution is then employed in a constructal solution, following Bejan, for cooling of electronics. The temperature and heat flux distributions of the elemental heat generating slabs are assumed to be the same as those of the analytical solution in all the elemental volumes and the high conductivity strips distributed in the different constructs. Although the analytical solution of the fundamental 2D heat conduction problem improves the accuracy of the distributions in the elemental slabs, the results following Bejan's strategy do not affirm the accuracy of Bejan's constructal solution itself as applied to this problem of cooling of electronics. Several different strategies are possible for developing a constructal solution to this problem as is indicated
Application of collocation meshless method to eigenvalue problem
International Nuclear Information System (INIS)
Saitoh, Ayumu; Matsui, Nobuyuki; Itoh, Taku; Kamitani, Atsushi; Nakamura, Hiroaki
2012-01-01
The numerical method for solving the nonlinear eigenvalue problem has been developed by using the collocation Element-Free Galerkin Method (EFGM) and its performance has been numerically investigated. The results of computations show that the approximate solution of the nonlinear eigenvalue problem can be obtained stably by using the developed method. Therefore, it can be concluded that the developed method is useful for solving the nonlinear eigenvalue problem. (author)
Computing group cardinality constraint solutions for logistic regression problems.
Zhang, Yong; Kwon, Dongjin; Pohl, Kilian M
2017-01-01
We derive an algorithm to directly solve logistic regression based on cardinality constraint, group sparsity and use it to classify intra-subject MRI sequences (e.g. cine MRIs) of healthy from diseased subjects. Group cardinality constraint models are often applied to medical images in order to avoid overfitting of the classifier to the training data. Solutions within these models are generally determined by relaxing the cardinality constraint to a weighted feature selection scheme. However, these solutions relate to the original sparse problem only under specific assumptions, which generally do not hold for medical image applications. In addition, inferring clinical meaning from features weighted by a classifier is an ongoing topic of discussion. Avoiding weighing features, we propose to directly solve the group cardinality constraint logistic regression problem by generalizing the Penalty Decomposition method. To do so, we assume that an intra-subject series of images represents repeated samples of the same disease patterns. We model this assumption by combining series of measurements created by a feature across time into a single group. Our algorithm then derives a solution within that model by decoupling the minimization of the logistic regression function from enforcing the group sparsity constraint. The minimum to the smooth and convex logistic regression problem is determined via gradient descent while we derive a closed form solution for finding a sparse approximation of that minimum. We apply our method to cine MRI of 38 healthy controls and 44 adult patients that received reconstructive surgery of Tetralogy of Fallot (TOF) during infancy. Our method correctly identifies regions impacted by TOF and generally obtains statistically significant higher classification accuracy than alternative solutions to this model, i.e., ones relaxing group cardinality constraints. Copyright © 2016 Elsevier B.V. All rights reserved.
Directory of Open Access Journals (Sweden)
Shoubin Wang
2017-01-01
Full Text Available The compound variable inverse problem which comprises boundary temperature distribution and surface convective heat conduction coefficient of two-dimensional steady heat transfer system with inner heat source is studied in this paper applying the conjugate gradient method. The introduction of complex variable to solve the gradient matrix of the objective function obtains more precise inversion results. This paper applies boundary element method to solve the temperature calculation of discrete points in forward problems. The factors of measuring error and the number of measuring points zero error which impact the measurement result are discussed and compared with L-MM method in inverse problems. Instance calculation and analysis prove that the method applied in this paper still has good effectiveness and accuracy even if measurement error exists and the boundary measurement points’ number is reduced. The comparison indicates that the influence of error on the inversion solution can be minimized effectively using this method.
Directory of Open Access Journals (Sweden)
Mehmet Tarik Atay
2013-01-01
Full Text Available The Variational Iteration Method (VIM and Modified Variational Iteration Method (MVIM are used to find solutions of systems of stiff ordinary differential equations for both linear and nonlinear problems. Some examples are given to illustrate the accuracy and effectiveness of these methods. We compare our results with exact results. In some studies related to stiff ordinary differential equations, problems were solved by Adomian Decomposition Method and VIM and Homotopy Perturbation Method. Comparisons with exact solutions reveal that the Variational Iteration Method (VIM and the Modified Variational Iteration Method (MVIM are easier to implement. In fact, these methods are promising methods for various systems of linear and nonlinear stiff ordinary differential equations. Furthermore, VIM, or in some cases MVIM, is giving exact solutions in linear cases and very satisfactory solutions when compared to exact solutions for nonlinear cases depending on the stiffness ratio of the stiff system to be solved.
Numerical methods for solution of some nonlinear problems of mathematical physics
International Nuclear Information System (INIS)
Zhidkov, E.P.
1981-01-01
The continuous analog of the Newton method and its application to some nonlinear problems of mathematical physics using a computer is considered. It is shown that the application of this method in JINR to the wide range of nonlinear problems has shown its universality and high efficiency [ru
Periodic Solutions for Circular Restricted -Body Problems
Directory of Open Access Journals (Sweden)
Xiaoxiao Zhao
2013-01-01
Full Text Available For circular restricted -body problems, we study the motion of a sufficiently small mass point (called the zero mass point in the plane of equal masses located at the vertices of a regular polygon. By using variational minimizing methods, for some , we prove the existence of the noncollision periodic solution for the zero mass point with some fixed wingding number.
A finite-dimensional reduction method for slightly supercritical elliptic problems
Directory of Open Access Journals (Sweden)
Riccardo Molle
2004-01-01
Full Text Available We describe a finite-dimensional reduction method to find solutions for a class of slightly supercritical elliptic problems. A suitable truncation argument allows us to work in the usual Sobolev space even in the presence of supercritical nonlinearities: we modify the supercritical term in such a way to have subcritical approximating problems; for these problems, the finite-dimensional reduction can be obtained applying the methods already developed in the subcritical case; finally, we show that, if the truncation is realized at a sufficiently large level, then the solutions of the approximating problems, given by these methods, also solve the supercritical problems when the parameter is small enough.
Simos, T. E.
2017-11-01
A family of four stages high algebraic order embedded explicit six-step methods, for the numerical solution of second order initial or boundary-value problems with periodical and/or oscillating solutions, are studied in this paper. The free parameters of the new proposed methods are calculated solving the linear system of equations which is produced by requesting the vanishing of the phase-lag of the methods and the vanishing of the phase-lag's derivatives of the schemes. For the new obtained methods we investigate: • Its local truncation error (LTE) of the methods.• The asymptotic form of the LTE obtained using as model problem the radial Schrödinger equation.• The comparison of the asymptotic forms of LTEs for several methods of the same family. This comparison leads to conclusions on the efficiency of each method of the family.• The stability and the interval of periodicity of the obtained methods of the new family of embedded finite difference pairs.• The applications of the new obtained family of embedded finite difference pairs to the numerical solution of several second order problems like the radial Schrödinger equation, astronomical problems etc. The above applications lead to conclusion on the efficiency of the methods of the new family of embedded finite difference pairs.
Diffusion-synthetic acceleration methods for discrete-ordinates problems
International Nuclear Information System (INIS)
Larsen, E.W.
1984-01-01
The diffusion-synthetic acceleration (DSA) method is an iterative procedure for obtaining numerical solutions of discrete-ordinates problems. The DSA method is operationally more complicated than the standard source-iteration (SI) method, but if encoded properly it converges much more rapidly, especially for problems with diffusion-like regions. In this article we describe the basic ideas behind the DSA method and give a (roughly chronological) review of its long development. We conclude with a discussion which covers additional topics, including some remaining open problems an the status of current efforts aimed at solving these problems
Newton-like methods for Navier-Stokes solution
Qin, N.; Xu, X.; Richards, B. E.
1992-12-01
The paper reports on Newton-like methods called SFDN-alpha-GMRES and SQN-alpha-GMRES methods that have been devised and proven as powerful schemes for large nonlinear problems typical of viscous compressible Navier-Stokes solutions. They can be applied using a partially converged solution from a conventional explicit or approximate implicit method. Developments have included the efficient parallelization of the schemes on a distributed memory parallel computer. The methods are illustrated using a RISC workstation and a transputer parallel system respectively to solve a hypersonic vortical flow.
Efficient solution of 3D Ginzburg-Landau problem for mesoscopic superconductors
International Nuclear Information System (INIS)
Pereira, Paulo J; Moshchalkov, Victor V; Chibotaru, Liviu F
2014-01-01
The recently proposed approach for the solution of Ginzburg-Landau (GL) problem for 2D samples of arbitrary shape is, in this article, extended over 3D samples having the shape of (i) a prism with arbitrary base and (ii) a solid of revolution with arbitrary profile. Starting from the set of Laplace operator eigenfunctions of a 2D object, we construct an approximation to or the exact eigenfunctions of the Laplace operator of a 3D structure by applying an extrusion or revolution to these solutions. This set of functions is used as the basis to construct the solutions of the linearized GL equation. These solutions are then used as basis for the non-linear GL equation much like the famous LCAO method. To solve the non-linear equation, we used the Newton-Raphson method starting from the solution of the linear equation, i.e., the nucleation distribution of superconducting condensate. The vector potential approximations typically used in 2D cases, i.e., considering it as corresponding to applied constant field, are in the 3D case harder to justify. For that reason, we use a locally corrected Nystrom method to solve the second Ginzburg-Landau equation. The complete solution of GL problem is then achieved by solving self-consistently both equations
Time-dependent problems and difference methods
Gustafsson, Bertil; Oliger, Joseph
2013-01-01
Praise for the First Edition "". . . fills a considerable gap in the numerical analysis literature by providing a self-contained treatment . . . this is an important work written in a clear style . . . warmly recommended to any graduate student or researcher in the field of the numerical solution of partial differential equations."" -SIAM Review Time-Dependent Problems and Difference Methods, Second Edition continues to provide guidance for the analysis of difference methods for computing approximate solutions to partial differential equations for time-de
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.
A Robust Solution of the Spherical Burmester Problem
DEFF Research Database (Denmark)
Angeles, Jorge; Bai, Shaoping
2010-01-01
The problem of spherical four-bar linkage synthesis is revisited in this paper. The work is aimed at developing a robust synthesis method by taking into account both the formulation and the solution method. In addition, the synthesis of linkages with spherical prismatic joints is considered...... by treating them as a special case of the linkages under study. A two-step synthesis method is developed, which sequentially deals with equation-solving by a semigraphical approach and branching-detection. Examples are included to demonstrate the proposed method....
Optimal solution of full fuzzy transportation problems using total integral ranking
Sam’an, M.; Farikhin; Hariyanto, S.; Surarso, B.
2018-03-01
Full fuzzy transportation problem (FFTP) is a transportation problem where transport costs, demand, supply and decision variables are expressed in form of fuzzy numbers. To solve fuzzy transportation problem, fuzzy number parameter must be converted to a crisp number called defuzzyfication method. In this new total integral ranking method with fuzzy numbers from conversion of trapezoidal fuzzy numbers to hexagonal fuzzy numbers obtained result of consistency defuzzyfication on symmetrical fuzzy hexagonal and non symmetrical type 2 numbers with fuzzy triangular numbers. To calculate of optimum solution FTP used fuzzy transportation algorithm with least cost method. From this optimum solution, it is found that use of fuzzy number form total integral ranking with index of optimism gives different optimum value. In addition, total integral ranking value using hexagonal fuzzy numbers has an optimal value better than the total integral ranking value using trapezoidal fuzzy numbers.
Equilibrium Solutions of the Logarithmic Hamiltonian Leapfrog for the N-body Problem
Minesaki, Yukitaka
2018-04-01
We prove that a second-order logarithmic Hamiltonian leapfrog for the classical general N-body problem (CGNBP) designed by Mikkola and Tanikawa and some higher-order logarithmic Hamiltonian methods based on symmetric multicompositions of the logarithmic algorithm exactly reproduce the orbits of elliptic relative equilibrium solutions in the original CGNBP. These methods are explicit symplectic methods. Before this proof, only some implicit discrete-time CGNBPs proposed by Minesaki had been analytically shown to trace the orbits of elliptic relative equilibrium solutions. The proof is therefore the first existence proof for explicit symplectic methods. Such logarithmic Hamiltonian methods with a variable time step can also precisely retain periodic orbits in the classical general three-body problem, which generic numerical methods with a constant time step cannot do.
Silverlight 2 Recipes A Problem-solution Approach
Ghosh, Cameron
2010-01-01
Microsoft .NET Architect Evangelist, Jit Ghosh, presents a practical companion guide to developing rich, interactive web applications with Silverlight 2. Common problems, issues, and every--day scenarios are tackled with a detailed discussion of the solution and ready--made code recipes that will save you hours of coding time. The recipes included in Silverlight 2 Recipes: A Problem-Solution Approach have been carefully selected and tested with the professional developer in mind. You'll find clearly and succinctly stated problems, well--architected solutions, and ample discussion of the code a
A theoretical study on a convergence problem of nodal methods
Energy Technology Data Exchange (ETDEWEB)
Shaohong, Z.; Ziyong, L. [Shanghai Jiao Tong Univ., 1954 Hua Shan Road, Shanghai, 200030 (China); Chao, Y. A. [Westinghouse Electric Company, P. O. Box 355, Pittsburgh, PA 15230-0355 (United States)
2006-07-01
The effectiveness of modern nodal methods is largely due to its use of the information from the analytical flux solution inside a homogeneous node. As a result, the nodal coupling coefficients depend explicitly or implicitly on the evolving Eigen-value of a problem during its solution iteration process. This poses an inherently non-linear matrix Eigen-value iteration problem. This paper points out analytically that, whenever the half wave length of an evolving node interior analytic solution becomes smaller than the size of that node, this non-linear iteration problem can become inherently unstable and theoretically can always be non-convergent or converge to higher order harmonics. This phenomenon is confirmed, demonstrated and analyzed via the simplest 1-D problem solved by the simplest analytic nodal method, the Analytic Coarse Mesh Finite Difference (ACMFD, [1]) method. (authors)
Approximative solutions of stochastic optimization problem
Czech Academy of Sciences Publication Activity Database
Lachout, Petr
2010-01-01
Roč. 46, č. 3 (2010), s. 513-523 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539 Institutional research plan: CEZ:AV0Z10750506 Keywords : Stochastic optimization problem * sensitivity * approximative solution Subject RIV: BA - General Mathematics Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/SI/lachout-approximative solutions of stochastic optimization problem.pdf
Iterative Runge–Kutta-type methods for nonlinear ill-posed problems
International Nuclear Information System (INIS)
Böckmann, C; Pornsawad, P
2008-01-01
We present a regularization method for solving nonlinear ill-posed problems by applying the family of Runge–Kutta methods to an initial value problem, in particular, to the asymptotical regularization method. We prove that the developed iterative regularization method converges to a solution under certain conditions and with a general stopping rule. Some particular iterative regularization methods are numerically implemented. Numerical results of the examples show that the developed Runge–Kutta-type regularization methods yield stable solutions and that particular implicit methods are very efficient in saving iteration steps
Acceleration of monte Carlo solution by conjugate gradient method
International Nuclear Information System (INIS)
Toshihisa, Yamamoto
2005-01-01
The conjugate gradient method (CG) was applied to accelerate Monte Carlo solutions in fixed source problems. The equilibrium model based formulation enables to use CG scheme as well as initial guess to maximize computational performance. This method is available to arbitrary geometry provided that the neutron source distribution in each subregion can be regarded as flat. Even if it is not the case, the method can still be used as a powerful tool to provide an initial guess very close to the converged solution. The major difference of Monte Carlo CG to deterministic CG is that residual error is estimated using Monte Carlo sampling, thus statistical error exists in the residual. This leads to a flow diagram specific to Monte Carlo-CG. Three pre-conditioners were proposed for CG scheme and the performance was compared with a simple 1-D slab heterogeneous test problem. One of them, Sparse-M option, showed an excellent performance in convergence. The performance per unit cost was improved by four times in the test problem. Although direct estimation of efficiency of the method is impossible mainly because of the strong problem-dependence of the optimized pre-conditioner in CG, the method seems to have efficient potential as a fast solution algorithm for Monte Carlo calculations. (author)
Analytical Evaluation of Beam Deformation Problem Using Approximate Methods
DEFF Research Database (Denmark)
Barari, Amin; Kimiaeifar, A.; Domairry, G.
2010-01-01
The beam deformation equation has very wide applications in structural engineering. As a differential equation, it has its own problem concerning existence, uniqueness and methods of solutions. Often, original forms of governing differential equations used in engineering problems are simplified......, and this process produces noise in the obtained answers. This paper deals with the solution of second order of differential equation governing beam deformation using four analytical approximate methods, namely the Perturbation, Homotopy Perturbation Method (HPM), Homotopy Analysis Method (HAM) and Variational...... Iteration Method (VIM). The comparisons of the results reveal that these methods are very effective, convenient and quite accurate for systems of non-linear differential equation....
Fluid mechanics problems and solutions
Spurk, Joseph H
1997-01-01
his collection of over 200 detailed worked exercises adds to and complements the textbook Fluid Mechanics by the same author, and illustrates the teaching material through examples. In the exercises the fundamental concepts of Fluid Mechanics are applied to obtaining the solution of diverse concrete problems, and in doing this the student's skill in the mathematical modeling of practical problems is developed. In addition, 30 challenging questions without detailed solutions have been included, and while lecturers will find these questions suitable for examinations and tests, the student himself can use them to check his understanding of the subject.
Problems and solutions in thermoelasticity and magneto-thermoelasticity
Das, B
2017-01-01
This book presents problems and solutions of the mathematical theories of thermoelasticity and magnetothermoelasticity. The classical, coupled and generalized theories are solved using the eigenvalue methodology. Different methods of numerical inversion of the Laplace transform are presented and their direct applications are illustrated. The book is very useful to those interested in continuum mechanics.
Solution of the porous media equation by Adomian's decomposition method
International Nuclear Information System (INIS)
Pamuk, Serdal
2005-01-01
The particular exact solutions of the porous media equation that usually occurs in nonlinear problems of heat and mass transfer, and in biological systems are obtained using Adomian's decomposition method. Also, numerical comparison of particular solutions in the decomposition method indicate that there is a very good agreement between the numerical solutions and particular exact solutions in terms of efficiency and accuracy
Optimisation-Based Solution Methods for Set Partitioning Models
DEFF Research Database (Denmark)
Rasmussen, Matias Sevel
The scheduling of crew, i.e. the construction of work schedules for crew members, is often not a trivial task, but a complex puzzle. The task is complicated by rules, restrictions, and preferences. Therefore, manual solutions as well as solutions from standard software packages are not always su......_cient with respect to solution quality and solution time. Enhancement of the overall solution quality as well as the solution time can be of vital importance to many organisations. The _elds of operations research and mathematical optimisation deal with mathematical modelling of di_cult scheduling problems (among...... other topics). The _elds also deal with the development of sophisticated solution methods for these mathematical models. This thesis describes the set partitioning model which has been widely used for modelling crew scheduling problems. Integer properties for the set partitioning model are shown...
Optimization of the solution of the problem of scheduling theory ...
African Journals Online (AJOL)
This article describes the genetic algorithm used to solve the problem related to the scheduling theory. A large number of different methods is described in the scientific literature. The main issue that faced the problem in question is that it is necessary to search the optimal solution in a large search space for the set of ...
Viable Solutions for seemingly Intractable Problems
Directory of Open Access Journals (Sweden)
Ashok Natarajan
2015-10-01
Full Text Available Life is filled with seemingly intractable problems. But life wisdom affirms that if there is a problem, there must be a solution. Or better yet, the solution to the problem lies within the problem itself. Problems have their roots in disharmony. Disharmony arises when a part separates itself from the whole and acts independently of the wider reality of which it is a part, as financial markets have separated themselves from the real economy and economy has detached itself from social and ecological consequences. Insistence on out-moded approaches under new conditions generates intractable problems, as when the framework of a heterogeneous nation-state is employed for the dominance of a single ethnic or religious group. Knowledge and culture are the supreme values of a society and core element of its capacity for accomplishment and development, yet both tend to be exclusively possessed by elites for their own benefit, rather than freely distributed to maximize their impact on society as a whole. Society evolves by the transformation of ignorance into knowledge. Life evolves by organization. The linking and integration of social organizations spur development. Mind itself is an organization and powerful force for development. Energy makes organization more efficient. Any problem can be solved by raising the effectiveness of energy by converting it into skill or capacity and transforming it into power through organization. What one person sees as a problem is an opportunity for another with wider vision. The difference in perception accounts for the difference in levels of accomplishment. So, those with the right perspective see opportunities where others see insolvable problems. Current problems are the result of irrationality, refusal to benefit from past experience and insistence on repeating past errors. Modern science, which was born to fight the superstition of religion, has become a source of superstition. Fully availing of the latest
On the solution of the inverse scattering problem on a ray
International Nuclear Information System (INIS)
Egikyan, R.S.; Zhidkov, E.P.
1988-01-01
Quantum inverse scattering problem (ISP) is considered within the framework of two-particle scattering for local interaction case depending only on the scattering between particles. Constructing the solution of secondary integral equation solution of ISP is described in the clear image. Numerical calculations are conducted using a direct method
Directory of Open Access Journals (Sweden)
Shonin M.Yu.
2017-02-01
Full Text Available the work is devoted to creation of mathematical model of the solution of problems on use of raw materials and drawing up a diet. These problems have been solved by the authors of this article by means of a graphic method in number.
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)
Positive solution of a time and energy dependent neutron transport problem
International Nuclear Information System (INIS)
Pao, C.V.
1975-01-01
A constructive method is given for the determination of a solution and an existence--uniqueness theorem for some nonlinear time and energy dependent neutron transport problems, including the linear transport system. The geometry of the medium under consideration is allowed to be either bounded or unbounded which includes the geometry of a finite or infinite cylinder, a half-space and the whole space R/subm/ (m=1,2,center-dotcenter-dotcenter-dot). Our approach to the problem is by successive approximation which leads to various recursion formulas for the approximations in terms of explicit integrations. It is shown under some Lipschitz conditions on the nonlinear functions, which describe the process of neutrons absorption, fission, and scattering, that the sequence of approximations converges to a unique positive solution. Since these conditions are satisfied by the linear transport equation, all the results for the nonlinear system are valid for the linear transport problem. In the general nonlinear problem, the existence of both local and global solutions are discussed, and an iterative process for the construction of the solution is given
Some exact solutions to the translation-invariant N-body problem
International Nuclear Information System (INIS)
Hall, R.L.
1978-01-01
It is shown that Schroedinger's equation for a translation-invariant system consisting of N particles with arbitrary masses interacting via Hooke's law pair potentials with the same coupling constant can be solved exactly; explicit solutions are found for the case N = 3. Exact solutions are also found explicitly for the translation-invariant problem in which a particle with mass m 0 interacts with N identical particles of mass m 1 via Hooke's law pair potential with coupling constant k 0 2 , and the identical particles interact with each other via Hooke's law pair potentials with coupling constant k 1 2 . The latter solution provides a basis problem for an energy lower-bound method for translation-invariant atom-like systems. (author)
Rebello, Carina M.
2012-01-01
This study explored the effects of alternative forms of argumentation on undergraduates' physics solutions in introductory calculus-based physics. A two-phase concurrent mixed methods design was employed to investigate relationships between undergraduates' written argumentation abilities, conceptual quality of problem solutions, as well…
Numerical solution of system of boundary value problems using B-spline with free parameter
Gupta, Yogesh
2017-01-01
This paper deals with method of B-spline solution for a system of boundary value problems. The differential equations are useful in various fields of science and engineering. Some interesting real life problems involve more than one unknown function. These result in system of simultaneous differential equations. Such systems have been applied to many problems in mathematics, physics, engineering etc. In present paper, B-spline and B-spline with free parameter methods for the solution of a linear system of second-order boundary value problems are presented. The methods utilize the values of cubic B-spline and its derivatives at nodal points together with the equations of the given system and boundary conditions, ensuing into the linear matrix equation.
International Nuclear Information System (INIS)
Houfek, Karel
2008-01-01
Numerical solution of coupled radial differential equations which are encountered in multichannel scattering problems is presented. Numerical approach is based on the combination of the exterior complex scaling method and the finite-elements method with the discrete variable representation. This method can be used not only to solve multichannel scattering problem but also to find bound states and resonance positions and widths directly by diagonalization of the corresponding complex scaled Hamiltonian. Efficiency and accuracy of this method is demonstrated on an analytically solvable two-channel problem.
Cengizci, Süleyman; Atay, Mehmet Tarık; Eryılmaz, Aytekin
2016-01-01
This paper is concerned with two-point boundary value problems for singularly perturbed nonlinear ordinary differential equations. The case when the solution only has one boundary layer is examined. An efficient method so called Successive Complementary Expansion Method (SCEM) is used to obtain uniformly valid approximations to this kind of solutions. Four test problems are considered to check the efficiency and accuracy of the proposed method. The numerical results are found in good agreement with exact and existing solutions in literature. The results confirm that SCEM has a superiority over other existing methods in terms of easy-applicability and effectiveness.
Discrete ordinates transport methods for problems with highly forward-peaked scattering
International Nuclear Information System (INIS)
Pautz, S.D.
1998-04-01
The author examines the solutions of the discrete ordinates (S N ) method for problems with highly forward-peaked scattering kernels. He derives conditions necessary to obtain reasonable solutions in a certain forward-peaked limit, the Fokker-Planck (FP) limit. He also analyzes the acceleration of the iterative solution of such problems and offer improvements to it. He extends the analytic Fokker-Planck limit analysis to the S N equations. This analysis shows that in this asymptotic limit the S N solution satisfies a pseudospectral discretization of the FP equation, provided that the scattering term is handled in a certain way (which he describes) and that the analytic transport solution satisfies an analytic FP equation. Similar analyses of various spatially discretized S N equations reveal that they too produce solutions that satisfy discrete FP equations, given the same provisions. Numerical results agree with these theoretical predictions. He defines a multidimensional angular multigrid (ANMG) method to accelerate the iterative solution of highly forward-peaked problems. The analyses show that a straightforward application of this scheme is subject to high-frequency instabilities. However, by applying a diffusive filter to the ANMG corrections he is able to stabilize this method. Fourier analyses of model problems show that the resulting method is effective at accelerating the convergence rate when the scattering is forward-peaked. The numerical results demonstrate that these analyses are good predictors of the actual performance of the ANMG method
FAST LABEL: Easy and efficient solution of joint multi-label and estimation problems
Sundaramoorthi, Ganesh; Hong, Byungwoo
2014-01-01
that plague local solutions. Further, in comparison to global methods for the multi-label problem, the method is more efficient and it is easy for a non-specialist to implement. We give sample Matlab code for the multi-label Chan-Vese problem in this paper
An analytic solution of the static problem of inclined risers conveying fluid
Alfosail, Feras
2016-05-28
We use the method of matched asymptotic expansion to develop an analytic solution to the static problem of clamped–clamped inclined risers conveying fluid. The inclined riser is modeled as an Euler–Bernoulli beam taking into account its self-weight, mid-plane stretching, an applied axial tension, and the internal fluid velocity. The solution consists of three parts: an outer solution valid away from the two boundaries and two inner solutions valid near the two ends. The three solutions are then matched and combined into a so-called composite expansion. A Newton–Raphson method is used to determine the value of the mid-plane stretching corresponding to each applied tension and internal velocity. The analytic solution is in good agreement with those obtained with other solution methods for large values of applied tensions. Therefore, it can be used to replace other mathematical solution methods that suffer numerical limitations and high computational cost. © 2016 Springer Science+Business Media Dordrecht
Method of independent timesteps in the numerical solution of initial value problems
International Nuclear Information System (INIS)
Porter, A.P.
1976-01-01
In the numerical solution of initial-value problems in several independent variables, the timestep is controlled, especially in the presence of shocks, by a small portion of the logical mesh, what one may call the crisis zone. One is frustrated by the necessity of doing in the whole mesh frequent calculations required by only a small part of the mesh. It is shown that it is possible to choose different timesteps natural to different parts of the mesh and to advance each zone in time only as often as is appropriate to that zone's own natural timestep. Prior work is reviewed and for the first time an investigation of the conditions for well-posedness, consistency and stability in independent timesteps is presented; a new method results. The prochronic and parachronic Cauchy surfaces are identified; and the reasons (well-posedness) for constraining the Cauchy surfaces to be prochronic (as distinct from the method of Grandey), that is, to lie prior to the time of the crisis zone (the zone of least timestep), are indicated. Stability (in the maximum norm) of parabolic equations and (in the L2 norm) of hyperbolic equations is reviewed, without restricting the treatment to linear equations or constant coefficients, and stability of the new method is proven in this framework. The details of the method of independent timesteps, the rules for choosing timesteps and for deciding when to update and when to skip zones, and the method of joining adjacent regions of differing timestep are described. The stability of independent timestep difference schemes is analyzed and exhibited. The economic advantages of the method, which often amount to an order-of-magnitude decrease in running time relative to conventional or implicit difference methods, are noted
Method of independent timesteps in the numerical solution of initial value problems
Energy Technology Data Exchange (ETDEWEB)
Porter, A.P.
1976-07-21
In the numerical solution of initial-value problems in several independent variables, the timestep is controlled, especially in the presence of shocks, by a small portion of the logical mesh, what one may call the crisis zone. One is frustrated by the necessity of doing in the whole mesh frequent calculations required by only a small part of the mesh. It is shown that it is possible to choose different timesteps natural to different parts of the mesh and to advance each zone in time only as often as is appropriate to that zone's own natural timestep. Prior work is reviewed and for the first time an investigation of the conditions for well-posedness, consistency and stability in independent timesteps is presented; a new method results. The prochronic and parachronic Cauchy surfaces are identified; and the reasons (well-posedness) for constraining the Cauchy surfaces to be prochronic (as distinct from the method of Grandey), that is, to lie prior to the time of the crisis zone (the zone of least timestep), are indicated. Stability (in the maximum norm) of parabolic equations and (in the L2 norm) of hyperbolic equations is reviewed, without restricting the treatment to linear equations or constant coefficients, and stability of the new method is proven in this framework. The details of the method of independent timesteps, the rules for choosing timesteps and for deciding when to update and when to skip zones, and the method of joining adjacent regions of differing timestep are described. The stability of independent timestep difference schemes is analyzed and exhibited. The economic advantages of the method, which often amount to an order-of-magnitude decrease in running time relative to conventional or implicit difference methods, are noted.
Distributed Solutions for Loosely Coupled Feasibility Problems Using Proximal Splitting Methods
DEFF Research Database (Denmark)
Pakazad, Sina Khoshfetrat; Andersen, Martin Skovgaard; Hansson, Anders
2014-01-01
In this paper,we consider convex feasibility problems (CFPs) where the underlying sets are loosely coupled, and we propose several algorithms to solve such problems in a distributed manner. These algorithms are obtained by applying proximal splitting methods to convex minimization reformulations ...
International Nuclear Information System (INIS)
Choi, C. Y.; Park, C. T.; Kim, T. H.; Han, K. N.; Choe, S. H.
1995-01-01
A geometrical inverse heat conduction problem is solved for the development of Infrared Computerized-Axial-Tomography (IR CAT) Scan by using a boundary element method in conjunction with regularization procedure. In this problem, an overspecified temperature condition by infrared scanning is provided on the surface, and is used together with other conditions to solve the position of an unknown boundary (cavity). An auxiliary problem is introduced in the solution of this problem. By defining a hypothetical inner boundary for the auxiliary problem domain, the cavity is located interior to the domain and its position is determined by solving a potential problem. Boundary element method with regularization procedure is used to solve this problem, and the effects of regularization on the inverse solution method are investigated by means of numerical analysis
IMPSOR, 3-D Boundary Problems Solution for Thermal Conductivity Calculation
International Nuclear Information System (INIS)
Wilson, D.G.; Williams, M.A.
1994-01-01
1 - Description of program or function: IMPSOR implements finite difference methods for multidimensional moving boundary problems with Dirichlet or Neumann boundary conditions. The geometry of the spatial domain is a rectangular parallelepiped with dimensions specified by the user. Dirichlet or Neumann boundary conditions may be specified on each face of the box independently. The user defines the initial and boundary conditions as well as the thermal and physical properties of the problem and several parameters for the numerical method, e.g. degree of implicitness, time-step size. 2 - Method of solution: The spatial domain is partitioned and the governing equation discretized, which yields a nonlinear system of equations at each time-step. This nonlinear system is solved using a successive over-relaxation (SOR) algorithm. For a given node, the previous iteration's temperature and thermal conductivity values are used for advanced points with current values at previous points. This constitutes a Gauss-Seidel iteration. Most of the computing time used by the numerical method is spent in the iterative solution of the nonlinear system. The SOR scheme employed is designed to accommodate vectorization on a Cray X-MP. 3 - Restrictions on the complexity of the problem: Maximum of 70,000 nodes
New Class of Solutions for Water Infiltration Problems in Unsaturated Soils
DEFF Research Database (Denmark)
Barari, Amin; Omidvar, M; Momeni, M
2010-01-01
This paper presents the results of approximate analytical solutions to Richards’ equation, which governs the problem of unsaturated flow in porous media. The existing methods generally fall within the category of numerical and analytical methods, often having many restrictions for practical situa...
A recursive Monte Carlo method for estimating importance functions in deep penetration problems
International Nuclear Information System (INIS)
Goldstein, M.
1980-04-01
A pratical recursive Monte Carlo method for estimating the importance function distribution, aimed at importance sampling for the solution of deep penetration problems in three-dimensional systems, was developed. The efficiency of the recursive method was investigated for sample problems including one- and two-dimensional, monoenergetic and and multigroup problems, as well as for a practical deep-penetration problem with streaming. The results of the recursive Monte Carlo calculations agree fairly well with Ssub(n) results. It is concluded that the recursive Monte Carlo method promises to become a universal method for estimating the importance function distribution for the solution of deep-penetration problems, in all kinds of systems: for many systems the recursive method is likely to be more efficient than previously existing methods; for three-dimensional systems it is the first method that can estimate the importance function with the accuracy required for an efficient solution based on importance sampling of neutron deep-penetration problems in those systems
Finding Multiple Optimal Solutions to Optimal Load Distribution Problem in Hydropower Plant
Directory of Open Access Journals (Sweden)
Xinhao Jiang
2012-05-01
Full Text Available Optimal load distribution (OLD among generator units of a hydropower plant is a vital task for hydropower generation scheduling and management. Traditional optimization methods for solving this problem focus on finding a single optimal solution. However, many practical constraints on hydropower plant operation are very difficult, if not impossible, to be modeled, and the optimal solution found by those models might be of limited practical uses. This motivates us to find multiple optimal solutions to the OLD problem, which can provide more flexible choices for decision-making. Based on a special dynamic programming model, we use a modified shortest path algorithm to produce multiple solutions to the problem. It is shown that multiple optimal solutions exist for the case study of China’s Geheyan hydropower plant, and they are valuable for assessing the stability of generator units, showing the potential of reducing occurrence times of units across vibration areas.
The single-sink fixed-charge transportation problem: Applications and solution methods
DEFF Research Database (Denmark)
Goertz, Simon; Klose, Andreas
2007-01-01
The single-sink fixed-charge transportation problem (SSFCTP) consists in finding a minimum cost flow from a number of supplier nodes to a single demand node. Shipping costs comprise costs proportional to the amount shipped as well as a fixed-charge. Although the SSFCTP is an important special case...... of the well-known fixed-charge transportation problem, just a few methods for solving this problem have been proposed in the literature. After summarising some applications of this problem arising in manufacturing and transportation, we give an overview on approximation algorithms and worst-case results...
B-spline solution of a singularly perturbed boundary value problem arising in biology
International Nuclear Information System (INIS)
Lin Bin; Li Kaitai; Cheng Zhengxing
2009-01-01
We use B-spline functions to develop a numerical method for solving a singularly perturbed boundary value problem associated with biology science. We use B-spline collocation method, which leads to a tridiagonal linear system. The accuracy of the proposed method is demonstrated by test problems. The numerical result is found in good agreement with exact solution.
A solution to nonlinearity problems
International Nuclear Information System (INIS)
Neuffer, D.V.
1989-01-01
New methods of correcting dynamic nonlinearities resulting from the multipole content of a synchrotron or transport line are presented. In a simplest form, correction elements are places at the center (C) of the accelerator half-cells as well as near the focusing (F) and defocusing (D) quadrupoles. In a first approximation, the corrector strengths follow Simpson's Rule, forming an accurate quasi-local canceling approximation to the nonlinearity. The F, C, and D correctors may also be used to obtain precise control of the horizontal, coupled, and vertical motion. Correction by three or more orders of magnitude can be obtained, and simple solutions to a fundamental problem in beam transport have been obtained. 13 refs., 1 fig., 1 tab
Comparison of three Stark problem solution techniques for the bounded case
Hatten, Noble; Russell, Ryan P.
2015-01-01
Three methods of obtaining solutions to the Stark problem—one developed by Lantoine and Russell using Jacobi elliptic and related functions, one developed by Biscani and Izzo using Weierstrass elliptic and related functions, and one developed by Pellegrini, Russell, and Vittaldev using and Taylor series extended to the Stark problem—are compared qualitatively and quantitatively for the bounded motion case. For consistency with existing available code for the series solution, Fortran routines of the Lantoine method and Biscani method are newly implemented and made available. For these implementations, the Lantoine formulation is found to be more efficient than the Biscani formulation in the propagation of a single trajectory segment. However, for applications for which acceptable accuracy may be achieved by orders up to 16, the Pellegrini series solution is shown to be more efficient than either analytical method. The three methods are also compared in the propagation of sequentially connected trajectory segments in a low-thrust orbital transfer maneuver. Separate tests are conducted for discretizations between 8 and 96 segments per orbit. For the series solution, the interaction between order and step size leads to computation times that are nearly invariable to discretization for a given truncation error tolerance over the tested range of discretizations. This finding makes the series solution particularly attractive for mission design applications where problems may require both coarse and fine discretizations. Example applications include the modeling of low-thrust propulsion and time-varying perturbations—problems for which the efficient propagation of relatively short Stark segments is paramount because the disturbing acceleration generally varies continuously.
DEFF Research Database (Denmark)
Lange, Katrine; Frydendall, Jan; Cordua, Knud Skou
2012-01-01
The frequency matching method defines a closed form expression for a complex prior that quantifies the higher order statistics of a proposed solution model to an inverse problem. While existing solution methods to inverse problems are capable of sampling the solution space while taking into account...... arbitrarily complex a priori information defined by sample algorithms, it is not possible to directly compute the maximum a posteriori model, as the prior probability of a solution model cannot be expressed. We demonstrate how the frequency matching method enables us to compute the maximum a posteriori...... solution model to an inverse problem by using a priori information based on multiple point statistics learned from training images. We demonstrate the applicability of the suggested method on a synthetic tomographic crosshole inverse problem....
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.
Energy Technology Data Exchange (ETDEWEB)
Cobb, J.W.
1995-02-01
There is an increasing need for more accurate numerical methods for large-scale nonlinear magneto-fluid turbulence calculations. These methods should not only increase the current state of the art in terms of accuracy, but should also continue to optimize other desired properties such as simplicity, minimized computation, minimized memory requirements, and robust stability. This includes the ability to stably solve stiff problems with long time-steps. This work discusses a general methodology for deriving higher-order numerical methods. It also discusses how the selection of various choices can affect the desired properties. The explicit discussion focuses on third-order Runge-Kutta methods, including general solutions and five examples. The study investigates the linear numerical analysis of these methods, including their accuracy, general stability, and stiff stability. Additional appendices discuss linear multistep methods, discuss directions for further work, and exhibit numerical analysis results for some other commonly used lower-order methods.
Energy Technology Data Exchange (ETDEWEB)
Yokoi, T [Building Research Institute, Tokyo (Japan); Sanchez-Sesma, F [Universidad National Autonoma de Mexico, (Mexico). Institute de Ingenieria
1997-05-27
Formulation is introduced for discretizing a boundary integral equation into an indirect boundary element method for the solution of 3-dimensional topographic problems. Yokoi and Takenaka propose an analytical solution-capable reference solution (solution for the half space elastic body with flat free surface) to problems of topographic response to seismic motion in a 2-dimensional in-plane field. That is to say, they propose a boundary integral equation capable of effectively suppressing the non-physical waves that emerge in the result of computation in the wake of the truncation of the discretized ground surface making use of the wave field in a semi-infinite elastic body with flat free surface. They apply the proposed boundary integral equation discretized into the indirect boundary element method to solve some examples, and succeed in proving its validity. In this report, the equation is expanded to deal with 3-dimensional topographic problems. A problem of a P-wave vertically landing on a flat and free surface is solved by the conventional boundary integral equation and the proposed boundary integral equation, and the solutions are compared with each other. It is found that the new method, different from the conventional one, can delete non-physical waves from the analytical result. 4 figs.
On the method of solution of the differential-delay Toda equation
Villarroel, Javier; Ablowitz, Mark J.
1993-09-01
The method of solution of the Toda differential-delay equation, which is a reduction of the Toda equation in 2+1 dimensions, is described. An important feature of the solution process is to obtain and study a novel Riemann-Hilbert problem. The latter problem requires factorization across an infinite number of strips with a suitable branching structure. Explicit soliton solutions are given.
Surveying problem solution with theory and objective type questions
Chandra, AM
2005-01-01
The book provides a lucid and step-by-step treatment of the various principles and methods for solving problems in land surveying. Each chapter starts with basic concepts and definitions, then solution of typical field problems and ends with objective type questions. The book explains errors in survey measurements and their propagation. Survey measurements are detailed next. These include horizontal and vertical distance, slope, elevation, angle, and direction. Measurement using stadia tacheometry and EDM are then highlighted, followed by various types of levelling problems. Traversing is then explained, followed by a detailed discussion on adjustment of survey observations and then triangulation and trilateration.
Beshtokov, M. Kh.
2017-12-01
Boundary value problems for loaded third-order pseudo-parabolic equations with variable coefficients are considered. A priori estimates for the solutions of the problems in the differential and difference formulations are obtained. These a priori estimates imply the uniqueness and stability of the solution with respect to the initial data and the right-hand side on a layer, as well as the convergence of the solution of each difference problem to the solution of the corresponding differential problem.
A discrete-ordinates solution for a radiation therapy problem
International Nuclear Information System (INIS)
Goldschmidt, Gustavo Brun; Reichert, Janice Teresinha; Barichello, Liliane Basso
2008-01-01
A concise and accurate procedure for evaluating dose distribution, in a radiation therapy planning, is presented. The analytical discrete-ordinates method (ADO method) is used to develop a complete solution for a spectral dependent radiative transfer equation, in a one-dimensional medium, according to a multigroup scheme. Numerical results are presented for test problems, where the Klein-Nishina scattering kernel was used to describe the interaction processes. (author)
Solution of magnetic field and eddy current problem induced by rotating magnetic poles (abstract)
Liu, Z. J.; Low, T. S.
1996-04-01
The magnetic field and eddy current problems induced by rotating permanent magnet poles occur in electromagnetic dampers, magnetic couplings, and many other devices. Whereas numerical techniques, for example, finite element methods can be exploited to study various features of these problems, such as heat generation and drag torque development, etc., the analytical solution is always of interest to the designers since it helps them to gain the insight into the interdependence of the parameters involved and provides an efficient tool for designing. Some of the previous work showed that the solution of the eddy current problem due to the linearly moving magnet poles can give satisfactory approximation for the eddy current problem due to rotating fields. However, in many practical cases, especially when the number of magnet poles is small, there is significant effect of flux focusing due to the geometry. The above approximation can therefore lead to marked errors in the theoretical predictions of the device performance. Bernot et al. recently described an analytical solution in a polar coordinate system where the radial field is excited by a time-varying source. A discussion of an analytical solution of the magnetic field and eddy current problems induced by moving magnet poles in radial field machines will be given in this article. The theoretical predictions obtained from this method is compared with the results obtained from finite element calculations. The validity of the method is also checked by the comparison of the theoretical predictions and the measurements from a test machine. It is shown that the introduced solution leads to a significant improvement in the air gap field prediction as compared with the results obtained from the analytical solution that models the eddy current problems induced by linearly moving magnet poles.
Solutions of First-Order Volterra Type Linear Integrodifferential Equations by Collocation Method
Directory of Open Access Journals (Sweden)
Olumuyiwa A. Agbolade
2017-01-01
Full Text Available The numerical solutions of linear integrodifferential equations of Volterra type have been considered. Power series is used as the basis polynomial to approximate the solution of the problem. Furthermore, standard and Chebyshev-Gauss-Lobatto collocation points were, respectively, chosen to collocate the approximate solution. Numerical experiments are performed on some sample problems already solved by homotopy analysis method and finite difference methods. Comparison of the absolute error is obtained from the present method and those from aforementioned methods. It is also observed that the absolute errors obtained are very low establishing convergence and computational efficiency.
Particular solution of the discrete-ordinate method.
Qin, Yi; Box, Michael A; Jupp, David L
2004-06-20
We present two methods that can be used to derive the particular solution of the discrete-ordinate method (DOM) for an arbitrary source in a plane-parallel atmosphere, which allows us to solve the transfer equation 12-18% faster in the case of a single beam source and is even faster for the atmosphere thermal emission source. We also remove the divide by zero problem that occurs when a beam source coincides with a Gaussian quadrature point. In our implementation, solution for multiple sources can be obtained simultaneously. For each extra source, it costs only 1.3-3.6% CPU time required for a full solution. The GDOM code that we developed previously has been revised to integrate with the DOM. Therefore we are now able to compute the Green's function and DOM solutions simultaneously.
Solution of the Stieltjes truncated matrix moment problem
Directory of Open Access Journals (Sweden)
Vadim M. Adamyan
2005-01-01
Full Text Available The truncated Stieltjes matrix moment problem consisting in the description of all matrix distributions \\(\\boldsymbol{\\sigma}(t\\ on \\([0,\\infty\\ with given first \\(2n+1\\ power moments \\((\\mathbf{C}_j_{n=0}^j\\ is solved using known results on the corresponding Hamburger problem for which \\(\\boldsymbol{\\sigma}(t\\ are defined on \\((-\\infty,\\infty\\. The criterion of solvability of the Stieltjes problem is given and all its solutions in the non-degenerate case are described by selection of the appropriate solutions among those of the Hamburger problem for the same set of moments. The results on extensions of non-negative operators are used and a purely algebraic algorithm for the solution of both Hamburger and Stieltjes problems is proposed.
Rebello, Carina M.
This study explored the effects of alternative forms of argumentation on undergraduates' physics solutions in introductory calculus-based physics. A two-phase concurrent mixed methods design was employed to investigate relationships between undergraduates' written argumentation abilities, conceptual quality of problem solutions, as well as approaches and strategies for solving argumentative physics problems across multiple physics topics. Participants were assigned via stratified sampling to one of three conditions (control, guided construct, or guided evaluate) based on gender and pre-test scores on a conceptual instrument. The guided construct and guided evaluate groups received tasks and prompts drawn from literature to facilitate argument construction or evaluation. Using a multiple case study design, with each condition serving as a case, interviews were conducted consisting of a think-aloud problem solving session paired with a semi-structured interview. The analysis of problem solving strategies was guided by the theoretical framework on epistemic games adapted by Tuminaro and Redish (2007). This study provides empirical evidence that integration of written argumentation into physics problems can potentially improve the conceptual quality of solutions, expand their repertoire of problem solving strategies and show promise for addressing the gender gap in physics. The study suggests further avenues for research in this area and implications for designing and implementing argumentation tasks in introductory college physics.
Domain decomposition methods for the neutron diffusion problem
International Nuclear Information System (INIS)
Guerin, P.; Baudron, A. M.; Lautard, J. J.
2010-01-01
The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, simplified transport (SPN) or diffusion approximations are often used. The MINOS solver developed at CEA Saclay uses a mixed dual finite element method for the resolution of these problems. and has shown his efficiency. In order to take into account the heterogeneities of the geometry, a very fine mesh is generally required, and leads to expensive calculations for industrial applications. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose here two domain decomposition methods based on the MINOS solver. The first approach is a component mode synthesis method on overlapping sub-domains: several Eigenmodes solutions of a local problem on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is an iterative method based on a non-overlapping domain decomposition with Robin interface conditions. At each iteration, we solve the problem on each sub-domain with the interface conditions given by the solutions on the adjacent sub-domains estimated at the previous iteration. Numerical results on parallel computers are presented for the diffusion model on realistic 2D and 3D cores. (authors)
Cerebellum-inspired neural network solution of the inverse kinematics problem.
Asadi-Eydivand, Mitra; Ebadzadeh, Mohammad Mehdi; Solati-Hashjin, Mehran; Darlot, Christian; Abu Osman, Noor Azuan
2015-12-01
The demand today for more complex robots that have manipulators with higher degrees of freedom is increasing because of technological advances. Obtaining the precise movement for a desired trajectory or a sequence of arm and positions requires the computation of the inverse kinematic (IK) function, which is a major problem in robotics. The solution of the IK problem leads robots to the precise position and orientation of their end-effector. We developed a bioinspired solution comparable with the cerebellar anatomy and function to solve the said problem. The proposed model is stable under all conditions merely by parameter determination, in contrast to recursive model-based solutions, which remain stable only under certain conditions. We modified the proposed model for the simple two-segmented arm to prove the feasibility of the model under a basic condition. A fuzzy neural network through its learning method was used to compute the parameters of the system. Simulation results show the practical feasibility and efficiency of the proposed model in robotics. The main advantage of the proposed model is its generalizability and potential use in any robot.
Directory of Open Access Journals (Sweden)
Lyakhovich Leonid
2017-01-01
Full Text Available This paper is devoted to formulation and general principles of approximation of multipoint boundary problem of static analysis of deep beam with the use of combined application of finite element method (FEM discrete-continual finite element method (DCFEM. The field of application of DCFEM comprises structures with regular physical and geometrical parameters in some dimension (“basic” dimension. DCFEM presupposes finite element approximation for non-basic dimension while in the basic dimension problem remains continual. DCFEM is based on analytical solutions of resulting multipoint boundary problems for systems of ordinary differential equations with piecewise-constant coefficients.
Spectral Solutions of Self-adjoint Elliptic Problems with Immersed Interfaces
International Nuclear Information System (INIS)
Auchmuty, G.; Klouček, P.
2011-01-01
This paper describes a spectral representation of solutions of self-adjoint elliptic problems with immersed interfaces. The interface is assumed to be a simple non-self-intersecting closed curve that obeys some weak regularity conditions. The problem is decomposed into two problems, one with zero interface data and the other with zero exterior boundary data. The problem with zero interface data is solved by standard spectral methods. The problem with non-zero interface data is solved by introducing an interface space H Γ (Ω) and constructing an orthonormal basis of this space. This basis is constructed using a special class of orthogonal eigenfunctions analogously to the methods used for standard trace spaces by Auchmuty (SIAM J. Math. Anal. 38, 894–915, 2006). Analytical and numerical approximations of these eigenfunctions are described and some simulations are presented.
Multiple solutions for inhomogeneous nonlinear elliptic problems arising in astrophyiscs
Directory of Open Access Journals (Sweden)
Marco Calahorrano
2004-04-01
Full Text Available Using variational methods we prove the existence and multiplicity of solutions for some nonlinear inhomogeneous elliptic problems on a bounded domain in $mathbb{R}^n$, with $ngeq 2$ and a smooth boundary, and when the domain is $mathbb{R}_+^n$
Heuristics methods for the flow shop scheduling problem with separated setup times
Directory of Open Access Journals (Sweden)
Marcelo Seido Nagano
2012-06-01
Full Text Available This paper deals with the permutation flow shop scheduling problem with separated machine setup times. As a result of an investigation on the problem characteristics, four heuristics methods are proposed with procedures of the construction sequencing solution by an analogy with the asymmetric traveling salesman problem with the objective of minimizing makespan. Experimental results show that one of the new heuristics methods proposed provide high quality solutions in comparisons with the evaluated methods considered in the literature.
A new solution method for wheel/rail rolling contact.
Yang, Jian; Song, Hua; Fu, Lihua; Wang, Meng; Li, Wei
2016-01-01
To solve the problem of wheel/rail rolling contact of nonlinear steady-state curving, a three-dimensional transient finite element (FE) model is developed by the explicit software ANSYS/LS-DYNA. To improve the solving speed and efficiency, an explicit-explicit order solution method is put forward based on analysis of the features of implicit and explicit algorithm. The solution method was first applied to calculate the pre-loading of wheel/rail rolling contact with explicit algorithm, and then the results became the initial conditions in solving the dynamic process of wheel/rail rolling contact with explicit algorithm as well. Simultaneously, the common implicit-explicit order solution method is used to solve the FE model. Results show that the explicit-explicit order solution method has faster operation speed and higher efficiency than the implicit-explicit order solution method while the solution accuracy is almost the same. Hence, the explicit-explicit order solution method is more suitable for the wheel/rail rolling contact model with large scale and high nonlinearity.
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
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
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.
Directory of Open Access Journals (Sweden)
Farzad Amirkhani
2017-03-01
The proposed method is implemented on classical job-shop problems with objective of makespan and results are compared with mixed integer programming model. Moreover, the appropriate dispatching priorities are achieved for dynamic job-shop problem minimizing a multi-objective criteria. The results show that simulation-based optimization are highly capable to capture the main characteristics of the shop and produce optimal/near-optimal solutions with highly credibility degree.
Numerical methods for hyperbolic differential functional problems
Directory of Open Access Journals (Sweden)
Roman Ciarski
2008-01-01
Full Text Available The paper deals with the initial boundary value problem for quasilinear first order partial differential functional systems. A general class of difference methods for the problem is constructed. Theorems on the error estimate of approximate solutions for difference functional systems are presented. The convergence results are proved by means of consistency and stability arguments. A numerical example is given.
The cell method for electrical engineering and multiphysics problems an introduction
Alotto, Piergiorgio; Repetto, Maurizio; Rosso, Carlo
2013-01-01
This book presents a numerical scheme for the solution of field problems governed by partial differential equations: the cell method. The technique lends itself naturally to the solution of multiphysics problems with several interacting phenomena. The Cell Method, based on a space-time tessellation, is intimately related to the work of Tonti and to his ideas of classification diagrams or, as they are nowadays called, Tonti diagrams: a graphical representation of the problem's equations made possible by a suitable selection of a space-time framework relating physical variables to each other. The main features of the cell method are presented and links with many other discrete numerical methods (finite integration techniques, finite difference time domain, finite volumes, mimetic finite differences, etc.) are discussed. After outlining the theoretical basis of the method, a set of physical problems which have been solved with the cell method is described. These single and multiphysics problems stem from the aut...
On Solutions of the Integrable Boundary Value Problem for KdV Equation on the Semi-Axis
International Nuclear Information System (INIS)
Ignatyev, M. Yu.
2013-01-01
This paper is concerned with the Korteweg–de Vries (KdV) equation on the semi-axis. The boundary value problem with inhomogeneous integrable boundary conditions is studied. We establish some characteristic properties of solutions of the problem. Also we construct a wide class of solutions of the problem using the inverse spectral method.
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.
Alternative solution algorithm for coupled thermal-hydraulic problems
International Nuclear Information System (INIS)
Farnsworth, D.A.; Rice, J.G.
1986-01-01
A thermal-hydraulic system involves flow of a fluid for which a combined solution of the continuity, momentum, and energy equations is required. When the solutions of the energy and momentum fields are dependent on each other, the system is said to be thermally coupled. A common problem encountered in the numerical solution of strongly coupled thermal-hydraulic problems is a very slow rate of convergence or a complete lack of convergence. Many times this degradation in convergence is due to the lack of true coupling between the energy and momentum fields during the iteration process. In the most widely used solution algorithms - such as the SIMPLE algorithm and its many variants - a sequential solution technique is required. That is, the solution process alternates between the flow and energy fields until a converged solution is obtained. This approach allows only implicit energy-momentum coupling. To improve the convergence rate for strongly coupled problems, a practical solution algorithm that can accommodate true energy-momentum coupling terms was developed. A complete simultaneous (versus sequential) solution of the governing conservation equations utilizing a line-by-line solution was developed and direct coupling terms between the momentum and energy fields were added utilizing a modified Newton-Raphson technique
Solution of the Dirichlet Problem for the Poisson's Equation in a Multidimensional Infinite Layer
Directory of Open Access Journals (Sweden)
O. D. Algazin
2015-01-01
Full Text Available The paper considers the multidimensional Poisson equation in the domain bounded by two parallel hyperplanes (in the multidimensional infinite layer. For an n-dimensional half-space method of solving boundary value problems for linear partial differential equations with constant coefficients is a Fourier transform to the variables in the boundary hyperplane. The same method can be used for an infinite layer, as is done in this paper in the case of the Dirichlet problem for the Poisson equation. For strip and infinite layer in three-dimensional space the solutions of this problem are known. And in the three-dimensional case Green's function is written as an infinite series. In this paper, the solution is obtained in the integral form and kernels of integrals are expressed in a finite form in terms of elementary functions and Bessel functions. A recurrence relation between the kernels of integrals for n-dimensional and (n + 2 -dimensional layers was obtained. In particular, is built the Green's function of the Laplace operator for the Dirichlet problem, through which the solution of the problem is recorded. Even in three-dimensional case we obtained new formula compared to the known. It is shown that the kernel of the integral representation of the solution of the Dirichlet problem for a homogeneous Poisson equation (Laplace equation is an approximate identity (δ-shaped system of functions. Therefore, if the boundary values are generalized functions of slow growth, the solution of the Dirichlet problem for the homogeneous equation (Laplace is written as a convolution of kernels with these functions.
Chain segmentation for the Monte Carlo solution of particle transport problems
International Nuclear Information System (INIS)
Ragheb, M.M.H.
1984-01-01
A Monte Carlo approach is proposed where the random walk chains generated in particle transport simulations are segmented. Forward and adjoint-mode estimators are then used in conjunction with the firstevent source density on the segmented chains to obtain multiple estimates of the individual terms of the Neumann series solution at each collision point. The solution is then constructed by summation of the series. The approach is compared to the exact analytical and to the Monte Carlo nonabsorption weighting method results for two representative slowing down and deep penetration problems. Application of the proposed approach leads to unbiased estimates for limited numbers of particle simulations and is useful in suppressing an effective bias problem observed in some cases of deep penetration particle transport problems
Existence of solutions to fractional boundary-value problems with a parameter
Directory of Open Access Journals (Sweden)
Ya-Ning Li
2013-06-01
Full Text Available This article concerns the existence of solutions to the fractional boundary-value problem $$displaylines{ -frac{d}{dt} ig(frac{1}{2} {}_0D_t^{-eta}+ frac{1}{2}{}_tD_{T}^{-eta}igu'(t=lambda u(t+abla F(t,u(t,quad hbox{a.e. } tin[0,T], cr u(0=0,quad u(T=0. }$$ First for the eigenvalue problem associated with it, we prove that there is a sequence of positive and increasing real eigenvalues; a characterization of the first eigenvalue is also given. Then under different assumptions on the nonlinearity F(t,u, we show the existence of weak solutions of the problem when $lambda$ lies in various intervals. Our main tools are variational methods and critical point theorems.
On one approach to an earthquakes forecasting problems solution
International Nuclear Information System (INIS)
Khugaev, A.V.; Koblik, Yu.N.; Rakhmanov, T.T.
2007-01-01
The problem of earthquake forecasting is practically important one but it is extremely complex and so it does not solved yet. In the report the problem of data analysis obtained in measurements of radioactive gases emission (for example, radon, thoron, action) from the earth surface, data in magnetic fields anomalies measurement and their correlation in accordance of seismic activity is considered. In a general case the problem has an unlikely total solution in an analytic meaning due to it nonlinearity, multi-parametration and influence of random factors. It is suggested that useful solution could be found only at reasonable combination of empiric knowledge got at a long observations, its generalization and numerical simulation. In the base of the offered calculation method the correlation analysis between seismic activity and , for example, radioactive gases emission variations of earthquake signs one can present in form of two components, one of which is regular component, and the second one is irregular one. The key interest presents the analysis of irregular component reasoned by random factors. At problem solution of irregular component of the Earth magnetic fields determination which with high precise could measured with help of magnetic sensors is determined. At that time in the base of mathematical apparatus for analysis the approach for irregular component determination applied at determination of irregular component of galactic magnet field. Hear values of irregular component and field size in which they play considerable role are obtained. Besides, the work the approach allowing solving problem about complex surface oscillation with necessary precision for practical requirements is discussed
Hierarchical Solution of the Traveling Salesman Problem with Random Dyadic Tilings
Kalmár-Nagy, Tamás; Bak, Bendegúz Dezső
We propose a hierarchical heuristic approach for solving the Traveling Salesman Problem (TSP) in the unit square. The points are partitioned with a random dyadic tiling and clusters are formed by the points located in the same tile. Each cluster is represented by its geometrical barycenter and a “coarse” TSP solution is calculated for these barycenters. Midpoints are placed at the middle of each edge in the coarse solution. Near-optimal (or optimal) minimum tours are computed for each cluster. The tours are concatenated using the midpoints yielding a solution for the original TSP. The method is tested on random TSPs (independent, identically distributed points in the unit square) up to 10,000 points as well as on a popular benchmark problem (att532 — coordinates of 532 American cities). Our solutions are 8-13% longer than the optimal ones. We also present an optimization algorithm for the partitioning to improve our solutions. This algorithm further reduces the solution errors (by several percent using 1000 iteration steps). The numerical experiments demonstrate the viability of the approach.
Exact series solution to the two flavor neutrino oscillation problem in matter
International Nuclear Information System (INIS)
Blennow, Mattias; Ohlsson, Tommy
2004-01-01
In this paper, we present a real nonlinear differential equation for the two flavor neutrino oscillation problem in matter with an arbitrary density profile. We also present an exact series solution to this nonlinear differential equation. In addition, we investigate numerically the convergence of this solution for different matter density profiles such as constant and linear profiles as well as the Preliminary Reference Earth Model describing the Earth's matter density profile. Finally, we discuss other methods used for solving the neutrino flavor evolution problem
Problems and solutions in quantum physics
Ficek, Zbigniew
2016-01-01
This book contains tutorial problems with solutions for the textbook Quantum Physics for Beginners. The reader studying the abstract field of quantum physics needs to solve plenty of practical, especially quantitative, problems. This book places emphasis on basic problems of quantum physics together with some instructive, simulating, and useful applications. A considerable range of complexity is presented by these problems, and not too many of them can be solved using formulas alone.
Laplace transform homotopy perturbation method for the approximation of variational problems.
Filobello-Nino, U; Vazquez-Leal, H; Rashidi, M M; Sedighi, H M; Perez-Sesma, A; Sandoval-Hernandez, M; Sarmiento-Reyes, A; Contreras-Hernandez, A D; Pereyra-Diaz, D; Hoyos-Reyes, C; Jimenez-Fernandez, V M; Huerta-Chua, J; Castro-Gonzalez, F; Laguna-Camacho, J R
2016-01-01
This article proposes the application of Laplace Transform-Homotopy Perturbation Method and some of its modifications in order to find analytical approximate solutions for the linear and nonlinear differential equations which arise from some variational problems. As case study we will solve four ordinary differential equations, and we will show that the proposed solutions have good accuracy, even we will obtain an exact solution. In the sequel, we will see that the square residual error for the approximate solutions, belongs to the interval [0.001918936920, 0.06334882582], which confirms the accuracy of the proposed methods, taking into account the complexity and difficulty of variational problems.
Provisional-Ideal-Point-Based Multi-objective Optimization Method for Drone Delivery Problem
Omagari, Hiroki; Higashino, Shin-Ichiro
2018-04-01
In this paper, we proposed a new evolutionary multi-objective optimization method for solving drone delivery problems (DDP). It can be formulated as a constrained multi-objective optimization problem. In our previous research, we proposed the "aspiration-point-based method" to solve multi-objective optimization problems. However, this method needs to calculate the optimal values of each objective function value in advance. Moreover, it does not consider the constraint conditions except for the objective functions. Therefore, it cannot apply to DDP which has many constraint conditions. To solve these issues, we proposed "provisional-ideal-point-based method." The proposed method defines a "penalty value" to search for feasible solutions. It also defines a new reference solution named "provisional-ideal point" to search for the preferred solution for a decision maker. In this way, we can eliminate the preliminary calculations and its limited application scope. The results of the benchmark test problems show that the proposed method can generate the preferred solution efficiently. The usefulness of the proposed method is also demonstrated by applying it to DDP. As a result, the delivery path when combining one drone and one truck drastically reduces the traveling distance and the delivery time compared with the case of using only one truck.
Feed back Petrov-Galerkin methods for convection dominated problems
International Nuclear Information System (INIS)
Carmo, E.G.D. do; Galeao, A.C.
1988-09-01
The Petrov-Galerkin method is adaptively applied to convection dominated problems. To this end a feedback function is created which increases the control of derivatives in the direction of he gradient of the approximate solution. This leads to a method with good stability properties close to boundary layers and high accuracy in those regions where regular solutions do occur. (author) [pt
The numerical solution of boundary value problems over an infinite domain
International Nuclear Information System (INIS)
Shepherd, M.; Skinner, R.
1976-01-01
A method is presented for the numerical solution of boundary value problems over infinite domains. An example that illustrates also the strength and accuracy of a numerical procedure for calculating Green's functions is described in detail
Model reduction method using variable-separation for stochastic saddle point problems
Jiang, Lijian; Li, Qiuqi
2018-02-01
In this paper, we consider a variable-separation (VS) method to solve the stochastic saddle point (SSP) problems. The VS method is applied to obtain the solution in tensor product structure for stochastic partial differential equations (SPDEs) in a mixed formulation. The aim of such a technique is to construct a reduced basis approximation of the solution of the SSP problems. The VS method attempts to get a low rank separated representation of the solution for SSP in a systematic enrichment manner. No iteration is performed at each enrichment step. In order to satisfy the inf-sup condition in the mixed formulation, we enrich the separated terms for the primal system variable at each enrichment step. For the SSP problems by regularization or penalty, we propose a more efficient variable-separation (VS) method, i.e., the variable-separation by penalty method. This can avoid further enrichment of the separated terms in the original mixed formulation. The computation of the variable-separation method decomposes into offline phase and online phase. Sparse low rank tensor approximation method is used to significantly improve the online computation efficiency when the number of separated terms is large. For the applications of SSP problems, we present three numerical examples to illustrate the performance of the proposed methods.
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.
A systematic literature review on the joint replenishment problem solutions: 2006-2015
Directory of Open Access Journals (Sweden)
Leonardo dos Santos Lourenço Bastos
Full Text Available Abstract Among all existing inventory replenishment models, this research was dedicated to the Joint Replenishment Problem (JRP, which consists in the replenishment of multiple items simultaneously, aiming total cost reduction. Literature has presented several optimal and approximated solutions to this problem, with different applications and techniques, which results in a large quantity of solution proposals. Therefore, this research aimed to map existing solutions to the problem in 2006-2015 in order to provide a guide for interested parts in JRP and to update previous reviews. Hence, systematic review was used to assess papers from that period interval. From a total of 128 papers, a general trend for seeking JRP extensions and practical applications was verified. Furthermore, the heuristic and metaheuristic methods were the most used and considered the most suitable due to their simplicity in understanding and application.
Solution of the finite Milne problem in stochastic media with RVT Technique
Slama, Howida; El-Bedwhey, Nabila A.; El-Depsy, Alia; Selim, Mustafa M.
2017-12-01
This paper presents the solution to the Milne problem in the steady state with isotropic scattering phase function. The properties of the medium are considered as stochastic ones with Gaussian or exponential distributions and hence the problem treated as a stochastic integro-differential equation. To get an explicit form for the radiant energy density, the linear extrapolation distance, reflectivity and transmissivity in the deterministic case the problem is solved using the Pomraning-Eddington method. The obtained solution is found to be dependent on the optical space variable and thickness of the medium which are considered as random variables. The random variable transformation (RVT) technique is used to find the first probability density function (1-PDF) of the solution process. Then the stochastic linear extrapolation distance, reflectivity and transmissivity are calculated. For illustration, numerical results with conclusions are provided.
Directory of Open Access Journals (Sweden)
Firat Evirgen
2016-04-01
Full Text Available In this paper, a class of Nonlinear Programming problem is modeled with gradient based system of fractional order differential equations in Caputo's sense. To see the overlap between the equilibrium point of the fractional order dynamic system and theoptimal solution of the NLP problem in a longer timespan the Multistage Variational İteration Method isapplied. The comparisons among the multistage variational iteration method, the variationaliteration method and the fourth order Runge-Kutta method in fractional and integer order showthat fractional order model and techniques can be seen as an effective and reliable tool for finding optimal solutions of Nonlinear Programming problems.
PROBLEMS OF UKRAINIAN ENERGY AND THEIR SOLUTIONS
Directory of Open Access Journals (Sweden)
G. Fyliuk
2016-04-01
Full Text Available The paper studies current situation at the Ukrainian electric power industry. The problems which prevent development of the industry under current conditions are analyzed. The problems of the cross-subsidization are exposed. The ways of the problems solutions are offered.
Polyanin, A. D.; Sorokin, V. G.
2017-12-01
The paper deals with nonlinear reaction-diffusion equations with one or several delays. We formulate theorems that allow constructing exact solutions for some classes of these equations, which depend on several arbitrary functions. Examples of application of these theorems for obtaining new exact solutions in elementary functions are provided. We state basic principles of construction, selection, and use of test problems for nonlinear partial differential equations with delay. Some test problems which can be suitable for estimating accuracy of approximate analytical and numerical methods of solving reaction-diffusion equations with delay are presented. Some examples of numerical solutions of nonlinear test problems with delay are considered.
Kudo, Fumiya; Yoshikawa, Tomohiro; Furuhashi, Takeshi
Recentry, Multi-objective Genetic Algorithm, which is the application of Genetic Algorithm to Multi-objective Optimization Problems is focused on in the engineering design field. In this field, the analysis of design variables in the acquired Pareto solutions, which gives the designers useful knowledge in the applied problem, is important as well as the acquisition of advanced solutions. This paper proposes a new visualization method using Isomap which visualizes the geometric distances of solutions in the design variable space considering their distances in the objective space. The proposed method enables a user to analyze the design variables of the acquired solutions considering their relationship in the objective space. This paper applies the proposed method to the conceptual design optimization problem of hybrid rocket engine and studies the effectiveness of the proposed method.
Analytical Solution of Nonlinear Problems in Classical Dynamics by Means of Lagrange-Ham
DEFF Research Database (Denmark)
Kimiaeifar, Amin; Mahdavi, S. H; Rabbani, A.
2011-01-01
In this work, a powerful analytical method, called Homotopy Analysis Methods (HAM) is coupled with Lagrange method to obtain the exact solution for nonlinear problems in classic dynamics. In this work, the governing equations are obtained by using Lagrange method, and then the nonlinear governing...
A multilevel, level-set method for optimizing eigenvalues in shape design problems
International Nuclear Information System (INIS)
Haber, E.
2004-01-01
In this paper, we consider optimal design problems that involve shape optimization. The goal is to determine the shape of a certain structure such that it is either as rigid or as soft as possible. To achieve this goal we combine two new ideas for an efficient solution of the problem. First, we replace the eigenvalue problem with an approximation by using inverse iteration. Second, we use a level set method but rather than propagating the front we use constrained optimization methods combined with multilevel continuation techniques. Combining these two ideas we obtain a robust and rapid method for the solution of the optimal design problem
Invisibility problem in acoustics, electromagnetism and heat transfer. Inverse design method
Alekseev, G.; Tokhtina, A.; Soboleva, O.
2017-10-01
Two approaches (direct design and inverse design methods) for solving problems of designing devices providing invisibility of material bodies of detection using different physical fields - electromagnetic, acoustic and static are discussed. The second method is applied for solving problems of designing cloaking devices for the 3D stationary thermal scattering model. Based on this method the design problems under study are reduced to respective control problems. The material parameters (radial and tangential heat conductivities) of the inhomogeneous anisotropic medium filling the thermal cloak and the density of auxiliary heat sources play the role of controls. A unique solvability of direct thermal scattering problem in the Sobolev space is proved and the new estimates of solutions are established. Using these results, the solvability of control problem is proved and the optimality system is derived. Based on analysis of optimality system, the stability estimates of optimal solutions are established and numerical algorithms for solving particular thermal cloaking problem are proposed.
International Nuclear Information System (INIS)
Sanchez, Richard.
1980-11-01
This work is divided into two parts: the first part deals with the solution of complex two-dimensional transport problems, the second one (note CEA-N-2166) treats the critically mixed methods of resolution. A set of approximate solutions for the isotropic two-dimensional neutron transport problem has been developed using the interface current formalism. The method has been applied to regular lattices of rectangular cells containing a fuel pin, cladding, and water, or homogenized structural material. The cells are divided into zones that are homogeneous. A zone-wise flux expansion is used to formulate a direct collision probability problem within a cell. The coupling of the cells is effected by making extra assumptions on the currents entering and leaving the interfaces. Two codes have been written: CALLIOPE uses a cylindrical cell model and one or three terms for the flux expansion, and NAUSICAA uses a two-dimensional flux representation and does a truly two-dimensional calculation inside each cell. In both codes, one or three terms can be used to make a space-independent expansion of the angular fluxes entering and leaving each side of the cell. The accuracies and computing times achieved with the different approximations are illustrated by numerical studies on two benchmark problems and by calculations performed in the APOLLO multigroup code [fr
Mapped Fourier Methods for stiff problems in toroidal geometry
Guillard , Herve
2014-01-01
Fourier spectral or pseudo-spectral methods are usually extremely efficient for periodic problems. However this efficiency is lost if the solutions have zones of rapid variations or internal layers. For these cases, a large number of Fourier modes are required and this makes the Fourier method unpractical in many cases. This work investigates the use of mapped Fourier method as a way to circumvent this problem. Mapped Fourier method uses instead of the usual Fourier interpolant the compositio...
Application of the perturbation iteration method to boundary layer type problems.
Pakdemirli, Mehmet
2016-01-01
The recently developed perturbation iteration method is applied to boundary layer type singular problems for the first time. As a preliminary work on the topic, the simplest algorithm of PIA(1,1) is employed in the calculations. Linear and nonlinear problems are solved to outline the basic ideas of the new solution technique. The inner and outer solutions are determined with the iteration algorithm and matched to construct a composite expansion valid within all parts of the domain. The solutions are contrasted with the available exact or numerical solutions. It is shown that the perturbation-iteration algorithm can be effectively used for solving boundary layer type problems.
The Median Solution of the Newsvendor Problem and Some Observations
Directory of Open Access Journals (Sweden)
Sinha Pritibhushan
2015-09-01
Full Text Available We consider the median solution of the Newsvendor Problem. Some properties of such a solution are shown through a theoretical analysis and a numerical experiment. Sometimes, though not often, median solution may be better than solutions maximizing expected profit, or maximizing minimum possible, over distribution with the same average and standard deviation, expected profit, according to some criteria. We discuss the practical suitability of the objective function set and the solution derived, for the Newsvendor Problem, and other such random optimization problems.
Kelly, Regina; McLoughlin, Eilish; Finlayson, Odilla E.
2016-07-01
An interdisciplinary science course has been implemented at a university with the intention of providing students the opportunity to develop a range of key skills in relation to: real-world connections of science, problem-solving, information and communications technology use and team while linking subject knowledge in each of the science disciplines. One of the problems used in this interdisciplinary course has been selected to evaluate if it affords students the opportunity to explicitly display problem-solving processes. While the benefits of implementing problem-based learning have been well reported, far less research has been devoted to methods of assessing student problem-solving solutions. A problem-solving theoretical framework was used as a tool to assess student written solutions to indicate if problem-solving processes were present. In two academic years, student problem-solving processes were satisfactory for exploring and understanding, representing and formulating, and planning and executing, indicating that student collaboration on problems is a good initiator of developing these processes. In both academic years, students displayed poor monitoring and reflecting (MR) processes at the intermediate level. A key impact of evaluating student work in this way is that it facilitated meaningful feedback about the students' problem-solving process rather than solely assessing the correctness of problem solutions.
Finite element method solution of simplified P3 equation for flexible geometry handling
International Nuclear Information System (INIS)
Ryu, Eun Hyun; Joo, Han Gyu
2011-01-01
In order to obtain efficiently core flux solutions which would be much closer to the transport solution than the diffusion solution is, not being limited by the geometry of the core, the simplified P 3 (SP 3 ) equation is solved with the finite element method (FEM). A generic mesh generator, GMSH, is used to generate linear and quadratic mesh data. The linear system resulting from the SP 3 FEM discretization is solved by Krylov subspace methods (KSM). A symmetric form of the SP 3 equation is derived to apply the conjugate gradient method rather than the KSMs for nonsymmetric linear systems. An optional iso-parametric quadratic mapping scheme, which is to selectively model nonlinear shapes with a quadratic mapping to prevent significant mismatch in local domain volume, is also implemented for efficient application of arbitrary geometry handling. The gain in the accuracy attainable by the SP 3 solution over the diffusion solution is assessed by solving numerous benchmark problems having various core geometries including the IAEA PWR problems involving rectangular fuels and the Takeda fast reactor problems involving hexagonal fuels. The reference transport solution is produced by the McCARD Monte Carlo code and the multiplication factor and power distribution errors are assessed. In addition, the effect of quadratic mapping is examined for circular cell problems. It is shown that significant accuracy gain is possible with the SP 3 solution for the fast reactor problems whereas only marginal improvement is noted for thermal reactor problems. The quadratic mapping is also quite effective handling geometries with curvature. (author)
Solution of Riemann problem for ideal polytropic dusty gas
International Nuclear Information System (INIS)
Nath, Triloki; Gupta, R.K.; Singh, L.P.
2017-01-01
Highlights : • A direct approach is used to solve the Riemann problem for dusty ideal polytropic gas. • An analytical solution to the Riemann problem for dusty gas flow is obtained. • The existence and uniqueness of the solution in dusty gas is discussed. • Properties of elementary wave solutions of Riemann problem are discussed. • Effect of mass fraction of solid particles on the solution is presented. - Abstract: The Riemann problem for a quasilinear hyperbolic system of equations governing the one dimensional unsteady flow of an ideal polytropic gas with dust particles is solved analytically without any restriction on magnitude of the initial states. The elementary wave solutions of the Riemann problem, that is shock waves, rarefaction waves and contact discontinuities are derived explicitly and their properties are discussed, for a dusty gas. The existence and uniqueness of the solution for Riemann problem in dusty gas is discussed. Also the conditions leading to the existence of shock waves or simple waves for a 1-family and 3-family curves in the solution of the Riemann problem are discussed. It is observed that the presence of dust particles in an ideal polytropic gas leads to more complex expression as compared to the corresponding ideal case; however all the parallel results remain same. Also, the effect of variation of mass fraction of dust particles with fixed volume fraction (Z) and the ratio of specific heat of the solid particles and the specific heat of the gas at constant pressure on the variation of velocity and density across the shock wave, rarefaction wave and contact discontinuities are discussed.
Geometric Series: A New Solution to the Dog Problem
Dion, Peter; Ho, Anthony
2013-01-01
This article describes what is often referred to as the dog, beetle, mice, ant, or turtle problem. Solutions to this problem exist, some being variations of each other, which involve mathematics of a wide range of complexity. Herein, the authors describe the intuitive solution and the calculus solution and then offer a completely new solution…
[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
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.
Hyperspectral imaging in medicine: image pre-processing problems and solutions in Matlab.
Koprowski, Robert
2015-11-01
The paper presents problems and solutions related to hyperspectral image pre-processing. New methods of preliminary image analysis are proposed. The paper shows problems occurring in Matlab when trying to analyse this type of images. Moreover, new methods are discussed which provide the source code in Matlab that can be used in practice without any licensing restrictions. The proposed application and sample result of hyperspectral image analysis. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Finite element based composite solution for neutron transport problems
International Nuclear Information System (INIS)
Mirza, A.N.; Mirza, N.M.
1995-01-01
A finite element treatment for solving neutron transport problems is presented. The employs region-wise discontinuous finite elements for the spatial representation of the neutron angular flux, while spherical harmonics are used for directional dependence. Composite solutions has been obtained by using different orders of angular approximations in different parts of a system. The method has been successfully implemented for one dimensional slab and two dimensional rectangular geometry problems. An overall reduction in the number of nodal coefficients (more than 60% in some cases as compared to conventional schemes) has been achieved without loss of accuracy with better utilization of computational resources. The method also provides an efficient way of handling physically difficult situations such as treatment of voids in duct problems and sharply changing angular flux. It is observed that a great wealth of information about the spatial and directional dependence of the angular flux is obtained much more quickly as compared to Monte Carlo method, where most of the information in restricted to the locality of immediate interest. (author)
Molecular computation: RNA solutions to chess problems.
Faulhammer, D; Cukras, A R; Lipton, R J; Landweber, L F
2000-02-15
We have expanded the field of "DNA computers" to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a variant of the "Knight problem," which asks generally what configurations of knights can one place on an n x n chess board such that no knight is attacking any other knight on the board. Using specific ribonuclease digestion to manipulate strands of a 10-bit binary RNA library, we developed a molecular algorithm and applied it to a 3 x 3 chessboard as a 9-bit instance of this problem. Here, the nine spaces on the board correspond to nine "bits" or placeholders in a combinatorial RNA library. We recovered a set of "winning" molecules that describe solutions to this problem.
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.
Constructive Solution of Ellipticity Problem for the First Order Differential System
Directory of Open Access Journals (Sweden)
Vladimir E. Balabaev
2017-01-01
Full Text Available We built first order elliptic systems with any possible number of unknown functions and the maximum possible number of unknowns, i.e, in general. These systems provide the basis for studying the properties of any first order elliptic systems. The study of the Cauchy-Riemann system and its generalizations led to the identification of a class of elliptic systems of first-order of a special structure. An integral representation of solutions is of great importance in the study of these systems. Only by means of a constructive method of integral representations we can solve a number of problems in the theory of elliptic systems related mainly to the boundary properties of solutions. The obtained integral representation could be applied to solve a number of problems that are hard to solve, if you rely only on the non-constructive methods. Some analogues of the theorems of Liouville, Weierstrass, Cauchy, Gauss, Morera, an analogue of Green’s formula are established, as well as an analogue of the maximum principle. The used matrix operators allow the new structural arrangement of the maximum number of linearly independent vector fields on spheres of any possible dimension. Also the built operators allow to obtain a constructive solution of the extended problem ”of the sum of squares” known in algebra.
Exact Closed-form Solutions for Lamb's Problem
Feng, X.
2017-12-01
In this work, we report on an exact closedform solution for the displacement at the surfaceof an elastic halfspace elicited by a buried point source that acts at some point underneath thatsurface. This is commonly referred to as the 3D Lamb's problem, for which previous solutionswere restricted to sources and receivers placed at the free surface. By means of the reciprocitytheorem, our solution should also be valid as a means to obtain the displacements at interior pointswhen the source is placed at the free surface. We manage to obtain explicit results by expressingthe solution in terms of elementary algebraic expression as well as elliptic integrals. We anchorour developments on Poissons ratio 0.25 starting from Johnson's numerical, integral transformsolutions. Furthermore, the spatial derivatives of our solutions can be easily acquired in termsof our methods. In the end, our closed-form results agree perfectly with the numerical results ofJohnson, which strongly conrms the correctness of our explicit formulas. It is hoped that in duetime, these formulas may constitute a valuable canonical solution that will serve as a yardstickagainst which other numerical solutions can be compared and measured.In addition, we abstract some terms from our solutions as the generator of the Rayleigh waves.Some basic properties of the Rayleigh waves in the time domain will be indicated in terms of thegenerator. The fareld radiation patterns of P-wave and S-wave elicited by the double-couple forcein the uniform half-space medium could also be acquired from our results.
Stability of stationary solutions for inflow problem on the micropolar fluid model
Yin, Haiyan
2017-04-01
In this paper, we study the asymptotic behavior of solutions to the initial boundary value problem for the micropolar fluid model in a half-line R+:=(0,∞). We prove that the corresponding stationary solutions of the small amplitude to the inflow problem for the micropolar fluid model are time asymptotically stable under small H1 perturbations in both the subsonic and degenerate cases. The microrotation velocity brings us some additional troubles compared with Navier-Stokes equations in the absence of the microrotation velocity. The proof of asymptotic stability is based on the basic energy method.
PN solutions for the slowing-down and the cell calculation problems in plane geometry
International Nuclear Information System (INIS)
Caldeira, Alexandre David
1999-01-01
In this work P N solutions for the slowing-down and cell problems in slab geometry are developed. To highlight the main contributions of this development, one can mention: the new particular solution developed for the P N method applied to the slowing-down problem in the multigroup model, originating a new class of polynomials denominated Chandrasekhar generalized polynomials; the treatment of a specific situation, known as a degeneracy, arising from a particularity in the group constants and the first application of the P N method, for arbitrary N, in criticality calculations at the cell level reported in literature. (author)
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
Solution of the gauge hierarchy problem
International Nuclear Information System (INIS)
Dimopoulos, S.; Georgi, H.
1982-01-01
We propose a novel solution to the gauge hierarchy problem in theories with softly broken supersymmetry. Quantum effects can resuscitate classically sick theories, producing the large scale from the small supersymmetry breaking scale. We use this mechanism to construct realistic SU(6) and SU(5) GUTs which do not suffer from gauge hierarchy or fine tuning problems. (orig.)
Limiting Accuracy of Segregated Solution Methods for Nonsymmetric Saddle Point Problems
Czech Academy of Sciences Publication Activity Database
Jiránek, P.; Rozložník, Miroslav
Roc. 215, c. 1 (2008), s. 28-37 ISSN 0377-0427 R&D Projects: GA MŠk 1M0554; GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : saddle point problems * Schur complement reduction method * null-space projection method * rounding error analysis Subject RIV: BA - General Mathematics Impact factor: 1.048, year: 2008
Solution of the conjugated heat transfer problem for the fuel elements assemblies
International Nuclear Information System (INIS)
Golba, V.S.; Ivanenko, I.J.; Zinina, G.A.
1997-01-01
The paper presents the assemblies conjugated heat conductivity problem calculation and experimental method. The method is based on the temperature superposition modified concept and subchannel method and allows to predict the fuel elements surface temperatures with availability of fuel elements inside structure of any complication caused by technological and working defects and with availability of depositions with low heat conductivity on the fuel elements surfaces. According to the method developed the partial solutions of the heat conductivity equation at the heat removal boundaries (solid-liquid) are found separately for the fuel elements and for the liquid. The heat conductivity equation partial solutions for the fuel elements are predicted by calculations. The coolant heat conductivity equation partial solution ('influence functions') data massif is obtained in present work experimentally in the fuel assembly model consists of 7 tube bundle of fuel elements imitators placed in right grating with relative grating step equal to 1.1 and cooled by eutectic alloy Pb-Bi. It is shown that 'subchannel prediction method' decreases the crosswise heat transfer in comparison with crosswise heat transfer, when the fuel element inside structure is taken into account. Also in the paper it is shown that it is possible to realize the assembly temperature prediction method suggested without carrying out the experiments in the assembly's model in order to get the external problem influence functions'. (author)
Method of lines solution of Richards` equation
Energy Technology Data Exchange (ETDEWEB)
Kelley, C.T.; Miller, C.T.; Tocci, M.D.
1996-12-31
We consider the method of lines solution of Richard`s equation, which models flow through porous media, as an example of a situation in which the method can give incorrect results because of premature termination of the nonlinear corrector iteration. This premature termination arises when the solution has a sharp moving front and the Jacobian is ill-conditioned. While this problem can be solved by tightening the tolerances provided to the ODE or DAE solver used for the temporal integration, it is more efficient to modify the termination criteria of the nonlinear solver and/or recompute the Jacobian more frequently. In this paper we continue previous work on this topic by analyzing the modifications in more detail and giving a strategy on how the modifications can be turned on and off in response to changes in the character of the solution.
The Solution of Large Time-Dependent Problems Using Reduced Coordinates.
1987-06-01
numerical intergration schemes for dynamic problems, the algorithm known as Newmark’s Method. The behavior of the Newmark scheme, as well as the basic...T’he horizontal displacements at the mid-height and the bottom of the buildin- are shown in f igure 4. 13. The solution history illustrated is for a
Constraint satisfaction problems with isolated solutions are hard
International Nuclear Information System (INIS)
Zdeborová, Lenka; Mézard, Marc
2008-01-01
We study the phase diagram and the algorithmic hardness of the random 'locked' constraint satisfaction problems, and compare them to the commonly studied 'non-locked' problems like satisfiability of Boolean formulae or graph coloring. The special property of the locked problems is that clusters of solutions are isolated points. This simplifies significantly the determination of the phase diagram, which makes the locked problems particularly appealing from the mathematical point of view. On the other hand, we show empirically that the clustered phase of these problems is extremely hard from the algorithmic point of view: the best known algorithms all fail to find solutions. Our results suggest that the easy/hard transition (for currently known algorithms) in the locked problems coincides with the clustering transition. These should thus be regarded as new benchmarks of really hard constraint satisfaction problems
A numerical solution of a singular boundary value problem arising in boundary layer theory.
Hu, Jiancheng
2016-01-01
In this paper, a second-order nonlinear singular boundary value problem is presented, which is equivalent to the well-known Falkner-Skan equation. And the one-dimensional third-order boundary value problem on interval [Formula: see text] is equivalently transformed into a second-order boundary value problem on finite interval [Formula: see text]. The finite difference method is utilized to solve the singular boundary value problem, in which the amount of computational effort is significantly less than the other numerical methods. The numerical solutions obtained by the finite difference method are in agreement with those obtained by previous authors.
Electrical circuits in biomedical engineering problems with solutions
Keskin, Ali Ümit
2017-01-01
This authored monograph presents a comprehensive and in-depth analysis of electrical circuit theory in biomedical engineering, ideally suited as textbook for a course program. The book contains methods and theory, but the topical focus is placed on practical applications of circuit theory, including problems, solutions and case studies. The target audience primarily comprises researchers and experts in electrical engineering who intend to embark on biomedical applications. The book is also very well suited for graduate students in the field. .
Hybrid Fundamental Solution Based Finite Element Method: Theory and Applications
Directory of Open Access Journals (Sweden)
Changyong Cao
2015-01-01
Full Text Available An overview on the development of hybrid fundamental solution based finite element method (HFS-FEM and its application in engineering problems is presented in this paper. The framework and formulations of HFS-FEM for potential problem, plane elasticity, three-dimensional elasticity, thermoelasticity, anisotropic elasticity, and plane piezoelectricity are presented. In this method, two independent assumed fields (intraelement filed and auxiliary frame field are employed. The formulations for all cases are derived from the modified variational functionals and the fundamental solutions to a given problem. Generation of elemental stiffness equations from the modified variational principle is also described. Typical numerical examples are given to demonstrate the validity and performance of the HFS-FEM. Finally, a brief summary of the approach is provided and future trends in this field are identified.
Approximate solution fuzzy pantograph equation by using homotopy perturbation method
Jameel, A. F.; Saaban, A.; Ahadkulov, H.; Alipiah, F. M.
2017-09-01
In this paper, Homotopy Perturbation Method (HPM) is modified and formulated to find the approximate solution for its employment to solve (FDDEs) involving a fuzzy pantograph equation. The solution that can be obtained by using HPM is in the form of infinite series that converge to the actual solution of the FDDE and this is one of the benefits of this method In addition, it can be used for solving high order fuzzy delay differential equations directly without reduction to a first order system. Moreover, the accuracy of HPM can be detected without needing the exact solution. The HPM is studied for fuzzy initial value problems involving pantograph equation. Using the properties of fuzzy set theory, we reformulate the standard approximate method of HPM and obtain the approximate solutions. The effectiveness of the proposed method is demonstrated for third order fuzzy pantograph equation.
Directory of Open Access Journals (Sweden)
Z. Pashazadeh Atabakan
2013-01-01
Full Text Available Spectral homotopy analysis method (SHAM as a modification of homotopy analysis method (HAM is applied to obtain solution of high-order nonlinear Fredholm integro-differential problems. The existence and uniqueness of the solution and convergence of the proposed method are proved. Some examples are given to approve the efficiency and the accuracy of the proposed method. The SHAM results show that the proposed approach is quite reasonable when compared to homotopy analysis method, Lagrange interpolation solutions, and exact solutions.
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.
Multiresolution strategies for the numerical solution of optimal control problems
Jain, Sachin
nonlinear programming (NLP) problem that is solved using standard NLP codes. The novelty of the proposed approach hinges on the automatic calculation of a suitable, nonuniform grid over which the NLP problem is solved, which tends to increase numerical efficiency and robustness. Control and/or state constraints are handled with ease, and without any additional computational complexity. The proposed algorithm is based on a simple and intuitive method to balance several conflicting objectives, such as accuracy of the solution, convergence, and speed of the computations. The benefits of the proposed algorithm over uniform grid implementations are demonstrated with the help of several nontrivial examples. Furthermore, two sequential multiresolution trajectory optimization algorithms for solving problems with moving targets and/or dynamically changing environments have been developed. For such problems, high accuracy is desirable only in the immediate future, yet the ultimate mission objectives should be accommodated as well. An intelligent trajectory generation for such situations is thus enabled by introducing the idea of multigrid temporal resolution to solve the associated trajectory optimization problem on a non-uniform grid across time that is adapted to: (i) immediate future, and (ii) potential discontinuities in the state and control variables.
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.
Finding practical solutions to complex problems: IDRC's fifth annual ...
International Development Research Centre (IDRC) Digital Library (Canada)
2016-04-15
Apr 15, 2016 ... English · Français ... Finding practical solutions to complex problems: IDRC's fifth annual ... “IDRC staff share a common goal with the researchers they work with – to find low-cost, down-to-earth solutions to complex problems ...
Analytical solution to the circularity problem in the discounted cash flow valuation framework
Directory of Open Access Journals (Sweden)
Felipe Mejía-Peláez
2011-12-01
Full Text Available In this paper we propose an analytical solution to the circularity problem between value and cost of capital. Our solution is derived starting from a central principle of finance that relates value today to value, cash flow, and the discount rate for next period. We present a general formulation without circularity for the equity value (E, cost of levered equity (Ke, levered firm value (V, and the weighted average cost of capital (WACC. We furthermore compare the results obtained from these formulas with the results of the application of the Adjusted Present Value approach (no circularity and the iterative solution of circularity based upon the iteration feature of a spreadsheet, concluding that all methods yield exactly the same answer. The advantage of this solution is that it avoids problems such as using manual methods (i.e., the popular “Rolling WACC” ignoring the circularity issue, setting a target leverage (usually constant with the inconsistencies that result from it, the wrong use of book values, or attributing the discrepancies in values to rounding errors.
Problems and solutions in quantum chemistry and physics
Johnson, Charles S
1988-01-01
Unusually varied problems, with detailed solutions, cover quantum mechanics, wave mechanics, angular momentum, molecular spectroscopy, scattering theory, more. 280 problems, plus 139 supplementary exercises.
Directory of Open Access Journals (Sweden)
H. O. Bakodah
2013-01-01
Full Text Available A method of lines approach to the numerical solution of nonlinear wave equations typified by the regularized long wave (RLW is presented. The method developed uses a finite differences discretization to the space. Solution of the resulting system was obtained by applying fourth Runge-Kutta time discretization method. Using Von Neumann stability analysis, it is shown that the proposed method is marginally stable. To test the accuracy of the method some numerical experiments on test problems are presented. Test problems including solitary wave motion, two-solitary wave interaction, and the temporal evaluation of a Maxwellian initial pulse are studied. The accuracy of the present method is tested with and error norms and the conservation properties of mass, energy, and momentum under the RLW equation.
The method of lines solution of discrete ordinates method for non-grey media
International Nuclear Information System (INIS)
Cayan, Fatma Nihan; Selcuk, Nevin
2007-01-01
A radiation code based on method of lines (MOL) solution of discrete ordinates method (DOM) for radiative heat transfer in non-grey absorbing-emitting media was developed by incorporation of a gas spectral radiative property model, namely wide band correlated-k (WBCK) model, which is compatible with MOL solution of DOM. Predictive accuracy of the code was evaluated by applying it to 1-D parallel plate and 2-D axisymmetric cylindrical enclosure problems containing absorbing-emitting medium and benchmarking its predictions against line-by-line solutions available in the literature. Comparisons reveal that MOL solution of DOM with WBCK model produces accurate results for radiative heat fluxes and source terms and can be used with confidence in conjunction with computational fluid dynamics codes based on the same approach
The Pizza Problem: A Solution with Sequences
Shafer, Kathryn G.; Mast, Caleb J.
2008-01-01
This article addresses the issues of coaching and assessing. A preservice middle school teacher's unique solution to the Pizza problem was not what the professor expected. The student's solution strategy, based on sequences and a reinvention of Pascal's triangle, is explained in detail. (Contains 8 figures.)
A general analytical solution for the stochastic Milne problem using Karhunen–Loeve (K–L) expansion
International Nuclear Information System (INIS)
Hussein, A.; Selim, M.M.
2013-01-01
This paper considers the solution of the stochastic integro-differential equation of Milne problem with random operator. The Pomraning–Eddington method is implemented to get a closed form solution deterministically. Relying on the spectral properties of the covariance function, the Karhunen–Loeve (K–L) expansion is used to represent the input stochastic process in the deterministic solution. This leads to an explicit expression for the solution process as a multivariate functional of a set of uncorrelated random variables. By using different distributions for these variables, the work is realized through computing the mean and the variance of the solution. The numerical results are found in agreement with those obtained in the literature. -- Highlights: •The solution of the stochastic Milne problem is considered. •We dealt with the random cross-section itself not with the optical transformation of it. •Pomraning–Eddington method together with the (K–L) expansion were implemented. •The solution process is obtained as a functional of a set of uncorrelated random variables. •Good results are obtained for different distributions of these variables
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.
Two numerical methods for an inverse problem for the 2-D Helmholtz equation
Gryazin, Y A; Lucas, T R
2003-01-01
Two solution methods for the inverse problem for the 2-D Helmholtz equation are developed, tested, and compared. The proposed approaches are based on a marching finite-difference scheme which requires the solution of an overdetermined system at each step. The preconditioned conjugate gradient method is used for rapid solutions of these systems and an efficient preconditioner has been developed for this class of problems. Underlying target applications include the imaging of land mines, unexploded ordinance, and pollutant plumes in environmental cleanup sites, each formulated as an inverse problem for a 2-D Helmholtz equation. The images represent the electromagnetic properties of the respective underground regions. Extensive numerical results are presented.
The Iterative Solution to Discrete-Time H∞ Control Problems for Periodic Systems
Directory of Open Access Journals (Sweden)
Ivan G. Ivanov
2016-03-01
Full Text Available This paper addresses the problem of solving discrete-time H ∞ control problems for periodic systems. The approach for solving such a type of equations is well known in the literature. However, the focus of our research is set on the numerical computation of the stabilizing solution. In particular, two effective methods for practical realization of the known iterative processes are described. Furthermore, a new iterative approach is investigated and applied. On the basis of numerical experiments, we compare the presented methods. A major conclusion is that the new iterative approach is faster than rest of the methods and it uses less RAM memory than other methods.
DEFF Research Database (Denmark)
Ganji, D.D; Miansari, Mo; B, Ganjavi
2008-01-01
In this paper, homotopy-perturbation method (HPM) is introduced to solve nonlinear equations of ozone decomposition in aqueous solutions. HPM deforms a di¢ cult problem into a simple problem which can be easily solved. The effects of some parameters such as temperature to the solutions are consid......In this paper, homotopy-perturbation method (HPM) is introduced to solve nonlinear equations of ozone decomposition in aqueous solutions. HPM deforms a di¢ cult problem into a simple problem which can be easily solved. The effects of some parameters such as temperature to the solutions...
The use of wavelet transforms in the solution of two-phase flow problems
International Nuclear Information System (INIS)
Moridis, G.J.; Nikolaou, M.; You, Yong
1994-10-01
In this paper we present the use of wavelets to solve the nonlinear Partial Differential.Equation (PDE) of two-phase flow in one dimension. The wavelet transforms allow a drastically different approach in the discretization of space. In contrast to the traditional trigonometric basis functions, wavelets approximate a function not by cancellation but by placement of wavelets at appropriate locations. When an abrupt chance, such as a shock wave or a spike, occurs in a function, only local coefficients in a wavelet approximation will be affected. The unique feature of wavelets is their Multi-Resolution Analysis (MRA) property, which allows seamless investigational any spatial resolution. The use of wavelets is tested in the solution of the one-dimensional Buckley-Leverett problem against analytical solutions and solutions obtained from standard numerical models. Two classes of wavelet bases (Daubechies and Chui-Wang) and two methods (Galerkin and collocation) are investigated. We determine that the Chui-Wang, wavelets and a collocation method provide the optimum wavelet solution for this type of problem. Increasing the resolution level improves the accuracy of the solution, but the order of the basis function seems to be far less important. Our results indicate that wavelet transforms are an effective and accurate method which does not suffer from oscillations or numerical smearing in the presence of steep fronts
Directory of Open Access Journals (Sweden)
D. A. Eliseev
2015-01-01
Full Text Available The solution stability of an initial boundary problem for a linear hybrid system of differential equations, which models the rotation of a rigid body with two elastic rods located in the same plane is studied in the paper. To an axis passing through the mass center of the rigid body perpendicularly to the rods location plane is applied the stabilizing moment proportional to the angle of the system rotation, derivative of the angle, integral of the angle. The external moment provides a feedback. A method of studying the behavior of solutions of the initial boundary problem is proposed. This method allows to exclude from the hybrid system of differential equations partial differential equations, which describe the dynamics of distributed elements of a mechanical system. It allows us to build one equation for an angle of the system rotation. Its characteristic equation defines the stability of solutions of all the system. In the space of feedback-coefficients the areas that provide the asymptotic stability of solutions of the initial boundary problem are built up.
A History of Aerospace Problems, Their Solutions, Their Lessons
Ryan, R. S.
1996-01-01
The positive aspect of problem occurrences is the opportunity for learning and a challenge for innovation. The learning aspect is not restricted to the solution period of the problem occurrence, but can become the beacon for problem prevention on future programs. Problems/failures serve as a point of departure for scaling to new designs. To ensure that problems/failures and their solutions guide the future programs, a concerted effort has been expended to study these problems, their solutions, their derived lessons learned, and projections for future programs. This includes identification of technology thrusts, process changes, codes development, etc. However, they must not become an excuse for adding layers upon layers of standards, criteria, and requirements, but must serve as guidelines that assist instead of stifling engineers. This report is an extension of prior efforts to accomplish this task. Although these efforts only scratch the surface, it is a beginning that others must complete.
Energy Technology Data Exchange (ETDEWEB)
Silva, Julio M.; Marchesin, Dan [Instituto de Matematica Pura e Aplicada (IMPA), Rio de Janeiro, RJ (Brazil)
2008-07-01
The deep bed filtration problem is closely related to secondary oil recovery. In this work we derive explicit solutions to two filtration problems. The filtration function varies non-linearly with the Darcy speed and linearly with the deposition, but very little. The first solution is built by the method of perturbations and although it is only an approximation it is available in multiple symmetries, including the radial geometry used in the field. The main motivation is the validation of numerical methods. The second solution is exact but it is only available in the linear symmetry, i.e., laboratory geometry. We use it to verify the accuracy of the first solution, but it can also be used to simulate the deposition in experiments. (author)
Inverse problems with non-trivial priors: efficient solution through sequential Gibbs sampling
DEFF Research Database (Denmark)
Hansen, Thomas Mejer; Cordua, Knud Skou; Mosegaard, Klaus
2012-01-01
Markov chain Monte Carlo methods such as the Gibbs sampler and the Metropolis algorithm can be used to sample solutions to non-linear inverse problems. In principle, these methods allow incorporation of prior information of arbitrary complexity. If an analytical closed form description of the prior...... is available, which is the case when the prior can be described by a multidimensional Gaussian distribution, such prior information can easily be considered. In reality, prior information is often more complex than can be described by the Gaussian model, and no closed form expression of the prior can be given....... We propose an algorithm, called sequential Gibbs sampling, allowing the Metropolis algorithm to efficiently incorporate complex priors into the solution of an inverse problem, also for the case where no closed form description of the prior exists. First, we lay out the theoretical background...
Directory of Open Access Journals (Sweden)
A. L. Lapikov
2014-01-01
Full Text Available The paper concerns the solution of direct kinematic problem for the Stewart-Gough platform of the type 6-3. The article represents a detailed analysis of methods of direct kinematic problem solution for platform mechanisms based on the parallel structures. The complexity of the problem solution is estimated for the mechanisms of parallel kinematics in comparison with the classic manipulators, characterized by the open kinematic chain.The method for the solution of this problem is suggested. It consists in setting up the correspondence between the functional dependence of Cartesian coordinates and the orientation of the moving platform centre on the values of generalized coordinates of the manipulator, which may be represented, in the case of platform manipulators, by the lengths of extensible arms to connect the foundation and the moving platform of the manipulator. The method is constructed in such a way that the solution of the direct kinematic problem reduces to solution of the analytical equation of plane where the moving platform is situated. The equation of the required plane is built according to three points which in this case are attachment points of moving platform joints. To define joints coordinates values it is necessary to generate a system of nine nonlinear equations. It ought to be noted that in generating a system of equation are used the equations with the same type of nonlinearity. The physical meaning of all nine equations of the system is Euclidean distance between the points of the manipulator. The location and orientation of the moving platform is represented as a homogeneous transformation matrix. The components of translation and rotation of this matrix can be defined through the required plane.The obtained theoretical results are supposed to be used in the decision support system during the complex research of multi-sectional manipulators of parallel kinematics to describe the geometrically similar 3D-prototype of the
CFD code verification and the method of manufactured solutions
International Nuclear Information System (INIS)
Pelletier, D.; Roache, P.J.
2002-01-01
This paper presents the Method of Manufactured Solutions (MMS) for CFD code verification. The MMS provides benchmark solutions for direct evaluation of the solution error. The best benchmarks are exact analytical solutions with sufficiently complex solution structure to ensure that all terms of the differential equations are exercised in the simulation. The MMS provides a straight forward and general procedure for generating such solutions. When used with systematic grid refinement studies, which are remarkably sensitive, the MMS provides strong code verification with a theorem-like quality. The MMS is first presented on simple 1-D examples. Manufactured solutions for more complex problems are then presented with sample results from grid convergence studies. (author)
An analytic solution of the static problem of inclined risers conveying fluid
Alfosail, Feras; Nayfeh, Ali H.; Younis, Mohammad I.
2016-01-01
We use the method of matched asymptotic expansion to develop an analytic solution to the static problem of clamped–clamped inclined risers conveying fluid. The inclined riser is modeled as an Euler–Bernoulli beam taking into account its self
Solution of linear ill-posed problems using overcomplete dictionaries
Pensky, Marianna
2016-01-01
In the present paper we consider application of overcomplete dictionaries to solution of general ill-posed linear inverse problems. Construction of an adaptive optimal solution for such problems usually relies either on a singular value decomposition or representation of the solution via an orthonormal basis. The shortcoming of both approaches lies in the fact that, in many situations, neither the eigenbasis of the linear operator nor a standard orthonormal basis constitutes an appropriate co...
Uniqueness of solution to a stationary boundary kinetic problem
International Nuclear Information System (INIS)
Zhykharsky, A.V.
1992-01-01
The paper treats the question of uniqueness of solution to the boundary kinetic problem. This analysis is based on the accurate solutions to the stationary one-dimensional boundary kinetic problem for the limited plasma system. In the paper a simplified problem statement is used (no account is taken of the external magnetic field, a simplest form of boundary conditions is accepted) which, however, covers all features of the problem considered. Omitting the details of the conclusion we will write a set of Vlasov stationary kinetic equations for the cases of plane, cylindrical and spherical geometry of the problem. (author) 1 ref
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...
Malik, Suheel Abdullah; Qureshi, Ijaz Mansoor; Amir, Muhammad; Malik, Aqdas Naveed; Haq, Ihsanul
2015-01-01
In this paper, a new heuristic scheme for the approximate solution of the generalized Burgers'-Fisher equation is proposed. The scheme is based on the hybridization of Exp-function method with nature inspired algorithm. The given nonlinear partial differential equation (NPDE) through substitution is converted into a nonlinear ordinary differential equation (NODE). The travelling wave solution is approximated by the Exp-function method with unknown parameters. The unknown parameters are estimated by transforming the NODE into an equivalent global error minimization problem by using a fitness function. The popular genetic algorithm (GA) is used to solve the minimization problem, and to achieve the unknown parameters. The proposed scheme is successfully implemented to solve the generalized Burgers'-Fisher equation. The comparison of numerical results with the exact solutions, and the solutions obtained using some traditional methods, including adomian decomposition method (ADM), homotopy perturbation method (HPM), and optimal homotopy asymptotic method (OHAM), show that the suggested scheme is fairly accurate and viable for solving such problems.
Directory of Open Access Journals (Sweden)
Suheel Abdullah Malik
Full Text Available In this paper, a new heuristic scheme for the approximate solution of the generalized Burgers'-Fisher equation is proposed. The scheme is based on the hybridization of Exp-function method with nature inspired algorithm. The given nonlinear partial differential equation (NPDE through substitution is converted into a nonlinear ordinary differential equation (NODE. The travelling wave solution is approximated by the Exp-function method with unknown parameters. The unknown parameters are estimated by transforming the NODE into an equivalent global error minimization problem by using a fitness function. The popular genetic algorithm (GA is used to solve the minimization problem, and to achieve the unknown parameters. The proposed scheme is successfully implemented to solve the generalized Burgers'-Fisher equation. The comparison of numerical results with the exact solutions, and the solutions obtained using some traditional methods, including adomian decomposition method (ADM, homotopy perturbation method (HPM, and optimal homotopy asymptotic method (OHAM, show that the suggested scheme is fairly accurate and viable for solving such problems.
Energy Technology Data Exchange (ETDEWEB)
Aarao, J; Bradshaw-Hajek, B H; Miklavcic, S J; Ward, D A, E-mail: Stan.Miklavcic@unisa.edu.a [School of Mathematics and Statistics, University of South Australia, Mawson Lakes, SA 5095 (Australia)
2010-05-07
Standard analytical solutions to elliptic boundary value problems on asymmetric domains are rarely, if ever, obtainable. In this paper, we propose a solution technique wherein we embed the original domain into one with simple boundaries where the classical eigenfunction solution approach can be used. The solution in the larger domain, when restricted to the original domain, is then the solution of the original boundary value problem. We call this the extended-domain-eigenfunction method. To illustrate the method's strength and scope, we apply it to Laplace's equation on an annular-like domain.
Solutions to selected exercise problems in quantum chemistry and spectroscopy
DEFF Research Database (Denmark)
Spanget-Larsen, Jens
2016-01-01
Suggested solutions to a number of problems from the collection "Exercise Problems in Quantum Chemistry and Spectroscopy", previously published on ResearchGate (DOI: 10.13140/RG.2.1.4024.8162).......Suggested solutions to a number of problems from the collection "Exercise Problems in Quantum Chemistry and Spectroscopy", previously published on ResearchGate (DOI: 10.13140/RG.2.1.4024.8162)....
Directory of Open Access Journals (Sweden)
L.L. Glazyrina
2016-12-01
Full Text Available In this paper, the initial-boundary problem for two nonlinear parabolic combined equations has been considered. One of the equations is set on the bounded domain Ω from R2, another equation is set along the curve lying in Ω. Both of the equations are parabolic equations with double degeneration. The degeneration can be present at the space operator. Furthermore, the nonlinear function which is under the sign of partial derivative with respect to the variable t, can be bound to zero. This problem has an applied character: such structure is needed to describe the process of surface and ground water combined movement. In this case, the desired function determines the level of water above the given impenetrable bottom, the section simulates the riverbed. The Bussinesk equation has been used for mathematical description of the groundwater filtration process in the domain Ω; a diffusion analogue of the Saint-Venant's system has been used on the section for description of the process of water level change in the open channel. Earlier, the authors proved the theorems of generalized solution existence and uniqueness for the considered problem from the functions classes which are called strengthened Sobolev spaces in the literature. To obtain these results, we used the technique which was created by the German mathematicians (H.W. Alt, S. Luckhaus, F. Otto to establish the correctness of the problems with a double degeneration. In this paper, we have proposed and investigated an approximate solution method for the above-stated problem. This method has been constructed using semidiscretization with respect to the variable t and the finite element method for space variables. Triangulation of the domain has been accomplished by triangles. The mesh has been set on the section line. On each segment of the line section lying between the nearby mesh points, on both side of this segment we have constructed the triangles with a common side which matches with
Infinitely many solutions for a fourth-order boundary-value problem
Directory of Open Access Journals (Sweden)
Seyyed Mohsen Khalkhali
2012-09-01
Full Text Available In this article we consider the existence of infinitely many solutions to the fourth-order boundary-value problem $$displaylines{ u^{iv}+alpha u''+eta(x u=lambda f(x,u+h(u,quad xin]0,1[cr u(0=u(1=0,cr u''(0=u''(1=0,. }$$ Our approach is based on variational methods and critical point theory.
Application of the Least Squares Method in Axisymmetric Biharmonic Problems
Directory of Open Access Journals (Sweden)
Vasyl Chekurin
2016-01-01
Full Text Available An approach for solving of the axisymmetric biharmonic boundary value problems for semi-infinite cylindrical domain was developed in the paper. On the lateral surface of the domain homogeneous Neumann boundary conditions are prescribed. On the remaining part of the domain’s boundary four different biharmonic boundary pieces of data are considered. To solve the formulated biharmonic problems the method of least squares on the boundary combined with the method of homogeneous solutions was used. That enabled reducing the problems to infinite systems of linear algebraic equations which can be solved with the use of reduction method. Convergence of the solution obtained with developed approach was studied numerically on some characteristic examples. The developed approach can be used particularly to solve axisymmetric elasticity problems for cylindrical bodies, the heights of which are equal to or exceed their diameters, when on their lateral surface normal and tangential tractions are prescribed and on the cylinder’s end faces various types of boundary conditions in stresses in displacements or mixed ones are given.
The Solution of Two-Phase Inverse Stefan Problem Based on a Hybrid Method with Optimization
Directory of Open Access Journals (Sweden)
Yang Yu
2015-01-01
Full Text Available The two-phase Stefan problem is widely used in industrial field. This paper focuses on solving the two-phase inverse Stefan problem when the interface moving is unknown, which is more realistic from the practical point of view. With the help of optimization method, the paper presents a hybrid method which combines the homotopy perturbation method with the improved Adomian decomposition method to solve this problem. Simulation experiment demonstrates the validity of this method. Optimization method plays a very important role in this paper, so we propose a modified spectral DY conjugate gradient method. And the convergence of this method is given. Simulation experiment illustrates the effectiveness of this modified spectral DY conjugate gradient method.
Determination of Periodic Solution for Tapered Beams with Modified Iteration Perturbation Method
Directory of Open Access Journals (Sweden)
Mohammad Mehdi Mashinchi Joubari
2015-01-01
Full Text Available In this paper, we implemented the Modified Iteration Perturbation Method (MIPM for approximating the periodic behavior of a tapered beam. This problem is formulated as a nonlinear ordinary differential equation with linear and nonlinear terms. The solution is quickly convergent and does not need to complicated calculations. Comparing the results of the MIPM with the exact solution shows that this method is effective and convenient. Also, it is predicated that MIPM can be potentially used in the analysis of strongly nonlinear oscillation problems accurately.
Zhu, C
2003-01-01
This paper is concerned with the existence and uniqueness of the entropy solution to the initial boundary value problem for the inviscid Burgers equation. To apply the method of vanishing viscosity to study the existence of the entropy solution, we first introduce the initial boundary value problem for the viscous Burgers equation, and as in Evans (1998 Partial Differential Equations (Providence, RI: American Mathematical Society) and Hopf (1950 Commun. Pure Appl. Math. 3 201-30), give the formula of the corresponding viscosity solutions by Hopf-Cole transformation. Secondly, we prove the convergence of the viscosity solution sequences and verify that the limiting function is an entropy solution. Finally, we give an example to show how our main result can be applied to solve the initial boundary value problem for the Burgers equation.
International Nuclear Information System (INIS)
Zhu, Changjiang; Duan, Renjun
2003-01-01
This paper is concerned with the existence and uniqueness of the entropy solution to the initial boundary value problem for the inviscid Burgers equation. To apply the method of vanishing viscosity to study the existence of the entropy solution, we first introduce the initial boundary value problem for the viscous Burgers equation, and as in Evans (1998 Partial Differential Equations (Providence, RI: American Mathematical Society) and Hopf (1950 Commun. Pure Appl. Math. 3 201-30), give the formula of the corresponding viscosity solutions by Hopf-Cole transformation. Secondly, we prove the convergence of the viscosity solution sequences and verify that the limiting function is an entropy solution. Finally, we give an example to show how our main result can be applied to solve the initial boundary value problem for the Burgers equation
Directory of Open Access Journals (Sweden)
Long Yuhua
2017-12-01
Full Text Available In this paper, we study second-order nonlinear discrete Robin boundary value problem with parameter dependence. Applying invariant sets of descending flow and variational methods, we establish some new sufficient conditions on the existence of sign-changing solutions, positive solutions and negative solutions of the system when the parameter belongs to appropriate intervals. In addition, an example is given to illustrate our results.
Multigrid Methods for EHL Problems
Nurgat, Elyas; Berzins, Martin
1996-01-01
In many bearings and contacts, forces are transmitted through thin continuous fluid films which separate two contacting elements. Objects in contact are normally subjected to friction and wear which can be reduced effectively by using lubricants. If the lubricant film is sufficiently thin to prevent the opposing solids from coming into contact and carries the entire load, then we have hydrodynamic lubrication, where the lubricant film is determined by the motion and geometry of the solids. However, for loaded contacts of low geometrical conformity, such as gears, rolling contact bearings and cams, this is not the case due to high pressures and this is referred to as Elasto-Hydrodynamic Lubrication (EHL) In EHL, elastic deformation of the contacting elements and the increase in fluid viscosity with pressure are very significant and cannot be ignored. Since the deformation results in changing the geometry of the lubricating film, which in turn determines the pressure distribution, an EHL mathematical model must simultaneously satisfy the complex elasticity (integral) and the Reynolds lubrication (differential) equations. The nonlinear and coupled nature of the two equations makes numerical calculations computationally intensive. This is especially true for highly loaded problems found in practice. One novel feature of these problems is that the solution may exhibit sharp pressure spikes in the outlet region. To this date both finite element and finite difference methods have been used to solve EHL problems with perhaps greater emphasis on the use of the finite difference approach. In both cases, a major computational difficulty is ensuring convergence of the nonlinear equations solver to a steady state solution. Two successful methods for achieving this are direct iteration and multigrid methods. Direct iteration methods (e.g Gauss Seidel) have long been used in conjunction with finite difference discretizations on regular meshes. Perhaps one of the best examples of
Directory of Open Access Journals (Sweden)
Azza Hassan Amer
2017-12-01
Full Text Available Geometric programming problem is a powerful tool for solving some special type nonlinear programming problems. In the last few years we have seen a very rapid development on solving multiobjective geometric programming problem. A few mathematical programming methods namely fuzzy programming, goal programming and weighting methods have been applied in the recent past to find the compromise solution. In this paper, -constraint method has been applied in bi-level multiobjective geometric programming problem to find the Pareto optimal solution at each level. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem at eash level. Here, we have developed a new algorithm for fuzzy programming technique to solve bi-level multiobjective geometric programming problems to find an optimal compromise solution. Finally the solution procedure of the fuzzy technique is illustrated by a numerical example
Directory of Open Access Journals (Sweden)
Winfried Auzinger
2006-01-01
Full Text Available We demonstrate that eigenvalue problems for ordinary differential equations can be recast in a formulation suitable for the solution by polynomial collocation. It is shown that the well-posedness of the two formulations is equivalent in the regular as well as in the singular case. Thus, a collocation code equipped with asymptotically correct error estimation and adaptive mesh selection can be successfully applied to compute the eigenvalues and eigenfunctions efficiently and with reliable control of the accuracy. Numerical examples illustrate this claim.
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)
Solution of the Schroedinger equation by a spectral method
International Nuclear Information System (INIS)
Feit, M.D.; Fleck, J.A. Jr.; Steiger, A.
1982-01-01
A new computational method for determining the eigenvalues and eigenfunctions of the Schroedinger equation is described. Conventional methods for solving this problem rely on diagonalization of a Hamiltonian matrix or iterative numerical solutions of a time independent wave equation. The new method, in contrast, is based on the spectral properties of solutions to the time-dependent Schroedinger equation. The method requires the computation of a correlation function from a numerical solution psi(r, t). Fourier analysis of this correlation function reveals a set of resonant peaks that correspond to the stationary states of the system. Analysis of the location of these peaks reveals the eigenvalues with high accuracy. Additional Fourier transforms of psi(r, t) with respect to time generate the eigenfunctions. The effectiveness of the method is demonstrated for a one-dimensional asymmetric double well potential and for the two-dimensional Henon--Heiles potential
International Nuclear Information System (INIS)
Latynin, V.A.; Reshetov, V.A.; Karaseva, L.N.
1988-01-01
Numerical solution of the Stephen problem by the strained coordinate method is presented for an one-dimensional sphere. Differential formulae of heat fluxes from moving interfaces do not take into account volume heat capacities of the front nodes. Calculations, carried out according to these balanced formulae, as well as according to those usually used, have shown that the balanced formulae permit to reduce approximately by an order the number of nodes on the sphere radius, if similar accuracy of heat balance of the whole process of melting or crystallization is observed. 2 refs.; 1 fig
Selecting The Best Initial Method For A Transportation Problem ...
African Journals Online (AJOL)
This paper is concerned with determining the best initial method for a transportation problem. Seven initial methods are considered and compared. One is a new method that has not been reported in the literature. Comparison is done on the basis of the number of iterations required to reach the final solution if the concerned ...
Novel method for solution of coupled radial Schrödinger equations
International Nuclear Information System (INIS)
Ershov, S. N.; Vaagen, J. S.; Zhukov, M. V.
2011-01-01
One of the major problems in numerical solution of coupled differential equations is the maintenance of linear independence for different sets of solution vectors. A novel method for solution of radial Schrödinger equations is suggested. It consists of rearrangement of coupled equations in a way that is appropriate to avoid usual numerical instabilities associated with components of the wave function in their classically forbidden regions. Applications of the new method for nuclear structure calculations within the hyperspherical harmonics approach are given.
Directory of Open Access Journals (Sweden)
Hossein Karimi
2011-04-01
Full Text Available The permutation method of multiple attribute decision making has two significant deficiencies: high computational time and wrong priority output in some problem instances. In this paper, a novel permutation method called adjusted permutation method (APM is proposed to compensate deficiencies of conventional permutation method. We propose Tabu search (TS and particle swarm optimization (PSO to find suitable solutions at a reasonable computational time for large problem instances. The proposed method is examined using some numerical examples to evaluate the performance of the proposed method. The preliminary results show that both approaches provide competent solutions in relatively reasonable amounts of time while TS performs better to solve APM.
Configuration space methods in the three-nucleon problem
International Nuclear Information System (INIS)
Friar, J.L.
1985-01-01
The assumptions underlying the formulation and solution of the Schroedinger equation for three nucleons in configuration space are reviewed. Those qualitative aspects of the two-nucleon problem which play an important role in the trinucleon are discussed. The geometrical aspects of the problem are developed, and the importance of the angular momentum barrier is demonstrated. The Faddeev-Noyes formulation of the Schroedinger equation is motivated, and the boundary conditions for various three-body problems is reviewed. The method of splines is shown to provide a particularly useful numerical modelling technique for solving the Faddeev-Noyes equation. The properties of explicit trinucleon solutions for various two-body force models are discussed, and the evidence for three-body forces is reviewed. The status of calculations of trinucleon observables is discussed, and conclusions are presented. 40 refs., 14 figs
APPLICATION OF BOUNDARY INTEGRAL EQUATION METHOD FOR THERMOELASTICITY PROBLEMS
Directory of Open Access Journals (Sweden)
Vorona Yu.V.
2015-12-01
Full Text Available Boundary Integral Equation Method is used for solving analytically the problems of coupled thermoelastic spherical wave propagation. The resulting mathematical expressions coincide with the solutions obtained in a conventional manner.
An Augmented Lagrangian Method for the Optimal H∞ Model Order Reduction Problem
Directory of Open Access Journals (Sweden)
Hongli Yang
2017-01-01
Full Text Available This paper treats the computational method of the optimal H∞ model order reduction (MOR problem of linear time-invariant (LTI systems. Optimal solution of MOR problem of LTI systems can be obtained by solving the LMIs feasibility coupling with a rank inequality constraint, which makes the solutions much harder to be obtained. In this paper, we show that the rank inequality constraint can be formulated as a linear rank function equality constraint. Properties of the linear rank function are discussed. We present an iterative algorithm based on augmented Lagrangian method by replacing the rank inequality with the linear rank function. Convergence analysis of the algorithm is given, which is distinct to the now available heuristic methods. Numerical experiments for the MOR problems of continuous LTI system illustrate the practicality of our method.
Exact solution of some linear matrix equations using algebraic methods
Djaferis, T. E.; Mitter, S. K.
1977-01-01
A study is done of solution methods for Linear Matrix Equations including Lyapunov's equation, using methods of modern algebra. The emphasis is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The action f sub BA is introduced a Basic Lemma is proven. The equation PA + BP = -C as well as the Lyapunov equation are analyzed. Algorithms are given for the solution of the Lyapunov and comment is given on its arithmetic complexity. The equation P - A'PA = Q is studied and numerical examples are given.
Modification of equivalent charge method for the Roben three-dimensional problem in electrostatics
International Nuclear Information System (INIS)
Barsukov, A.B.; Surenskij, A.V.
1989-01-01
The approach of the Roben problem solution for the calculation of the potential of intermediate electrode of accelerating structure with HFQ focusing is considered. The solution is constructed on the basis of variational formulation of the equivalent charge method, where electrostatic problem is reduced to equations of root-mean-square residuals on the system conductors. The technique presented permits to solve efficiently the three-dimensional problems of electrostatics for rather complicated from geometrical viewpoint systems of electrodes. Processing time is comparable with methods of integral equations. 5 refs.; 2 figs
Iterative observer based method for source localization problem for Poisson equation in 3D
Majeed, Muhammad Usman
2017-07-10
A state-observer based method is developed to solve point source localization problem for Poisson equation in a 3D rectangular prism with available boundary data. The technique requires a weighted sum of solutions of multiple boundary data estimation problems for Laplace equation over the 3D domain. The solution of each of these boundary estimation problems involves writing down the mathematical problem in state-space-like representation using one of the space variables as time-like. First, system observability result for 3D boundary estimation problem is recalled in an infinite dimensional setting. Then, based on the observability result, the boundary estimation problem is decomposed into a set of independent 2D sub-problems. These 2D problems are then solved using an iterative observer to obtain the solution. Theoretical results are provided. The method is implemented numerically using finite difference discretization schemes. Numerical illustrations along with simulation results are provided.
A spectral dynamic stiffness method for free vibration analysis of plane elastodynamic problems
Liu, X.; Banerjee, J. R.
2017-03-01
A highly efficient and accurate analytical spectral dynamic stiffness (SDS) method for modal analysis of plane elastodynamic problems based on both plane stress and plane strain assumptions is presented in this paper. First, the general solution satisfying the governing differential equation exactly is derived by applying two types of one-dimensional modified Fourier series. Then the SDS matrix for an element is formulated symbolically using the general solution. The SDS matrices are assembled directly in a similar way to that of the finite element method, demonstrating the method's capability to model complex structures. Any arbitrary boundary conditions are represented accurately in the form of the modified Fourier series. The Wittrick-Williams algorithm is then used as the solution technique where the mode count problem (J0) of a fully-clamped element is resolved. The proposed method gives highly accurate solutions with remarkable computational efficiency, covering low, medium and high frequency ranges. The method is applied to both plane stress and plane strain problems with simple as well as complex geometries. All results from the theory in this paper are accurate up to the last figures quoted to serve as benchmarks.
Directory of Open Access Journals (Sweden)
Omar Abu Arqub
2014-01-01
Full Text Available The purpose of this paper is to present a new kind of analytical method, the so-called residual power series, to predict and represent the multiplicity of solutions to nonlinear boundary value problems of fractional order. The present method is capable of calculating all branches of solutions simultaneously, even if these multiple solutions are very close and thus rather difficult to distinguish even by numerical techniques. To verify the computational efficiency of the designed proposed technique, two nonlinear models are performed, one of them arises in mixed convection flows and the other one arises in heat transfer, which both admit multiple solutions. The results reveal that the method is very effective, straightforward, and powerful for formulating these multiple solutions.
Directory of Open Access Journals (Sweden)
Shuang Wang
2012-01-01
Full Text Available As an efficient tool, radial basis function (RBF has been widely used for the multivariate approximation, interpolating continuous, and the solution of the particle differential equations. However, ill-conditioned interpolation matrix may be encountered when the interpolation points are very dense or irregularly arranged. To avert this problem, RBFs with variable shape parameters are introduced, and several new variation strategies are proposed. Comparison with the RBF with constant shape parameters are made, and the results show that the condition number of the interpolation matrix grows much slower with our strategies. As an application, an improved collocation meshless method is formulated by employing the new RBF. In addition, the Hermite-type interpolation is implemented to handle the Neumann boundary conditions and an additional sine/cosine basis is introduced for the Helmlholtz equation. Then, two interior acoustic problems are solved with the presented method; the results demonstrate the robustness and effectiveness of the method.
International Nuclear Information System (INIS)
Puzynin, I.V.; Puzynina, T.P.; Tkhak, V.Ch.
2010-01-01
SLIPM (Sturm-LIouville Problem in MAPLE) is a program complex written in the language of the computer algebras system MAPLE. It consists of the main program SLIPM.mw and of some procedures. It is intended for a numerical solution with the help of the continuous analog of Newton's method (CANM) of Sturm-Liouville partial problems, i.e. for calculating some eigenvalue of linear second-order differential operator and a corresponding eigenfunction satisfying homogeneous boundary conditions of the general type. SLIPM is the development of the program complexes SLIP1 and SLIPH4 written in the Fortran language. It is added by two new ways of calculating the initial value of iterative parameter τ 0 , by a procedure for calculating a higher precision solution (eigenvalue and corresponding eigenfunction) with the help of Richardson's extrapolation method, by graphical visualization procedures of intermediate and final results of the iterative process and by saving of the results on a disk file. The descriptions of the procedures purposes and their parameters are given
Positive solutions for a fourth order boundary value problem
Directory of Open Access Journals (Sweden)
Bo Yang
2005-02-01
Full Text Available We consider a boundary value problem for the beam equation, in which the boundary conditions mean that the beam is embedded at one end and free at the other end. Some new estimates to the positive solutions to the boundary value problem are obtained. Some sufficient conditions for the existence of at least one positive solution for the boundary value problem are established. An example is given at the end of the paper to illustrate the main results.
To the development of numerical methods in problems of radiation transport
International Nuclear Information System (INIS)
Germogenova, T.A.
1990-01-01
Review of studies on the development of numerical methods and the discrete ordinate method in particular, used for solution of radiation protection physics problems is given. Consideration is given to the problems, which arise when calculating fields of penetrating radiation and when studying processes of charged-particle transport and cascade processes, generated by high-energy primary radiation
On multiple level-set regularization methods for inverse problems
International Nuclear Information System (INIS)
DeCezaro, A; Leitão, A; Tai, X-C
2009-01-01
We analyze a multiple level-set method for solving inverse problems with piecewise constant solutions. This method corresponds to an iterated Tikhonov method for a particular Tikhonov functional G α based on TV–H 1 penalization. We define generalized minimizers for our Tikhonov functional and establish an existence result. Moreover, we prove convergence and stability results of the proposed Tikhonov method. A multiple level-set algorithm is derived from the first-order optimality conditions for the Tikhonov functional G α , similarly as the iterated Tikhonov method. The proposed multiple level-set method is tested on an inverse potential problem. Numerical experiments show that the method is able to recover multiple objects as well as multiple contrast levels
An alternative extragradient projection method for quasi-equilibrium problems.
Chen, Haibin; Wang, Yiju; Xu, Yi
2018-01-01
For the quasi-equilibrium problem where the players' costs and their strategies both depend on the rival's decisions, an alternative extragradient projection method for solving it is designed. Different from the classical extragradient projection method whose generated sequence has the contraction property with respect to the solution set, the newly designed method possesses an expansion property with respect to a given initial point. The global convergence of the method is established under the assumptions of pseudomonotonicity of the equilibrium function and of continuity of the underlying multi-valued mapping. Furthermore, we show that the generated sequence converges to the nearest point in the solution set to the initial point. Numerical experiments show the efficiency of the method.
Shape space figure-8 solution of three body problem with two equal masses
Yu, Guowei
2017-06-01
In a preprint by Montgomery (https://people.ucsc.edu/~rmont/Nbdy.html), the author attempted to prove the existence of a shape space figure-8 solution of the Newtonian three body problem with two equal masses (it looks like a figure 8 in the shape space, which is different from the famous figure-8 solution with three equal masses (Chenciner and Montgomery 2000 Ann. Math. 152 881-901)). Unfortunately there is an error in the proof and the problem is still open. Consider the α-homogeneous Newton-type potential, 1/rα, using action minimization method, we prove the existence of this solution, for α \\in (1, 2) ; for α=1 (the Newtonian potential), an extra condition is required, which unfortunately seems hard to verify at this moment.
Development of a coarse mesh code for the solution of two group static diffusion problems
International Nuclear Information System (INIS)
Barros, R.C. de.
1985-01-01
This new coarse mesh code designed for the solution of 2 and 3 dimensional static diffusion problems, is based on an alternating direction method which consists in the solution of one dimensional problem along each coordinate direction with leakage terms for the remaining directions estimated from previous interactions. Four versions of this code have been developed: AD21 - 2D - 1/4, AD21 - 2D - 4/4, AD21 - 3D - 1/4 and AD21 - 3D - 4/4; these versions have been designed for 2 and 3 dimensional problems with or without 1/4 symmetry. (Author) [pt
three solutions for a semilinear elliptic boundary value problem
Indian Academy of Sciences (India)
69
Keywords: The Laplacian operator, elliptic problem, Nehari man- ifold, three critical points, weak solution. 1. Introduction. Let Ω be a smooth bounded domain in RN , N ≥ 3 . In this work, we show the existence of at least three solutions for the semilinear elliptic boundary- value problem: (Pλ).. −∆u = f(x)|u(x)|p−2u(x) + ...
Explicit solution of Riemann-Hilbert problems for the Ernst equation
Klein, C.; Richter, O.
1998-01-01
Riemann-Hilbert problems are an important solution technique for completely integrable differential equations. They are used to introduce a free function in the solutions which can be used at least in principle to solve initial or boundary value problems. But even if the initial or boundary data can be translated into a Riemann-Hilbert problem, it is in general impossible to obtain explicit solutions. In the case of the Ernst equation, however, this is possible for a large class because the matrix problem can be shown to be gauge equivalent to a scalar one on a hyperelliptic Riemann surface that can be solved in terms of theta functions. As an example we discuss the rigidly rotating dust disk.
Computational methods in calculating superconducting current problems
Brown, David John, II
Various computational problems in treating superconducting currents are examined. First, field inversion in spatial Fourier transform space is reviewed to obtain both one-dimensional transport currents flowing down a long thin tape, and a localized two-dimensional current. The problems associated with spatial high-frequency noise, created by finite resolution and experimental equipment, are presented, and resolved with a smooth Gaussian cutoff in spatial frequency space. Convergence of the Green's functions for the one-dimensional transport current densities is discussed, and particular attention is devoted to the negative effects of performing discrete Fourier transforms alone on fields asymptotically dropping like 1/r. Results of imaging simulated current densities are favorably compared to the original distributions after the resulting magnetic fields undergo the imaging procedure. The behavior of high-frequency spatial noise, and the behavior of the fields with a 1/r asymptote in the imaging procedure in our simulations is analyzed, and compared to the treatment of these phenomena in the published literature. Next, we examine calculation of Mathieu and spheroidal wave functions, solutions to the wave equation in elliptical cylindrical and oblate and prolate spheroidal coordinates, respectively. These functions are also solutions to Schrodinger's equations with certain potential wells, and are useful in solving time-varying superconducting problems. The Mathieu functions are Fourier expanded, and the spheroidal functions expanded in associated Legendre polynomials to convert the defining differential equations to recursion relations. The infinite number of linear recursion equations is converted to an infinite matrix, multiplied by a vector of expansion coefficients, thus becoming an eigenvalue problem. The eigenvalue problem is solved with root solvers, and the eigenvector problem is solved using a Jacobi-type iteration method, after preconditioning the
A numerical method for two-dimensional anisotropic transport problem in cylindrical geometry
International Nuclear Information System (INIS)
Du Mingsheng; Feng Tiekai; Fu Lianxiang; Cao Changshu; Liu Yulan
1988-01-01
The authors deal with the triangular mesh-discontinuous finite element method for solving the time-dependent anisotropic neutron transport problem in two-dimensional cylindrical geometry. A prior estimate of the numerical solution is given. Stability is proved. The authors have computed a two dimensional anisotropic neutron transport problem and a Tungsten-Carbide critical assembly problem by using the numerical method. In comparision with DSN method and the experimental results obtained by others both at home and abroad, the method is satisfactory
Solution of (3+1-Dimensional Nonlinear Cubic Schrodinger Equation by Differential Transform Method
Directory of Open Access Journals (Sweden)
Hassan A. Zedan
2012-01-01
Full Text Available Four-dimensional differential transform method has been introduced and fundamental theorems have been defined for the first time. Moreover, as an application of four-dimensional differential transform, exact solutions of nonlinear system of partial differential equations have been investigated. The results of the present method are compared very well with analytical solution of the system. Differential transform method can easily be applied to linear or nonlinear problems and reduces the size of computational work. With this method, exact solutions may be obtained without any need of cumbersome work, and it is a useful tool for analytical and numerical solutions.
A Maximum Entropy Method for a Robust Portfolio Problem
Directory of Open Access Journals (Sweden)
Yingying Xu
2014-06-01
Full Text Available We propose a continuous maximum entropy method to investigate the robustoptimal portfolio selection problem for the market with transaction costs and dividends.This robust model aims to maximize the worst-case portfolio return in the case that allof asset returns lie within some prescribed intervals. A numerical optimal solution tothe problem is obtained by using a continuous maximum entropy method. Furthermore,some numerical experiments indicate that the robust model in this paper can result in betterportfolio performance than a classical mean-variance model.
SIPPI: A Matlab toolbox for sampling the solution to inverse problems with complex prior information
DEFF Research Database (Denmark)
Hansen, Thomas Mejer; Cordua, Knud Skou; Caroline Looms, Majken
2013-01-01
on the solution. The combined states of information (i.e. the solution to the inverse problem) is a probability density function typically referred to as the a posteriori probability density function. We present a generic toolbox for Matlab and Gnu Octave called SIPPI that implements a number of methods...
Multigrid for the Galerkin least squares method in linear elasticity: The pure displacement problem
Energy Technology Data Exchange (ETDEWEB)
Yoo, Jaechil [Univ. of Wisconsin, Madison, WI (United States)
1996-12-31
Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we prove the convergence of a multigrid (W-cycle) method. This multigrid is robust in that the convergence is uniform as the parameter, v, goes to 1/2 Computational experiments are included.
Logic problems and solutions for memory signal of SEC pump in FQNP
International Nuclear Information System (INIS)
Lu Yanfei; Dang Xiaoqiang; Zhou Li; Ye Aiai
2014-01-01
In the Fuqing nuclear power plant, as a nuclear safety function system, the essential service water system is set two trains, and there are two pumps in each train. These pumps can be switched automatically according to the operation conditions. The signal which performs the automatic switch function called memory signal. This paper introduces the definition and role of the memory signal firstly, and then analyzes the logic of the two mutual backup SEC pumps, and the implementation method based on DCS platform. Finally, this paper presents the problems of memory signal during the commissioning and operation. Meanwhile, this paper proposes solutions to solve these problems, and analyzes the risk of the solutions, as well the significance for later units. (authors)
Approach method of the solutions of algebraic models of the N body problem
International Nuclear Information System (INIS)
Dufour, M.
1986-09-01
We have studied a class of algebraic eigenvalue problems that generate tridiagonal matrices. The Lipkin Hamiltonian was chosen as representative. Three methods have been implemented, whose extension to more general many body problems seems possible i) Degenerate Linked Cluster Theory (LCT), which disregards special symmetries of the interaction and defines a hierarchy of approximation based on model spaces at fixed number of particle-hole excitation of the unperturbed Hamiltonian. The method works for small perturbations but does not yield a complete description. ii) A new linearization method that replaces the matrix to be diagonalized by local (tangent) approximations by harmonic matrices. This method generalizes LCT and is a posteriori reminiscent of semi-classical ones. However of is simpler, more precise and yields a complete description of spectra. iii) A global way to characterize spectra based on Gershgorine-Hadamard disks [fr
International Nuclear Information System (INIS)
Koteras, J.R.
1996-01-01
The prediction of stresses and displacements around tunnels buried deep within the earth is an important class of geomechanics problems. The material behavior immediately surrounding the tunnel is typically nonlinear. The surrounding mass, even if it is nonlinear, can usually be characterized by a simple linear elastic model. The finite element method is best suited for modeling nonlinear materials of limited volume, while the boundary element method is well suited for modeling large volumes of linear elastic material. A computational scheme that couples the finite element and boundary element methods would seem particularly useful for geomechanics problems. A variety of coupling schemes have been proposed, but they rely on direct solution methods. Direct solution techniques have large storage requirements that become cumbersome for large-scale three-dimensional problems. An alternative to direct solution methods is iterative solution techniques. A scheme has been developed for coupling the finite element and boundary element methods that uses an iterative solution method. This report shows that this coupling scheme is valid for problems where nonlinear material behavior occurs in the finite element region
Numerical solution of an inverse 2D Cauchy problem connected with the Helmholtz equation
International Nuclear Information System (INIS)
Wei, T; Qin, H H; Shi, R
2008-01-01
In this paper, the Cauchy problem for the Helmholtz equation is investigated. By Green's formulation, the problem can be transformed into a moment problem. Then we propose a numerical algorithm for obtaining an approximate solution to the Neumann data on the unspecified boundary. Error estimate and convergence analysis have also been given. Finally, we present numerical results for several examples and show the effectiveness of the proposed method
An outer approximation method for the road network design problem.
Asadi Bagloee, Saeed; Sarvi, Majid
2018-01-01
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.
The Telegraph Equation and Its Solution by Reduced Differential Transform Method
Directory of Open Access Journals (Sweden)
Vineet K. Srivastava
2013-01-01
Full Text Available One-dimensional second-order hyperbolic telegraph equation was formulated using Ohm’s law and solved by a recent and reliable semianalytic method, namely, the reduced differential transform method (RDTM. Using this method, it is possible to find the exact solution or a closed approximate solution of a differential equation. Three numerical examples have been carried out in order to check the effectiveness, the accuracy, and convergence of the method. The RDTM is a powerful mathematical technique for solving wide range of problems arising in science and engineering fields.
Providing solutions to engineering problems
International Nuclear Information System (INIS)
Connop, R.P.P.
1991-01-01
BNFL has acquired unique experience over a period of 40 years in specifying, designing and constructing spent fuel reprocessing and associated waste management plant. This experience is currently used to support a pound 5.5 billion capital investment programme. This paper reviews a number of engineering problems and their solutions to highlight BNFL experience in providing comprehensive specification, design and engineering and project management services. (author)
Spring Recipes A Problem-solution Approach
Long, Josh; Mak, Gary
2010-01-01
With over 3 Million users/developers, Spring Framework is the leading "out of the box" Java framework. Spring addresses and offers simple solutions for most aspects of your Java/Java EE application development, and guides you to use industry best practices to design and implement your applications. The release of Spring Framework 3 has ushered in many improvements and new features. Spring Recipes: A Problem-Solution Approach, Second Edition continues upon the bestselling success of the previous edition but focuses on the latest Spring 3 features for building enterprise Java applications.
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.
Problems of Turkish Librarianship and Problems for Solution
Directory of Open Access Journals (Sweden)
İrfan Çakın
1993-09-01
Full Text Available Report presented to the Librarianship, Documentation and Archives Committee of the UNESCO Turkish National Commission, identifies environmental factors, the notion of library and librarianship in the society, and the low profile of librarians as main sources of problems. The society still sees the librarian as the protector of books. The value given to the profession is, thus, limited to such a narrow understanding of the profession, which leads to low payment and insufficient resource allocation to the libraries. Main field of activity, that is, the pro\\ision of information is expected from documentation and information centres. Library and information work cannot be separated from each other. The proposals for solution of the problems include improvement of professional education, legal provisions, and reorganiztion of professional organizations.
Existence and Stability of Solutions for Implicit Multivalued Vector Equilibrium Problems
Directory of Open Access Journals (Sweden)
Li Qiuying
2011-01-01
Full Text Available A class of implicit multivalued vector equilibrium problems is studied. By using the generalized Fan-Browder fixed point theorem, some existence results of solutions for the implicit multivalued vector equilibrium problems are obtained under some suitable assumptions. Moreover, a stability result of solutions for the implicit multivalued vector equilibrium problems is derived. These results extend and unify some recent results for implicit vector equilibrium problems, multivalued vector variational inequality problems, and vector variational inequality problems.
Hilbert's seventh problem solutions and extensions
Tubbs, Robert
2016-01-01
This exposition is primarily a survey of the elementary yet subtle innovations of several mathematicians between 1929 and 1934 that led to partial and then complete solutions to Hilbert’s Seventh Problem (from the International Congress of Mathematicians in Paris, 1900). This volume is suitable for both mathematics students, wishing to experience how different mathematical ideas can come together to establish results, and for research mathematicians interested in the fascinating progression of mathematical ideas that solved Hilbert’s problem and established a modern theory of transcendental numbers. .
Lavrentiev regularization method for nonlinear ill-posed problems
International Nuclear Information System (INIS)
Kinh, Nguyen Van
2002-10-01
In this paper we shall be concerned with Lavientiev regularization method to reconstruct solutions x 0 of non ill-posed problems F(x)=y o , where instead of y 0 noisy data y δ is an element of X with absolut(y δ -y 0 ) ≤ δ are given and F:X→X is an accretive nonlinear operator from a real reflexive Banach space X into itself. In this regularization method solutions x α δ are obtained by solving the singularly perturbed nonlinear operator equation F(x)+α(x-x*)=y δ with some initial guess x*. Assuming certain conditions concerning the operator F and the smoothness of the element x*-x 0 we derive stability estimates which show that the accuracy of the regularized solutions is order optimal provided that the regularization parameter α has been chosen properly. (author)
Directory of Open Access Journals (Sweden)
José Miguel Vargas-Félix
2012-11-01
Full Text Available The Finite Element Method (FEM is used to solve problems like solid deformation and heat diffusion in domains with complex geometries. This kind of geometries requires discretization with millions of elements; this is equivalent to solve systems of equations with sparse matrices and tens or hundreds of millions of variables. The aim is to use computer clusters to solve these systems. The solution method used is Schur substructuration. Using it is possible to divide a large system of equations into many small ones to solve them more efficiently. This method allows parallelization. MPI (Message Passing Interface is used to distribute the systems of equations to solve each one in a computer of a cluster. Each system of equations is solved using a solver implemented to use OpenMP as a local parallelization method.The Finite Element Method (FEM is used to solve problems like solid deformation and heat diffusion in domains with complex geometries. This kind of geometries requires discretization with millions of elements; this is equivalent to solve systems of equations with sparse matrices and tens or hundreds of millions of variables. The aim is to use computer clusters to solve these systems. The solution method used is Schur substructuration. Using it is possible to divide a large system of equations into many small ones to solve them more efficiently. This method allows parallelization. MPI (Message Passing Interface is used to distribute the systems of equations to solve each one in a computer of a cluster. Each system of equations is solved using a solver implemented to use OpenMP as a local parallelization method.
The numerical analysis of eigenvalue problem solutions in multigroup neutron diffusion theory
International Nuclear Information System (INIS)
Woznicki, Z.I.
1995-01-01
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iterations within global iterations. Particular iterative strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 35 figs, 16 tabs
Development of solutions to benchmark piping problems
Energy Technology Data Exchange (ETDEWEB)
Reich, M; Chang, T Y; Prachuktam, S; Hartzman, M
1977-12-01
Benchmark problems and their solutions are presented. The problems consist in calculating the static and dynamic response of selected piping structures subjected to a variety of loading conditions. The structures range from simple pipe geometries to a representative full scale primary nuclear piping system, which includes the various components and their supports. These structures are assumed to behave in a linear elastic fashion only, i.e., they experience small deformations and small displacements with no existing gaps, and remain elastic through their entire response. The solutions were obtained by using the program EPIPE, which is a modification of the widely available program SAP IV. A brief outline of the theoretical background of this program and its verification is also included.
An analytical nodal method for time-dependent one-dimensional discrete ordinates problems
International Nuclear Information System (INIS)
Barros, R.C. de
1992-01-01
In recent years, relatively little work has been done in developing time-dependent discrete ordinates (S N ) computer codes. Therefore, the topic of time integration methods certainly deserves further attention. In this paper, we describe a new coarse-mesh method for time-dependent monoenergetic S N transport problesm in slab geometry. This numerical method preserves the analytic solution of the transverse-integrated S N nodal equations by constants, so we call our method the analytical constant nodal (ACN) method. For time-independent S N problems in finite slab geometry and for time-dependent infinite-medium S N problems, the ACN method generates numerical solutions that are completely free of truncation errors. Bsed on this positive feature, we expect the ACN method to be more accurate than conventional numerical methods for S N transport calculations on coarse space-time grids
Moving Least Squares Method for a One-Dimensional Parabolic Inverse Problem
Directory of Open Access Journals (Sweden)
Baiyu Wang
2014-01-01
Full Text Available This paper investigates the numerical solution of a class of one-dimensional inverse parabolic problems using the moving least squares approximation; the inverse problem is the determination of an unknown source term depending on time. The collocation method is used for solving the equation; some numerical experiments are presented and discussed to illustrate the stability and high efficiency of the method.
Ensemble Kalman methods for inverse problems
International Nuclear Information System (INIS)
Iglesias, Marco A; Law, Kody J H; Stuart, Andrew M
2013-01-01
The ensemble Kalman filter (EnKF) was introduced by Evensen in 1994 (Evensen 1994 J. Geophys. Res. 99 10143–62) as a novel method for data assimilation: state estimation for noisily observed time-dependent problems. Since that time it has had enormous impact in many application domains because of its robustness and ease of implementation, and numerical evidence of its accuracy. In this paper we propose the application of an iterative ensemble Kalman method for the solution of a wide class of inverse problems. In this context we show that the estimate of the unknown function that we obtain with the ensemble Kalman method lies in a subspace A spanned by the initial ensemble. Hence the resulting error may be bounded above by the error found from the best approximation in this subspace. We provide numerical experiments which compare the error incurred by the ensemble Kalman method for inverse problems with the error of the best approximation in A, and with variants on traditional least-squares approaches, restricted to the subspace A. In so doing we demonstrate that the ensemble Kalman method for inverse problems provides a derivative-free optimization method with comparable accuracy to that achieved by traditional least-squares approaches. Furthermore, we also demonstrate that the accuracy is of the same order of magnitude as that achieved by the best approximation. Three examples are used to demonstrate these assertions: inversion of a compact linear operator; inversion of piezometric head to determine hydraulic conductivity in a Darcy model of groundwater flow; and inversion of Eulerian velocity measurements at positive times to determine the initial condition in an incompressible fluid. (paper)
Energy Technology Data Exchange (ETDEWEB)
Vetter, O.J.; Crichlow, H.B.
1979-02-14
The following topics are covered: thermodynamic instability of brine, injectivity loss during regular production and injection operations, injectivity loss caused by measures other than regular operations, heat mining and associated reservoir problems in reinjection, pressure maintenance through imported make-up water, suggested solutions to injection problems, and suggested solutions to injection problems: remedial and stimulation measures. (MHR)
Fundamental solutions and dual boundary element methods for fracture in plane Cosserat elasticity.
Atroshchenko, Elena; Bordas, Stéphane P A
2015-07-08
In this paper, both singular and hypersingular fundamental solutions of plane Cosserat elasticity are derived and given in a ready-to-use form. The hypersingular fundamental solutions allow to formulate the analogue of Somigliana stress identity, which can be used to obtain the stress and couple-stress fields inside the domain from the boundary values of the displacements, microrotation and stress and couple-stress tractions. Using these newly derived fundamental solutions, the boundary integral equations of both types are formulated and solved by the boundary element method. Simultaneous use of both types of equations (approach known as the dual boundary element method (BEM)) allows problems where parts of the boundary are overlapping, such as crack problems, to be treated and to do this for general geometry and loading conditions. The high accuracy of the boundary element method for both types of equations is demonstrated for a number of benchmark problems, including a Griffith crack problem and a plate with an edge crack. The detailed comparison of the BEM results and the analytical solution for a Griffith crack and an edge crack is given, particularly in terms of stress and couple-stress intensity factors, as well as the crack opening displacements and microrotations on the crack faces and the angular distributions of stresses and couple-stresses around the crack tip.
International Nuclear Information System (INIS)
Lee, Hwasung; Lee, Y J
2007-01-01
We derive analytic expressions of the recursive solutions to Schroedinger's equation by means of a cutoff-potential technique for one-dimensional piecewise-constant potentials. These solutions provide a method for accurately determining the transmission probabilities as well as the wavefunction in both classically accessible regions and inaccessible regions for any barrier potentials. It is also shown that the energy eigenvalues and the wavefunctions of bound states can be obtained for potential-well structures by exploiting this method. Calculational results of illustrative examples are shown in order to verify this method for treating barrier and potential-well problems
Operational method of solution of linear non-integer ordinary and partial differential equations.
Zhukovsky, K V
2016-01-01
We propose operational method with recourse to generalized forms of orthogonal polynomials for solution of a variety of differential equations of mathematical physics. Operational definitions of generalized families of orthogonal polynomials are used in this context. Integral transforms and the operational exponent together with some special functions are also employed in the solutions. The examples of solution of physical problems, related to such problems as the heat propagation in various models, evolutional processes, Black-Scholes-like equations etc. are demonstrated by the operational technique.
An introduction to fuzzy linear programming problems theory, methods and applications
Kaur, Jagdeep
2016-01-01
The book presents a snapshot of the state of the art in the field of fully fuzzy linear programming. The main focus is on showing current methods for finding the fuzzy optimal solution of fully fuzzy linear programming problems in which all the parameters and decision variables are represented by non-negative fuzzy numbers. It presents new methods developed by the authors, as well as existing methods developed by others, and their application to real-world problems, including fuzzy transportation problems. Moreover, it compares the outcomes of the different methods and discusses their advantages/disadvantages. As the first work to collect at one place the most important methods for solving fuzzy linear programming problems, the book represents a useful reference guide for students and researchers, providing them with the necessary theoretical and practical knowledge to deal with linear programming problems under uncertainty.
Linear finite element method for one-dimensional diffusion problems
Energy Technology Data Exchange (ETDEWEB)
Brandao, Michele A.; Dominguez, Dany S.; Iglesias, Susana M., E-mail: micheleabrandao@gmail.com, E-mail: dany@labbi.uesc.br, E-mail: smiglesias@uesc.br [Universidade Estadual de Santa Cruz (LCC/DCET/UESC), Ilheus, BA (Brazil). Departamento de Ciencias Exatas e Tecnologicas. Laboratorio de Computacao Cientifica
2011-07-01
We describe in this paper the fundamentals of Linear Finite Element Method (LFEM) applied to one-speed diffusion problems in slab geometry. We present the mathematical formulation to solve eigenvalue and fixed source problems. First, we discretized a calculus domain using a finite set of elements. At this point, we obtain the spatial balance equations for zero order and first order spatial moments inside each element. Then, we introduce the linear auxiliary equations to approximate neutron flux and current inside the element and architect a numerical scheme to obtain the solution. We offer numerical results for fixed source typical model problems to illustrate the method's accuracy for coarse-mesh calculations in homogeneous and heterogeneous domains. Also, we compare the accuracy and computational performance of LFEM formulation with conventional Finite Difference Method (FDM). (author)
A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise
Clason, Christian
2012-01-01
This work is concerned with nonlinear parameter identification in partial differential equations subject to impulsive noise. To cope with the non-Gaussian nature of the noise, we consider a model with L 1 fitting. However, the nonsmoothness of the problem makes its efficient numerical solution challenging. By approximating this problem using a family of smoothed functionals, a semismooth Newton method becomes applicable. In particular, its superlinear convergence is proved under a second-order condition. The convergence of the solution to the approximating problem as the smoothing parameter goes to zero is shown. A strategy for adaptively selecting the regularization parameter based on a balancing principle is suggested. The efficiency of the method is illustrated on several benchmark inverse problems of recovering coefficients in elliptic differential equations, for which one- and two-dimensional numerical examples are presented. © by SIAM.
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...
An overview of solution methods for multi-objective mixed integer linear programming programs
DEFF Research Database (Denmark)
Andersen, Kim Allan; Stidsen, Thomas Riis
Multiple objective mixed integer linear programming (MOMIP) problems are notoriously hard to solve to optimality, i.e. finding the complete set of non-dominated solutions. We will give an overview of existing methods. Among those are interactive methods, the two phases method and enumeration...... methods. In particular we will discuss the existing branch and bound approaches for solving multiple objective integer programming problems. Despite the fact that branch and bound methods has been applied successfully to integer programming problems with one criterion only a few attempts has been made...
Solutions of hyperbolic equations with the CIP-BS method
International Nuclear Information System (INIS)
Utsumi, Takayuki; Koga, James; Yamagiwa, Mitsuru; Yabe, Takashi; Aoki, Takayuki
2004-01-01
In this paper, we show that a new numerical method, the Constrained Interpolation Profile - Basis Set (CIP-BS) method, can solve general hyperbolic equations efficiently. This method uses a simple polynomial basis set that is easily extendable to any desired higher-order accuracy. The interpolating profile is chosen so that the subgrid scale solution approaches the local real solution owing to the constraints from the spatial derivatives of the master equations. Then, introducing scalar products, the linear and nonlinear partial differential equations are uniquely reduced to the ordinary differential equations for values and spatial derivatives at the grid points. The method gives stable, less diffusive, and accurate results. It is successfully applied to the continuity equation, the Burgers equation, the Korteweg-de Vries equation, and one-dimensional shock tube problems. (author)
Burman, Erik; Hansbo, Peter; Larson, Mats G.
2018-03-01
Tikhonov regularization is one of the most commonly used methods for the regularization of ill-posed problems. In the setting of finite element solutions of elliptic partial differential control problems, Tikhonov regularization amounts to adding suitably weighted least squares terms of the control variable, or derivatives thereof, to the Lagrangian determining the optimality system. In this note we show that the stabilization methods for discretely ill-posed problems developed in the setting of convection-dominated convection-diffusion problems, can be highly suitable for stabilizing optimal control problems, and that Tikhonov regularization will lead to less accurate discrete solutions. We consider some inverse problems for Poisson’s equation as an illustration and derive new error estimates both for the reconstruction of the solution from the measured data and reconstruction of the source term from the measured data. These estimates include both the effect of the discretization error and error in the measurements.
Operations research problems statements and solutions
Poler, Raúl; Díaz-Madroñero, Manuel
2014-01-01
The objective of this book is to provide a valuable compendium of problems as a reference for undergraduate and graduate students, faculty, researchers and practitioners of operations research and management science. These problems can serve as a basis for the development or study of assignments and exams. Also, they can be useful as a guide for the first stage of the model formulation, i.e. the definition of a problem. The book is divided into 11 chapters that address the following topics: Linear programming, integer programming, non linear programming, network modeling, inventory theory, queue theory, tree decision, game theory, dynamic programming and markov processes. Readers are going to find a considerable number of statements of operations research applications for management decision-making. The solutions of these problems are provided in a concise way although all topics start with a more developed resolution. The proposed problems are based on the research experience of the authors in real-world com...
Initial-Boundary Value Problem Solution of the Nonlinear Shallow-water Wave Equations
Kanoglu, U.; Aydin, B.
2014-12-01
The hodograph transformation solutions of the one-dimensional nonlinear shallow-water wave (NSW) equations are usually obtained through integral transform techniques such as Fourier-Bessel transforms. However, the original formulation of Carrier and Greenspan (1958 J Fluid Mech) and its variant Carrier et al. (2003 J Fluid Mech) involve evaluation integrals. Since elliptic integrals are highly singular as discussed in Carrier et al. (2003), this solution methodology requires either approximation of the associated integrands by smooth functions or selection of regular initial/boundary data. It should be noted that Kanoglu (2004 J Fluid Mech) partly resolves this issue by simplifying the resulting integrals in closed form. Here, the hodograph transform approach is coupled with the classical eigenfunction expansion method rather than integral transform techniques and a new analytical model for nonlinear long wave propagation over a plane beach is derived. This approach is based on the solution methodology used in Aydın & Kanoglu (2007 CMES-Comp Model Eng) for wind set-down relaxation problem. In contrast to classical initial- or boundary-value problem solutions, here, the NSW equations are formulated to yield an initial-boundary value problem (IBVP) solution. In general, initial wave profile with nonzero initial velocity distribution is assumed and the flow variables are given in the form of Fourier-Bessel series. The results reveal that the developed method allows accurate estimation of the spatial and temporal variation of the flow quantities, i.e., free-surface height and depth-averaged velocity, with much less computational effort compared to the integral transform techniques such as Carrier et al. (2003), Kanoglu (2004), Tinti & Tonini (2005 J Fluid Mech), and Kanoglu & Synolakis (2006 Phys Rev Lett). Acknowledgments: This work is funded by project ASTARTE- Assessment, STrategy And Risk Reduction for Tsunamis in Europe. Grant 603839, 7th FP (ENV.2013.6.4-3 ENV
International Nuclear Information System (INIS)
Jo, Jong Chull; Shin, Won Ky
1997-01-01
This paper presents an effective and simple procedure for the simulation of the motion of the solid-liquid interfacial boundary and the transient temperature field during phase change process. To accomplish this purpose, an iterative implicit solution algorithm has been developed by employing the dual reciprocity boundary element method. The dual reciprocity boundary element approach provided in this paper is much simpler than the usual boundary element method applying a reciprocity principle and an available technique for dealing with domain integral of boundary element formulation simultaneously. The effectiveness of the present analysis method have been illustrated through comparisons of the calculation results of an example with its semi-analytical or other numerical solutions where available
Application of the invariant embedding method to analytically solvable transport problems
Energy Technology Data Exchange (ETDEWEB)
Wahlberg, Malin
2005-05-01
The applicability and performance of the invariant embedding method for calculating various transport quantities is investigated in this thesis. The invariant embedding method is a technique to calculate the reflected or transmitted fluxes in homogeneous half-spaces and slabs, without the need for solving for the flux inside the medium. In return, the embedding equations become non-linear, and in practical cases they need to be solved by numerical methods. There are, however, fast and effective iterative methods available for this purpose. The objective of this thesis is to investigate the performance of these iterative methods in model problems, in which also an exact analytical solution can be obtained. Some of these analytical solutions are also new, hence their derivation constitutes a part of the thesis work. The cases investigated in the thesis all concern the calculation of reflected fluxes from half-spaces. The first problem treated was the calculation of the energy spectrum of reflected (sputtered) particles from a multiplying medium, where the multiplication arises from recoil production (i.e. like binary fission), when bombarded by o flux of monoenergetic particles of the same type. Both constant cross sections and energy dependent cross sections with a power law dependence were used in the calculations. The second class of problems concerned the calculation of the path length distribution of reflected particles from a medium without multiplication. It is an interesting new observation that the distribution of the path length travelled in the medium before reflection can be calculated with invariant embedding methods, which actually do not solve the flux distribution in the medium. We have tested the accuracy and the convergence properties of the embedding method also for this case. Finally, very recently a theory of connecting the infinite and half-space medium solutions by embedding-like integral equations was developed and reported in the literature
Application of the invariant embedding method to analytically solvable transport problems
International Nuclear Information System (INIS)
Wahlberg, Malin
2005-05-01
The applicability and performance of the invariant embedding method for calculating various transport quantities is investigated in this thesis. The invariant embedding method is a technique to calculate the reflected or transmitted fluxes in homogeneous half-spaces and slabs, without the need for solving for the flux inside the medium. In return, the embedding equations become non-linear, and in practical cases they need to be solved by numerical methods. There are, however, fast and effective iterative methods available for this purpose. The objective of this thesis is to investigate the performance of these iterative methods in model problems, in which also an exact analytical solution can be obtained. Some of these analytical solutions are also new, hence their derivation constitutes a part of the thesis work. The cases investigated in the thesis all concern the calculation of reflected fluxes from half-spaces. The first problem treated was the calculation of the energy spectrum of reflected (sputtered) particles from a multiplying medium, where the multiplication arises from recoil production (i.e. like binary fission), when bombarded by o flux of monoenergetic particles of the same type. Both constant cross sections and energy dependent cross sections with a power law dependence were used in the calculations. The second class of problems concerned the calculation of the path length distribution of reflected particles from a medium without multiplication. It is an interesting new observation that the distribution of the path length travelled in the medium before reflection can be calculated with invariant embedding methods, which actually do not solve the flux distribution in the medium. We have tested the accuracy and the convergence properties of the embedding method also for this case. Finally, very recently a theory of connecting the infinite and half-space medium solutions by embedding-like integral equations was developed and reported in the literature
Critical solution for a Hill's type problem
International Nuclear Information System (INIS)
Cabral, Hildeberto; Castilho, Cesar
2001-08-01
We studied the problem of two satellites attracted by a center of force. Assuming the motion of the center of mass of the two satellites describes a keplerian circular motion around the center of force we regularized the collision between them using the Levi-Civita procedure. The existence of a constant of motion in the extended phase space allowed us to study the stability of the solution where the two satellites are tied together in their circular motion around the center of force. We call this solution the critical solution. A theorem of M Kummer is applied to prove, in specific conditions, the existence of two one-parametric families of almost periodic orbits for the satellites motion that bifurcates from the critical solution. (author)
On Global Solutions for the Cauchy Problem of a Boussinesq-Type Equation
Taskesen, Hatice; Polat, Necat; Ertaş, Abdulkadir
2012-01-01
We will give conditions which will guarantee the existence of global weak solutions of the Boussinesq-type equation with power-type nonlinearity $\\gamma {|u|}^{p}$ and supercritical initial energy. By defining new functionals and using potential well method, we readdressed the initial value problem of the Boussinesq-type equation for the supercritical initial energy case.
Directory of Open Access Journals (Sweden)
Hongwu Zhang
2011-08-01
Full Text Available In this article, we study a Cauchy problem for an elliptic equation with variable coefficients. It is well-known that such a problem is severely ill-posed; i.e., the solution does not depend continuously on the Cauchy data. We propose a modified quasi-boundary value regularization method to solve it. Convergence estimates are established under two a priori assumptions on the exact solution. A numerical example is given to illustrate our proposed method.
APPLYING ROBUST RANKING METHOD IN TWO PHASE FUZZY OPTIMIZATION LINEAR PROGRAMMING PROBLEMS (FOLPP
Directory of Open Access Journals (Sweden)
Monalisha Pattnaik
2014-12-01
Full Text Available Background: This paper explores the solutions to the fuzzy optimization linear program problems (FOLPP where some parameters are fuzzy numbers. In practice, there are many problems in which all decision parameters are fuzzy numbers, and such problems are usually solved by either probabilistic programming or multi-objective programming methods. Methods: In this paper, using the concept of comparison of fuzzy numbers, a very effective method is introduced for solving these problems. This paper extends linear programming based problem in fuzzy environment. With the problem assumptions, the optimal solution can still be theoretically solved using the two phase simplex based method in fuzzy environment. To handle the fuzzy decision variables can be initially generated and then solved and improved sequentially using the fuzzy decision approach by introducing robust ranking technique. Results and conclusions: The model is illustrated with an application and a post optimal analysis approach is obtained. The proposed procedure was programmed with MATLAB (R2009a version software for plotting the four dimensional slice diagram to the application. Finally, numerical example is presented to illustrate the effectiveness of the theoretical results, and to gain additional managerial insights.
Numerical treatment of elliptic BVP with several solutions and of MHD equilibrium problems
International Nuclear Information System (INIS)
Meyer-Spasche, R.
1975-12-01
It is found out empirically that Newton iteration and difference methods are very suitable for the numerical treatment of elliptic boundary value problems (Lu)(x) = f(x,u(x)) in D c R 2 , u/deltaD = g having several solutions. Some convergence theorems for these methods are presented. Some notable numerical examples are given, including bifurcation diagrams, which are interesting in themselves and show also the applicability of the methods developed. (orig./WB) [de
Kot, V. A.
2017-11-01
The modern state of approximate integral methods used in applications, where the processes of heat conduction and heat and mass transfer are of first importance, is considered. Integral methods have found a wide utility in different fields of knowledge: problems of heat conduction with different heat-exchange conditions, simulation of thermal protection, Stefantype problems, microwave heating of a substance, problems on a boundary layer, simulation of a fluid flow in a channel, thermal explosion, laser and plasma treatment of materials, simulation of the formation and melting of ice, inverse heat problems, temperature and thermal definition of nanoparticles and nanoliquids, and others. Moreover, polynomial solutions are of interest because the determination of a temperature (concentration) field is an intermediate stage in the mathematical description of any other process. The following main methods were investigated on the basis of the error norms: the Tsoi and Postol’nik methods, the method of integral relations, the Gudman integral method of heat balance, the improved Volkov integral method, the matched integral method, the modified Hristov method, the Mayer integral method, the Kudinov method of additional boundary conditions, the Fedorov boundary method, the method of weighted temperature function, the integral method of boundary characteristics. It was established that the two last-mentioned methods are characterized by high convergence and frequently give solutions whose accuracy is not worse that the accuracy of numerical solutions.
A Hamiltonian-based derivation of Scaled Boundary Finite Element Method for elasticity problems
International Nuclear Information System (INIS)
Hu Zhiqiang; Lin Gao; Wang Yi; Liu Jun
2010-01-01
The Scaled Boundary Finite Method (SBFEM) is a semi-analytical solution approach for solving partial differential equation. For problem in elasticity, the governing equations can be obtained by mechanically based formulation, Scaled-boundary-transformation-based formulation and principle of virtual work. The governing equations are described in the frame of Lagrange system and the unknowns are displacements. But in the solution procedure, the auxiliary variables are introduced and the equations are solved in the state space. Based on the observation that the duality system to solve elastic problem proposed by W.X. Zhong is similar to the above solution approach, the discretization of the SBFEM and the duality system are combined to derive the governing equations in the Hamilton system by introducing the dual variables in this paper. The Precise Integration Method (PIM) used in Duality system is also an efficient method for the solution of the governing equations of SBFEM in displacement and boundary stiffness matrix especially for the case which results some numerical difficulties in the usually uses the eigenvalue method. Numerical examples are used to demonstrate the validity and effectiveness of the PIM for solution of boundary static stiffness.
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
Formal solutions of inverse scattering problems. III
International Nuclear Information System (INIS)
Prosser, R.T.
1980-01-01
The formal solutions of certain three-dimensional inverse scattering problems presented in papers I and II of this series [J. Math. Phys. 10, 1819 (1969); 17 1175 (1976)] are obtained here as fixed points of a certain nonlinear mapping acting on a suitable Banach space of integral kernels. When the scattering data are sufficiently restricted, this mapping is shown to be a contraction, thereby establishing the existence, uniqueness, and continuous dependence on the data of these formal solutions
Multidimensional phase change problems by the dual-reciprocity boundary-element method
International Nuclear Information System (INIS)
Jo, J.C.; Shin, W.K.; Choi, C.Y.
1999-01-01
Transient heat transfer problems with phase changes (Stefan problems) occur in many engineering situations, including potential core melting and solidification during pressurized-water-reactor severe accidents, ablation of thermal shields, melting and solidification of alloys, and many others. This article addresses the numerical analysis of nonlinear transient heat transfer with melting or solidification. An effective and simple procedure is presented for the simulation of the motion of the boundary and the transient temperature field during the phase change process. To accomplish this purpose, an iterative implicit solution algorithm has been developed by employing the dual-reciprocity boundary-element method. The dual-reciprocity boundary-element approach provided in this article is much simpler than the usual boundary-element method in applying a reciprocity principle and an available technique for dealing with the domain integral of the boundary element formulation simultaneously. In this article, attention is focused on two-dimensional melting (ablation)/solidification problems for simplicity. The accuracy and effectiveness of the present analysis method have been illustrated through comparisons of the calculation results of some examples of one-phase ablation/solidification problems with their known semianalytical or numerical solutions where available
The Numerical Solution of the Equilibrium Problem for a Stretchable Elastic Beam
Mehdiyeva, G. Y.; Aliyev, A. Y.
2017-08-01
The boundary value problem under consideration describes the equilibrium of an elastic beam that is stretched or contracted by specified forces. The left end of the beam is free of load, and the right end is rigidly lapped. To solve the problem numerically, an appropriate difference problem is constructed. Solving the difference problem, we obtain an approximate solution of the problem. We estimate the approximate solution of the stated problem.
International Nuclear Information System (INIS)
Wang, Yaqi
2012-01-01
The Method of Manufactured Solutions (MMS) is an accepted technique to verify that a numerical discretization for the radiation transport equation has been implemented correctly. This technique offers a few advantages over other methods such as benchmark problems or analytical solutions. The solution can be manufactured such that properties for the angular flux are either stressed or preserved. For radiation transport, these properties can include desired smoothness, positiveness and arbitrary order of anisotropy in angle. Another advantage is that the angular flux solution can be manufactured for multidimensional problems where analytical solutions are difficult to obtain in general.
The boundary element method : errors and gridding for problems with hot spots
Kakuba, G.
2011-01-01
Adaptive gridding methods are of fundamental importance both for industry and academia. As one of the computing methods, the Boundary Element Method (BEM) is used to simulate problems whose fundamental solutions are available. The method is usually characterised as constant elements BEM or linear
Optimization methods for the Train Unit Shunting Problem
DEFF Research Database (Denmark)
Haahr, Jørgen Thorlund; Lusby, Richard Martin; Wagenaar, Joris Camiel
2017-01-01
We consider the Train Unit Shunting Problem, an important planning problem for passenger railway operators. This problem entails assigning train units from shunting yards to scheduled train services in such a way that the resulting operations are without conflicts. The problem arises at every...... shunting yard in the railway network and involves matching train units to arriving and departing train services as well as assigning the selected matchings to appropriate shunting yard tracks. We present an extensive comparison benchmark of multiple solution approaches for this problem, some of which...... are novel. In particular, we develop a constraint programming formulation, a column generation approach, and a randomized greedy heuristic. We compare and benchmark these approaches with two existing methods, a mixed integer linear program and a two-stage heuristic. The benchmark contains multiple real...
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.
Solution of the Chandler-Gibson equations for a three-body test problem
International Nuclear Information System (INIS)
Gibson, A.G.; Waters, A.J.; Berthold, G.H.; Chandler, C.
1991-01-01
The Chandler-Gibson (CG) N-body equations are tested by considering the problem of three nonrelativistic particles moving on a line and interacting through attractive delta-function potentials. In particular, the input Born and overlap matrix-valued functions are evaluated analytically, and the CG equations are solved using a B-spline collocation method. The computed scattering matrix elements are within 0.5% of the known exact solutions, and the corresponding scattering probabilities are within 0.001% of the exact probabilities, both below and above the 3-body breakup threshold. These results establish that the CG method is practical, as well as theoretically correct, and may be a valuable approach for solving certain more complicated N-body scattering problems
METHOD OF GREEN FUNCTIONS IN MATHEMATICAL MODELLING FOR TWO-POINT BOUNDARY-VALUE PROBLEMS
Directory of Open Access Journals (Sweden)
E. V. Dikareva
2015-01-01
Full Text Available Summary. In many applied problems of control, optimization, system theory, theoretical and construction mechanics, for problems with strings and nods structures, oscillation theory, theory of elasticity and plasticity, mechanical problems connected with fracture dynamics and shock waves, the main instrument for study these problems is a theory of high order ordinary differential equations. This methodology is also applied for studying mathematical models in graph theory with different partitioning based on differential equations. Such equations are used for theoretical foundation of mathematical models but also for constructing numerical methods and computer algorithms. These models are studied with use of Green function method. In the paper first necessary theoretical information is included on Green function method for multi point boundary-value problems. The main equation is discussed, notions of multi-point boundary conditions, boundary functionals, degenerate and non-degenerate problems, fundamental matrix of solutions are introduced. In the main part the problem to study is formulated in terms of shocks and deformations in boundary conditions. After that the main results are formulated. In theorem 1 conditions for existence and uniqueness of solutions are proved. In theorem 2 conditions are proved for strict positivity and equal measureness for a pair of solutions. In theorem 3 existence and estimates are proved for the least eigenvalue, spectral properties and positivity of eigenfunctions. In theorem 4 the weighted positivity is proved for the Green function. Some possible applications are considered for a signal theory and transmutation operators.
Memristor-based memory: The sneak paths problem and solutions
Zidan, Mohammed A.
2012-10-29
In this paper, we investigate the read operation of memristor-based memories. We analyze the sneak paths problem and provide a noise margin metric to compare the various solutions proposed in the literature. We also analyze the power consumption associated with these solutions. Moreover, we study the effect of the aspect ratio of the memory array on the sneak paths. Finally, we introduce a new technique for solving the sneak paths problem by gating the memory cell using a three-terminal memistor device.
Memristor-based memory: The sneak paths problem and solutions
Zidan, Mohammed A.; Fahmy, Hossam A.H.; Hussain, Muhammad Mustafa; Salama, Khaled N.
2012-01-01
In this paper, we investigate the read operation of memristor-based memories. We analyze the sneak paths problem and provide a noise margin metric to compare the various solutions proposed in the literature. We also analyze the power consumption associated with these solutions. Moreover, we study the effect of the aspect ratio of the memory array on the sneak paths. Finally, we introduce a new technique for solving the sneak paths problem by gating the memory cell using a three-terminal memistor device.
Existence of solutions to nonlinear parabolic unilateral problems with an obstacle depending on time
Directory of Open Access Journals (Sweden)
Nabila Bellal
2014-10-01
Full Text Available Using the penalty method, we prove the existence of solutions to nonlinear parabolic unilateral problems with an obstacle depending on time. To find a solution, the original inequality is transformed into an equality by adding a positive function on the right-hand side and a complementary condition. This result can be seen as a generalization of the results by Mokrane in [11] where the obstacle is zero.
Numerical solutions of the N-body problem
International Nuclear Information System (INIS)
Marciniak, A.
1985-01-01
Devoted to the study of numerical methods for solving the general N-body problem and related problems, this volume starts with an overview of the conventional numerical methods for solving the initial value problem. The major part of the book contains original work and features a presentation of special numerical methods conserving the constants of motion in the general N-body problem and methods conserving the Jacobi constant in the problem of motion of N bodies in a rotating frame, as well as an analysis of the applications of both (conventional and special) kinds of methods for solving these problems. For all the methods considered, the author presents algorithms which are easily programmable in any computer language. Moreover, the author compares various methods and presents adequate numerical results. The appendix contains PL/I procedures for all the special methods conserving the constants of motion. 91 refs.; 35 figs.; 41 tabs
Synthetic acceleration methods for linear transport problems with highly anisotropic scattering
International Nuclear Information System (INIS)
Khattab, K.M.; Larsen, E.W.
1992-01-01
The diffusion synthetic acceleration (DSA) algorithm effectively accelerates the iterative solution of transport problems with isotropic or mildly anisotropic scattering. However, DSA loses its effectiveness for transport problems that have strongly anisotropic scattering. Two generalizations of DSA are proposed, which, for highly anisotropic scattering problems, converge at least an order of magnitude (clock time) faster than the DSA method. These two methods are developed, the results of Fourier analysis that theoretically predict their efficiency are described, and numerical results that verify the theoretical predictions are presented. (author). 10 refs., 7 figs., 5 tabs
Synthetic acceleration methods for linear transport problems with highly anisotropic scattering
International Nuclear Information System (INIS)
Khattab, K.M.; Larsen, E.W.
1991-01-01
This paper reports on the diffusion synthetic acceleration (DSA) algorithm that effectively accelerates the iterative solution of transport problems with isotropic or mildly anisotropic scattering. However, DSA loses its effectiveness for transport problems that have strongly anisotropic scattering. Two generalizations of DSA are proposed, which, for highly anisotropic scattering problems, converge at least an order of magnitude (clock time) faster than the DSA method. These two methods are developed, the results of Fourier analyses that theoretically predict their efficiency are described, and numerical results that verify the theoretical predictions are presented
Energy Technology Data Exchange (ETDEWEB)
Jo, Jong Chull; Shin, Won Ky [Korea Institute of Nuclear Safety, Taejon (Korea, Republic of)
1998-12-31
This paper presents an effective and simple procedure for the simulation of the motion of the solid-liquid interfacial boundary and the transient temperature field during phase change process. To accomplish this purpose, an iterative implicit solution algorithm has been developed by employing the dual reciprocity boundary element method. The dual reciprocity boundary element approach provided in this paper is much simpler than the usual boundary element method applying a reciprocity principle and an available technique for dealing with domain integral of boundary element formulation simultaneously. The effectiveness of the present analysis method have been illustrated through comparisons of the calculation results of an example with its semi-analytical or other numerical solutions where available. 22 refs., 3 figs. (Author)
Energy Technology Data Exchange (ETDEWEB)
Jo, Jong Chull; Shin, Won Ky [Korea Institute of Nuclear Safety, Taejon (Korea, Republic of)
1997-12-31
This paper presents an effective and simple procedure for the simulation of the motion of the solid-liquid interfacial boundary and the transient temperature field during phase change process. To accomplish this purpose, an iterative implicit solution algorithm has been developed by employing the dual reciprocity boundary element method. The dual reciprocity boundary element approach provided in this paper is much simpler than the usual boundary element method applying a reciprocity principle and an available technique for dealing with domain integral of boundary element formulation simultaneously. The effectiveness of the present analysis method have been illustrated through comparisons of the calculation results of an example with its semi-analytical or other numerical solutions where available. 22 refs., 3 figs. (Author)
Boundary integral equation methods and numerical solutions thin plates on an elastic foundation
Constanda, Christian; Hamill, William
2016-01-01
This book presents and explains a general, efficient, and elegant method for solving the Dirichlet, Neumann, and Robin boundary value problems for the extensional deformation of a thin plate on an elastic foundation. The solutions of these problems are obtained both analytically—by means of direct and indirect boundary integral equation methods (BIEMs)—and numerically, through the application of a boundary element technique. The text discusses the methodology for constructing a BIEM, deriving all the attending mathematical properties with full rigor. The model investigated in the book can serve as a template for the study of any linear elliptic two-dimensional problem with constant coefficients. The representation of the solution in terms of single-layer and double-layer potentials is pivotal in the development of a BIEM, which, in turn, forms the basis for the second part of the book, where approximate solutions are computed with a high degree of accuracy. The book is intended for graduate students and r...
Maximum Likelihood and Restricted Likelihood Solutions in Multiple-Method Studies.
Rukhin, Andrew L
2011-01-01
A formulation of the problem of combining data from several sources is discussed in terms of random effects models. The unknown measurement precision is assumed not to be the same for all methods. We investigate maximum likelihood solutions in this model. By representing the likelihood equations as simultaneous polynomial equations, the exact form of the Groebner basis for their stationary points is derived when there are two methods. A parametrization of these solutions which allows their comparison is suggested. A numerical method for solving likelihood equations is outlined, and an alternative to the maximum likelihood method, the restricted maximum likelihood, is studied. In the situation when methods variances are considered to be known an upper bound on the between-method variance is obtained. The relationship between likelihood equations and moment-type equations is also discussed.
Variational methods for problems from plasticity theory and for generalized Newtonian fluids
Fuchs, Martin
2000-01-01
Variational methods are applied to prove the existence of weak solutions for boundary value problems from the deformation theory of plasticity as well as for the slow, steady state flow of generalized Newtonian fluids including the Bingham and Prandtl-Eyring model. For perfect plasticity the role of the stress tensor is emphasized by studying the dual variational problem in appropriate function spaces. The main results describe the analytic properties of weak solutions, e.g. differentiability of velocity fields and continuity of stresses. The monograph addresses researchers and graduate students interested in applications of variational and PDE methods in the mechanics of solids and fluids.
Presentation of some methods for the solution of the monoenergetic neutrons transport equation
International Nuclear Information System (INIS)
Valle G, E. del.
1978-01-01
The neutrons transport theory problems whose solution has been reached were collected in order to show that the transport equation is so complicated that different techniques were developed so as to give approximative numerical solutions to problems concerning the practical application. Such a technique, which had not been investigated in the literature dealing with these problems, is described here. The results which were obtained through this technique in undimensional problems of criticity are satisfactory and speaking in a conceptual way this method is extremely simple because it times. There is no limitation to deal with problems related neutrons sources with an arbitrary distribution and in principle the application of this technique can be extended to unhomogeneous environments. (author)
Closed form solution to a second order boundary value problem and its application in fluid mechanics
International Nuclear Information System (INIS)
Eldabe, N.T.; Elghazy, E.M.; Ebaid, A.
2007-01-01
The Adomian decomposition method is used by many researchers to investigate several scientific models. In this Letter, the modified Adomian decomposition method is applied to construct a closed form solution for a second order boundary value problem with singularity
Problem and design drawing for solution of precision design drawing and machine design
International Nuclear Information System (INIS)
Heo, Gil
1982-04-01
The contents of this book are basic of design drawing, problem of machine design, problem of precision design drawing, problem of planar figure of sheet metal, design drawing for solution of machine design, design drawing for solution of precision design drawing and design drawing for planar figure of sheet metal. It tells of the problems and gives the solutions on precision design drawing and machine design.
SLATEC-4.1, Subroutine Library for Solution of Mathematical Problems
International Nuclear Information System (INIS)
Boland, W.R.
1999-01-01
1 - Description of problem or function: SLATEC4.1 is a large collection of FORTRAN mathematical subprograms brought together in a joint effort by the Air Force Phillips Laboratory, Lawrence Livermore National Laboratory, Los Alamos National Laboratory, Magnetic Fusion Energy Computing Center, National Institute of Standards and Technology, Sandia National Laboratories (Albuquerque and Livermore), and Oak Ridge National Laboratory. SLATEC is characterized by portability, good numerical technology, good documentation, robustness, and quality assurance. The library can be divided into the following subsections following the lines of the GAMS classification system: Error Analysis, Elementary and Special Functions, Elementary Vector Operations, Solutions of Systems of Linear Equations, Eigen analysis, QR Decomposition, Singular Value Decomposition, Overdetermined or Underdetermined Systems, Interpolation, Solution of Nonlinear Equations, Optimization, Quadrature, Ordinary Differential Equations, Partial Differential Equations, Fast Fourier Transforms, Approximation, Pseudo-random Number Generation, Sorting, Machine Constants, and Diagnostics and Error Handling. 2 - Method of solution: This information is provided by comments within the individual library subroutines
A LEVEL SET BASED SHAPE OPTIMIZATION METHOD FOR AN ELLIPTIC OBSTACLE PROBLEM
Burger, Martin; Matevosyan, Norayr; Wolfram, Marie-Therese
2011-01-01
analysis of the level set method in terms of viscosity solutions. To our knowledge this is the first complete analysis of a level set method for a nonlocal shape optimization problem. Finally, we discuss the implementation of the methods and illustrate its
Solution of the Multigroup-Diffusion equation by the response matrix method
International Nuclear Information System (INIS)
Oliveira, C.R.E.
1980-10-01
A preliminary analysis of the response matrix method is made, considering its application to the solution of the multigroup diffusion equations. The one-dimensional formulation is presented and used to test some flux expansions, seeking the application of the method to the two-dimensional problem. This formulation also solves the equations that arise from the integro-differential synthesis algorithm. The slow convergence of the power method, used to solve the eigenvalue problem, and its acceleration by means of the Chebyshev polynomial method, are also studied. An algorithm for the estimation of the dominance ratio is presented, based on the residues of two successive iteration vectors. This ratio, which is not known a priori, is fundamental for the efficiency of the method. Some numerical problems are solved, testing the 1D formulation of the response matrix method, its application to the synthesis algorithm and also, at the same time, the algorithm to accelerate the source problem. (Author) [pt
A novel finite element method for moving conductor eddy current problems
Energy Technology Data Exchange (ETDEWEB)
Liu, Z.; Eastham, A.R.; Dawson, G.E. (Queen' s Univ., Kingston, Ontario (Canada). Dept. of Electrical Engineering)
1993-11-01
A novel finite element method, as an alternative to upwinding, is proposed based on the elimination of the factors which could cause numerical oscillation and instability by properly choosing a set of unconventional weighting functions. The proposed method is first developed and verified for a one dimensional case and then extended to two dimensional problems. The calculation results for a 2D problem, along with the exact solutions and those obtained from Galerkin's and ''optimal'' upwinding methods, show that the proposed method is superior to the other two methods in terms of accuracy and freedom from oscillation.
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
Solutions for the stable roommates problem with payments
Biró, Péter; Bomhoff, M.J.; Golovach, Petr A.; Kern, Walter
2014-01-01
The stable roommates problem with payments has as input a graph G = (V , E ) with an edge weighting w : E → R≥0 and the problem is to find a stable solution. By pinpointing a relationship to the accessibility of the coalition structure core of matching games, we give a constructive proof for showing
Hip-hop solutions of the 2N-body problem
Barrabés, Esther; Cors, Josep Maria; Pinyol, Conxita; Soler, Jaume
2006-05-01
Hip-hop solutions of the 2N-body problem with equal masses are shown to exist using an analytic continuation argument. These solutions are close to planar regular 2N-gon relative equilibria with small vertical oscillations. For fixed N, an infinity of these solutions are three-dimensional choreographies, with all the bodies moving along the same closed curve in the inertial frame.
A note on the solution of general Falkner-Skan problem by two novel semi-analytical techniques
Directory of Open Access Journals (Sweden)
Ahmed Khidir
2015-12-01
Full Text Available The aim of this paper is to give a presentation of two new iterative methods for solving non-linear differential equations, they are successive linearisation method and spectral homotopy perturbation method. We applied these techniques on the non-linear boundary value problems of Falkner-Skan type. The methods used to find a recursive former for higher order equations that are solved using the Chebyshev spectral method to find solutions that are accurate and converge rapidly to the full numerical solution. The methods are illustrated by progressively applying the technique to the Blasius boundary layer equation, the Falkner-Skan equation and finally, the magnetohydrodynamic (MHD Falkner-Skan equation. The solutions are compared to other methods in the literature such as the homotopy analysis method and the spectral-homotopy analysis method with focus on the accuracy and convergence of this new techniques.
A numerical dressing method for the nonlinear superposition of solutions of the KdV equation
International Nuclear Information System (INIS)
Trogdon, Thomas; Deconinck, Bernard
2014-01-01
In this paper we present the unification of two existing numerical methods for the construction of solutions of the Korteweg–de Vries (KdV) equation. The first method is used to solve the Cauchy initial-value problem on the line for rapidly decaying initial data. The second method is used to compute finite-genus solutions of the KdV equation. The combination of these numerical methods allows for the computation of exact solutions that are asymptotically (quasi-)periodic finite-gap solutions and are a nonlinear superposition of dispersive, soliton and (quasi-)periodic solutions in the finite (x, t)-plane. Such solutions are referred to as superposition solutions. We compute these solutions accurately for all values of x and t. (paper)
Simplified computational methods for elastic and elastic-plastic fracture problems
Atluri, Satya N.
1992-01-01
An overview is given of some of the recent (1984-1991) developments in computational/analytical methods in the mechanics of fractures. Topics covered include analytical solutions for elliptical or circular cracks embedded in isotropic or transversely isotropic solids, with crack faces being subjected to arbitrary tractions; finite element or boundary element alternating methods for two or three dimensional crack problems; a 'direct stiffness' method for stiffened panels with flexible fasteners and with multiple cracks; multiple site damage near a row of fastener holes; an analysis of cracks with bonded repair patches; methods for the generation of weight functions for two and three dimensional crack problems; and domain-integral methods for elastic-plastic or inelastic crack mechanics.
Numerical Methods for Free Boundary Problems
1991-01-01
About 80 participants from 16 countries attended the Conference on Numerical Methods for Free Boundary Problems, held at the University of Jyviiskylii, Finland, July 23-27, 1990. The main purpose of this conference was to provide up-to-date information on important directions of research in the field of free boundary problems and their numerical solutions. The contributions contained in this volume cover the lectures given in the conference. The invited lectures were given by H.W. Alt, V. Barbu, K-H. Hoffmann, H. Mittelmann and V. Rivkind. In his lecture H.W. Alt considered a mathematical model and existence theory for non-isothermal phase separations in binary systems. The lecture of V. Barbu was on the approximate solvability of the inverse one phase Stefan problem. K-H. Hoff mann gave an up-to-date survey of several directions in free boundary problems and listed several applications, but the material of his lecture is not included in this proceedings. H.D. Mittelmann handled the stability of thermo capi...
A model-adaptivity method for the solution of Lennard-Jones based adhesive contact problems
Ben Dhia, Hachmi; Du, Shuimiao
2018-05-01
The surface micro-interaction model of Lennard-Jones (LJ) is used for adhesive contact problems (ACP). To address theoretical and numerical pitfalls of this model, a sequence of partitions of contact models is adaptively constructed to both extend and approximate the LJ model. It is formed by a combination of the LJ model with a sequence of shifted-Signorini (or, alternatively, -Linearized-LJ) models, indexed by a shift parameter field. For each model of this sequence, a weak formulation of the associated local ACP is developed. To track critical localized adhesive areas, a two-step strategy is developed: firstly, a macroscopic frictionless (as first approach) linear-elastic contact problem is solved once to detect contact separation zones. Secondly, at each shift-adaptive iteration, a micro-macro ACP is re-formulated and solved within the multiscale Arlequin framework, with significant reduction of computational costs. Comparison of our results with available analytical and numerical solutions shows the effectiveness of our global strategy.
Energy Technology Data Exchange (ETDEWEB)
Donald Estep; Michael Holst; Simon Tavener
2010-02-08
This project was concerned with the accurate computational error estimation for numerical solutions of multiphysics, multiscale systems that couple different physical processes acting across a large range of scales relevant to the interests of the DOE. Multiscale, multiphysics models are characterized by intimate interactions between different physics across a wide range of scales. This poses significant computational challenges addressed by the proposal, including: (1) Accurate and efficient computation; (2) Complex stability; and (3) Linking different physics. The research in this project focused on Multiscale Operator Decomposition methods for solving multiphysics problems. The general approach is to decompose a multiphysics problem into components involving simpler physics over a relatively limited range of scales, and then to seek the solution of the entire system through some sort of iterative procedure involving solutions of the individual components. MOD is a very widely used technique for solving multiphysics, multiscale problems; it is heavily used throughout the DOE computational landscape. This project made a major advance in the analysis of the solution of multiscale, multiphysics problems.
Human-computer interfaces applied to numerical solution of the Plateau problem
Elias Fabris, Antonio; Soares Bandeira, Ivana; Ramos Batista, Valério
2015-09-01
In this work we present a code in Matlab to solve the Problem of Plateau numerically, and the code will include human-computer interface. The Problem of Plateau has applications in areas of knowledge like, for instance, Computer Graphics. The solution method will be the same one of the Surface Evolver, but the difference will be a complete graphical interface with the user. This will enable us to implement other kinds of interface like ocular mouse, voice, touch, etc. To date, Evolver does not include any graphical interface, which restricts its use by the scientific community. Specially, its use is practically impossible for most of the Physically Challenged People.
International Nuclear Information System (INIS)
Menezes, Welton A.; Filho, Hermes Alves; Barros, Ricardo C.
2014-01-01
Highlights: • Fixed-source S N transport problems. • Energy multigroup model. • Anisotropic scattering. • Slab-geometry spectral nodal method. - Abstract: A generalization of the spectral Green’s function (SGF) method is developed for multigroup, fixed-source, slab-geometry discrete ordinates (S N ) problems with anisotropic scattering. The offered SGF method with the one-node block inversion (NBI) iterative scheme converges numerical solutions that are completely free from spatial truncation errors for multigroup, slab-geometry S N problems with scattering anisotropy of order L, provided L < N. As a coarse-mesh numerical method, the SGF method generates numerical solutions that generally do not give detailed information on the problem solution profile, as the grid points can be located considerably away from each other. Therefore, we describe in this paper a technique for the spatial reconstruction of the coarse-mesh solution generated by the multigroup SGF method. Numerical results are given to illustrate the method’s accuracy
North Dakota's Centennial Quilt and Problem Solvers: Solutions: The Library Problem
Small, Marian
2010-01-01
Quilt investigations, such as the Barn quilt problem in the December 2008/January 2009 issue of "Teaching Children Mathematics" and its solutions in last month's issue, can spark interdisciplinary pursuits for teachers and exciting connections for the full range of elementary school students. This month, North Dakota's centennial quilt…
Yousef, Hamood Mohammed; Ismail, Ahmad Izani
2017-11-01
In this paper, Laplace Adomian decomposition method (LADM) was applied to solve Delay differential equations with Boundary Value Problems. The solution is in the form of a convergent series which is easy to compute. This approach is tested on two test problem. The findings obtained exhibit the reliability and efficiency of the proposed method.
Existence and non-existence of solutions for a singular problem with variable potentials
Directory of Open Access Journals (Sweden)
Kamel Saoudi
2017-11-01
Full Text Available The purpose of this article is to prove some existence and nonexistence theorems for the inhomogeneous singular Dirichlet problem $$ - \\Delta_p u = \\frac{\\lambda k(x}{u^\\delta}\\pm h(x u^q. $$ For proving our results we use the sub and super solution method, and monotonicity arguments.
Cost-effective and simple solutions for environmental pollution problems by electrochemical methods
International Nuclear Information System (INIS)
Ahmed, R.
1997-01-01
Environmental pollution is a worldwide problem and has increased significantly with industrialization, urbanization and population growth and is effecting quality of our air, land and water resources. Pollutants include heavy metals, organic toxic and reactive compounds and toxic gases. Major problems in environmental pollution are monitoring and remediation. Now pollutants include such wide range of elements, compounds and gases and normally one needs a whole range of costly analytical techniques to analyse all the pollutants which only very few institutes can afford to purchased. Equipment for electro analytical techniques are much cheaper than most of the other analytical techniques and are also sensitive and accurate for the analysis of nearly the whole range of pollutants including heavy metal. organic reactive compounds, inorganic elements and compounds and toxic gases. application of electrochemical methods for the analysis of different pollutants are reviewed. after monitoring, remediation in the most important aspect of environmental pollution control. Best way could be to treat the pollutants from different industries in such a way that either these are removed from the waste or converted in to non-toxic compounds before their release into the environment. Among all the other treatment methods, electrochemical methods of utilizing the electron as a clean chemical regent are very attractive. Electrodes in electrochemical reactors are abundantly use for the removal and recycling of toxic metals like Cd, Cu, Ni, Pb, Cr and Zn from the industrial waste after electrodeposition. Electrochemical reactors are also being used for electro oxidation of cyanides and other toxic organic compounds into non-toxic species. Such reactors can, in principal, be applied to any environmental pollution problem where the pollutant can either be electro-reduced or oxidized. Different types of electrochemical reactors are discussed, with a view, of their envisaged used for
Special function solutions of a spectral problem for a nonlinear quantum oscillator
International Nuclear Information System (INIS)
Schulze-Halberg, A; Morris, J R
2012-01-01
We construct exact solutions of a spectral problem involving the Schrödinger equation for a nonlinear, one-parameter oscillator potential. In contrast to a previous analysis of the problem (Carinena et al 2007 Ann. Phys. 322 434–59), where solutions were given through a Rodrigues-type formula, our approach leads to closed-form representations of the solutions in terms of special functions, not containing any derivative operators. We show normalizability and orthogonality of our solutions, as well as correct reduction of the problem to the harmonic oscillator model, if the parameter in the potential gets close to zero. (paper)
The numerical analysis of eigenvalue problem solutions in the multigroup neutron diffusion theory
International Nuclear Information System (INIS)
Woznicki, Z.I.
1994-01-01
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iteration within global iterations. Particular interactive strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 32 figs, 15 tabs
The numerical analysis of eigenvalue problem solutions in the multigroup neutron diffusion theory
Energy Technology Data Exchange (ETDEWEB)
Woznicki, Z I [Institute of Atomic Energy, Otwock-Swierk (Poland)
1994-12-31
The main goal of this paper is to present a general iteration strategy for solving the discrete form of multidimensional neutron diffusion equations equivalent mathematically to an eigenvalue problem. Usually a solution method is based on different levels of iterations. The presented matrix formalism allows us to visualize explicitly how the used matrix splitting influences the matrix structure in an eigenvalue problem to be solved as well as the interdependence between inner and outer iteration within global iterations. Particular interactive strategies are illustrated by numerical results obtained for several reactor problems. (author). 21 refs, 32 figs, 15 tabs.
Path integral solution of the Dirichlet problem
International Nuclear Information System (INIS)
LaChapelle, J.
1997-01-01
A scheme for functional integration developed by Cartier/DeWitt-Morette is first reviewed and then employed to construct the path integral representation for the solution of the Dirichlet problem in terms of first exit time. The path integral solution is then applied to calculate the fixed-energy point-to-point transition amplitude both in configuration and phase space. The path integral solution can also be derived using physical principles based on Feynman close-quote s original reasoning. We check that the Fourier transform in energy of the fixed-energy point-to-point transition amplitude gives the well known time-dependent transition amplitude, and calculate the WKB approximation. copyright 1997 Academic Press, Inc
International Nuclear Information System (INIS)
Werner, K.D.
1990-01-01
In this paper we introduce briefly the Geometrical Shock Correction (GSC) method and consider various fields of applications, with special emphasis on two-phase flow problems in porous media. Some test problems are taken from this field. GSC is a very efficient numerical method for constructing the entropy solution of the Cauchy problem of scalar hyperboli conservation laws (with source term) in one space dimension and in specific two-dimensional cases. The novelty consists in constructing the solution at an arbitrary fixed time t=T>0 in one time step, based on transporting the initial values along characteristics and, if shocks appear, on a correction of the multivalued relation by a geometrical averaging technique. (orig.) With 7 figs [de
International Nuclear Information System (INIS)
Kowsary, F.; Pooladvand, K.; Pourshaghaghy, A.
2007-01-01
In this paper, an appropriate distribution of the heating elements' strengths in a radiation furnace is estimated using inverse methods so that a pre-specified temperature and heat flux distribution is attained on the design surface. Minimization of the sum of the squares of the error function is performed using the variable metric method (VMM), and the results are compared with those obtained by the conjugate gradient method (CGM) established previously in the literature. It is shown via test cases and a well-founded validation procedure that the VMM, when using a 'regularized' estimator, is more accurate and is able to reach at a higher quality final solution as compared to the CGM. The test cases used in this study were two-dimensional furnaces filled with an absorbing, emitting, and scattering gas
Yousef, Hamood. M.; Ismail, A. I. B. MD.
2017-08-01
Many attempts have been presented to solve the system of Delay Differential Equations (DDE) with Initial Value Problem. As a result, it has shown difficulties when getting the solution or cannot be solved. In this paper, a Variational Iteration Method is employed to find out an approximate solution for the system of DDE with initial value problems. The example illustrates convenient and an efficiency comparison with the exact solution.
Treating limbs with electrons: creative solutions to technical problems
International Nuclear Information System (INIS)
Hornby, C.
1993-01-01
The treatment of superficial lesions on limbs involving large areas of skin has long presented a challenge to radiation therapists. In the 1990's the use of electrons provides a good selection of field sizes and beam penetrations. However, the rapidly varying contours of limbs as well as their mobility, continues to necessitate solutions to the problems of accurate field definition, homogeneous dose in particularly at beam junctions and, simple but effective patient stabilization. This paper offers several examples of creative solutions to these problems. 8 refs., 17 figs
Student Solutions Manual to Boundary Value Problems and Partial Differential Equations
Powers, David L
2005-01-01
This student solutions manual accompanies the text, Boundary Value Problems and Partial Differential Equations, 5e. The SSM is available in print via PDF or electronically, and provides the student with the detailed solutions of the odd-numbered problems contained throughout the book.Provides students with exercises that skillfully illustrate the techniques used in the text to solve science and engineering problemsNearly 900 exercises ranging in difficulty from basic drills to advanced problem-solving exercisesMany exercises based on current engineering applications
A nodal method applied to a diffusion problem with generalized coefficients
International Nuclear Information System (INIS)
Laazizi, A.; Guessous, N.
1999-01-01
In this paper, we consider second order neutrons diffusion problem with coefficients in L ∞ (Ω). Nodal method of the lowest order is applied to approximate the problem's solution. The approximation uses special basis functions in which the coefficients appear. The rate of convergence obtained is O(h 2 ) in L 2 (Ω), with a free rectangular triangulation. (authors)
Numerical solution of problems concerning the thermal convection of a variable-viscosity liquid
Zherebiatev, I. F.; Lukianov, A. T.; Podkopaev, Iu. L.
A stabilizing-correction scheme is constructed for integrating the fourth-order equation describing the dynamics of a viscous incompressible liquid. As an example, a solution is obtained to the problem of the solidification of a liquid in a rectangular region with allowance for convective energy transfer in the liquid phase as well as temperature-dependent changes of viscosity. It is noted that the proposed method can be used to study steady-state problems of thermal convection in ingots obtained through continuous casting.
International Nuclear Information System (INIS)
Saitoh, Ayumu; Matsui, Nobuyuki; Itoh, Taku; Kamitani, Atsushi; Nakamura, Hiroaki
2011-01-01
A new method has been proposed for implementing essential boundary conditions to the Element-Free Galerkin Method (EFGM) without using the Lagrange multiplier. Furthermore, the performance of the proposed method has been investigated for a nonlinear Poisson problem. The results of computations show that, as interpolation functions become closer to delta functions, the accuracy of the solution is improved on the boundary. In addition, the accuracy of the proposed method is higher than that of the conventional EFGM. Therefore, it might be concluded that the proposed method is useful for solving the nonlinear Poisson problem. (author)
Utilization of niching methods of genetic algorithms in nuclear reactor problems optimization
International Nuclear Information System (INIS)
Sacco, Wagner Figueiredo; Schirru, Roberto
2000-01-01
Genetic Algorithms (GAs) are biologically motivated adaptive systems which have been used, with good results, in function optimization. However, traditional GAs rapidly push an artificial population toward convergence. That is, all individuals in the population soon become nearly identical. Niching Methods allow genetic algorithms to maintain a population of diverse individuals. GAs that incorporate these methods are capable of locating multiple, optimal solutions within a single population. The purpose of this study is to test existing niching techniques and two methods introduced herein, bearing in mind their eventual application in nuclear reactor related problems, specially the nuclear reactor core reload one, which has multiple solutions. Tests are performed using widely known test functions and their results show that the new methods are quite promising, specially in real world problems like the nuclear reactor core reload. (author)
Fast multigrid solution of the advection problem with closed characteristics
Energy Technology Data Exchange (ETDEWEB)
Yavneh, I. [Israel Inst. of Technology, Haifa (Israel); Venner, C.H. [Univ. of Twente, Enschede (Netherlands); Brandt, A. [Weizmann Inst. of Science, Rehovot (Israel)
1996-12-31
The numerical solution of the advection-diffusion problem in the inviscid limit with closed characteristics is studied as a prelude to an efficient high Reynolds-number flow solver. It is demonstrated by a heuristic analysis and numerical calculations that using upstream discretization with downstream relaxation-ordering and appropriate residual weighting in a simple multigrid V cycle produces an efficient solution process. We also derive upstream finite-difference approximations to the advection operator, whose truncation terms approximate {open_quotes}physical{close_quotes} (Laplacian) viscosity, thus avoiding spurious solutions to the homogeneous problem when the artificial diffusivity dominates the physical viscosity.
Numerical methods for coupled fracture problems
Viesca, Robert C.; Garagash, Dmitry I.
2018-04-01
We consider numerical solutions in which the linear elastic response to an opening- or sliding-mode fracture couples with one or more processes. Classic examples of such problems include traction-free cracks leading to stress singularities or cracks with cohesive-zone strength requirements leading to non-singular stress distributions. These classical problems have characteristic square-root asymptotic behavior for stress, relative displacement, or their derivatives. Prior work has shown that such asymptotics lead to a natural quadrature of the singular integrals at roots of Chebyhsev polynomials of the first, second, third, or fourth kind. We show that such quadratures lead to convenient techniques for interpolation, differentiation, and integration, with the potential for spectral accuracy. We further show that these techniques, with slight amendment, may continue to be used for non-classical problems which lack the classical asymptotic behavior. We consider solutions to example problems of both the classical and non-classical variety (e.g., fluid-driven opening-mode fracture and fault shear rupture driven by thermal weakening), with comparisons to analytical solutions or asymptotes, where available.
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.
Closed-form kinetic parameter estimation solution to the truncated data problem
International Nuclear Information System (INIS)
Zeng, Gengsheng L; Kadrmas, Dan J; Gullberg, Grant T
2010-01-01
In a dedicated cardiac single photon emission computed tomography (SPECT) system, the detectors are focused on the heart and the background is truncated in the projections. Reconstruction using truncated data results in biased images, leading to inaccurate kinetic parameter estimates. This paper has developed a closed-form kinetic parameter estimation solution to the dynamic emission imaging problem. This solution is insensitive to the bias in the reconstructed images that is caused by the projection data truncation. This paper introduces two new ideas: (1) it includes background bias as an additional parameter to estimate, and (2) it presents a closed-form solution for compartment models. The method is based on the following two assumptions: (i) the amount of the bias is directly proportional to the truncated activities in the projection data, and (ii) the background concentration is directly proportional to the concentration in the myocardium. In other words, the method assumes that the image slice contains only the heart and the background, without other organs, that the heart is not truncated, and that the background radioactivity is directly proportional to the radioactivity in the blood pool. As long as the background activity can be modeled, the proposed method is applicable regardless of the number of compartments in the model. For simplicity, the proposed method is presented and verified using a single compartment model with computer simulations using both noiseless and noisy projections.
Method of interior boundaries in a mixed problem of acoustic scattering
Directory of Open Access Journals (Sweden)
P. A. Krutitskii
1999-01-01
Full Text Available The mixed problem for the Helmholtz equation in the exterior of several bodies (obstacles is studied in 2 and 3 dimensions. The Dirichlet boundary condition is given on some obstacles and the impedance boundary condition is specified on the rest. The problem is investigated by a special modification of the boundary integral equation method. This modification can be called ‘Method of interior boundaries’, because additional boundaries are introduced inside scattering bodies, where impedance boundary condition is given. The solution of the problem is obtained in the form of potentials on the whole boundary. The density in the potentials satisfies the uniquely solvable Fredholm equation of the second kind and can be computed by standard codes. In fact our method holds for any positive wave numbers. The Neumann, Dirichlet, impedance problems and mixed Dirichlet–Neumann problem are particular cases of our problem.
Web 2.0 Solutions to Wicked Climate Change Problems
Directory of Open Access Journals (Sweden)
Alanah Kazlauskas
2010-01-01
Full Text Available One of the most pressing ‘wicked problems’ facing humankind is climate change together with its many interrelated environmental concerns. The complexity of this set of problems can be overwhelming as there is such diversity among both the interpretations of the scientific evidence and the viability of possible solutions. Among the social technologies associated with the second generation of the Internet known as Web 2.0, there are tools that allow people to communicate, coordinate and collaborate in ways that reduce their carbon footprint and a potential to become part of the climate change solution. However the way forward is not obvious or easy as Web 2.0, while readily accepted in the chaotic social world, is often treated with suspicion in the more ordered world of business and government. This paper applies a holistic theoretical sense-making framework to research and practice on potential Web 2.0 solutions to climate change problems. The suite of issues, activities and tools involved are viewed as an ecosystem where all elements are dynamic and inter-related. Through such innovative thinking the Information Systems community can make a valuable contribution to a critical global problem and hence find a new relevance as part of the solution.
Reinforcement learning solution for HJB equation arising in constrained optimal control problem.
Luo, Biao; Wu, Huai-Ning; Huang, Tingwen; Liu, Derong
2015-11-01
The constrained optimal control problem depends on the solution of the complicated Hamilton-Jacobi-Bellman equation (HJBE). In this paper, a data-based off-policy reinforcement learning (RL) method is proposed, which learns the solution of the HJBE and the optimal control policy from real system data. One important feature of the off-policy RL is that its policy evaluation can be realized with data generated by other behavior policies, not necessarily the target policy, which solves the insufficient exploration problem. The convergence of the off-policy RL is proved by demonstrating its equivalence to the successive approximation approach. Its implementation procedure is based on the actor-critic neural networks structure, where the function approximation is conducted with linearly independent basis functions. Subsequently, the convergence of the implementation procedure with function approximation is also proved. Finally, its effectiveness is verified through computer simulations. Copyright © 2015 Elsevier Ltd. All rights reserved.
Numerical solution of singularity-perturbed two-point boundary-value problems
International Nuclear Information System (INIS)
Masenge, R.W.P.
1993-07-01
Physical processes which involve transportation of slowly diffusing substances in a fast-flowing medium are mathematically modelled by so-called singularly-perturbed second order convection diffusion differential equations in which the convective first order terms dominate over the diffusive second order terms. In general, analytical solutions of such equations are characterized by having sharp solution fronts in some sections of the interior and/or the boundary of the domain of solution. The presence of these (usually very narrow) layer regions in the solution domain makes the task of globally approximating such solutions by standard numerical techniques very difficult. In this expository paper we use a simple one-dimensional prototype problem as a vehicle for analysing the nature of the numerical approximation difficulties involved. In the sequel we present, without detailed derivation, two practical numerical schemes which succeed in varying degrees in numerically resolving the layer of the solution to the prototype problem. (author). 3 refs, 1 fig., 1 tab
Leukhin, Anatolii N.
2005-08-01
The algebraic solution of a 'complex' problem of synthesis of phase-coded (PC) sequences with the zero level of side lobes of the cyclic autocorrelation function (ACF) is proposed. It is shown that the solution of the synthesis problem is connected with the existence of difference sets for a given code dimension. The problem of estimating the number of possible code combinations for a given code dimension is solved. It is pointed out that the problem of synthesis of PC sequences is related to the fundamental problems of discrete mathematics and, first of all, to a number of combinatorial problems, which can be solved, as the number factorisation problem, by algebraic methods by using the theory of Galois fields and groups.
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.
The optimal solution of a non-convex state-dependent LQR problem and its applications.
Directory of Open Access Journals (Sweden)
Xudan Xu
Full Text Available This paper studies a Non-convex State-dependent Linear Quadratic Regulator (NSLQR problem, in which the control penalty weighting matrix [Formula: see text] in the performance index is state-dependent. A necessary and sufficient condition for the optimal solution is established with a rigorous proof by Euler-Lagrange Equation. It is found that the optimal solution of the NSLQR problem can be obtained by solving a Pseudo-Differential-Riccati-Equation (PDRE simultaneously with the closed-loop system equation. A Comparison Theorem for the PDRE is given to facilitate solution methods for the PDRE. A linear time-variant system is employed as an example in simulation to verify the proposed optimal solution. As a non-trivial application, a goal pursuit process in psychology is modeled as a NSLQR problem and two typical goal pursuit behaviors found in human and animals are reproduced using different control weighting [Formula: see text]. It is found that these two behaviors save control energy and cause less stress over Conventional Control Behavior typified by the LQR control with a constant control weighting [Formula: see text], in situations where only the goal discrepancy at the terminal time is of concern, such as in Marathon races and target hitting missions.
International Nuclear Information System (INIS)
Yabushita, Kazuki; Yamashita, Mariko; Tsuboi, Kazuhiro
2007-01-01
We consider the problem of two-dimensional projectile motion in which the resistance acting on an object moving in air is proportional to the square of the velocity of the object (quadratic resistance law). It is well known that the quadratic resistance law is valid in the range of the Reynolds number: 1 x 10 3 ∼ 2 x 10 5 (for instance, a sphere) for practical situations, such as throwing a ball. It has been considered that the equations of motion of this case are unsolvable for a general projectile angle, although some solutions have been obtained for a small projectile angle using perturbation techniques. To obtain a general analytic solution, we apply Liao's homotopy analysis method to this problem. The homotopy analysis method, which is different from a perturbation technique, can be applied to a problem which does not include small parameters. We apply the homotopy analysis method for not only governing differential equations, but also an algebraic equation of a velocity vector to extend the radius of convergence. Ultimately, we obtain the analytic solution to this problem and investigate the validation of the solution
Convergence Properties of Projection and Contraction Methods for Variational Inequality Problems
International Nuclear Information System (INIS)
Xiu, N.; Wang, C.; Zhang, J.
2001-01-01
In this paper we develop the convergence theory of a general class of projection and contraction algorithms (PC method), where an extended stepsize rule is used, for solving variational inequality (VI) problems. It is shown that, by defining a scaled projection residue, the PC method forces the sequence of the residues to zero. It is also shown that, by defining a projected function, the PC method forces the sequence of projected functions to zero. A consequence of this result is that if the PC method converges to a nondegenerate solution of the VI problem, then after a finite number of iterations, the optimal face is identified. Finally, we study local convergence behavior of the extragradient algorithm for solving the KKT system of the inequality constrained VI problem
A general solution strategy of modified power method for higher mode solutions
International Nuclear Information System (INIS)
Zhang, Peng; Lee, Hyunsuk; Lee, Deokjung
2016-01-01
A general solution strategy of the modified power iteration method for calculating higher eigenmodes has been developed and applied in continuous energy Monte Carlo simulation. The new approach adopts four features: 1) the eigen decomposition of transfer matrix, 2) weight cancellation for higher modes, 3) population control with higher mode weights, and 4) stabilization technique of statistical fluctuations using multi-cycle accumulations. The numerical tests of neutron transport eigenvalue problems successfully demonstrate that the new strategy can significantly accelerate the fission source convergence with stable convergence behavior while obtaining multiple higher eigenmodes at the same time. The advantages of the new strategy can be summarized as 1) the replacement of the cumbersome solution step of high order polynomial equations required by Booth's original method with the simple matrix eigen decomposition, 2) faster fission source convergence in inactive cycles, 3) more stable behaviors in both inactive and active cycles, and 4) smaller variances in active cycles. Advantages 3 and 4 can be attributed to the lower sensitivity of the new strategy to statistical fluctuations due to the multi-cycle accumulations. The application of the modified power method to continuous energy Monte Carlo simulation and the higher eigenmodes up to 4th order are reported for the first time in this paper. -- Graphical abstract: -- Highlights: •Modified power method is applied to continuous energy Monte Carlo simulation. •Transfer matrix is introduced to generalize the modified power method. •All mode based population control is applied to get the higher eigenmodes. •Statistic fluctuation can be greatly reduced using accumulated tally results. •Fission source convergence is accelerated with higher mode solutions.
A new method for the solution of the Schroedinger equation
International Nuclear Information System (INIS)
Amore, Paolo; Aranda, Alfredo; De Pace, Arturo
2004-01-01
We present a new method for the solution of the Schroedinger equation applicable to problems of a non-perturbative nature. The method works by identifying three different scales in the problem, which then are treated independently: an asymptotic scale, which depends uniquely on the form of the potential at large distances; an intermediate scale, still characterized by an exponential decay of the wavefunction; and, finally, a short distance scale, in which the wavefunction is sizable. The notion of optimized perturbation is then used in the last two regimes. We apply the method to the quantum anharmonic oscillator and find it suitable to treat both energy eigenvalues and wavefunctions, even for strong couplings
International Nuclear Information System (INIS)
Manakov, S V; Santini, P M
2008-01-01
We have recently solved the inverse scattering problem for one-parameter families of vector fields, and used this result to construct the formal solution of the Cauchy problem for a class of integrable nonlinear partial differential equations in multidimensions, including the second heavenly equation of Plebanski and the dispersionless Kadomtsev-Petviashvili (dKP) equation. We showed, in particular, that the associated inverse problems can be expressed in terms of nonlinear Riemann-Hilbert problems on the real axis. In this paper, we make use of the nonlinear Riemann-Hilbert problem of dKP (i) to construct the longtime behaviour of the solutions of its Cauchy problem; (ii) to characterize a class of implicit solutions; (iii) to elucidate the spectral mechanism causing the gradient catastrophe of localized solutions of dKP, at finite time as well as in the longtime regime, and the corresponding universal behaviours near breaking
Energy Technology Data Exchange (ETDEWEB)
Manakov, S V [Landau Institute for Theoretical Physics, Moscow (Russian Federation); Santini, P M [Dipartimento di Fisica, Universita di Roma ' La Sapienza' , and Istituto Nazionale di Fisica Nucleare, Sezione di Roma 1, Piazz.le Aldo Moro 2, I-00185 Rome (Italy)
2008-02-08
We have recently solved the inverse scattering problem for one-parameter families of vector fields, and used this result to construct the formal solution of the Cauchy problem for a class of integrable nonlinear partial differential equations in multidimensions, including the second heavenly equation of Plebanski and the dispersionless Kadomtsev-Petviashvili (dKP) equation. We showed, in particular, that the associated inverse problems can be expressed in terms of nonlinear Riemann-Hilbert problems on the real axis. In this paper, we make use of the nonlinear Riemann-Hilbert problem of dKP (i) to construct the longtime behaviour of the solutions of its Cauchy problem; (ii) to characterize a class of implicit solutions; (iii) to elucidate the spectral mechanism causing the gradient catastrophe of localized solutions of dKP, at finite time as well as in the longtime regime, and the corresponding universal behaviours near breaking.
Variational Iteration Method for Fifth-Order Boundary Value Problems Using He's Polynomials
Directory of Open Access Journals (Sweden)
Muhammad Aslam Noor
2008-01-01
Full Text Available We apply the variational iteration method using He's polynomials (VIMHP for solving the fifth-order boundary value problems. The proposed method is an elegant combination of variational iteration and the homotopy perturbation methods and is mainly due to Ghorbani (2007. The suggested algorithm is quite efficient and is practically well suited for use in these problems. The proposed iterative scheme finds the solution without any discritization, linearization, or restrictive assumptions. Several examples are given to verify the reliability and efficiency of the method. The fact that the proposed technique solves nonlinear problems without using Adomian's polynomials can be considered as a clear advantage of this algorithm over the decomposition method.
A Three Step Explicit Method for Direct Solution of Third Order ...
African Journals Online (AJOL)
This study produces a three step discrete Linear Multistep Method for Direct solution of third order initial value problems of ordinary differential equations of the form y'''= f(x,y,y',y''). Taylor series expansion technique was adopted in the development of the method. The differential system from the basis polynomial function to ...
Game Theoretic Problems in Network Economics and Mechanism Design Solutions
Narahari, Y; Narayanam, Ramasuri; Prakash, Hastagiri
2009-01-01
Explores game theoretic modeling and mechanism design for problem solving in Internet and network economics. This monograph contains an exposition of representative game theoretic problems in three different network economics situations and a systematic exploration of mechanism design solutions to these problems.
Energy Technology Data Exchange (ETDEWEB)
Guerin, P
2007-12-15
The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)
Spectral Analysis of Large Finite Element Problems by Optimization Methods
Directory of Open Access Journals (Sweden)
Luca Bergamaschi
1994-01-01
Full Text Available Recently an efficient method for the solution of the partial symmetric eigenproblem (DACG, deflated-accelerated conjugate gradient was developed, based on the conjugate gradient (CG minimization of successive Rayleigh quotients over deflated subspaces of decreasing size. In this article four different choices of the coefficient βk required at each DACG iteration for the computation of the new search direction Pk are discussed. The “optimal” choice is the one that yields the same asymptotic convergence rate as the CG scheme applied to the solution of linear systems. Numerical results point out that the optimal βk leads to a very cost effective algorithm in terms of CPU time in all the sample problems presented. Various preconditioners are also analyzed. It is found that DACG using the optimal βk and (LLT−1 as a preconditioner, L being the incomplete Cholesky factor of A, proves a very promising method for the partial eigensolution. It appears to be superior to the Lanczos method in the evaluation of the 40 leftmost eigenpairs of five finite element problems, and particularly for the largest problem, with size equal to 4560, for which the speed gain turns out to fall between 2.5 and 6.0, depending on the eigenpair level.
Energy Technology Data Exchange (ETDEWEB)
Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)
1996-12-31
The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.
Blow up of solutions to ordinary differential equations arising in nonlinear dispersive problems
Directory of Open Access Journals (Sweden)
Milena Dimova
2018-03-01
Full Text Available We study a new class of ordinary differential equations with blow up solutions. Necessary and sufficient conditions for finite blow up time are proved. Based on the new differential equation, a revised version of the concavity method of Levine is proposed. As an application we investigate the non-existence of global solutions to the Cauchy problem of Klein-Gordon, and to the double dispersive equations. We obtain necessary and sufficient condition for finite time blow up with arbitrary positive energy. A very general sufficient condition for blow up is also given.
A Note on the Solutions of the Van der Pol and Duffing Equations Using a Linearisation Method
Directory of Open Access Journals (Sweden)
Sandile S. Motsa
2012-01-01
Full Text Available We present a novel application of the successive linearisation method to the classical Van der Pol and Duffing oscillator equations. By recasting the governing equations as nonlinear eigenvalue problems we obtain accurate values of the frequency and amplitude. We demonstrate that the proposed method can be used to obtain the limit cycle and bifurcation diagrams of the governing equations. Comparison with exact and other results in the literature shows that the method is accurate and effective in finding solutions of nonlinear equations with oscillatory solutions, nonlinear eigenvalue problems, and other nonlinear problems with bifurcations.
An analytical method for the inverse Cauchy problem of Lame equation in a rectangle
Grigor’ev, Yu
2018-04-01
In this paper, we present an analytical computational method for the inverse Cauchy problem of Lame equation in the elasticity theory. A rectangular domain is frequently used in engineering structures and we only consider the analytical solution in a two-dimensional rectangle, wherein a missing boundary condition is recovered from the full measurement of stresses and displacements on an accessible boundary. The essence of the method consists in solving three independent Cauchy problems for the Laplace and Poisson equations. For each of them, the Fourier series is used to formulate a first-kind Fredholm integral equation for the unknown function of data. Then, we use a Lavrentiev regularization method, and the termwise separable property of kernel function allows us to obtain a closed-form regularized solution. As a result, for the displacement components, we obtain solutions in the form of a sum of series with three regularization parameters. The uniform convergence and error estimation of the regularized solutions are proved.
POISSON, Analysis Solution of Poisson Problems in Probabilistic Risk Assessment
International Nuclear Information System (INIS)
Froehner, F.H.
1986-01-01
1 - Description of program or function: Purpose of program: Analytic treatment of two-stage Poisson problem in Probabilistic Risk Assessment. Input: estimated a-priori mean failure rate and error factor of system considered (for calculation of stage-1 prior), number of failures and operating times for similar systems (for calculation of stage-2 prior). Output: a-posteriori probability distributions on linear and logarithmic time scale (on specified time grid) and expectation values of failure rate and error factors are calculated for: - stage-1 a-priori distribution, - stage-1 a-posteriori distribution, - stage-2 a-priori distribution, - stage-2 a-posteriori distribution. 2 - Method of solution: Bayesian approach with conjugate stage-1 prior, improved with experience from similar systems to yield stage-2 prior, and likelihood function from experience with system under study (documentation see below under 10.). 3 - Restrictions on the complexity of the problem: Up to 100 similar systems (including the system considered), arbitrary number of problems (failure types) with same grid
Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution
Energy Technology Data Exchange (ETDEWEB)
Dall-Anese, Emiliano [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zhao, Changhong [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Zamzam, Admed S. [University of Minnesota; Sidiropoulos, Nicholas D. [University of Minnesota; Taylor, Josh A. [University of Toronto
2018-01-12
This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successive convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.
Linear facility location in three dimensions - Models and solution methods
DEFF Research Database (Denmark)
Brimberg, Jack; Juel, Henrik; Schöbel, Anita
2002-01-01
We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the line (segment) to a given set of points is minimized. An example is planning the drilling of a mine shaft, with access to ore deposits through...... horizontal tunnels connecting the deposits and the shaft. Various models of the problem are developed and analyzed, and efficient solution methods are given....
International Nuclear Information System (INIS)
Ma Wenxiu; Lee, J.-H.
2009-01-01
A direct approach to exact solutions of nonlinear partial differential equations is proposed, by using rational function transformations. The new method provides a more systematical and convenient handling of the solution process of nonlinear equations, unifying the tanh-function type methods, the homogeneous balance method, the exp-function method, the mapping method, and the F-expansion type methods. Its key point is to search for rational solutions to variable-coefficient ordinary differential equations transformed from given partial differential equations. As an application, the construction problem of exact solutions to the 3+1 dimensional Jimbo-Miwa equation is treated, together with a Baecklund transformation.
Public problems: Still waiting on the marketplace for solutions
Energy Technology Data Exchange (ETDEWEB)
Gover, J. [Sandia National Labs., Albuquerque, NM (United States); Carayannis, E. [George Washington Univ., Washington, DC (United States); Huray, P.
1997-10-01
This report addresses the need for government sponsored R and D to address real public problems. The motivation is that a public benefit of the money spent must be demonstrated. The areas identified as not having appropriate attention resulting in unmet public needs include healthcare cost, cost and benefits of regulations, infrastructure problems, defense spending misaligned with foreign policy objectives, the crime problem, energy impact on the environment, the education problem, low productivity growth industry sectors, the income distribution problem, the aging problem, the propagation of disease and policy changes needed to address the solution of these problems.
Singularly perturbed hyperbolic problems on metric graphs: asymptotics of solutions
Directory of Open Access Journals (Sweden)
Golovaty Yuriy
2017-04-01
Full Text Available We are interested in the evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a metric graph is studied. The hyperbolic equation becomes degenerate on a part of the graph as a small parameter goes to zero. In addition, the rates of degeneration may differ in different edges of the graph. Using the boundary layer method the complete asymptotic expansions of solutions are constructed and justified.
A note on numerical solution to the problem of criticality
International Nuclear Information System (INIS)
Kyncl, J.
2002-01-01
The contribution deals with numerical solution to the problem of criticality for neutron transport equation by the external source iteration method. Especially, the speed of convergence is examined. It is shown that if neutron absorption in the medium considered is high and if the space region occupied by the medium is large then a slow convergence of the iterations can be expected. This expectation is confirmed by results to CB4 benchmark obtained by MCNP code. Besides the results presented some questions concerning applications of them to criticality calculations are pointed out (Author)
Problems of Mathematical Finance by Stochastic Control Methods
Stettner, Łukasz
The purpose of this paper is to present main ideas of mathematics of finance using the stochastic control methods. There is an interplay between stochastic control and mathematics of finance. On the one hand stochastic control is a powerful tool to study financial problems. On the other hand financial applications have stimulated development in several research subareas of stochastic control in the last two decades. We start with pricing of financial derivatives and modeling of asset prices, studying the conditions for the absence of arbitrage. Then we consider pricing of defaultable contingent claims. Investments in bonds lead us to the term structure modeling problems. Special attention is devoted to historical static portfolio analysis called Markowitz theory. We also briefly sketch dynamic portfolio problems using viscosity solutions to Hamilton-Jacobi-Bellman equation, martingale-convex analysis method or stochastic maximum principle together with backward stochastic differential equation. Finally, long time portfolio analysis for both risk neutral and risk sensitive functionals is introduced.
Solution for Nonlinear Three-Dimensional Intercept Problem with Minimum Energy
Directory of Open Access Journals (Sweden)
Henzeh Leeghim
2013-01-01
a minimum-energy application, which then generates both the desired initial interceptor velocity and the TOF for the minimum-energy transfer. The optimization problem is formulated by using the classical Lagrangian f and g coefficients, which map initial position and velocity vectors to future times, and a universal time variable x. A Newton-Raphson iteration algorithm is introduced for iteratively solving the problem. A generalized problem formulation is introduced for minimizing the TOF as part of the optimization problem. Several examples are presented, and the results are compared with the Hohmann transfer solution approaches. The resulting minimum-energy intercept solution algorithm is expected to be broadly useful as a starting iterative for applications spanning: targeting, rendezvous, interplanetary trajectory design, and so on.
The unified method: III. Nonlinearizable problems on the interval
International Nuclear Information System (INIS)
Lenells, J; Fokas, A S
2012-01-01
Boundary value problems for integrable nonlinear evolution PDEs formulated on the finite interval can be analyzed by the unified method introduced by one of the authors and extensively used in the literature. The implementation of this general method to this particular class of problems yields the solution in terms of the unique solution of a matrix Riemann–Hilbert problem formulated in the complex k-plane (the Fourier plane), which has a jump matrix with explicit (x, t)-dependence involving six scalar functions of k, called the spectral functions. Two of these functions depend on the initial data, whereas the other four depend on all boundary values. The most difficult step of the new method is the characterization of the latter four spectral functions in terms of the given initial and boundary data, i.e. the elimination of the unknown boundary values. Here, we present an effective characterization of the spectral functions in terms of the given initial and boundary data. We present two different characterizations of this problem. One is based on the analysis of the so-called global relation, on the analysis of the equations obtained from the global relation via certain transformations leaving the dispersion relation of the associated linearized PDE invariant and on the computation of the large k asymptotics of the eigenfunctions defining the relevant spectral functions. The other is based on the analysis of the global relation and on the introduction of the so-called Gelfand–Levitan–Marchenko representations of the eigenfunctions defining the relevant spectral functions. We also show that these two different characterizations are equivalent and that in the limit when the length of the interval tends to infinity, the relevant formulas reduce to the analogous formulas obtained recently for the case of boundary value problems formulated on the half-line. (paper)
Energy Technology Data Exchange (ETDEWEB)
Carey, G.F.; Young, D.M.
1993-12-31
The program outlined here is directed to research on methods, algorithms, and software for distributed parallel supercomputers. Of particular interest are finite element methods and finite difference methods together with sparse iterative solution schemes for scientific and engineering computations of very large-scale systems. Both linear and nonlinear problems will be investigated. In the nonlinear case, applications with bifurcation to multiple solutions will be considered using continuation strategies. The parallelizable numerical methods of particular interest are a family of partitioning schemes embracing domain decomposition, element-by-element strategies, and multi-level techniques. The methods will be further developed incorporating parallel iterative solution algorithms with associated preconditioners in parallel computer software. The schemes will be implemented on distributed memory parallel architectures such as the CRAY MPP, Intel Paragon, the NCUBE3, and the Connection Machine. We will also consider other new architectures such as the Kendall-Square (KSQ) and proposed machines such as the TERA. The applications will focus on large-scale three-dimensional nonlinear flow and reservoir problems with strong convective transport contributions. These are legitimate grand challenge class computational fluid dynamics (CFD) problems of significant practical interest to DOE. The methods developed and algorithms will, however, be of wider interest.
Two Novel Methods and Multi-Mode Periodic Solutions for the Fermi-Pasta-Ulam Model
Arioli, Gianni; Koch, Hans; Terracini, Susanna
2005-04-01
We introduce two novel methods for studying periodic solutions of the FPU β-model, both numerically and rigorously. One is a variational approach, based on the dual formulation of the problem, and the other involves computer-assisted proofs. These methods are used e.g. to construct a new type of solutions, whose energy is spread among several modes, associated with closely spaced resonances.
Challenging problems and solutions in intelligent systems
Grzegorzewski, Przemysław; Kacprzyk, Janusz; Owsiński, Jan; Penczek, Wojciech; Zadrożny, Sławomir
2016-01-01
This volume presents recent research, challenging problems and solutions in Intelligent Systems– covering the following disciplines: artificial and computational intelligence, fuzzy logic and other non-classic logics, intelligent database systems, information retrieval, information fusion, intelligent search (engines), data mining, cluster analysis, unsupervised learning, machine learning, intelligent data analysis, (group) decision support systems, intelligent agents and multi-agent systems, knowledge-based systems, imprecision and uncertainty handling, electronic commerce, distributed systems, etc. The book defines a common ground for sometimes seemingly disparate problems and addresses them by using the paradigm of broadly perceived intelligent systems. It presents a broad panorama of a multitude of theoretical and practical problems which have been successfully dealt with using the paradigm of intelligent computing.
Comptonization in Ultra-Strong Magnetic Fields: Numerical Solution to the Radiative Transfer Problem
Ceccobello, C.; Farinelli, R.; Titarchuk, L.
2014-01-01
We consider the radiative transfer problem in a plane-parallel slab of thermal electrons in the presence of an ultra-strong magnetic field (B approximately greater than B(sub c) approx. = 4.4 x 10(exp 13) G). Under these conditions, the magnetic field behaves like a birefringent medium for the propagating photons, and the electromagnetic radiation is split into two polarization modes, ordinary and extraordinary, that have different cross-sections. When the optical depth of the slab is large, the ordinary-mode photons are strongly Comptonized and the photon field is dominated by an isotropic component. Aims. The radiative transfer problem in strong magnetic fields presents many mathematical issues and analytical or numerical solutions can be obtained only under some given approximations. We investigate this problem both from the analytical and numerical point of view, provide a test of the previous analytical estimates, and extend these results with numerical techniques. Methods. We consider here the case of low temperature black-body photons propagating in a sub-relativistic temperature plasma, which allows us to deal with a semi-Fokker-Planck approximation of the radiative transfer equation. The problem can then be treated with the variable separation method, and we use a numerical technique to find solutions to the eigenvalue problem in the case of a singular kernel of the space operator. The singularity of the space kernel is the result of the strong angular dependence of the electron cross-section in the presence of a strong magnetic field. Results. We provide the numerical solution obtained for eigenvalues and eigenfunctions of the space operator, and the emerging Comptonization spectrum of the ordinary-mode photons for any eigenvalue of the space equation and for energies significantly lesser than the cyclotron energy, which is on the order of MeV for the intensity of the magnetic field here considered. Conclusions. We derived the specific intensity of the
Methods for computing SN eigenvalues and eigenvectors of slab geometry transport problems
International Nuclear Information System (INIS)
Yavuz, Musa
1998-01-01
We discuss computational methods for computing the eigenvalues and eigenvectors of single energy-group neutral particle transport (S N ) problems in homogeneous slab geometry, with an arbitrary scattering anisotropy of order L. These eigensolutions are important when exact (or very accurate) solutions are desired for coarse spatial cell problems demanding rapid execution times. Three methods, one of which is 'new', are presented for determining the eigenvalues and eigenvectors of such S N problems. In the first method, separation of variables is directly applied to the S N equations. In the second method, common characteristics of the S N and P N-1 equations are used. In the new method, the eigenvalues and eigenvectors can be computed provided that the cell-interface Green's functions (transmission and reflection factors) are known. Numerical results for S 4 test problems are given to compare the new method with the existing methods
Methods for computing SN eigenvalues and eigenvectors of slab geometry transport problems
International Nuclear Information System (INIS)
Yavuz, M.
1997-01-01
We discuss computational methods for computing the eigenvalues and eigenvectors of single energy-group neutral particle transport (S N ) problems in homogeneous slab geometry, with an arbitrary scattering anisotropy of order L. These eigensolutions are important when exact (or very accurate) solutions are desired for coarse spatial cell problems demanding rapid execution times. Three methods, one of which is 'new', are presented for determining the eigenvalues and eigenvectors of such S N problems. In the first method, separation of variables is directly applied to the S N equations. In the second method, common characteristics of the S N and P N-1 equations are used. In the new method, the eigenvalues and eigenvectors can be computed provided that the cell-interface Green's functions (transmission and reflection factors) are known. Numerical results for S 4 test problems are given to compare the new method with the existing methods. (author)
International Nuclear Information System (INIS)
Guerin, P.
2007-12-01
The neutronic simulation of a nuclear reactor core is performed using the neutron transport equation, and leads to an eigenvalue problem in the steady-state case. Among the deterministic resolution methods, diffusion approximation is often used. For this problem, the MINOS solver based on a mixed dual finite element method has shown his efficiency. In order to take advantage of parallel computers, and to reduce the computing time and the local memory requirement, we propose in this dissertation two domain decomposition methods for the resolution of the mixed dual form of the eigenvalue neutron diffusion problem. The first approach is a component mode synthesis method on overlapping sub-domains. Several Eigenmodes solutions of a local problem solved by MINOS on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second approach is a modified iterative Schwarz algorithm based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, the problem is solved on each sub domain by MINOS with the interface conditions deduced from the solutions on the adjacent sub-domains at the previous iteration. The iterations allow the simultaneous convergence of the domain decomposition and the eigenvalue problem. We demonstrate the accuracy and the efficiency in parallel of these two methods with numerical results for the diffusion model on realistic 2- and 3-dimensional cores. (author)
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.
DEFF Research Database (Denmark)
Stolpe, Mathias; Stidsen, Thomas K.
2005-01-01
In this paper we present a hierarchical optimization method for finding feasible true 0-1 solutions to finite element based topology design problems. The topology design problems are initially modeled as non-convex mixed 0-1 programs. The hierarchical optimization method is applied to the problem...... and then successively refined as needed. At each level of design mesh refinement, a neighborhood optimization method is used to solve the problem considered. The non-convex topology design problems are equivalently reformulated as convex all-quadratic mixed 0-1 programs. This reformulation enables the use of methods...... of minimizing the weight of a structure subject to displacement and local design-dependent stress constraints. The method iteratively solves a sequence of problems of increasing size of the same type as the original problem. The problems are defined on a design mesh which is initially coarse...
Complicated problem solution techniques in optimal parameter searching
International Nuclear Information System (INIS)
Gergel', V.P.; Grishagin, V.A.; Rogatneva, E.A.; Strongin, R.G.; Vysotskaya, I.N.; Kukhtin, V.V.
1992-01-01
An algorithm is presented of a global search for numerical solution of multidimentional multiextremal multicriteria optimization problems with complicated constraints. A boundedness of object characteristic changes is assumed at restricted changes of its parameters (Lipschitz condition). The algorithm was realized as a computer code. The algorithm was realized as a computer code. The programme was used to solve in practice the different applied optimization problems. 10 refs.; 3 figs
International Nuclear Information System (INIS)
Sergienko, I.V.; Golodnikov, A.N.
1984-01-01
This article applies the methods of decompositions, which are used to solve continuous linear problems, to integer and partially integer problems. The fall-vector method is used to solve the obtained coordinate problems. An algorithm of the fall-vector is described. The Kornai-Liptak decomposition principle is used to reduce the integer linear programming problem to integer linear programming problems of a smaller dimension and to a discrete coordinate problem with simple constraints
Energy Technology Data Exchange (ETDEWEB)
Bluet, J C [Commissariat a l' Energie Atomique, Cadarache (France)
1966-02-01
Three problems of multiple scattering arising from neutron cross sections experiments, are reported here. The common hypothesis are: - Elastic scattering is the only possible process - Angular distributions are isotropic - Losses of particle energy are negligible in successive collisions. In the three cases practical results, corresponding to actual experiments are given. Moreover the results are shown in more general way, using dimensionless variable such as the ratio of geometrical dimensions to neutron mean free path. The FORTRAN codes are given together with to the corresponding flow charts, and lexicons of symbols. First problem: Measurement of sodium capture cross-section. A sodium sample of given geometry is submitted to a neutron flux. Induced activity is then measured by means of a sodium iodide cristal. The distribution of active nuclei in the sample, and the counter efficiency are calculated by Monte-Carlo method taking multiple scattering into account. Second problem: absolute measurement of a neutron flux using a glass scintillator. The scintillator is a use of lithium 6 loaded glass, submitted to neutron flux perpendicular to its plane faces. If the glass thickness is not negligible compared with scattering mean free path {lambda}, the mean path e' of neutrons in the glass is different from the thickness. Monte-Carlo calculation are made to compute this path and a relative correction to efficiency equal to (e' - e)/e. Third problem: study of a neutron collimator. A neutron detector is placed at the bottom of a cylinder surrounded with water. A neutron source is placed on the cylinder axis, in front of the water shield. The number of neutron tracks going directly and indirectly through the water from the source to the detector are counted. (author) [French] On traite dans ce rapport de trois problemes avec les hypotheses communes suivantes: 1.- Le seul processus de collision possible est la diffusion electrique. 2.- La distribution angulaire est
NUMERICAL SOLUTION OF SINGULAR INVERSE NODAL PROBLEM BY USING CHEBYSHEV POLYNOMIALS
NEAMATY, ABDOLALI; YILMAZ, EMRAH; AKBARPOOR, SHAHRBANOO; DABBAGHIAN, ABDOLHADI
2017-01-01
In this study, we consider Sturm-Liouville problem in two cases: the first case having no singularity and the second case having a singularity at zero. Then, we calculate the eigenvalues and the nodal points and present the uniqueness theorem for the solution of the inverse problem by using a dense subset of the nodal points in two given cases. Also, we use Chebyshev polynomials of the first kind for calculating the approximate solution of the inverse nodal problem in these cases. Finally, we...
The best solution to our Nation's waste management problem: Education
International Nuclear Information System (INIS)
Mikel, C.J.
1992-01-01
In addition to the Waste Isolation Pilot Plant (WIPP) being the best solution today to the Nation's problem of permanent storage of transuranic radioactive waste produced by the defense industry, WIPP is also involved in finding the solution for another national problem: the education of our youth. The youth of America have grown up thinking that science and math are too hard, or not interesting. We, the parents of our Nation's leaders of tomorrow, must find a solution to this dilemma. It is the mission of the Waste Isolation Division Educational Programs to create programs to promote quality education in the classroom and to enhance each student's interest in mathematics and the sciences
Directory of Open Access Journals (Sweden)
Mitsuhiro Nakao
2014-01-01
Full Text Available We prove the existence and uniqueness of a global decaying solution to the initial boundary value problem for the quasilinear wave equation with Kelvin-Voigt dissipation and a derivative nonlinearity. To derive the required estimates of the solutions we employ a 'loan' method and use a difference inequality on the energy.
Methods tuned on the physical problem. A way to improve numerical codes
International Nuclear Information System (INIS)
Ixaru, L.Gr.
2010-01-01
We consider the problem on how the numerical methods tuned on the physical problem can contribute to the enhancement of the performance of the codes. We illustrate this on two simple cases: solution of time independent one-dimensional Schroedinger equation, and the computation of integrals with oscillatory integrands. In both cases the tuned versions bring a massive gain in accuracy at negligible extra cost. We presented two simple problems where successive levels of tuning enhance significantly the accuracy at negligible extra cost. These problems should be seen as representing only some illustrations on how the codes can be improved but we must also mention that in many cases tuned versions still have to be developed. Just for a suggestion, quadrature formulae which involve the integrand and a number of successive derivatives of this exist, but no formula is available when some of these derivatives are missing, for example when we dispose of y and y'' but not of y'. A direct application will be on the case when the integrand involves the solution of the Schrodinger equation by the method of Numerov. (author)
Quasihomogeneous function method and Fock's problem
International Nuclear Information System (INIS)
Smyshlyaev, V.P.
1987-01-01
The diffraction of a high-frequency wave by a smooth convex body near the tangency point of the limiting ray to the surface is restated as the scattering problem for the Schrodinger equation with a linear potential on a half-axis. Various prior estimates for the scattering problem are used in order to prove existence, uniqueness, and smoothness theorems. The corresponding solution satisfies the principle of limiting absorption. The formal solution of the corresponding Schrodinger equation in the form of quasihomogeneous functions is essentially used in their constructions
A simple finite element method for boundary value problems with a Riemann–Liouville derivative
Jin, Bangti; Lazarov, Raytcho; Lu, Xiliang; Zhou, Zhi
2016-01-01
© 2015 Elsevier B.V. All rights reserved. We consider a boundary value problem involving a Riemann-Liouville fractional derivative of order α∈(3/2,2) on the unit interval (0,1). The standard Galerkin finite element approximation converges slowly due to the presence of singularity term xα-^{1} in the solution representation. In this work, we develop a simple technique, by transforming it into a second-order two-point boundary value problem with nonlocal low order terms, whose solution can reconstruct directly the solution to the original problem. The stability of the variational formulation, and the optimal regularity pickup of the solution are analyzed. A novel Galerkin finite element method with piecewise linear or quadratic finite elements is developed, and ^{L2}(D) error estimates are provided. The approach is then applied to the corresponding fractional Sturm-Liouville problem, and error estimates of the eigenvalue approximations are given. Extensive numerical results fully confirm our theoretical study.
A simple finite element method for boundary value problems with a Riemann–Liouville derivative
Jin, Bangti
2016-02-01
© 2015 Elsevier B.V. All rights reserved. We consider a boundary value problem involving a Riemann-Liouville fractional derivative of order α∈(3/2,2) on the unit interval (0,1). The standard Galerkin finite element approximation converges slowly due to the presence of singularity term xα-^{1} in the solution representation. In this work, we develop a simple technique, by transforming it into a second-order two-point boundary value problem with nonlocal low order terms, whose solution can reconstruct directly the solution to the original problem. The stability of the variational formulation, and the optimal regularity pickup of the solution are analyzed. A novel Galerkin finite element method with piecewise linear or quadratic finite elements is developed, and ^{L2}(D) error estimates are provided. The approach is then applied to the corresponding fractional Sturm-Liouville problem, and error estimates of the eigenvalue approximations are given. Extensive numerical results fully confirm our theoretical study.
Positive solutions and eigenvalues of nonlocal boundary-value problems
Directory of Open Access Journals (Sweden)
Jifeng Chu
2005-07-01
Full Text Available We study the ordinary differential equation $x''+lambda a(tf(x=0$ with the boundary conditions $x(0=0$ and $x'(1=int_{eta}^{1}x'(sdg(s$. We characterize values of $lambda$ for which boundary-value problem has a positive solution. Also we find appropriate intervals for $lambda$ so that there are two positive solutions.
A penalty method for PDE-constrained optimization in inverse problems
International Nuclear Information System (INIS)
Leeuwen, T van; Herrmann, F J
2016-01-01
Many inverse and parameter estimation problems can be written as PDE-constrained optimization problems. The goal is to infer the parameters, typically coefficients of the PDE, from partial measurements of the solutions of the PDE for several right-hand sides. Such PDE-constrained problems can be solved by finding a stationary point of the Lagrangian, which entails simultaneously updating the parameters and the (adjoint) state variables. For large-scale problems, such an all-at-once approach is not feasible as it requires storing all the state variables. In this case one usually resorts to a reduced approach where the constraints are explicitly eliminated (at each iteration) by solving the PDEs. These two approaches, and variations thereof, are the main workhorses for solving PDE-constrained optimization problems arising from inverse problems. In this paper, we present an alternative method that aims to combine the advantages of both approaches. Our method is based on a quadratic penalty formulation of the constrained optimization problem. By eliminating the state variable, we develop an efficient algorithm that has roughly the same computational complexity as the conventional reduced approach while exploiting a larger search space. Numerical results show that this method indeed reduces some of the nonlinearity of the problem and is less sensitive to the initial iterate. (paper)
Nature, Human Nature, and Solutions to Problems.
Pedrini, D. T.; Pedrini, B. C.
This paper promotes an undergraduate course that would discuss the great ideas of Plato, St. Paul, Karl Marx, Sigmund Freud, Jean Paul Sartre, B. F. Skinner, and Konrad Lorenz. This course would help students understand human values and behaviors while focusing on historical, world, and national problems. Tentative solutions would then be…
Producing Satisfactory Solutions to Scheduling Problems: An Iterative Constraint Relaxation Approach
Chien, S.; Gratch, J.
1994-01-01
One drawback to using constraint-propagation in planning and scheduling systems is that when a problem has an unsatisfiable set of constraints such algorithms typically only show that no solution exists. While, technically correct, in practical situations, it is desirable in these cases to produce a satisficing solution that satisfies the most important constraints (typically defined in terms of maximizing a utility function). This paper describes an iterative constraint relaxation approach in which the scheduler uses heuristics to progressively relax problem constraints until the problem becomes satisfiable. We present empirical results of applying these techniques to the problem of scheduling spacecraft communications for JPL/NASA antenna resources.