Role of Beliefs and Emotions in Numerical Problem Solving in University Physics Education

ERIC Educational Resources Information Center

Bodin, Madelen; Winberg, Mikael

2012-01-01

Numerical problem solving in classical mechanics in university physics education offers a learning situation where students have many possibilities of control and creativity. In this study, expertlike beliefs about physics and learning physics together with prior knowledge were the most important predictors of the quality of performance of a task…

Analytical-numerical solution of a nonlinear integrodifferential equation in econometrics

NASA Astrophysics Data System (ADS)

Kakhktsyan, V. M.; Khachatryan, A. Kh.

2013-07-01

A mixed problem for a nonlinear integrodifferential equation arising in econometrics is considered. An analytical-numerical method is proposed for solving the problem. Some numerical results are presented.

Numerical Leak Detection in a Pipeline Network of Complex Structure with Unsteady Flow

NASA Astrophysics Data System (ADS)

Aida-zade, K. R.; Ashrafova, E. R.

2017-12-01

An inverse problem for a pipeline network of complex loopback structure is solved numerically. The problem is to determine the locations and amounts of leaks from unsteady flow characteristics measured at some pipeline points. The features of the problem include impulse functions involved in a system of hyperbolic differential equations, the absence of classical initial conditions, and boundary conditions specified as nonseparated relations between the states at the endpoints of adjacent pipeline segments. The problem is reduced to a parametric optimal control problem without initial conditions, but with nonseparated boundary conditions. The latter problem is solved by applying first-order optimization methods. Results of numerical experiments are presented.

Numerical simulation of transient, incongruent vaporization induced by high power laser

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsai, C.H.

1981-01-01

A mathematical model and numerical calculations were developed to solve the heat and mass transfer problems specifically for uranum oxide subject to laser irradiation. It can easily be modified for other heat sources or/and other materials. In the uranium-oxygen system, oxygen is the preferentially vaporizing component, and as a result of the finite mobility of oxygen in the solid, an oxygen deficiency is set up near the surface. Because of the bivariant behavior of uranium oxide, the heat transfer problem and the oxygen diffusion problem are coupled and a numerical method of simultaneously solving the two boundary value problems ismore » studied. The temperature dependence of the thermal properties and oxygen diffusivity, as well as the highly ablative effect on the surface, leads to considerable non-linearities in both the governing differential equations and the boundary conditions. Based on the earlier work done in this laboratory by Olstad and Olander on Iron and on Zirconium hydride, the generality of the problem is expanded and the efficiency of the numerical scheme is improved. The finite difference method, along with some advanced numerical techniques, is found to be an efficient way to solve this problem.« less

The Effects of Labels on Learning Subgoals for Solving Problems.

ERIC Educational Resources Information Center

Catrambone, Richard

This study, involving 65 undergraduates at the Georgia Institute of Technology (Atlanta); explores a scheme for representing problem-solving knowledge and predicting transfer as a function of problem-solving subgoals acquired from examples. A subgoal is an unknown entity (numerical or conceptual) that needs to be found in order to achieve a higher…

Numerical study of signal propagation in corrugated coaxial cables

DOE PAGES

Li, Jichun; Machorro, Eric A.; Shields, Sidney

2017-01-01

Our article focuses on high-fidelity modeling of signal propagation in corrugated coaxial cables. Taking advantage of the axisymmetry, the authors reduce the 3-D problem to a 2-D problem by solving time-dependent Maxwell's equations in cylindrical coordinates.They then develop a nodal discontinuous Galerkin method for solving their model equations. We prove stability and error analysis for the semi-discrete scheme. We we present our numerical results, we demonstrate that our algorithm not only converges as our theoretical analysis predicts, but it is also very effective in solving a variety of signal propagation problems in practical corrugated coaxial cables.

Optimality conditions for the numerical solution of optimization problems with PDE constraints :

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aguilo Valentin, Miguel Alejandro; Ridzal, Denis

2014-03-01

A theoretical framework for the numerical solution of partial di erential equation (PDE) constrained optimization problems is presented in this report. This theoretical framework embodies the fundamental infrastructure required to e ciently implement and solve this class of problems. Detail derivations of the optimality conditions required to accurately solve several parameter identi cation and optimal control problems are also provided in this report. This will allow the reader to further understand how the theoretical abstraction presented in this report translates to the application.

An accurate method for solving a class of fractional Sturm-Liouville eigenvalue problems

NASA Astrophysics Data System (ADS)

Kashkari, Bothayna S. H.; Syam, Muhammed I.

2018-06-01

This article is devoted to both theoretical and numerical study of the eigenvalues of nonsingular fractional second-order Sturm-Liouville problem. In this paper, we implement a fractional-order Legendre Tau method to approximate the eigenvalues. This method transforms the Sturm-Liouville problem to a sparse nonsingular linear system which is solved using the continuation method. Theoretical results for the considered problem are provided and proved. Numerical results are presented to show the efficiency of the proposed method.

Efficient numerical method for solving Cauchy problem for the Gamma equation

NASA Astrophysics Data System (ADS)

Koleva, Miglena N.

2011-12-01

In this work we consider Cauchy problem for the so called Gamma equation, derived by transforming the fully nonlinear Black-Scholes equation for option price into a quasilinear parabolic equation for the second derivative (Greek) Γ = VSS of the option price V. We develop an efficient numerical method for solving the model problem concerning different volatility terms. Using suitable change of variables the problem is transformed on finite interval, keeping original behavior of the solution at the infinity. Then we construct Picard-Newton algorithm with adaptive mesh step in time, which can be applied also in the case of non-differentiable functions. Results of numerical simulations are given.

Numerical method for solving the nonlinear four-point boundary value problems

NASA Astrophysics Data System (ADS)

Lin, Yingzhen; Lin, Jinnan

2010-12-01

In this paper, a new reproducing kernel space is constructed skillfully in order to solve a class of nonlinear four-point boundary value problems. The exact solution of the linear problem can be expressed in the form of series and the approximate solution of the nonlinear problem is given by the iterative formula. Compared with known investigations, the advantages of our method are that the representation of exact solution is obtained in a new reproducing kernel Hilbert space and accuracy of numerical computation is higher. Meanwhile we present the convergent theorem, complexity analysis and error estimation. The performance of the new method is illustrated with several numerical examples.

Solving of the coefficient inverse problems for a nonlinear singularly perturbed reaction-diffusion-advection equation with the final time data

NASA Astrophysics Data System (ADS)

Lukyanenko, D. V.; Shishlenin, M. A.; Volkov, V. T.

2018-01-01

We propose the numerical method for solving coefficient inverse problem for a nonlinear singularly perturbed reaction-diffusion-advection equation with the final time observation data based on the asymptotic analysis and the gradient method. Asymptotic analysis allows us to extract a priory information about interior layer (moving front), which appears in the direct problem, and boundary layers, which appear in the conjugate problem. We describe and implement the method of constructing a dynamically adapted mesh based on this a priory information. The dynamically adapted mesh significantly reduces the complexity of the numerical calculations and improve the numerical stability in comparison with the usual approaches. Numerical example shows the effectiveness of the proposed method.

A numerical method for solving a nonlinear 2-D optimal control problem with the classical diffusion equation

NASA Astrophysics Data System (ADS)

Mamehrashi, K.; Yousefi, S. A.

2017-02-01

This paper presents a numerical solution for solving a nonlinear 2-D optimal control problem (2DOP). The performance index of a nonlinear 2DOP is described with a state and a control function. Furthermore, dynamic constraint of the system is given by a classical diffusion equation. It is preferred to use the Ritz method for finding the numerical solution of the problem. The method is based upon the Legendre polynomial basis. By using this method, the given optimisation nonlinear 2DOP reduces to the problem of solving a system of algebraic equations. The benefit of the method is that it provides greater flexibility in which the given initial and boundary conditions of the problem are imposed. Moreover, compared with the eigenfunction method, the satisfactory results are obtained only in a small number of polynomials order. This numerical approach is applicable and effective for such a kind of nonlinear 2DOP. The convergence of the method is extensively discussed and finally two illustrative examples are included to observe the validity and applicability of the new technique developed in the current work.

Solving phase appearance/disappearance two-phase flow problems with high resolution staggered grid and fully implicit schemes by the Jacobian-free Newton–Krylov Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-04-01

The phase appearance/disappearance issue presents serious numerical challenges in two-phase flow simulations. Many existing reactor safety analysis codes use different kinds of treatments for the phase appearance/disappearance problem. However, to our best knowledge, there are no fully satisfactory solutions. Additionally, the majority of the existing reactor system analysis codes were developed using low-order numerical schemes in both space and time. In many situations, it is desirable to use high-resolution spatial discretization and fully implicit time integration schemes to reduce numerical errors. In this work, we adapted a high-resolution spatial discretization scheme on staggered grid mesh and fully implicit time integrationmore » methods (such as BDF1 and BDF2) to solve the two-phase flow problems. The discretized nonlinear system was solved by the Jacobian-free Newton Krylov (JFNK) method, which does not require the derivation and implementation of analytical Jacobian matrix. These methods were tested with a few two-phase flow problems with phase appearance/disappearance phenomena considered, such as a linear advection problem, an oscillating manometer problem, and a sedimentation problem. The JFNK method demonstrated extremely robust and stable behaviors in solving the two-phase flow problems with phase appearance/disappearance. No special treatments such as water level tracking or void fraction limiting were used. High-resolution spatial discretization and second- order fully implicit method also demonstrated their capabilities in significantly reducing numerical errors.« less

An approach to solve replacement problems under intuitionistic fuzzy nature

NASA Astrophysics Data System (ADS)

Balaganesan, M.; Ganesan, K.

2018-04-01

Due to impreciseness to solve the day to day problems the researchers use fuzzy sets in their discussions of the replacement problems. The aim of this paper is to solve the replacement theory problems with triangular intuitionistic fuzzy numbers. An effective methodology based on fuzziness index and location index is proposed to determine the optimal solution of the replacement problem. A numerical example is illustrated to validate the proposed method.

Sandia National Laboratories analysis code data base

NASA Astrophysics Data System (ADS)

Peterson, C. W.

1994-11-01

Sandia National Laboratories' mission is to solve important problems in the areas of national defense, energy security, environmental integrity, and industrial technology. The laboratories' strategy for accomplishing this mission is to conduct research to provide an understanding of the important physical phenomena underlying any problem, and then to construct validated computational models of the phenomena which can be used as tools to solve the problem. In the course of implementing this strategy, Sandia's technical staff has produced a wide variety of numerical problem-solving tools which they use regularly in the design, analysis, performance prediction, and optimization of Sandia components, systems, and manufacturing processes. This report provides the relevant technical and accessibility data on the numerical codes used at Sandia, including information on the technical competency or capability area that each code addresses, code 'ownership' and release status, and references describing the physical models and numerical implementation.

Applications of numerical methods to simulate the movement of contaminants in groundwater.

PubMed Central

Sun, N Z

1989-01-01

This paper reviews mathematical models and numerical methods that have been extensively used to simulate the movement of contaminants through the subsurface. The major emphasis is placed on the numerical methods of advection-dominated transport problems and inverse problems. Several mathematical models that are commonly used in field problems are listed. A variety of numerical solutions for three-dimensional models are introduced, including the multiple cell balance method that can be considered a variation of the finite element method. The multiple cell balance method is easy to understand and convenient for solving field problems. When the advection transport dominates the dispersion transport, two kinds of numerical difficulties, overshoot and numerical dispersion, are always involved in solving standard, finite difference methods and finite element methods. To overcome these numerical difficulties, various numerical techniques are developed, such as upstream weighting methods and moving point methods. A complete review of these methods is given and we also mention the problems of parameter identification, reliability analysis, and optimal-experiment design that are absolutely necessary for constructing a practical model. PMID:2695327

Improve Problem Solving Skills through Adapting Programming Tools

NASA Technical Reports Server (NTRS)

Shaykhian, Linda H.; Shaykhian, Gholam Ali

2007-01-01

There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

Reconstruction of local perturbations in periodic surfaces

NASA Astrophysics Data System (ADS)

Lechleiter, Armin; Zhang, Ruming

2018-03-01

This paper concerns the inverse scattering problem to reconstruct a local perturbation in a periodic structure. Unlike the periodic problems, the periodicity for the scattered field no longer holds, thus classical methods, which reduce quasi-periodic fields in one periodic cell, are no longer available. Based on the Floquet-Bloch transform, a numerical method has been developed to solve the direct problem, that leads to a possibility to design an algorithm for the inverse problem. The numerical method introduced in this paper contains two steps. The first step is initialization, that is to locate the support of the perturbation by a simple method. This step reduces the inverse problem in an infinite domain into one periodic cell. The second step is to apply the Newton-CG method to solve the associated optimization problem. The perturbation is then approximated by a finite spline basis. Numerical examples are given at the end of this paper, showing the efficiency of the numerical method.

Integrating Numerical Computation into the Modeling Instruction Curriculum

ERIC Educational Resources Information Center

Caballero, Marcos D.; Burk, John B.; Aiken, John M.; Thoms, Brian D.; Douglas, Scott S.; Scanlon, Erin M.; Schatz, Michael F.

2014-01-01

Numerical computation (the use of a computer to solve, simulate, or visualize a physical problem) has fundamentally changed the way scientific research is done. Systems that are too difficult to solve in closed form are probed using computation. Experiments that are impossible to perform in the laboratory are studied numerically. Consequently, in…

Numerical simulation of hull curved plate forming by electromagnetic force assisted line heating

NASA Astrophysics Data System (ADS)

Wang, Ji; Wang, Shun; Liu, Yujun; Li, Rui; Liu, xiao

2017-11-01

Line heating is a common method in shipyards for forming of hull curved plate. The aluminum alloy plate is widely used in shipbuilding. To solve the problem of thick aluminum alloy plate forming with complex curved surface, a new technology named electromagnetic force assisted line heating(EFALH) was proposed in this paper. The FEM model of EFALH was established and the effect of electromagnetic force assisted forming was verified by self development equipment. Firstly, the solving idea of numerical simulation for EFALH was illustrated. Then, the coupled numerical simulation model of multi physical fields were established. Lastly, the reliability of the numerical simulation model was verified by comparing the experimental data. This paper lays a foundation for solving the forming problems of thick aluminum alloy curved plate in shipbuilding.

New computer program solves wide variety of heat flow problems

NASA Technical Reports Server (NTRS)

Almond, J. C.

1966-01-01

Boeing Engineering Thermal Analyzer /BETA/ computer program uses numerical methods to provide accurate heat transfer solutions to a wide variety of heat flow problems. The program solves steady-state and transient problems in almost any situation that can be represented by a resistance-capacitance network.

Design of Linear Quadratic Regulators and Kalman Filters

NASA Technical Reports Server (NTRS)

Lehtinen, B.; Geyser, L.

1986-01-01

AESOP solves problems associated with design of controls and state estimators for linear time-invariant systems. Systems considered are modeled in state-variable form by set of linear differential and algebraic equations with constant coefficients. Two key problems solved by AESOP are linear quadratic regulator (LQR) design problem and steady-state Kalman filter design problem. AESOP is interactive. User solves design problems and analyzes solutions in single interactive session. Both numerical and graphical information available to user during the session.

Solving the Problem of Linear Viscoelasticity for Piecewise-Homogeneous Anisotropic Plates

NASA Astrophysics Data System (ADS)

Kaloerov, S. A.; Koshkin, A. A.

2017-11-01

An approximate method for solving the problem of linear viscoelasticity for thin anisotropic plates subject to transverse bending is proposed. The method of small parameter is used to reduce the problem to a sequence of boundary problems of applied theory of bending of plates solved using complex potentials. The general form of complex potentials in approximations and the boundary conditions for determining them are obtained. Problems for a plate with elliptic elastic inclusions are solved as an example. The numerical results for a plate with one, two elliptical (circular), and linear inclusions are analyzed.

Steady flow model user's guide

NASA Astrophysics Data System (ADS)

Doughty, C.; Hellstrom, G.; Tsang, C. F.; Claesson, J.

1984-07-01

Sophisticated numerical models that solve the coupled mass and energy transport equations for nonisothermal fluid flow in a porous medium were used to match analytical results and field data for aquifer thermal energy storage (ATES) systems. As an alternative to the ATES problem the Steady Flow Model (SFM), a simplified but fast numerical model was developed. A steady purely radial flow field is prescribed in the aquifer, and incorporated into the heat transport equation which is then solved numerically. While the radial flow assumption limits the range of ATES systems that can be studied using the SFM, it greatly simplifies use of this code. The preparation of input is quite simple compared to that for a sophisticated coupled mass and energy model, and the cost of running the SFM is far cheaper. The simple flow field allows use of a special calculational mesh that eliminates the numerical dispersion usually associated with the numerical solution of convection problems. The problem is defined, the algorithm used to solve it are outllined, and the input and output for the SFM is described.

The semantic system is involved in mathematical problem solving.

PubMed

Zhou, Xinlin; Li, Mengyi; Li, Leinian; Zhang, Yiyun; Cui, Jiaxin; Liu, Jie; Chen, Chuansheng

2018-02-01

Numerous studies have shown that the brain regions around bilateral intraparietal cortex are critical for number processing and arithmetical computation. However, the neural circuits for more advanced mathematics such as mathematical problem solving (with little routine arithmetical computation) remain unclear. Using functional magnetic resonance imaging (fMRI), this study (N = 24 undergraduate students) compared neural bases of mathematical problem solving (i.e., number series completion, mathematical word problem solving, and geometric problem solving) and arithmetical computation. Direct subject- and item-wise comparisons revealed that mathematical problem solving typically had greater activation than arithmetical computation in all 7 regions of the semantic system (which was based on a meta-analysis of 120 functional neuroimaging studies on semantic processing). Arithmetical computation typically had greater activation in the supplementary motor area and left precentral gyrus. The results suggest that the semantic system in the brain supports mathematical problem solving. Copyright © 2017 Elsevier Inc. All rights reserved.

Numerical Boundary Conditions for Computational Aeroacoustics Benchmark Problems

NASA Technical Reports Server (NTRS)

Tam, Chritsopher K. W.; Kurbatskii, Konstantin A.; Fang, Jun

1997-01-01

Category 1, Problems 1 and 2, Category 2, Problem 2, and Category 3, Problem 2 are solved computationally using the Dispersion-Relation-Preserving (DRP) scheme. All these problems are governed by the linearized Euler equations. The resolution requirements of the DRP scheme for maintaining low numerical dispersion and dissipation as well as accurate wave speeds in solving the linearized Euler equations are now well understood. As long as 8 or more mesh points per wavelength is employed in the numerical computation, high quality results are assured. For the first three categories of benchmark problems, therefore, the real challenge is to develop high quality numerical boundary conditions. For Category 1, Problems 1 and 2, it is the curved wall boundary conditions. For Category 2, Problem 2, it is the internal radiation boundary conditions inside the duct. For Category 3, Problem 2, they are the inflow and outflow boundary conditions upstream and downstream of the blade row. These are the foci of the present investigation. Special nonhomogeneous radiation boundary conditions that generate the incoming disturbances and at the same time allow the outgoing reflected or scattered acoustic disturbances to leave the computation domain without significant reflection are developed. Numerical results based on these boundary conditions are provided.

Comprehension and computation in Bayesian problem solving

PubMed Central

Johnson, Eric D.; Tubau, Elisabet

2015-01-01

Humans have long been characterized as poor probabilistic reasoners when presented with explicit numerical information. Bayesian word problems provide a well-known example of this, where even highly educated and cognitively skilled individuals fail to adhere to mathematical norms. It is widely agreed that natural frequencies can facilitate Bayesian inferences relative to normalized formats (e.g., probabilities, percentages), both by clarifying logical set-subset relations and by simplifying numerical calculations. Nevertheless, between-study performance on “transparent” Bayesian problems varies widely, and generally remains rather unimpressive. We suggest there has been an over-focus on this representational facilitator (i.e., transparent problem structures) at the expense of the specific logical and numerical processing requirements and the corresponding individual abilities and skills necessary for providing Bayesian-like output given specific verbal and numerical input. We further suggest that understanding this task-individual pair could benefit from considerations from the literature on mathematical cognition, which emphasizes text comprehension and problem solving, along with contributions of online executive working memory, metacognitive regulation, and relevant stored knowledge and skills. We conclude by offering avenues for future research aimed at identifying the stages in problem solving at which correct vs. incorrect reasoners depart, and how individual differences might influence this time point. PMID:26283976

Iterative Methods for Solving Nonlinear Parabolic Problem in Pension Saving Management

NASA Astrophysics Data System (ADS)

Koleva, M. N.

2011-11-01

In this work we consider a nonlinear parabolic equation, obtained from Riccati like transformation of the Hamilton-Jacobi-Bellman equation, arising in pension saving management. We discuss two numerical iterative methods for solving the model problem—fully implicit Picard method and mixed Picard-Newton method, which preserves the parabolic characteristics of the differential problem. Numerical experiments for comparison the accuracy and effectiveness of the algorithms are discussed. Finally, observations are given.

Numerical approximations for fractional diffusion equations via a Chebyshev spectral-tau method

NASA Astrophysics Data System (ADS)

Doha, Eid H.; Bhrawy, Ali H.; Ezz-Eldien, Samer S.

2013-10-01

In this paper, a class of fractional diffusion equations with variable coefficients is considered. An accurate and efficient spectral tau technique for solving the fractional diffusion equations numerically is proposed. This method is based upon Chebyshev tau approximation together with Chebyshev operational matrix of Caputo fractional differentiation. Such approach has the advantage of reducing the problem to the solution of a system of algebraic equations, which may then be solved by any standard numerical technique. We apply this general method to solve four specific examples. In each of the examples considered, the numerical results show that the proposed method is of high accuracy and is efficient for solving the time-dependent fractional diffusion equations.

Fictitious domain method for fully resolved reacting gas-solid flow simulation

NASA Astrophysics Data System (ADS)

Zhang, Longhui; Liu, Kai; You, Changfu

2015-10-01

Fully resolved simulation (FRS) for gas-solid multiphase flow considers solid objects as finite sized regions in flow fields and their behaviours are predicted by solving equations in both fluid and solid regions directly. Fixed mesh numerical methods, such as fictitious domain method, are preferred in solving FRS problems and have been widely researched. However, for reacting gas-solid flows no suitable fictitious domain numerical method has been developed. This work presents a new fictitious domain finite element method for FRS of reacting particulate flows. Low Mach number reacting flow governing equations are solved sequentially on a regular background mesh. Particles are immersed in the mesh and driven by their surface forces and torques integrated on immersed interfaces. Additional treatments on energy and surface reactions are developed. Several numerical test cases validated the method and a burning carbon particles array falling simulation proved the capability for solving moving reacting particle cluster problems.

A dynamical regularization algorithm for solving inverse source problems of elliptic partial differential equations

NASA Astrophysics Data System (ADS)

Zhang, Ye; Gong, Rongfang; Cheng, Xiaoliang; Gulliksson, Mårten

2018-06-01

This study considers the inverse source problem for elliptic partial differential equations with both Dirichlet and Neumann boundary data. The unknown source term is to be determined by additional boundary conditions. Unlike the existing methods found in the literature, which usually employ the first-order in time gradient-like system (such as the steepest descent methods) for numerically solving the regularized optimization problem with a fixed regularization parameter, we propose a novel method with a second-order in time dissipative gradient-like system and a dynamical selected regularization parameter. A damped symplectic scheme is proposed for the numerical solution. Theoretical analysis is given for both the continuous model and the numerical algorithm. Several numerical examples are provided to show the robustness of the proposed algorithm.

Word Problem Strategy for Latino English Language Learners at Risk for Math Disabilities

ERIC Educational Resources Information Center

Orosco, Michael J.

2014-01-01

"English Language Learners" (ELLs) at risk for "math disabilities" (MD) are challenged in solving word problems for numerous reasons such as (a) learning English as a second language, (b) limited experience using math vocabulary, and (c) lack of strategies to improve word-problem-solving skills. As a result of these…

Numerical Problems and Agent-Based Models for a Mass Transfer Course

ERIC Educational Resources Information Center

Murthi, Manohar; Shea, Lonnie D.; Snurr, Randall Q.

2009-01-01

Problems requiring numerical solutions of differential equations or the use of agent-based modeling are presented for use in a course on mass transfer. These problems were solved using the popular technical computing language MATLABTM. Students were introduced to MATLAB via a problem with an analytical solution. A more complex problem to which no…

Improving Critical Skills Using Wikis and CGPS in a Physics Classroom

NASA Astrophysics Data System (ADS)

Mohottala, H. E.

2016-10-01

We report the combined use of Wikispaces (wikis) and collaborative group problem solving (CGPS) sessions conducted in introductory-level calculus-based physics classes. As a part of this new teaching tool, some essay-type problems were posted on the wiki page on a weekly basis and students were encouraged to participate in problem solving without providing numerical final answers but only the steps. Each week students were further evaluated on problem solving skills, opening up more opportunity for peer interaction through CGPS. Students developed a set of skills in decision making, problem solving, communication, negotiation, critical and independent thinking, and teamwork through the combination of wikis and CGPS.

Simultaneous and semi-alternating projection algorithms for solving split equality problems.

PubMed

Dong, Qiao-Li; Jiang, Dan

2018-01-01

In this article, we first introduce two simultaneous projection algorithms for solving the split equality problem by using a new choice of the stepsize, and then propose two semi-alternating projection algorithms. The weak convergence of the proposed algorithms is analyzed under standard conditions. As applications, we extend the results to solve the split feasibility problem. Finally, a numerical example is presented to illustrate the efficiency and advantage of the proposed algorithms.

Intellectual Abilities That Discriminate Good and Poor Problem Solvers.

ERIC Educational Resources Information Center

Meyer, Ruth Ann

1981-01-01

This study compared good and poor fourth-grade problem solvers on a battery of 19 "reference" tests for verbal, induction, numerical, word fluency, memory, perceptual speed, and simple visualization abilities. Results suggest verbal, numerical, and especially induction abilities are important to successful mathematical problem solving.…

Perfecting scientists’ collaboration and problem-solving skills in the virtual team environment

USDA-ARS?s Scientific Manuscript database

Perfecting Scientists’ Collaboration and Problem-Solving Skills in the Virtual Team Environment Numerous factors have contributed to the proliferation of conducting work in virtual teams at the domestic, national, and global levels: innovations in technology, critical developments in software, co-lo...

Solving Fuzzy Fractional Differential Equations Using Zadeh's Extension Principle

PubMed Central

Ahmad, M. Z.; Hasan, M. K.; Abbasbandy, S.

2013-01-01

We study a fuzzy fractional differential equation (FFDE) and present its solution using Zadeh's extension principle. The proposed study extends the case of fuzzy differential equations of integer order. We also propose a numerical method to approximate the solution of FFDEs. To solve nonlinear problems, the proposed numerical method is then incorporated into an unconstrained optimisation technique. Several numerical examples are provided. PMID:24082853

Implicitly solving phase appearance and disappearance problems using two-fluid six-equation model

DOE PAGES

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-01-25

Phase appearance and disappearance issue presents serious numerical challenges in two-phase flow simulations using the two-fluid six-equation model. Numerical challenges arise from the singular equation system when one phase is absent, as well as from the discontinuity in the solution space when one phase appears or disappears. In this work, a high-resolution spatial discretization scheme on staggered grids and fully implicit methods were applied for the simulation of two-phase flow problems using the two-fluid six-equation model. A Jacobian-free Newton-Krylov (JFNK) method was used to solve the discretized nonlinear problem. An improved numerical treatment was proposed and proved to be effectivemore » to handle the numerical challenges. The treatment scheme is conceptually simple, easy to implement, and does not require explicit truncations on solutions, which is essential to conserve mass and energy. Various types of phase appearance and disappearance problems relevant to thermal-hydraulics analysis have been investigated, including a sedimentation problem, an oscillating manometer problem, a non-condensable gas injection problem, a single-phase flow with heat addition problem and a subcooled flow boiling problem. Successful simulations of these problems demonstrate the capability and robustness of the proposed numerical methods and numerical treatments. As a result, volume fraction of the absent phase can be calculated effectively as zero.« less

Numerical solution of the electron transport equation

NASA Astrophysics Data System (ADS)

Woods, Mark

The electron transport equation has been solved many times for a variety of reasons. The main difficulty in its numerical solution is that it is a very stiff boundary value problem. The most common numerical methods for solving boundary value problems are symmetric collocation methods and shooting methods. Both of these types of methods can only be applied to the electron transport equation if the boundary conditions are altered with unrealistic assumptions because they require too many points to be practical. Further, they result in oscillating and negative solutions, which are physically meaningless for the problem at hand. For these reasons, all numerical methods for this problem to date are a bit unusual because they were designed to try and avoid the problem of extreme stiffness. This dissertation shows that there is no need to introduce spurious boundary conditions or invent other numerical methods for the electron transport equation. Rather, there already exists methods for very stiff boundary value problems within the numerical analysis literature. We demonstrate one such method in which the fast and slow modes of the boundary value problem are essentially decoupled. This allows for an upwind finite difference method to be applied to each mode as is appropriate. This greatly reduces the number of points needed in the mesh, and we demonstrate how this eliminates the need to define new boundary conditions. This method is verified by showing that under certain restrictive assumptions, the electron transport equation has an exact solution that can be written as an integral. We show that the solution from the upwind method agrees with the quadrature evaluation of the exact solution. This serves to verify that the upwind method is properly solving the electron transport equation. Further, it is demonstrated that the output of the upwind method can be used to compute auroral light emissions.

An Analysis of Kindergarten and First Grade Children's Addition and Subtraction Problem Solving Modeling and Accuracy.

ERIC Educational Resources Information Center

Shores, Jay H.; Underhill, Robert G.

A study was undertaken of the effects of formal education and conservation of numerousness on addition and subtraction problem types. Thirty-six kindergarten and 36 first-grade subjects randomly selected from one area of a school district were administered measures of conservation, problem-solving success, and modeling ability. Following factor…

Solving intuitionistic fuzzy multi-objective nonlinear programming problem

NASA Astrophysics Data System (ADS)

Anuradha, D.; Sobana, V. E.

2017-11-01

This paper presents intuitionistic fuzzy multi-objective nonlinear programming problem (IFMONLPP). All the coefficients of the multi-objective nonlinear programming problem (MONLPP) and the constraints are taken to be intuitionistic fuzzy numbers (IFN). The IFMONLPP has been transformed into crisp one and solved by using Kuhn-Tucker condition. Numerical example is provided to illustrate the approach.

A systematic linear space approach to solving partially described inverse eigenvalue problems

NASA Astrophysics Data System (ADS)

Hu, Sau-Lon James; Li, Haujun

2008-06-01

Most applications of the inverse eigenvalue problem (IEP), which concerns the reconstruction of a matrix from prescribed spectral data, are associated with special classes of structured matrices. Solving the IEP requires one to satisfy both the spectral constraint and the structural constraint. If the spectral constraint consists of only one or few prescribed eigenpairs, this kind of inverse problem has been referred to as the partially described inverse eigenvalue problem (PDIEP). This paper develops an efficient, general and systematic approach to solve the PDIEP. Basically, the approach, applicable to various structured matrices, converts the PDIEP into an ordinary inverse problem that is formulated as a set of simultaneous linear equations. While solving simultaneous linear equations for model parameters, the singular value decomposition method is applied. Because of the conversion to an ordinary inverse problem, other constraints associated with the model parameters can be easily incorporated into the solution procedure. The detailed derivation and numerical examples to implement the newly developed approach to symmetric Toeplitz and quadratic pencil (including mass, damping and stiffness matrices of a linear dynamic system) PDIEPs are presented. Excellent numerical results for both kinds of problem are achieved under the situations that have either unique or infinitely many solutions.

Numerical algebraic geometry: a new perspective on gauge and string theories

NASA Astrophysics Data System (ADS)

Mehta, Dhagash; He, Yang-Hui; Hauensteine, Jonathan D.

2012-07-01

There is a rich interplay between algebraic geometry and string and gauge theories which has been recently aided immensely by advances in computational algebra. However, symbolic (Gröbner) methods are severely limited by algorithmic issues such as exponential space complexity and being highly sequential. In this paper, we introduce a novel paradigm of numerical algebraic geometry which in a plethora of situations overcomes these shortcomings. The so-called `embarrassing parallelizability' allows us to solve many problems and extract physical information which elude symbolic methods. We describe the method and then use it to solve various problems arising from physics which could not be otherwise solved.

Non-standard finite difference and Chebyshev collocation methods for solving fractional diffusion equation

NASA Astrophysics Data System (ADS)

Agarwal, P.; El-Sayed, A. A.

2018-06-01

In this paper, a new numerical technique for solving the fractional order diffusion equation is introduced. This technique basically depends on the Non-Standard finite difference method (NSFD) and Chebyshev collocation method, where the fractional derivatives are described in terms of the Caputo sense. The Chebyshev collocation method with the (NSFD) method is used to convert the problem into a system of algebraic equations. These equations solved numerically using Newton's iteration method. The applicability, reliability, and efficiency of the presented technique are demonstrated through some given numerical examples.

A new shock-capturing numerical scheme for ideal hydrodynamics

NASA Astrophysics Data System (ADS)

Fecková, Z.; Tomášik, B.

2015-05-01

We present a new algorithm for solving ideal relativistic hydrodynamics based on Godunov method with an exact solution of Riemann problem for an arbitrary equation of state. Standard numerical tests are executed, such as the sound wave propagation and the shock tube problem. Low numerical viscosity and high precision are attained with proper discretization.

A class of finite-time dual neural networks for solving quadratic programming problems and its k-winners-take-all application.

PubMed

Li, Shuai; Li, Yangming; Wang, Zheng

2013-03-01

This paper presents a class of recurrent neural networks to solve quadratic programming problems. Different from most existing recurrent neural networks for solving quadratic programming problems, the proposed neural network model converges in finite time and the activation function is not required to be a hard-limiting function for finite convergence time. The stability, finite-time convergence property and the optimality of the proposed neural network for solving the original quadratic programming problem are proven in theory. Extensive simulations are performed to evaluate the performance of the neural network with different parameters. In addition, the proposed neural network is applied to solving the k-winner-take-all (k-WTA) problem. Both theoretical analysis and numerical simulations validate the effectiveness of our method for solving the k-WTA problem. Copyright © 2012 Elsevier Ltd. All rights reserved.

Density-matrix-based algorithm for solving eigenvalue problems

NASA Astrophysics Data System (ADS)

Polizzi, Eric

2009-03-01

A fast and stable numerical algorithm for solving the symmetric eigenvalue problem is presented. The technique deviates fundamentally from the traditional Krylov subspace iteration based techniques (Arnoldi and Lanczos algorithms) or other Davidson-Jacobi techniques and takes its inspiration from the contour integration and density-matrix representation in quantum mechanics. It will be shown that this algorithm—named FEAST—exhibits high efficiency, robustness, accuracy, and scalability on parallel architectures. Examples from electronic structure calculations of carbon nanotubes are presented, and numerical performances and capabilities are discussed.

Some variance reduction methods for numerical stochastic homogenization

PubMed Central

Blanc, X.; Le Bris, C.; Legoll, F.

2016-01-01

We give an overview of a series of recent studies devoted to variance reduction techniques for numerical stochastic homogenization. Numerical homogenization requires that a set of problems is solved at the microscale, the so-called corrector problems. In a random environment, these problems are stochastic and therefore need to be repeatedly solved, for several configurations of the medium considered. An empirical average over all configurations is then performed using the Monte Carlo approach, so as to approximate the effective coefficients necessary to determine the macroscopic behaviour. Variance severely affects the accuracy and the cost of such computations. Variance reduction approaches, borrowed from other contexts in the engineering sciences, can be useful. Some of these variance reduction techniques are presented, studied and tested here. PMID:27002065

Numerical techniques for solving nonlinear instability problems in smokeless tactical solid rocket motors. [finite difference technique

NASA Technical Reports Server (NTRS)

Baum, J. D.; Levine, J. N.

1980-01-01

The selection of a satisfactory numerical method for calculating the propagation of steep fronted shock life waveforms in a solid rocket motor combustion chamber is discussed. A number of different numerical schemes were evaluated by comparing the results obtained for three problems: the shock tube problems; the linear wave equation, and nonlinear wave propagation in a closed tube. The most promising method--a combination of the Lax-Wendroff, Hybrid and Artificial Compression techniques, was incorporated into an existing nonlinear instability program. The capability of the modified program to treat steep fronted wave instabilities in low smoke tactical motors was verified by solving a number of motor test cases with disturbance amplitudes as high as 80% of the mean pressure.

A multilevel finite element method for Fredholm integral eigenvalue problems

NASA Astrophysics Data System (ADS)

Xie, Hehu; Zhou, Tao

2015-12-01

In this work, we proposed a multigrid finite element (MFE) method for solving the Fredholm integral eigenvalue problems. The main motivation for such studies is to compute the Karhunen-Loève expansions of random fields, which play an important role in the applications of uncertainty quantification. In our MFE framework, solving the eigenvalue problem is converted to doing a series of integral iterations and eigenvalue solving in the coarsest mesh. Then, any existing efficient integration scheme can be used for the associated integration process. The error estimates are provided, and the computational complexity is analyzed. It is noticed that the total computational work of our method is comparable with a single integration step in the finest mesh. Several numerical experiments are presented to validate the efficiency of the proposed numerical method.

A New Homotopy Perturbation Scheme for Solving Singular Boundary Value Problems Arising in Various Physical Models

NASA Astrophysics Data System (ADS)

Roul, Pradip; Warbhe, Ujwal

2017-08-01

The classical homotopy perturbation method proposed by J. H. He, Comput. Methods Appl. Mech. Eng. 178, 257 (1999) is useful for obtaining the approximate solutions for a wide class of nonlinear problems in terms of series with easily calculable components. However, in some cases, it has been found that this method results in slowly convergent series. To overcome the shortcoming, we present a new reliable algorithm called the domain decomposition homotopy perturbation method (DDHPM) to solve a class of singular two-point boundary value problems with Neumann and Robin-type boundary conditions arising in various physical models. Five numerical examples are presented to demonstrate the accuracy and applicability of our method, including thermal explosion, oxygen-diffusion in a spherical cell and heat conduction through a solid with heat generation. A comparison is made between the proposed technique and other existing seminumerical or numerical techniques. Numerical results reveal that only two or three iterations lead to high accuracy of the solution and this newly improved technique introduces a powerful improvement for solving nonlinear singular boundary value problems (SBVPs).

A numerical projection technique for large-scale eigenvalue problems

NASA Astrophysics Data System (ADS)

Gamillscheg, Ralf; Haase, Gundolf; von der Linden, Wolfgang

2011-10-01

We present a new numerical technique to solve large-scale eigenvalue problems. It is based on the projection technique, used in strongly correlated quantum many-body systems, where first an effective approximate model of smaller complexity is constructed by projecting out high energy degrees of freedom and in turn solving the resulting model by some standard eigenvalue solver. Here we introduce a generalization of this idea, where both steps are performed numerically and which in contrast to the standard projection technique converges in principle to the exact eigenvalues. This approach is not just applicable to eigenvalue problems encountered in many-body systems but also in other areas of research that result in large-scale eigenvalue problems for matrices which have, roughly speaking, mostly a pronounced dominant diagonal part. We will present detailed studies of the approach guided by two many-body models.

Mathematical Problem Solving Ability of Eleventh Standard Students

ERIC Educational Resources Information Center

Priya, J. Johnsi

2017-01-01

There is a general assertion among mathematics instructors that learners need to acquire problem solving expertise, figure out how to communicate using mathematics knowledge and aptitude, create numerical reasoning and thinking, to see the interconnectedness amongst mathematics and other subjects. Based on this perspective, the present study aims…

Variational data assimilation system "INM RAS - Black Sea"

NASA Astrophysics Data System (ADS)

Parmuzin, Eugene; Agoshkov, Valery; Assovskiy, Maksim; Giniatulin, Sergey; Zakharova, Natalia; Kuimov, Grigory; Fomin, Vladimir

2013-04-01

Development of Informational-Computational Systems (ICS) for Data Assimilation Procedures is one of multidisciplinary problems. To study and solve these problems one needs to apply modern results from different disciplines and recent developments in: mathematical modeling; theory of adjoint equations and optimal control; inverse problems; numerical methods theory; numerical algebra and scientific computing. The problems discussed above are studied in the Institute of Numerical Mathematics of the Russian Academy of Science (INM RAS) in ICS for Personal Computers (PC). Special problems and questions arise while effective ICS versions for PC are being developed. These problems and questions can be solved with applying modern methods of numerical mathematics and by solving "parallelism problem" using OpenMP technology and special linear algebra packages. In this work the results on the ICS development for PC-ICS "INM RAS - Black Sea" are presented. In the work the following problems and questions are discussed: practical problems that can be studied by ICS; parallelism problems and their solutions with applying of OpenMP technology and the linear algebra packages used in ICS "INM - Black Sea"; Interface of ICS. The results of ICS "INM RAS - Black Sea" testing are presented. Efficiency of technologies and methods applied are discussed. The work was supported by RFBR, grants No. 13-01-00753, 13-05-00715 and by The Ministry of education and science of Russian Federation, project 8291, project 11.519.11.1005 References: [1] V.I. Agoshkov, M.V. Assovskii, S.A. Lebedev, Numerical simulation of Black Sea hydrothermodynamics taking into account tide-forming forces. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, 5-31 [2] E.I. Parmuzin, V.I. Agoshkov, Numerical solution of the variational assimilation problem for sea surface temperature in the model of the Black Sea dynamics. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, 69-94 [3] V.B. Zalesny, N.A. Diansky, V.V. Fomin, S.N. Moshonkin, S.G. Demyshev, Numerical model of the circulation of Black Sea and Sea of Azov. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, 95-111 [4] V.I. Agoshkov, S.V. Giniatulin, G.V. Kuimov. OpenMP technology and linear algebra packages in the variation data assimilation systems. - Abstracts of the 1-st China-Russia Conference on Numerical Algebra with Applications in Radiactive Hydrodynamics, Beijing, China, October 16-18, 2012. [5] Zakharova N.B., Agoshkov V.I., Parmuzin E.I., The new method of ARGO buoys system observation data interpolation. Russian Journal of Numerical Analysis and Mathematical Modelling. Vol. 28, Issue 1, 2013.

Numerical solutions of a control problem governed by functional differential equations

NASA Technical Reports Server (NTRS)

Banks, H. T.; Thrift, P. R.; Burns, J. A.; Cliff, E. M.

1978-01-01

A numerical procedure is proposed for solving optimal control problems governed by linear retarded functional differential equations. The procedure is based on the idea of 'averaging approximations', due to Banks and Burns (1975). For illustration, numerical results generated on an IBM 370/158 computer, which demonstrate the rapid convergence of the method are presented.

Variational data assimilation for the initial-value dynamo problem.

PubMed

Li, Kuan; Jackson, Andrew; Livermore, Philip W

2011-11-01

The secular variation of the geomagnetic field as observed at the Earth's surface results from the complex magnetohydrodynamics taking place in the fluid core of the Earth. One way to analyze this system is to use the data in concert with an underlying dynamical model of the system through the technique of variational data assimilation, in much the same way as is employed in meteorology and oceanography. The aim is to discover an optimal initial condition that leads to a trajectory of the system in agreement with observations. Taking the Earth's core to be an electrically conducting fluid sphere in which convection takes place, we develop the continuous adjoint forms of the magnetohydrodynamic equations that govern the dynamical system together with the corresponding numerical algorithms appropriate for a fully spectral method. These adjoint equations enable a computationally fast iterative improvement of the initial condition that determines the system evolution. The initial condition depends on the three dimensional form of quantities such as the magnetic field in the entire sphere. For the magnetic field, conservation of the divergence-free condition for the adjoint magnetic field requires the introduction of an adjoint pressure term satisfying a zero boundary condition. We thus find that solving the forward and adjoint dynamo system requires different numerical algorithms. In this paper, an efficient algorithm for numerically solving this problem is developed and tested for two illustrative problems in a whole sphere: one is a kinematic problem with prescribed velocity field, and the second is associated with the Hall-effect dynamo, exhibiting considerable nonlinearity. The algorithm exhibits reliable numerical accuracy and stability. Using both the analytical and the numerical techniques of this paper, the adjoint dynamo system can be solved directly with the same order of computational complexity as that required to solve the forward problem. These numerical techniques form a foundation for ultimate application to observations of the geomagnetic field over the time scale of centuries.

A Novel Numerical Method for Fuzzy Boundary Value Problems

NASA Astrophysics Data System (ADS)

Can, E.; Bayrak, M. A.; Hicdurmaz

2016-05-01

In the present paper, a new numerical method is proposed for solving fuzzy differential equations which are utilized for the modeling problems in science and engineering. Fuzzy approach is selected due to its important applications on processing uncertainty or subjective information for mathematical models of physical problems. A second-order fuzzy linear boundary value problem is considered in particular due to its important applications in physics. Moreover, numerical experiments are presented to show the effectiveness of the proposed numerical method on specific physical problems such as heat conduction in an infinite plate and a fin.

Rapid processing of data based on high-performance algorithms for solving inverse problems and 3D-simulation of the tsunami and earthquakes

NASA Astrophysics Data System (ADS)

Marinin, I. V.; Kabanikhin, S. I.; Krivorotko, O. I.; Karas, A.; Khidasheli, D. G.

2012-04-01

We consider new techniques and methods for earthquake and tsunami related problems, particularly - inverse problems for the determination of tsunami source parameters, numerical simulation of long wave propagation in soil and water and tsunami risk estimations. In addition, we will touch upon the issue of database management and destruction scenario visualization. New approaches and strategies, as well as mathematical tools and software are to be shown. The long joint investigations by researchers of the Institute of Mathematical Geophysics and Computational Mathematics SB RAS and specialists from WAPMERR and Informap have produced special theoretical approaches, numerical methods, and software tsunami and earthquake modeling (modeling of propagation and run-up of tsunami waves on coastal areas), visualization, risk estimation of tsunami, and earthquakes. Algorithms are developed for the operational definition of the origin and forms of the tsunami source. The system TSS numerically simulates the source of tsunami and/or earthquakes and includes the possibility to solve the direct and the inverse problem. It becomes possible to involve advanced mathematical results to improve models and to increase the resolution of inverse problems. Via TSS one can construct maps of risks, the online scenario of disasters, estimation of potential damage to buildings and roads. One of the main tools for the numerical modeling is the finite volume method (FVM), which allows us to achieve stability with respect to possible input errors, as well as to achieve optimum computing speed. Our approach to the inverse problem of tsunami and earthquake determination is based on recent theoretical results concerning the Dirichlet problem for the wave equation. This problem is intrinsically ill-posed. We use the optimization approach to solve this problem and SVD-analysis to estimate the degree of ill-posedness and to find the quasi-solution. The software system we developed is intended to create technology «no frost», realizing a steady stream of direct and inverse problems: solving the direct problem, the visualization and comparison with observed data, to solve the inverse problem (correction of the model parameters). The main objective of further work is the creation of a workstation operating emergency tool that could be used by an emergency duty person in real time.

Some variance reduction methods for numerical stochastic homogenization.

PubMed

Blanc, X; Le Bris, C; Legoll, F

2016-04-28

We give an overview of a series of recent studies devoted to variance reduction techniques for numerical stochastic homogenization. Numerical homogenization requires that a set of problems is solved at the microscale, the so-called corrector problems. In a random environment, these problems are stochastic and therefore need to be repeatedly solved, for several configurations of the medium considered. An empirical average over all configurations is then performed using the Monte Carlo approach, so as to approximate the effective coefficients necessary to determine the macroscopic behaviour. Variance severely affects the accuracy and the cost of such computations. Variance reduction approaches, borrowed from other contexts in the engineering sciences, can be useful. Some of these variance reduction techniques are presented, studied and tested here. © 2016 The Author(s).

Mean Field Type Control with Congestion (II): An Augmented Lagrangian Method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Achdou, Yves, E-mail: achdou@ljll.univ-paris-diderot.fr; Laurière, Mathieu

This work deals with a numerical method for solving a mean-field type control problem with congestion. It is the continuation of an article by the same authors, in which suitably defined weak solutions of the system of partial differential equations arising from the model were discussed and existence and uniqueness were proved. Here, the focus is put on numerical methods: a monotone finite difference scheme is proposed and shown to have a variational interpretation. Then an Alternating Direction Method of Multipliers for solving the variational problem is addressed. It is based on an augmented Lagrangian. Two kinds of boundary conditionsmore » are considered: periodic conditions and more realistic boundary conditions associated to state constrained problems. Various test cases and numerical results are presented.« less

Conceptual Comparison of Population Based Metaheuristics for Engineering Problems

PubMed Central

Green, Paul

2015-01-01

Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems. Several extensions of differential evolution have been adopted in solving constrained and nonconstrained multiobjective optimization problems, but in this study, the third version of generalized differential evolution (GDE) is used for solving practical engineering problems. GDE3 metaheuristic modifies the selection process of the basic differential evolution and extends DE/rand/1/bin strategy in solving practical applications. The performance of the metaheuristic is investigated through engineering design optimization problems and the results are reported. The comparison of the numerical results with those of other metaheuristic techniques demonstrates the promising performance of the algorithm as a robust optimization tool for practical purposes. PMID:25874265

Conceptual comparison of population based metaheuristics for engineering problems.

PubMed

Adekanmbi, Oluwole; Green, Paul

2015-01-01

Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems. Several extensions of differential evolution have been adopted in solving constrained and nonconstrained multiobjective optimization problems, but in this study, the third version of generalized differential evolution (GDE) is used for solving practical engineering problems. GDE3 metaheuristic modifies the selection process of the basic differential evolution and extends DE/rand/1/bin strategy in solving practical applications. The performance of the metaheuristic is investigated through engineering design optimization problems and the results are reported. The comparison of the numerical results with those of other metaheuristic techniques demonstrates the promising performance of the algorithm as a robust optimization tool for practical purposes.

Solutions of the benchmark problems by the dispersion-relation-preserving scheme

NASA Technical Reports Server (NTRS)

Tam, Christopher K. W.; Shen, H.; Kurbatskii, K. A.; Auriault, L.

1995-01-01

The 7-point stencil Dispersion-Relation-Preserving scheme of Tam and Webb is used to solve all the six categories of the CAA benchmark problems. The purpose is to show that the scheme is capable of solving linear, as well as nonlinear aeroacoustics problems accurately. Nonlinearities, inevitably, lead to the generation of spurious short wave length numerical waves. Often, these spurious waves would overwhelm the entire numerical solution. In this work, the spurious waves are removed by the addition of artificial selective damping terms to the discretized equations. Category 3 problems are for testing radiation and outflow boundary conditions. In solving these problems, the radiation and outflow boundary conditions of Tam and Webb are used. These conditions are derived from the asymptotic solutions of the linearized Euler equations. Category 4 problems involved solid walls. Here, the wall boundary conditions for high-order schemes of Tam and Dong are employed. These conditions require the use of one ghost value per boundary point per physical boundary condition. In the second problem of this category, the governing equations, when written in cylindrical coordinates, are singular along the axis of the radial coordinate. The proper boundary conditions at the axis are derived by applying the limiting process of r approaches 0 to the governing equations. The Category 5 problem deals with the numerical noise issue. In the present approach, the time-independent mean flow solution is computed first. Once the residual drops to the machine noise level, the incident sound wave is turned on gradually. The solution is marched in time until a time-periodic state is reached. No exact solution is known for the Category 6 problem. Because of this, the problem is formulated in two totally different ways, first as a scattering problem then as a direct simulation problem. There is good agreement between the two numerical solutions. This offers confidence in the computed results. Both formulations are solved as initial value problems. As such, no Kutta condition is required at the trailing edge of the airfoil.

Discrete-time neural network for fast solving large linear L1 estimation problems and its application to image restoration.

PubMed

Xia, Youshen; Sun, Changyin; Zheng, Wei Xing

2012-05-01

There is growing interest in solving linear L1 estimation problems for sparsity of the solution and robustness against non-Gaussian noise. This paper proposes a discrete-time neural network which can calculate large linear L1 estimation problems fast. The proposed neural network has a fixed computational step length and is proved to be globally convergent to an optimal solution. Then, the proposed neural network is efficiently applied to image restoration. Numerical results show that the proposed neural network is not only efficient in solving degenerate problems resulting from the nonunique solutions of the linear L1 estimation problems but also needs much less computational time than the related algorithms in solving both linear L1 estimation and image restoration problems.

Thai Grade 10 and 11 Students' Conceptual Understanding and Ability to Solve Stoichiometry Problems

ERIC Educational Resources Information Center

Dahsah, Chanyah; Coll, Richard K.

2007-01-01

Stoichiometry and related concepts are an important part of student learning in chemistry. In this interpretive-based inquiry, we investigated Thai Grade 10 and 11 students' conceptual understanding and ability to solve numerical problems for stoichiometry-related concepts. Ninety-seven participants completed a purpose-designed survey instrument…

From Number Lines to Graphs in the Coordinate Plane: Investigating Problem Solving across Mathematical Representations

ERIC Educational Resources Information Center

Earnest, Darrell

2015-01-01

This article reports on students' problem-solving approaches across three representations--number lines, coordinate planes, and function graphs--the axes of which conventional mathematics treats in terms of consistent geometric and numeric coordinations. I consider these representations to be a part of a "hierarchical representational…

The numerical-analytical implementation of the cross-sections method to the open waveguide transition of the "horn" type

NASA Astrophysics Data System (ADS)

Divakov, Dmitriy; Malykh, Mikhail; Sevastianov, Leonid; Sevastianov, Anton; Tiutiunnik, Anastasiia

2017-04-01

In the paper we construct a method for approximate solution of the waveguide problem for guided modes of an open irregular waveguide transition. The method is based on straightening of the curved waveguide boundaries by introducing new variables and applying the Kantorovich method to the problem formulated in the new variables to get a system of ordinary second-order differential equations. In the method, the boundary conditions are formulated by analogy with the partial radiation conditions in the similar problem for closed waveguide transitions. The method is implemented in the symbolic-numeric form using the Maple computer algebra system. The coefficient matrices of the system of differential equations and boundary conditions are calculated symbolically, and then the obtained boundary-value problem is solved numerically using the finite difference method. The chosen coordinate functions of Kantorovich expansions provide good conditionality of the coefficient matrices. The numerical experiment simulating the propagation of guided modes in the open waveguide transition confirms the validity of the method proposed to solve the problem.

Use of various versions of Schwarz method for solving the problem of contact interaction of elastic bodies

NASA Astrophysics Data System (ADS)

Galanin, M. P.; Lukin, V. V.; Rodin, A. S.

2018-04-01

A definition of a sufficiently common problem of mechanical contact interaction in a system of elastic bodies is given. Various versions of realization of the Schwarz method for solving the contact problem numerically are described and the results of solution of a number of problems are presented. Special attention is paid to calculations where the grids in the bodies significantly differ in steps.

Arithmetic and algebraic problem solving and resource allocation: the distinct impact of fluid and numerical intelligence.

PubMed

Dix, Annika; van der Meer, Elke

2015-04-01

This study investigates cognitive resource allocation dependent on fluid and numerical intelligence in arithmetic/algebraic tasks varying in difficulty. Sixty-six 11th grade students participated in a mathematical verification paradigm, while pupil dilation as a measure of resource allocation was collected. Students with high fluid intelligence solved the tasks faster and more accurately than those with average fluid intelligence, as did students with high compared to average numerical intelligence. However, fluid intelligence sped up response times only in students with average but not high numerical intelligence. Further, high fluid but not numerical intelligence led to greater task-related pupil dilation. We assume that fluid intelligence serves as a domain-general resource that helps to tackle problems for which domain-specific knowledge (numerical intelligence) is missing. The allocation of this resource can be measured by pupil dilation. Copyright © 2014 Society for Psychophysiological Research.

ADM For Solving Linear Second-Order Fredholm Integro-Differential Equations

NASA Astrophysics Data System (ADS)

Karim, Mohd F.; Mohamad, Mahathir; Saifullah Rusiman, Mohd; Che-Him, Norziha; Roslan, Rozaini; Khalid, Kamil

2018-04-01

In this paper, we apply Adomian Decomposition Method (ADM) as numerically analyse linear second-order Fredholm Integro-differential Equations. The approximate solutions of the problems are calculated by Maple package. Some numerical examples have been considered to illustrate the ADM for solving this equation. The results are compared with the existing exact solution. Thus, the Adomian decomposition method can be the best alternative method for solving linear second-order Fredholm Integro-Differential equation. It converges to the exact solution quickly and in the same time reduces computational work for solving the equation. The result obtained by ADM shows the ability and efficiency for solving these equations.

Method for the numerical integration of equations of perturbed satellite motion in problems of space geodesy

NASA Astrophysics Data System (ADS)

Plakhov, Iu. V.; Mytsenko, A. V.; Shel'Pov, V. A.

A numerical integration method is developed that is more accurate than Everhart's (1974) implicit single-sequence approach for integrating orbits. This method can be used to solve problems of space geodesy based on the use of highly precise laser observations.

Novel Numerical Methods for Optimal Control Problems Involving Fractional-Order Differential Equations

DTIC Science & Technology

2018-03-14

pricing, Appl. Math . Comp. Vol.305, 174-187 (2017) 5. W. Li, S. Wang, Pricing European options with proportional transaction costs and stochastic...for fractional differential equation. Numer. Math . Theor. Methods Appl. 5, 229–241, 2012. [23] Kilbas A.A. and Marzan, S.A., Cauchy problem for...numerical technique for solving fractional optimal control problems, Comput. Math . Appl., 62, Issue 3, 1055–1067, 2011. [26] Lotfi A., Yousefi SA., Dehghan M

Numerical Optimization Using Computer Experiments

NASA Technical Reports Server (NTRS)

Trosset, Michael W.; Torczon, Virginia

1997-01-01

Engineering design optimization often gives rise to problems in which expensive objective functions are minimized by derivative-free methods. We propose a method for solving such problems that synthesizes ideas from the numerical optimization and computer experiment literatures. Our approach relies on kriging known function values to construct a sequence of surrogate models of the objective function that are used to guide a grid search for a minimizer. Results from numerical experiments on a standard test problem are presented.

Simulating propagation of coherent light in random media using the Fredholm type integral equation

NASA Astrophysics Data System (ADS)

Kraszewski, Maciej; Pluciński, Jerzy

2017-06-01

Studying propagation of light in random scattering materials is important for both basic and applied research. Such studies often require usage of numerical method for simulating behavior of light beams in random media. However, if such simulations require consideration of coherence properties of light, they may become a complex numerical problems. There are well established methods for simulating multiple scattering of light (e.g. Radiative Transfer Theory and Monte Carlo methods) but they do not treat coherence properties of light directly. Some variations of these methods allows to predict behavior of coherent light but only for an averaged realization of the scattering medium. This limits their application in studying many physical phenomena connected to a specific distribution of scattering particles (e.g. laser speckle). In general, numerical simulation of coherent light propagation in a specific realization of random medium is a time- and memory-consuming problem. The goal of the presented research was to develop new efficient method for solving this problem. The method, presented in our earlier works, is based on solving the Fredholm type integral equation, which describes multiple light scattering process. This equation can be discretized and solved numerically using various algorithms e.g. by direct solving the corresponding linear equations system, as well as by using iterative or Monte Carlo solvers. Here we present recent development of this method including its comparison with well-known analytical results and a finite-difference type simulations. We also present extension of the method for problems of multiple scattering of a polarized light on large spherical particles that joins presented mathematical formalism with Mie theory.

WEAK GALERKIN METHODS FOR SECOND ORDER ELLIPTIC INTERFACE PROBLEMS

PubMed Central

MU, LIN; WANG, JUNPING; WEI, GUOWEI; YE, XIU; ZHAO, SHAN

2013-01-01

Weak Galerkin methods refer to general finite element methods for partial differential equations (PDEs) in which differential operators are approximated by their weak forms as distributions. Such weak forms give rise to desirable flexibilities in enforcing boundary and interface conditions. A weak Galerkin finite element method (WG-FEM) is developed in this paper for solving elliptic PDEs with discontinuous coefficients and interfaces. Theoretically, it is proved that high order numerical schemes can be designed by using the WG-FEM with polynomials of high order on each element. Extensive numerical experiments have been carried to validate the WG-FEM for solving second order elliptic interface problems. High order of convergence is numerically confirmed in both L2 and L∞ norms for the piecewise linear WG-FEM. Special attention is paid to solve many interface problems, in which the solution possesses a certain singularity due to the nonsmoothness of the interface. A challenge in research is to design nearly second order numerical methods that work well for problems with low regularity in the solution. The best known numerical scheme in the literature is of order O(h) to O(h1.5) for the solution itself in L∞ norm. It is demonstrated that the WG-FEM of the lowest order, i.e., the piecewise constant WG-FEM, is capable of delivering numerical approximations that are of order O(h1.75) to O(h2) in the L∞ norm for C1 or Lipschitz continuous interfaces associated with a C1 or H2 continuous solution. PMID:24072935

Brain Hyper-Connectivity and Operation-Specific Deficits during Arithmetic Problem Solving in Children with Developmental Dyscalculia

ERIC Educational Resources Information Center

Rosenberg-Lee, Miriam; Ashkenazi, Sarit; Chen, Tianwen; Young, Christina B.; Geary, David C.; Menon, Vinod

2015-01-01

Developmental dyscalculia (DD) is marked by specific deficits in processing numerical and mathematical information despite normal intelligence (IQ) and reading ability. We examined how brain circuits used by young children with DD to solve simple addition and subtraction problems differ from those used by typically developing (TD) children who…

Creativity in Unique Problem-Solving in Mathematics and Its Influence on Motivation for Learning

ERIC Educational Resources Information Center

Bishara, Saied

2016-01-01

This research study investigates the ability of students to tackle the solving of unique mathematical problems in the domain of numerical series, verbal and formal, and its influence on the motivation of junior high students with learning disabilities in the Arab sector. Two instruments were used to collect the data: mathematical series were…

Hierarchical semi-numeric method for pairwise fuzzy group decision making.

PubMed

Marimin, M; Umano, M; Hatono, I; Tamura, H

2002-01-01

Gradual improvements to a single-level semi-numeric method, i.e., linguistic labels preference representation by fuzzy sets computation for pairwise fuzzy group decision making are summarized. The method is extended to solve multiple criteria hierarchical structure pairwise fuzzy group decision-making problems. The problems are hierarchically structured into focus, criteria, and alternatives. Decision makers express their evaluations of criteria and alternatives based on each criterion by using linguistic labels. The labels are converted into and processed in triangular fuzzy numbers (TFNs). Evaluations of criteria yield relative criteria weights. Evaluations of the alternatives, based on each criterion, yield a degree of preference for each alternative or a degree of satisfaction for each preference value. By using a neat ordered weighted average (OWA) or a fuzzy weighted average operator, solutions obtained based on each criterion are aggregated into final solutions. The hierarchical semi-numeric method is suitable for solving a larger and more complex pairwise fuzzy group decision-making problem. The proposed method has been verified and applied to solve some real cases and is compared to Saaty's (1996) analytic hierarchy process (AHP) method.

On a numerical method for solving integro-differential equations with variable coefficients with applications in finance

NASA Astrophysics Data System (ADS)

Kudryavtsev, O.; Rodochenko, V.

2018-03-01

We propose a new general numerical method aimed to solve integro-differential equations with variable coefficients. The problem under consideration arises in finance where in the context of pricing barrier options in a wide class of stochastic volatility models with jumps. To handle the effect of the correlation between the price and the variance, we use a suitable substitution for processes. Then we construct a Markov-chain approximation for the variation process on small time intervals and apply a maturity randomization technique. The result is a system of boundary problems for integro-differential equations with constant coefficients on the line in each vertex of the chain. We solve the arising problems using a numerical Wiener-Hopf factorization method. The approximate formulae for the factors are efficiently implemented by means of the Fast Fourier Transform. Finally, we use a recurrent procedure that moves backwards in time on the variance tree. We demonstrate the convergence of the method using Monte-Carlo simulations and compare our results with the results obtained by the Wiener-Hopf method with closed-form expressions of the factors.

Total-variation based velocity inversion with Bregmanized operator splitting algorithm

NASA Astrophysics Data System (ADS)

Zand, Toktam; Gholami, Ali

2018-04-01

Many problems in applied geophysics can be formulated as a linear inverse problem. The associated problems, however, are large-scale and ill-conditioned. Therefore, regularization techniques are needed to be employed for solving them and generating a stable and acceptable solution. We consider numerical methods for solving such problems in this paper. In order to tackle the ill-conditioning of the problem we use blockiness as a prior information of the subsurface parameters and formulate the problem as a constrained total variation (TV) regularization. The Bregmanized operator splitting (BOS) algorithm as a combination of the Bregman iteration and the proximal forward backward operator splitting method is developed to solve the arranged problem. Two main advantages of this new algorithm are that no matrix inversion is required and that a discrepancy stopping criterion is used to stop the iterations, which allow efficient solution of large-scale problems. The high performance of the proposed TV regularization method is demonstrated using two different experiments: 1) velocity inversion from (synthetic) seismic data which is based on Born approximation, 2) computing interval velocities from RMS velocities via Dix formula. Numerical examples are presented to verify the feasibility of the proposed method for high-resolution velocity inversion.

Computation of Pressurized Gas Bearings Using CE/SE Method

NASA Technical Reports Server (NTRS)

Cioc, Sorin; Dimofte, Florin; Keith, Theo G., Jr.; Fleming, David P.

2003-01-01

The space-time conservation element and solution element (CE/SE) method is extended to compute compressible viscous flows in pressurized thin fluid films. This numerical scheme has previously been used successfully to solve a wide variety of compressible flow problems, including flows with large and small discontinuities. In this paper, the method is applied to calculate the pressure distribution in a hybrid gas journal bearing. The formulation of the problem is presented, including the modeling of the feeding system. the numerical results obtained are compared with experimental data. Good agreement between the computed results and the test data were obtained, and thus validate the CE/SE method to solve such problems.

One shot methods for optimal control of distributed parameter systems 1: Finite dimensional control

NASA Technical Reports Server (NTRS)

Taasan, Shlomo

1991-01-01

The efficient numerical treatment of optimal control problems governed by elliptic partial differential equations (PDEs) and systems of elliptic PDEs, where the control is finite dimensional is discussed. Distributed control as well as boundary control cases are discussed. The main characteristic of the new methods is that they are designed to solve the full optimization problem directly, rather than accelerating a descent method by an efficient multigrid solver for the equations involved. The methods use the adjoint state in order to achieve efficient smoother and a robust coarsening strategy. The main idea is the treatment of the control variables on appropriate scales, i.e., control variables that correspond to smooth functions are solved for on coarse grids depending on the smoothness of these functions. Solution of the control problems is achieved with the cost of solving the constraint equations about two to three times (by a multigrid solver). Numerical examples demonstrate the effectiveness of the method proposed in distributed control case, pointwise control and boundary control problems.

Application of symbolic/numeric matrix solution techniques to the NASTRAN program

NASA Technical Reports Server (NTRS)

Buturla, E. M.; Burroughs, S. H.

1977-01-01

The matrix solving algorithm of any finite element algorithm is extremely important since solution of the matrix equations requires a large amount of elapse time due to null calculations and excessive input/output operations. An alternate method of solving the matrix equations is presented. A symbolic processing step followed by numeric solution yields the solution very rapidly and is especially useful for nonlinear problems.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

PubMed

Yuan, Gonglin; Duan, Xiabin; Liu, Wenjie; Wang, Xiaoliang; Cui, Zengru; Sheng, Zhou

2015-01-01

Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1) βk ≥ 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models

PubMed Central

Yuan, Gonglin; Duan, Xiabin; Liu, Wenjie; Wang, Xiaoliang; Cui, Zengru; Sheng, Zhou

2015-01-01

Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1)β k ≥ 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations. PMID:26502409

Numerical solution of the nonlinear Schrodinger equation by feedforward neural networks

NASA Astrophysics Data System (ADS)

Shirvany, Yazdan; Hayati, Mohsen; Moradian, Rostam

2008-12-01

We present a method to solve boundary value problems using artificial neural networks (ANN). A trial solution of the differential equation is written as a feed-forward neural network containing adjustable parameters (the weights and biases). From the differential equation and its boundary conditions we prepare the energy function which is used in the back-propagation method with momentum term to update the network parameters. We improved energy function of ANN which is derived from Schrodinger equation and the boundary conditions. With this improvement of energy function we can use unsupervised training method in the ANN for solving the equation. Unsupervised training aims to minimize a non-negative energy function. We used the ANN method to solve Schrodinger equation for few quantum systems. Eigenfunctions and energy eigenvalues are calculated. Our numerical results are in agreement with their corresponding analytical solution and show the efficiency of ANN method for solving eigenvalue problems.

Computational procedure for finite difference solution of one-dimensional heat conduction problems reduces computer time

NASA Technical Reports Server (NTRS)

Iida, H. T.

1966-01-01

Computational procedure reduces the numerical effort whenever the method of finite differences is used to solve ablation problems for which the surface recession is large relative to the initial slab thickness. The number of numerical operations required for a given maximum space mesh size is reduced.

Solving fully fuzzy transportation problem using pentagonal fuzzy numbers

NASA Astrophysics Data System (ADS)

Maheswari, P. Uma; Ganesan, K.

2018-04-01

In this paper, we propose a simple approach for the solution of fuzzy transportation problem under fuzzy environment in which the transportation costs, supplies at sources and demands at destinations are represented by pentagonal fuzzy numbers. The fuzzy transportation problem is solved without converting to its equivalent crisp form using a robust ranking technique and a new fuzzy arithmetic on pentagonal fuzzy numbers. To illustrate the proposed approach a numerical example is provided.

Newton's method: A link between continuous and discrete solutions of nonlinear problems

NASA Technical Reports Server (NTRS)

Thurston, G. A.

1980-01-01

Newton's method for nonlinear mechanics problems replaces the governing nonlinear equations by an iterative sequence of linear equations. When the linear equations are linear differential equations, the equations are usually solved by numerical methods. The iterative sequence in Newton's method can exhibit poor convergence properties when the nonlinear problem has multiple solutions for a fixed set of parameters, unless the iterative sequences are aimed at solving for each solution separately. The theory of the linear differential operators is often a better guide for solution strategies in applying Newton's method than the theory of linear algebra associated with the numerical analogs of the differential operators. In fact, the theory for the differential operators can suggest the choice of numerical linear operators. In this paper the method of variation of parameters from the theory of linear ordinary differential equations is examined in detail in the context of Newton's method to demonstrate how it might be used as a guide for numerical solutions.

Nash equilibrium and multi criterion aerodynamic optimization

NASA Astrophysics Data System (ADS)

Tang, Zhili; Zhang, Lianhe

2016-06-01

Game theory and its particular Nash Equilibrium (NE) are gaining importance in solving Multi Criterion Optimization (MCO) in engineering problems over the past decade. The solution of a MCO problem can be viewed as a NE under the concept of competitive games. This paper surveyed/proposed four efficient algorithms for calculating a NE of a MCO problem. Existence and equivalence of the solution are analyzed and proved in the paper based on fixed point theorem. Specific virtual symmetric Nash game is also presented to set up an optimization strategy for single objective optimization problems. Two numerical examples are presented to verify proposed algorithms. One is mathematical functions' optimization to illustrate detailed numerical procedures of algorithms, the other is aerodynamic drag reduction of civil transport wing fuselage configuration by using virtual game. The successful application validates efficiency of algorithms in solving complex aerodynamic optimization problem.

Numerical methods for the design of gradient-index optical coatings.

PubMed

Anzengruber, Stephan W; Klann, Esther; Ramlau, Ronny; Tonova, Diana

2012-12-01

We formulate the problem of designing gradient-index optical coatings as the task of solving a system of operator equations. We use iterative numerical procedures known from the theory of inverse problems to solve it with respect to the coating refractive index profile and thickness. The mathematical derivations necessary for the application of the procedures are presented, and different numerical methods (Landweber, Newton, and Gauss-Newton methods, Tikhonov minimization with surrogate functionals) are implemented. Procedures for the transformation of the gradient coating designs into quasi-gradient ones (i.e., multilayer stacks of homogeneous layers with different refractive indices) are also developed. The design algorithms work with physically available coating materials that could be produced with the modern coating technologies.

Solving transient acoustic boundary value problems with equivalent sources using a lumped parameter approach.

PubMed

Fahnline, John B

2016-12-01

An equivalent source method is developed for solving transient acoustic boundary value problems. The method assumes the boundary surface is discretized in terms of triangular or quadrilateral elements and that the solution is represented using the acoustic fields of discrete sources placed at the element centers. Also, the boundary condition is assumed to be specified for the normal component of the surface velocity as a function of time, and the source amplitudes are determined to match the known elemental volume velocity vector at a series of discrete time steps. Equations are given for marching-on-in-time schemes to solve for the source amplitudes at each time step for simple, dipole, and tripole source formulations. Several example problems are solved to illustrate the results and to validate the formulations, including problems with closed boundary surfaces where long-time numerical instabilities typically occur. A simple relationship between the simple and dipole source amplitudes in the tripole source formulation is derived so that the source radiates primarily in the direction of the outward surface normal. The tripole source formulation is shown to eliminate interior acoustic resonances and long-time numerical instabilities.

New algorithms for solving third- and fifth-order two point boundary value problems based on nonsymmetric generalized Jacobi Petrov–Galerkin method

PubMed Central

Doha, E.H.; Abd-Elhameed, W.M.; Youssri, Y.H.

2014-01-01

Two families of certain nonsymmetric generalized Jacobi polynomials with negative integer indexes are employed for solving third- and fifth-order two point boundary value problems governed by homogeneous and nonhomogeneous boundary conditions using a dual Petrov–Galerkin method. The idea behind our method is to use trial functions satisfying the underlying boundary conditions of the differential equations and the test functions satisfying the dual boundary conditions. The resulting linear systems from the application of our method are specially structured and they can be efficiently inverted. The use of generalized Jacobi polynomials simplify the theoretical and numerical analysis of the method and also leads to accurate and efficient numerical algorithms. The presented numerical results indicate that the proposed numerical algorithms are reliable and very efficient. PMID:26425358

Solving a class of generalized fractional programming problems using the feasibility of linear programs.

PubMed

Shen, Peiping; Zhang, Tongli; Wang, Chunfeng

2017-01-01

This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.

Application of shifted Jacobi pseudospectral method for solving (in)finite-horizon min-max optimal control problems with uncertainty

NASA Astrophysics Data System (ADS)

Nikooeinejad, Z.; Delavarkhalafi, A.; Heydari, M.

2018-03-01

The difficulty of solving the min-max optimal control problems (M-MOCPs) with uncertainty using generalised Euler-Lagrange equations is caused by the combination of split boundary conditions, nonlinear differential equations and the manner in which the final time is treated. In this investigation, the shifted Jacobi pseudospectral method (SJPM) as a numerical technique for solving two-point boundary value problems (TPBVPs) in M-MOCPs for several boundary states is proposed. At first, a novel framework of approximate solutions which satisfied the split boundary conditions automatically for various boundary states is presented. Then, by applying the generalised Euler-Lagrange equations and expanding the required approximate solutions as elements of shifted Jacobi polynomials, finding a solution of TPBVPs in nonlinear M-MOCPs with uncertainty is reduced to the solution of a system of algebraic equations. Moreover, the Jacobi polynomials are particularly useful for boundary value problems in unbounded domain, which allow us to solve infinite- as well as finite and free final time problems by domain truncation method. Some numerical examples are given to demonstrate the accuracy and efficiency of the proposed method. A comparative study between the proposed method and other existing methods shows that the SJPM is simple and accurate.

Parallelized traveling cluster approximation to study numerically spin-fermion models on large lattices

NASA Astrophysics Data System (ADS)

Mukherjee, Anamitra; Patel, Niravkumar D.; Bishop, Chris; Dagotto, Elbio

2015-06-01

Lattice spin-fermion models are important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the "spins," are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The "traveling cluster approximation" (TCA) is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 103 sites. In this publication, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. This allows us to solve generic spin-fermion models easily on 104 lattice sites and with some effort on 105 lattice sites, representing the record lattice sizes studied for this family of models.

A spectral tau algorithm based on Jacobi operational matrix for numerical solution of time fractional diffusion-wave equations

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Doha, E. H.; Baleanu, D.; Ezz-Eldien, S. S.

2015-07-01

In this paper, an efficient and accurate spectral numerical method is presented for solving second-, fourth-order fractional diffusion-wave equations and fractional wave equations with damping. The proposed method is based on Jacobi tau spectral procedure together with the Jacobi operational matrix for fractional integrals, described in the Riemann-Liouville sense. The main characteristic behind this approach is to reduce such problems to those of solving systems of algebraic equations in the unknown expansion coefficients of the sought-for spectral approximations. The validity and effectiveness of the method are demonstrated by solving five numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions more easier.

Cognitive Skills Used to Solve Mathematical Word Problems and Numerical Operations: A Study of 6- to 7-Year-Old Children

ERIC Educational Resources Information Center

Bjork, Isabel Maria; Bowyer-Crane, Claudine

2013-01-01

This study investigates the relationship between skills that underpin mathematical word problems and those that underpin numerical operations, such as addition, subtraction, division and multiplication. Sixty children aged 6-7 years were tested on measures of mathematical ability, reading accuracy, reading comprehension, verbal intelligence and…

Problems of interaction longitudinal shear waves with V-shape tunnels defect

NASA Astrophysics Data System (ADS)

Popov, V. G.

2018-04-01

The problem of determining the two-dimensional dynamic stress state near a tunnel defect of V-shaped cross-section is solved. The defect is located in an infinite elastic medium, where harmonic longitudinal shear waves are propagating. The initial problem is reduced to a system of two singular integral or integro-differential equations with fixed singularities. A numerical method for solving these systems with regard to the true asymptotics of the unknown functions is developed.

Low frequency acoustic and electromagnetic scattering

NASA Technical Reports Server (NTRS)

Hariharan, S. I.; Maccamy, R. C.

1986-01-01

This paper deals with two classes of problems arising from acoustics and electromagnetics scattering in the low frequency stations. The first class of problem is solving Helmholtz equation with Dirichlet boundary conditions on an arbitrary two dimensional body while the second one is an interior-exterior interface problem with Helmholtz equation in the exterior. Low frequency analysis show that there are two intermediate problems which solve the above problems accurate to 0(k/2/ log k) where k is the frequency. These solutions greatly differ from the zero frequency approximations. For the Dirichlet problem numerical examples are shown to verify the theoretical estimates.

Solution Strategies, Modes of Representation and Justifications of Primary Five Pupils in Solving Pre Algebra Problems: An Experience of Using Task-Based Interview and Verbal Protocol Analysis

ERIC Educational Resources Information Center

Ling, Gan We; Ghazali, Munirah

2007-01-01

This descriptive study was aimed at looking into how Primary 5 pupils solve pre-algebra problems concerning patterns and unknown quantities. Specifically, objectives of this study were to describe Primary 5 pupils' solution strategies, modes of representations and justifications in: (a) discovering, describing and using numerical and geometrical…

Self-similar solutions to isothermal shock problems

NASA Astrophysics Data System (ADS)

Deschner, Stephan C.; Illenseer, Tobias F.; Duschl, Wolfgang J.

We investigate exact solutions for isothermal shock problems in different one-dimensional geometries. These solutions are given as analytical expressions if possible, or are computed using standard numerical methods for solving ordinary differential equations. We test the numerical solutions against the analytical expressions to verify the correctness of all numerical algorithms. We use similarity methods to derive a system of ordinary differential equations (ODE) yielding exact solutions for power law density distributions as initial conditions. Further, the system of ODEs accounts for implosion problems (IP) as well as explosion problems (EP) by changing the initial or boundary conditions, respectively. Taking genuinely isothermal approximations into account leads to additional insights of EPs in contrast to earlier models. We neglect a constant initial energy contribution but introduce a parameter to adjust the initial mass distribution of the system. Moreover, we show that due to this parameter a constant initial density is not allowed for isothermal EPs. Reasonable restrictions for this parameter are given. Both, the (genuinely) isothermal implosion as well as the explosion problem are solved for the first time.

A numerical solution of a singular boundary value problem arising in boundary layer theory.

PubMed

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.

An analytically iterative method for solving problems of cosmic-ray modulation

NASA Astrophysics Data System (ADS)

Kolesnyk, Yuriy L.; Bobik, Pavol; Shakhov, Boris A.; Putis, Marian

2017-09-01

The development of an analytically iterative method for solving steady-state as well as unsteady-state problems of cosmic-ray (CR) modulation is proposed. Iterations for obtaining the solutions are constructed for the spherically symmetric form of the CR propagation equation. The main solution of the considered problem consists of the zero-order solution that is obtained during the initial iteration and amendments that may be obtained by subsequent iterations. The finding of the zero-order solution is based on the CR isotropy during propagation in the space, whereas the anisotropy is taken into account when finding the next amendments. To begin with, the method is applied to solve the problem of CR modulation where the diffusion coefficient κ and the solar wind speed u are constants with an Local Interstellar Spectra (LIS) spectrum. The solution obtained with two iterations was compared with an analytical solution and with numerical solutions. Finally, solutions that have only one iteration for two problems of CR modulation with u = constant and the same form of LIS spectrum were obtained and tested against numerical solutions. For the first problem, κ is proportional to the momentum of the particle p, so it has the form κ = k0η, where η =p/m_0c. For the second problem, the diffusion coefficient is given in the form κ = k0βη, where β =v/c is the particle speed relative to the speed of light. There was a good matching of the obtained solutions with the numerical solutions as well as with the analytical solution for the problem where κ = constant.

A Penalty Method for the Numerical Solution of Hamilton-Jacobi-Bellman (HJB) Equations in Finance

NASA Astrophysics Data System (ADS)

Witte, J. H.; Reisinger, C.

2010-09-01

We present a simple and easy to implement method for the numerical solution of a rather general class of Hamilton-Jacobi-Bellman (HJB) equations. In many cases, the considered problems have only a viscosity solution, to which, fortunately, many intuitive (e.g. finite difference based) discretisations can be shown to converge. However, especially when using fully implicit time stepping schemes with their desireable stability properties, one is still faced with the considerable task of solving the resulting nonlinear discrete system. In this paper, we introduce a penalty method which approximates the nonlinear discrete system to an order of O(1/ρ), where ρ>0 is the penalty parameter, and we show that an iterative scheme can be used to solve the penalised discrete problem in finitely many steps. We include a number of examples from mathematical finance for which the described approach yields a rigorous numerical scheme and present numerical results.

Use of Green's functions in the numerical solution of two-point boundary value problems

NASA Technical Reports Server (NTRS)

Gallaher, L. J.; Perlin, I. E.

1974-01-01

This study investigates the use of Green's functions in the numerical solution of the two-point boundary value problem. The first part deals with the role of the Green's function in solving both linear and nonlinear second order ordinary differential equations with boundary conditions and systems of such equations. The second part describes procedures for numerical construction of Green's functions and considers briefly the conditions for their existence. Finally, there is a description of some numerical experiments using nonlinear problems for which the known existence, uniqueness or convergence theorems do not apply. Examples here include some problems in finding rendezvous orbits of the restricted three body system.

Multiobjective optimization approach: thermal food processing.

PubMed

Abakarov, A; Sushkov, Y; Almonacid, S; Simpson, R

2009-01-01

The objective of this study was to utilize a multiobjective optimization technique for the thermal sterilization of packaged foods. The multiobjective optimization approach used in this study is based on the optimization of well-known aggregating functions by an adaptive random search algorithm. The applicability of the proposed approach was illustrated by solving widely used multiobjective test problems taken from the literature. The numerical results obtained for the multiobjective test problems and for the thermal processing problem show that the proposed approach can be effectively used for solving multiobjective optimization problems arising in the food engineering field.

Developmental and Individual Differences in Pure Numerical Estimation

ERIC Educational Resources Information Center

Booth, Julie L.; Siegler, Robert S.

2006-01-01

The authors examined developmental and individual differences in pure numerical estimation, the type of estimation that depends solely on knowledge of numbers. Children between kindergarten and 4th grade were asked to solve 4 types of numerical estimation problems: computational, numerosity, measurement, and number line. In Experiment 1,…

Neural underpinnings of divergent production of rules in numerical analogical reasoning.

PubMed

Wu, Xiaofei; Jung, Rex E; Zhang, Hao

2016-05-01

Creativity plays an important role in numerical problem solving. Although the neural underpinnings of creativity have been studied over decades, very little is known about neural mechanisms of the creative process that relates to numerical problem solving. In the present study, we employed a numerical analogical reasoning task with functional Magnetic Resonance Imaging (fMRI) to investigate the neural correlates of divergent production of rules in numerical analogical reasoning. Participants performed two tasks: a multiple solution analogical reasoning task and a single solution analogical reasoning task. Results revealed that divergent production of rules involves significant activations at Brodmann area (BA) 10 in the right middle frontal cortex, BA 40 in the left inferior parietal lobule, and BA 8 in the superior frontal cortex. The results suggest that right BA 10 and left BA 40 are involved in the generation of novel rules, and BA 8 is associated with the inhibition of initial rules in numerical analogical reasoning. The findings shed light on the neural mechanisms of creativity in numerical processing. Copyright © 2016 Elsevier B.V. All rights reserved.

A posteriori error estimates in voice source recovery

NASA Astrophysics Data System (ADS)

Leonov, A. S.; Sorokin, V. N.

2017-12-01

The inverse problem of voice source pulse recovery from a segment of a speech signal is under consideration. A special mathematical model is used for the solution that relates these quantities. A variational method of solving inverse problem of voice source recovery for a new parametric class of sources, that is for piecewise-linear sources (PWL-sources), is proposed. Also, a technique for a posteriori numerical error estimation for obtained solutions is presented. A computer study of the adequacy of adopted speech production model with PWL-sources is performed in solving the inverse problems for various types of voice signals, as well as corresponding study of a posteriori error estimates. Numerical experiments for speech signals show satisfactory properties of proposed a posteriori error estimates, which represent the upper bounds of possible errors in solving the inverse problem. The estimate of the most probable error in determining the source-pulse shapes is about 7-8% for the investigated speech material. It is noted that a posteriori error estimates can be used as a criterion of the quality for obtained voice source pulses in application to speaker recognition.

The expanded invasive weed optimization metaheuristic for solving continuous and discrete optimization problems.

PubMed

Josiński, Henryk; Kostrzewa, Daniel; Michalczuk, Agnieszka; Switoński, Adam

2014-01-01

This paper introduces an expanded version of the Invasive Weed Optimization algorithm (exIWO) distinguished by the hybrid strategy of the search space exploration proposed by the authors. The algorithm is evaluated by solving three well-known optimization problems: minimization of numerical functions, feature selection, and the Mona Lisa TSP Challenge as one of the instances of the traveling salesman problem. The achieved results are compared with analogous outcomes produced by other optimization methods reported in the literature.

A dynamic model of functioning of a bank

NASA Astrophysics Data System (ADS)

Malafeyev, Oleg; Awasthi, Achal; Zaitseva, Irina; Rezenkov, Denis; Bogdanova, Svetlana

2018-04-01

In this paper, we analyze dynamic programming as a novel approach to solve the problem of maximizing the profits of a bank. The mathematical model of the problem and the description of bank's work is described in this paper. The problem is then approached using the method of dynamic programming. Dynamic programming makes sure that the solutions obtained are globally optimal and numerically stable. The optimization process is set up as a discrete multi-stage decision process and solved with the help of dynamic programming.

On a numerical solving of random generated hexamatrix games

NASA Astrophysics Data System (ADS)

Orlov, Andrei; Strekalovskiy, Alexander

2016-10-01

In this paper, we develop a global search method for finding a Nash equilibrium in a hexamatrix game (polymatrix game of three players). The method, on the one hand, is based on the equivalence theorem of the problem of finding a Nash equilibrium in the game and a special mathematical optimization problem, and, on the other hand, on the usage of Global Search Theory for solving the latter problem. The efficiency of this approach is demonstrated by the results of computational testing.

Solution of a Plane Hydrofracture Problem with Stress Contrast

NASA Astrophysics Data System (ADS)

Gladkov, I. O.; Linkov, A. M.

2018-03-01

A plane hydrofracture problem for the Khristianovich-Geertsma-de Klerk model is extended and solved in the case where a confining stress closing a fracture is not constant in the direction of its propagation. A method is developed for solving the problem with an arbitrary stress contrast. It is stated that the transition through a contact with positive (negative) contrast occurs with fracture arresting (acceleration), whose intensity is controlled by a dimensionless parameter derived from theoretical considerations and numerical results.

Inverse problems and optimal experiment design in unsteady heat transfer processes identification

NASA Technical Reports Server (NTRS)

Artyukhin, Eugene A.

1991-01-01

Experimental-computational methods for estimating characteristics of unsteady heat transfer processes are analyzed. The methods are based on the principles of distributed parameter system identification. The theoretical basis of such methods is the numerical solution of nonlinear ill-posed inverse heat transfer problems and optimal experiment design problems. Numerical techniques for solving problems are briefly reviewed. The results of the practical application of identification methods are demonstrated when estimating effective thermophysical characteristics of composite materials and thermal contact resistance in two-layer systems.

Numerical solution to generalized Burgers'-Fisher equation using Exp-function method hybridized with heuristic computation.

PubMed

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.

Numerical Solution to Generalized Burgers'-Fisher Equation Using Exp-Function Method Hybridized with Heuristic Computation

PubMed Central

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

A stabilized element-based finite volume method for poroelastic problems

NASA Astrophysics Data System (ADS)

Honório, Hermínio T.; Maliska, Clovis R.; Ferronato, Massimiliano; Janna, Carlo

2018-07-01

The coupled equations of Biot's poroelasticity, consisting of stress equilibrium and fluid mass balance in deforming porous media, are numerically solved. The governing partial differential equations are discretized by an Element-based Finite Volume Method (EbFVM), which can be used in three dimensional unstructured grids composed of elements of different types. One of the difficulties for solving these equations is the numerical pressure instability that can arise when undrained conditions take place. In this paper, a stabilization technique is developed to overcome this problem by employing an interpolation function for displacements that considers also the pressure gradient effect. The interpolation function is obtained by the so-called Physical Influence Scheme (PIS), typically employed for solving incompressible fluid flows governed by the Navier-Stokes equations. Classical problems with analytical solutions, as well as three-dimensional realistic cases are addressed. The results reveal that the proposed stabilization technique is able to eliminate the spurious pressure instabilities arising under undrained conditions at a low computational cost.

Computational Efficiency of the Simplex Embedding Method in Convex Nondifferentiable Optimization

NASA Astrophysics Data System (ADS)

Kolosnitsyn, A. V.

2018-02-01

The simplex embedding method for solving convex nondifferentiable optimization problems is considered. A description of modifications of this method based on a shift of the cutting plane intended for cutting off the maximum number of simplex vertices is given. These modification speed up the problem solution. A numerical comparison of the efficiency of the proposed modifications based on the numerical solution of benchmark convex nondifferentiable optimization problems is presented.

A genetic algorithm used for solving one optimization problem

NASA Astrophysics Data System (ADS)

Shipacheva, E. N.; Petunin, A. A.; Berezin, I. M.

2017-12-01

A problem of minimizing the length of the blank run for a cutting tool during cutting of sheet materials into shaped blanks is discussed. This problem arises during the preparation of control programs for computerized numerical control (CNC) machines. A discrete model of the problem is analogous in setting to the generalized travelling salesman problem with limitations in the form of precursor conditions determined by the technological features of cutting. A certain variant of a genetic algorithm for solving this problem is described. The effect of the parameters of the developed algorithm on the solution result for the problem with limitations is investigated.

Mixing Regimes in a Spatially Confined, Two-Dimensional, Supersonic Shear Layer

DTIC Science & Technology

1992-07-31

MODEL ................................... 3 THE MODEL PROBLEMS .............................................. 6 THE ONE-DIMENSIONAL PROBLEM...the effects of the numerical diffusion on the spectrum. Guirguis et al.ś and Farouk et al."’ have studied spatially evolving mixing layers for equal...approximations. Physical and Numerical Model General Formulation We solve the time-dependent, two-dimensional, compressible, Navier-Stokes equations for a

The Bean model in suprconductivity: Variational formulation and numerical solution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Prigozhin, L.

The Bean critical-state model describes the penetration of magnetic field into type-II superconductors. Mathematically, this is a free boundary problem and its solution is of interest in applied superconductivity. We derive a variational formulation for the Bean model and use it to solve two-dimensional and axially symmetric critical-state problems numerically. 25 refs., 9 figs., 1 tab.

A new Jacobi spectral collocation method for solving 1+1 fractional Schrödinger equations and fractional coupled Schrödinger systems

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Doha, E. H.; Ezz-Eldien, S. S.; Van Gorder, Robert A.

2014-12-01

The Jacobi spectral collocation method (JSCM) is constructed and used in combination with the operational matrix of fractional derivatives (described in the Caputo sense) for the numerical solution of the time-fractional Schrödinger equation (T-FSE) and the space-fractional Schrödinger equation (S-FSE). The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations, which greatly simplifies the solution process. In addition, the presented approach is also applied to solve the time-fractional coupled Schrödinger system (T-FCSS). In order to demonstrate the validity and accuracy of the numerical scheme proposed, several numerical examples with their approximate solutions are presented with comparisons between our numerical results and those obtained by other methods.

Computation of rotor-stator interaction using the Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Whitfield, David L.; Chen, Jen-Ping

1995-01-01

The numerical scheme presented belongs to a family of codes known as UNCLE (UNsteady Computation of fieLd Equations) as reported by Whitfield (1995), that is being used to solve problems in a variety of areas including compressible and incompressible flows. This derivation is specifically developed for general unsteady multi-blade-row turbomachinery problems. The scheme solves the Reynolds-averaged N-S equations with the Baldwin-Lomax turbulence model.

Derivative free Davidon-Fletcher-Powell (DFP) for solving symmetric systems of nonlinear equations

NASA Astrophysics Data System (ADS)

Mamat, M.; Dauda, M. K.; Mohamed, M. A. bin; Waziri, M. Y.; Mohamad, F. S.; Abdullah, H.

2018-03-01

Research from the work of engineers, economist, modelling, industry, computing, and scientist are mostly nonlinear equations in nature. Numerical solution to such systems is widely applied in those areas of mathematics. Over the years, there has been significant theoretical study to develop methods for solving such systems, despite these efforts, unfortunately the methods developed do have deficiency. In a contribution to solve systems of the form F(x) = 0, x ∈ Rn , a derivative free method via the classical Davidon-Fletcher-Powell (DFP) update is presented. This is achieved by simply approximating the inverse Hessian matrix with {Q}k+1-1 to θkI. The modified method satisfied the descent condition and possess local superlinear convergence properties. Interestingly, without computing any derivative, the proposed method never fail to converge throughout the numerical experiments. The output is based on number of iterations and CPU time, different initial starting points were used on a solve 40 benchmark test problems. With the aid of the squared norm merit function and derivative-free line search technique, the approach yield a method of solving symmetric systems of nonlinear equations that is capable of significantly reducing the CPU time and number of iteration, as compared to its counterparts. A comparison between the proposed method and classical DFP update were made and found that the proposed methodis the top performer and outperformed the existing method in almost all the cases. In terms of number of iterations, out of the 40 problems solved, the proposed method solved 38 successfully, (95%) while classical DFP solved 2 problems (i.e. 05%). In terms of CPU time, the proposed method solved 29 out of the 40 problems given, (i.e.72.5%) successfully whereas classical DFP solves 11 (27.5%). The method is valid in terms of derivation, reliable in terms of number of iterations and accurate in terms of CPU time. Thus, suitable and achived the objective.

Numerical modeling and optimization of the Iguassu gas centrifuge

NASA Astrophysics Data System (ADS)

Bogovalov, S. V.; Borman, V. D.; Borisevich, V. D.; Tronin, V. N.; Tronin, I. V.

2017-07-01

The full procedure of the numerical calculation of the optimized parameters of the Iguassu gas centrifuge (GC) is under discussion. The procedure consists of a few steps. On the first step the problem of a hydrodynamical flow of the gas in the rotating rotor of the GC is solved numerically. On the second step the problem of diffusion of the binary mixture of isotopes is solved. The separation power of the gas centrifuge is calculated after that. On the last step the time consuming procedure of optimization of the GC is performed providing us the maximum of the separation power. The optimization is based on the BOBYQA method exploring the results of numerical simulations of the hydrodynamics and diffusion of the mixture of isotopes. Fast convergence of calculations is achieved due to exploring of a direct solver at the solution of the hydrodynamical and diffusion parts of the problem. Optimized separative power and optimal internal parameters of the Iguassu GC with 1 m rotor were calculated using the developed approach. Optimization procedure converges in 45 iterations taking 811 minutes.

Extension of lattice Boltzmann flux solver for simulation of compressible multi-component flows

NASA Astrophysics Data System (ADS)

Yang, Li-Ming; Shu, Chang; Yang, Wen-Ming; Wang, Yan

2018-05-01

The lattice Boltzmann flux solver (LBFS), which was presented by Shu and his coworkers for solving compressible fluid flow problems, is extended to simulate compressible multi-component flows in this work. To solve the two-phase gas-liquid problems, the model equations with stiffened gas equation of state are adopted. In this model, two additional non-conservative equations are introduced to represent the material interfaces, apart from the classical Euler equations. We first convert the interface equations into the full conservative form by applying the mass equation. After that, we calculate the numerical fluxes of the classical Euler equations by the existing LBFS and the numerical fluxes of the interface equations by the passive scalar approach. Once all the numerical fluxes at the cell interface are obtained, the conservative variables at cell centers can be updated by marching the equations in time and the material interfaces can be identified via the distributions of the additional variables. The numerical accuracy and stability of present scheme are validated by its application to several compressible multi-component fluid flow problems.

Analytic Formulation and Numerical Implementation of an Acoustic Pressure Gradient Prediction

NASA Technical Reports Server (NTRS)

Lee, Seongkyu; Brentner, Kenneth S.; Farassat, F.; Morris, Philip J.

2008-01-01

Two new analytical formulations of the acoustic pressure gradient have been developed and implemented in the PSU-WOPWOP rotor noise prediction code. The pressure gradient can be used to solve the boundary condition for scattering problems and it is a key aspect to solve acoustic scattering problems. The first formulation is derived from the gradient of the Ffowcs Williams-Hawkings (FW-H) equation. This formulation has a form involving the observer time differentiation outside the integrals. In the second formulation, the time differentiation is taken inside the integrals analytically. This formulation avoids the numerical time differentiation with respect to the observer time, which is computationally more efficient. The acoustic pressure gradient predicted by these new formulations is validated through comparison with available exact solutions for a stationary and moving monopole sources. The agreement between the predictions and exact solutions is excellent. The formulations are applied to the rotor noise problems for two model rotors. A purely numerical approach is compared with the analytical formulations. The agreement between the analytical formulations and the numerical method is excellent for both stationary and moving observer cases.

Numerical Solution of Time-Dependent Problems with a Fractional-Power Elliptic Operator

NASA Astrophysics Data System (ADS)

Vabishchevich, P. N.

2018-03-01

A time-dependent problem in a bounded domain for a fractional diffusion equation is considered. The first-order evolution equation involves a fractional-power second-order elliptic operator with Robin boundary conditions. A finite-element spatial approximation with an additive approximation of the operator of the problem is used. The time approximation is based on a vector scheme. The transition to a new time level is ensured by solving a sequence of standard elliptic boundary value problems. Numerical results obtained for a two-dimensional model problem are presented.

Fluid-structure interaction with pipe-wall viscoelasticity during water hammer

NASA Astrophysics Data System (ADS)

Keramat, A.; Tijsseling, A. S.; Hou, Q.; Ahmadi, A.

2012-01-01

Fluid-structure interaction (FSI) due to water hammer in a pipeline which has viscoelastic wall behaviour is studied. Appropriate governing equations are derived and numerically solved. In the numerical implementation of the hydraulic and structural equations, viscoelasticity is incorporated using the Kelvin-Voigt mechanical model. The equations are solved by two different approaches, namely the Method of Characteristics-Finite Element Method (MOC-FEM) and full MOC. In both approaches two important effects of FSI in fluid-filled pipes, namely Poisson and junction coupling, are taken into account. The study proposes a more comprehensive model for studying fluid transients in pipelines as compared to previous works, which take into account either FSI or viscoelasticity. To verify the proposed mathematical model and its numerical solutions, the following problems are investigated: axial vibration of a viscoelastic bar subjected to a step uniaxial loading, FSI in an elastic pipe, and hydraulic transients in a pressurised polyethylene pipe without FSI. The results of each case are checked with available exact and experimental results. Then, to study the simultaneous effects of FSI and viscoelasticity, which is the new element of the present research, one problem is solved by the two different numerical approaches. Both numerical methods give the same results, thus confirming the correctness of the solutions.

Optimal Price Decision Problem for Simultaneous Multi-article Auction and Its Optimal Price Searching Method by Particle Swarm Optimization

NASA Astrophysics Data System (ADS)

Masuda, Kazuaki; Aiyoshi, Eitaro

We propose a method for solving optimal price decision problems for simultaneous multi-article auctions. An auction problem, originally formulated as a combinatorial problem, determines both every seller's whether or not to sell his/her article and every buyer's which article(s) to buy, so that the total utility of buyers and sellers will be maximized. Due to the duality theory, we transform it equivalently into a dual problem in which Lagrange multipliers are interpreted as articles' transaction price. As the dual problem is a continuous optimization problem with respect to the multipliers (i.e., the transaction prices), we propose a numerical method to solve it by applying heuristic global search methods. In this paper, Particle Swarm Optimization (PSO) is used to solve the dual problem, and experimental results are presented to show the validity of the proposed method.

Numerical simulation of the processes in the normal incidence tube for high acoustic pressure levels

NASA Astrophysics Data System (ADS)

Fedotov, E. S.; Khramtsov, I. V.; Kustov, O. Yu.

2016-10-01

Numerical simulation of the acoustic processes in an impedance tube at high levels of acoustic pressure is a way to solve a problem of noise suppressing by liners. These studies used liner specimen that is one cylindrical Helmholtz resonator. The evaluation of the real and imaginary parts of the liner acoustic impedance and sound absorption coefficient was performed for sound pressure levels of 130, 140 and 150 dB. The numerical simulation used experimental data having been obtained on the impedance tube with normal incidence waves. At the first stage of the numerical simulation it was used the linearized Navier-Stokes equations, which describe well the imaginary part of the liner impedance whatever the sound pressure level. These equations were solved by finite element method in COMSOL Multiphysics program in axisymmetric formulation. At the second stage, the complete Navier-Stokes equations were solved by direct numerical simulation in ANSYS CFX in axisymmetric formulation. As the result, the acceptable agreement between numerical simulation and experiment was obtained.

Variational finite-difference methods in linear and nonlinear problems of the deformation of metallic and composite shells (review)

NASA Astrophysics Data System (ADS)

Maksimyuk, V. A.; Storozhuk, E. A.; Chernyshenko, I. S.

2012-11-01

Variational finite-difference methods of solving linear and nonlinear problems for thin and nonthin shells (plates) made of homogeneous isotropic (metallic) and orthotropic (composite) materials are analyzed and their classification principles and structure are discussed. Scalar and vector variational finite-difference methods that implement the Kirchhoff-Love hypotheses analytically or algorithmically using Lagrange multipliers are outlined. The Timoshenko hypotheses are implemented in a traditional way, i.e., analytically. The stress-strain state of metallic and composite shells of complex geometry is analyzed numerically. The numerical results are presented in the form of graphs and tables and used to assess the efficiency of using the variational finite-difference methods to solve linear and nonlinear problems of the statics of shells (plates)

Application of the boundary integral method to immiscible displacement problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Masukawa, J.; Horne, R.N.

1988-08-01

This paper presents an application of the boundary integral method (BIM) to fluid displacement problems to demonstrate its usefulness in reservoir simulation. A method for solving two-dimensional (2D), piston-like displacement for incompressible fluids with good accuracy has been developed. Several typical example problems with repeated five-spot patterns were solved for various mobility ratios. The solutions were compared with the analytical solutions to demonstrate accuracy. Singularity programming was found to be a major advantage in handling flow in the vicinity of wells. The BIM was found to be an excellent way to solve immiscible displacement problems. Unlike analytic methods, it canmore » accommodate complex boundary shapes and does not suffer from numerical dispersion at the front.« less

Using the Multilayer Free-Surface Flow Model to Solve Wave Problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Prokof’ev, V. A., E-mail: ProkofyevVA@vniig.ru

2017-01-15

A method is presented for changing over from a single-layer shallow-water model to a multilayer model with hydrostatic pressure profile and, then, to a multilayer model with nonhydrostatic pressure profile. The method does not require complex procedures for solving the discrete Poisson’s equation and features high computation efficiency. The results of validating the algorithm against experimental data critical for the numerical dissipation of the numerical scheme are presented. Examples are considered.

An efficient numerical algorithm for transverse impact problems

NASA Technical Reports Server (NTRS)

Sankar, B. V.; Sun, C. T.

1985-01-01

Transverse impact problems in which the elastic and plastic indentation effects are considered, involve a nonlinear integral equation for the contact force, which, in practice, is usually solved by an iterative scheme with small increments in time. In this paper, a numerical method is proposed wherein the iterations of the nonlinear problem are separated from the structural response computations. This makes the numerical procedures much simpler and also efficient. The proposed method is applied to some impact problems for which solutions are available, and they are found to be in good agreement. The effect of the magnitude of time increment on the results is also discussed.

Numerical calculations of turbulent swirling flow

NASA Technical Reports Server (NTRS)

Kubo, I.; Gouldin, F. C.

1974-01-01

Description of a numerical technique for solving axisymmetric, incompressible, turbulent swirling flow problems. Isothermal flow calculations are presented for a coaxial flow configuration of special interest. The calculation results are discussed in regard to their implications for the design of gas turbine combustors.

Parallelized traveling cluster approximation to study numerically spin-fermion models on large lattices

DOE PAGES

Mukherjee, Anamitra; Patel, Niravkumar D.; Bishop, Chris; ...

2015-06-08

Lattice spin-fermion models are quite important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the “spins,” are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The “traveling cluster approximation” (TCA)more » is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 10 3 sites. In this paper, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. Finally, this allows us to solve generic spin-fermion models easily on 10 4 lattice sites and with some effort on 10 5 lattice sites, representing the record lattice sizes studied for this family of models.« less

Parallelized traveling cluster approximation to study numerically spin-fermion models on large lattices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mukherjee, Anamitra; Patel, Niravkumar D.; Bishop, Chris

Lattice spin-fermion models are quite important to study correlated systems where quantum dynamics allows for a separation between slow and fast degrees of freedom. The fast degrees of freedom are treated quantum mechanically while the slow variables, generically referred to as the “spins,” are treated classically. At present, exact diagonalization coupled with classical Monte Carlo (ED + MC) is extensively used to solve numerically a general class of lattice spin-fermion problems. In this common setup, the classical variables (spins) are treated via the standard MC method while the fermion problem is solved by exact diagonalization. The “traveling cluster approximation” (TCA)more » is a real space variant of the ED + MC method that allows to solve spin-fermion problems on lattice sizes with up to 10 3 sites. In this paper, we present a novel reorganization of the TCA algorithm in a manner that can be efficiently parallelized. Finally, this allows us to solve generic spin-fermion models easily on 10 4 lattice sites and with some effort on 10 5 lattice sites, representing the record lattice sizes studied for this family of models.« less

Numerical optimization methods for controlled systems with parameters

NASA Astrophysics Data System (ADS)

Tyatyushkin, A. I.

2017-10-01

First- and second-order numerical methods for optimizing controlled dynamical systems with parameters are discussed. In unconstrained-parameter problems, the control parameters are optimized by applying the conjugate gradient method. A more accurate numerical solution in these problems is produced by Newton's method based on a second-order functional increment formula. Next, a general optimal control problem with state constraints and parameters involved on the righthand sides of the controlled system and in the initial conditions is considered. This complicated problem is reduced to a mathematical programming one, followed by the search for optimal parameter values and control functions by applying a multimethod algorithm. The performance of the proposed technique is demonstrated by solving application problems.

Numerical methods for incompressible viscous flows with engineering applications

NASA Technical Reports Server (NTRS)

Rose, M. E.; Ash, R. L.

1988-01-01

A numerical scheme has been developed to solve the incompressible, 3-D Navier-Stokes equations using velocity-vorticity variables. This report summarizes the development of the numerical approximation schemes for the divergence and curl of the velocity vector fields and the development of compact schemes for handling boundary and initial boundary value problems.

Numerical optimization in Hilbert space using inexact function and gradient evaluations

NASA Technical Reports Server (NTRS)

Carter, Richard G.

1989-01-01

Trust region algorithms provide a robust iterative technique for solving non-convex unstrained optimization problems, but in many instances it is prohibitively expensive to compute high accuracy function and gradient values for the method. Of particular interest are inverse and parameter estimation problems, since function and gradient evaluations involve numerically solving large systems of differential equations. A global convergence theory is presented for trust region algorithms in which neither function nor gradient values are known exactly. The theory is formulated in a Hilbert space setting so that it can be applied to variational problems as well as the finite dimensional problems normally seen in trust region literature. The conditions concerning allowable error are remarkably relaxed: relative errors in the gradient error condition is automatically satisfied if the error is orthogonal to the gradient approximation. A technique for estimating gradient error and improving the approximation is also presented.

Superconvergent second order Cartesian method for solving free boundary problem for invadopodia formation

NASA Astrophysics Data System (ADS)

Gallinato, Olivier; Poignard, Clair

2017-06-01

In this paper, we present a superconvergent second order Cartesian method to solve a free boundary problem with two harmonic phases coupled through the moving interface. The model recently proposed by the authors and colleagues describes the formation of cell protrusions. The moving interface is described by a level set function and is advected at the velocity given by the gradient of the inner phase. The finite differences method proposed in this paper consists of a new stabilized ghost fluid method and second order discretizations for the Laplace operator with the boundary conditions (Dirichlet, Neumann or Robin conditions). Interestingly, the method to solve the harmonic subproblems is superconvergent on two levels, in the sense that the first and second order derivatives of the numerical solutions are obtained with the second order of accuracy, similarly to the solution itself. We exhibit numerical criteria on the data accuracy to get such properties and numerical simulations corroborate these criteria. In addition to these properties, we propose an appropriate extension of the velocity of the level-set to avoid any loss of consistency, and to obtain the second order of accuracy of the complete free boundary problem. Interestingly, we highlight the transmission of the superconvergent properties for the static subproblems and their preservation by the dynamical scheme. Our method is also well suited for quasistatic Hele-Shaw-like or Muskat-like problems.

On the complexity of a combined homotopy interior method for convex programming

NASA Astrophysics Data System (ADS)

Yu, Bo; Xu, Qing; Feng, Guochen

2007-03-01

In [G.C. Feng, Z.H. Lin, B. Yu, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, Nonlinear Anal. 32 (1998) 761-768; G.C. Feng, B. Yu, Combined homotopy interior point method for nonlinear programming problems, in: H. Fujita, M. Yamaguti (Eds.), Advances in Numerical Mathematics, Proceedings of the Second Japan-China Seminar on Numerical Mathematics, Lecture Notes in Numerical and Applied Analysis, vol. 14, Kinokuniya, Tokyo, 1995, pp. 9-16; Z.H. Lin, B. Yu, G.C. Feng, A combined homotopy interior point method for convex programming problem, Appl. Math. Comput. 84 (1997) 193-211.], a combined homotopy was constructed for solving non-convex programming and convex programming with weaker conditions, without assuming the logarithmic barrier function to be strictly convex and the solution set to be bounded. It was proven that a smooth interior path from an interior point of the feasible set to a K-K-T point of the problem exists. This shows that combined homotopy interior point methods can solve the problem that commonly used interior point methods cannot solveE However, so far, there is no result on its complexity, even for linear programming. The main difficulty is that the objective function is not monotonically decreasing on the combined homotopy path. In this paper, by taking a piecewise technique, under commonly used conditions, polynomiality of a combined homotopy interior point method is given for convex nonlinear programming.

Solving Fractional Programming Problems based on Swarm Intelligence

NASA Astrophysics Data System (ADS)

Raouf, Osama Abdel; Hezam, Ibrahim M.

2014-04-01

This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to solve any type of FPPs. The solution results employing the SI algorithms are compared with a number of exact and metaheuristic solution methods used for handling FPPs. Swarm Intelligence can be denoted as an effective technique for solving linear or nonlinear, non-differentiable fractional objective functions. Problems with an optimal solution at a finite point and an unbounded constraint set, can be solved using the proposed approach. Numerical examples are given to show the feasibility, effectiveness, and robustness of the proposed algorithm. The results obtained using the two SI algorithms revealed the superiority of the proposed technique among others in computational time. A better accuracy was remarkably observed in the solution results of the industrial application problems.

Cubic spline numerical solution of an ablation problem with convective backface cooling

NASA Astrophysics Data System (ADS)

Lin, S.; Wang, P.; Kahawita, R.

1984-08-01

An implicit numerical technique using cubic splines is presented for solving an ablation problem on a thin wall with convective cooling. A non-uniform computational mesh with 6 grid points has been used for the numerical integration. The method has been found to be computationally efficient, providing for the care under consideration of an overall error of about 1 percent. The results obtained indicate that the convective cooling is an important factor in reducing the ablation thickness.

Efficient Jacobi-Gauss collocation method for solving initial value problems of Bratu type

NASA Astrophysics Data System (ADS)

Doha, E. H.; Bhrawy, A. H.; Baleanu, D.; Hafez, R. M.

2013-09-01

In this paper, we propose the shifted Jacobi-Gauss collocation spectral method for solving initial value problems of Bratu type, which is widely applicable in fuel ignition of the combustion theory and heat transfer. The spatial approximation is based on shifted Jacobi polynomials J {/n (α,β)}( x) with α, β ∈ (-1, ∞), x ∈ [0, 1] and n the polynomial degree. The shifted Jacobi-Gauss points are used as collocation nodes. Illustrative examples have been discussed to demonstrate the validity and applicability of the proposed technique. Comparing the numerical results of the proposed method with some well-known results show that the method is efficient and gives excellent numerical results.

NAS technical summaries. Numerical aerodynamic simulation program, March 1992 - February 1993

NASA Technical Reports Server (NTRS)

1994-01-01

NASA created the Numerical Aerodynamic Simulation (NAS) Program in 1987 to focus resources on solving critical problems in aeroscience and related disciplines by utilizing the power of the most advanced supercomputers available. The NAS Program provides scientists with the necessary computing power to solve today's most demanding computational fluid dynamics problems and serves as a pathfinder in integrating leading-edge supercomputing technologies, thus benefitting other supercomputer centers in government and industry. The 1992-93 operational year concluded with 399 high-speed processor projects and 91 parallel projects representing NASA, the Department of Defense, other government agencies, private industry, and universities. This document provides a glimpse at some of the significant scientific results for the year.

Solving fractional optimal control problems within a Chebyshev-Legendre operational technique

NASA Astrophysics Data System (ADS)

Bhrawy, A. H.; Ezz-Eldien, S. S.; Doha, E. H.; Abdelkawy, M. A.; Baleanu, D.

2017-06-01

In this manuscript, we report a new operational technique for approximating the numerical solution of fractional optimal control (FOC) problems. The operational matrix of the Caputo fractional derivative of the orthonormal Chebyshev polynomial and the Legendre-Gauss quadrature formula are used, and then the Lagrange multiplier scheme is employed for reducing such problems into those consisting of systems of easily solvable algebraic equations. We compare the approximate solutions achieved using our approach with the exact solutions and with those presented in other techniques and we show the accuracy and applicability of the new numerical approach, through two numerical examples.

Numerical Solution of the Electron Transport Equation in the Upper Atmosphere

DOE Office of Scientific and Technical Information (OSTI.GOV)

Woods, Mark Christopher; Holmes, Mark; Sailor, William C

A new approach for solving the electron transport equation in the upper atmosphere is derived. The problem is a very stiff boundary value problem, and to obtain an accurate numerical solution, matrix factorizations are used to decouple the fast and slow modes. A stable finite difference method is applied to each mode. This solver is applied to a simplifieed problem for which an exact solution exists using various versions of the boundary conditions that might arise in a natural auroral display. The numerical and exact solutions are found to agree with each other to at least two significant digits.

Extension of the firefly algorithm and preference rules for solving MINLP problems

NASA Astrophysics Data System (ADS)

Costa, M. Fernanda P.; Francisco, Rogério B.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.

2017-07-01

An extension of the firefly algorithm (FA) for solving mixed-integer nonlinear programming (MINLP) problems is presented. Although penalty functions are nowadays frequently used to handle integrality conditions and inequality and equality constraints, this paper proposes the implementation within the FA of a simple rounded-based heuristic and four preference rules to find and converge to MINLP feasible solutions. Preliminary numerical experiments are carried out to validate the proposed methodology.

Free Vibrations of Nonthin Elliptic Cylindrical Shells of Variable Thickness

NASA Astrophysics Data System (ADS)

Grigorenko, A. Ya.; Efimova, T. L.; Korotkikh, Yu. A.

2017-11-01

The problem of the free vibrations of nonthin elliptic cylindrical shells of variable thickness under various boundary conditions is solved using the refined Timoshenko-Mindlin theory. To solve the problem, an effective numerical approach based on the spline-approximation and discrete-orthogonalization methods is used. The effect of the cross-sectional shape, thickness variation law, material properties, and boundary conditions on the natural frequency spectrum of the shells is analyzed.

Advanced computational techniques for incompressible/compressible fluid-structure interactions

NASA Astrophysics Data System (ADS)

Kumar, Vinod

2005-07-01

Fluid-Structure Interaction (FSI) problems are of great importance to many fields of engineering and pose tremendous challenges to numerical analyst. This thesis addresses some of the hurdles faced for both 2D and 3D real life time-dependent FSI problems with particular emphasis on parachute systems. The techniques developed here would help improve the design of parachutes and are of direct relevance to several other FSI problems. The fluid system is solved using the Deforming-Spatial-Domain/Stabilized Space-Time (DSD/SST) finite element formulation for the Navier-Stokes equations of incompressible and compressible flows. The structural dynamics solver is based on a total Lagrangian finite element formulation. Newton-Raphson method is employed to linearize the otherwise nonlinear system resulting from the fluid and structure formulations. The fluid and structural systems are solved in decoupled fashion at each nonlinear iteration. While rigorous coupling methods are desirable for FSI simulations, the decoupled solution techniques provide sufficient convergence in the time-dependent problems considered here. In this thesis, common problems in the FSI simulations of parachutes are discussed and possible remedies for a few of them are presented. Further, the effects of the porosity model on the aerodynamic forces of round parachutes are analyzed. Techniques for solving compressible FSI problems are also discussed. Subsequently, a better stabilization technique is proposed to efficiently capture and accurately predict the shocks in supersonic flows. The numerical examples simulated here require high performance computing. Therefore, numerical tools using distributed memory supercomputers with message passing interface (MPI) libraries were developed.

A gradient based algorithm to solve inverse plane bimodular problems of identification

NASA Astrophysics Data System (ADS)

Ran, Chunjiang; Yang, Haitian; Zhang, Guoqing

2018-02-01

This paper presents a gradient based algorithm to solve inverse plane bimodular problems of identifying constitutive parameters, including tensile/compressive moduli and tensile/compressive Poisson's ratios. For the forward bimodular problem, a FE tangent stiffness matrix is derived facilitating the implementation of gradient based algorithms, for the inverse bimodular problem of identification, a two-level sensitivity analysis based strategy is proposed. Numerical verification in term of accuracy and efficiency is provided, and the impacts of initial guess, number of measurement points, regional inhomogeneity, and noisy data on the identification are taken into accounts.

An efficient numerical method for solving the Boltzmann equation in multidimensions

NASA Astrophysics Data System (ADS)

Dimarco, Giacomo; Loubère, Raphaël; Narski, Jacek; Rey, Thomas

2018-01-01

In this paper we deal with the extension of the Fast Kinetic Scheme (FKS) (Dimarco and Loubère, 2013 [26]) originally constructed for solving the BGK equation, to the more challenging case of the Boltzmann equation. The scheme combines a robust and fast method for treating the transport part based on an innovative Lagrangian technique supplemented with conservative fast spectral schemes to treat the collisional operator by means of an operator splitting approach. This approach along with several implementation features related to the parallelization of the algorithm permits to construct an efficient simulation tool which is numerically tested against exact and reference solutions on classical problems arising in rarefied gas dynamic. We present results up to the 3 D × 3 D case for unsteady flows for the Variable Hard Sphere model which may serve as benchmark for future comparisons between different numerical methods for solving the multidimensional Boltzmann equation. For this reason, we also provide for each problem studied details on the computational cost and memory consumption as well as comparisons with the BGK model or the limit model of compressible Euler equations.

Multiresolution strategies for the numerical solution of optimal control problems

NASA Astrophysics Data System (ADS)

Jain, Sachin

There exist many numerical techniques for solving optimal control problems but less work has been done in the field of making these algorithms run faster and more robustly. The main motivation of this work is to solve optimal control problems accurately in a fast and efficient way. Optimal control problems are often characterized by discontinuities or switchings in the control variables. One way of accurately capturing the irregularities in the solution is to use a high resolution (dense) uniform grid. This requires a large amount of computational resources both in terms of CPU time and memory. Hence, in order to accurately capture any irregularities in the solution using a few computational resources, one can refine the mesh locally in the region close to an irregularity instead of refining the mesh uniformly over the whole domain. Therefore, a novel multiresolution scheme for data compression has been designed which is shown to outperform similar data compression schemes. Specifically, we have shown that the proposed approach results in fewer grid points in the grid compared to a common multiresolution data compression scheme. The validity of the proposed mesh refinement algorithm has been verified by solving several challenging initial-boundary value problems for evolution equations in 1D. The examples have demonstrated the stability and robustness of the proposed algorithm. The algorithm adapted dynamically to any existing or emerging irregularities in the solution by automatically allocating more grid points to the region where the solution exhibited sharp features and fewer points to the region where the solution was smooth. Thereby, the computational time and memory usage has been reduced significantly, while maintaining an accuracy equivalent to the one obtained using a fine uniform mesh. Next, a direct multiresolution-based approach for solving trajectory optimization problems is developed. The original optimal control problem is transcribed into a 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.

Application of Jacobian-free Newton–Krylov method in implicitly solving two-fluid six-equation two-phase flow problems: Implementation, validation and benchmark

DOE PAGES

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2016-03-09

This work represents a first-of-its-kind successful application to employ advanced numerical methods in solving realistic two-phase flow problems with two-fluid six-equation two-phase flow model. These advanced numerical methods include high-resolution spatial discretization scheme with staggered grids (high-order) fully implicit time integration schemes, and Jacobian-free Newton–Krylov (JFNK) method as the nonlinear solver. The computer code developed in this work has been extensively validated with existing experimental flow boiling data in vertical pipes and rod bundles, which cover wide ranges of experimental conditions, such as pressure, inlet mass flux, wall heat flux and exit void fraction. Additional code-to-code benchmark with the RELAP5-3Dmore » code further verifies the correct code implementation. The combined methods employed in this work exhibit strong robustness in solving two-phase flow problems even when phase appearance (boiling) and realistic discrete flow regimes are considered. Transitional flow regimes used in existing system analysis codes, normally introduced to overcome numerical difficulty, were completely removed in this work. As a result, this in turn provides the possibility to utilize more sophisticated flow regime maps in the future to further improve simulation accuracy.« less

Does the Cognitive Reflection Test actually capture heuristic versus analytic reasoning styles in older adults?

PubMed

Hertzog, Christopher; Smith, R Marit; Ariel, Robert

2018-01-01

Background/Study Context: This study evaluated adult age differences in the original three-item Cognitive Reflection Test (CRT; Frederick, 2005, The Journal of Economic Perspectives, 19, 25-42) and an expanded seven-item version of that test (Toplak et al., 2013, Thinking and Reasoning, 20, 147-168). The CRT is a numerical problem-solving test thought to capture a disposition towards either rapid, intuition-based problem solving (Type I reasoning) or a more thoughtful, analytical problem-solving approach (Type II reasoning). Test items are designed to induce heuristically guided errors that can be avoided if using an appropriate numerical representation of the test problems. We evaluated differences between young adults and old adults in CRT performance and correlates of CRT performance. Older adults (ages 60 to 80) were paid volunteers who participated in experiments assessing age differences in self-regulated learning. Young adults (ages 17 to 35) were students participating for pay as part of a project assessing measures of critical thinking skills or as a young comparison group in the self-regulated learning study. There were age differences in the number of CRT correct responses in two independent samples. Results with the original three-item CRT found older adults to have a greater relative proportion of errors based on providing the intuitive lure. However, younger adults actually had a greater proportion of intuitive errors on the long version of the CRT, relative to older adults. Item analysis indicated a much lower internal consistency of CRT items for older adults. These outcomes do not offer full support for the argument that older adults are higher in the use of a "Type I" cognitive style. The evidence was also consistent with an alternative hypothesis that age differences were due to lower levels of numeracy in the older samples. Alternative process-oriented evaluations of how older adults solve CRT items will probably be needed to determine conditions under which older adults manifest an increase in the Type I dispositional tendency to opt for superficial, heuristically guided problem representations in numerical problem-solving tasks.

Integral Method of Boundary Characteristics: Neumann Condition

NASA Astrophysics Data System (ADS)

Kot, V. A.

2018-05-01

A new algorithm, based on systems of identical equalities with integral and differential boundary characteristics, is proposed for solving boundary-value problems on the heat conduction in bodies canonical in shape at a Neumann boundary condition. Results of a numerical analysis of the accuracy of solving heat-conduction problems with variable boundary conditions with the use of this algorithm are presented. The solutions obtained with it can be considered as exact because their errors comprise hundredths and ten-thousandths of a persent for a wide range of change in the parameters of a problem.

On a comparison of two schemes in sequential data assimilation

NASA Astrophysics Data System (ADS)

Grishina, Anastasiia A.; Penenko, Alexey V.

2017-11-01

This paper is focused on variational data assimilation as an approach to mathematical modeling. Realization of the approach requires a sequence of connected inverse problems with different sets of observational data to be solved. Two variational data assimilation schemes, "implicit" and "explicit", are considered in the article. Their equivalence is shown and the numerical results are given on a basis of non-linear Robertson system. To avoid the "inverse problem crime" different schemes were used to produce synthetic measurement and to solve the data assimilation problem.

Extrusion Process by Finite Volume Method Using OpenFoam Software

DOE Office of Scientific and Technical Information (OSTI.GOV)

Matos Martins, Marcelo; Tonini Button, Sergio; Divo Bressan, Jose

The computational codes are very important tools to solve engineering problems. In the analysis of metal forming process, such as extrusion, this is not different because the computational codes allow analyzing the process with reduced cost. Traditionally, the Finite Element Method is used to solve solid mechanic problems, however, the Finite Volume Method (FVM) have been gaining force in this field of applications. This paper presents the velocity field and friction coefficient variation results, obtained by numerical simulation using the OpenFoam Software and the FVM to solve an aluminum direct cold extrusion process.

Interior point techniques for LP and NLP

DOE Office of Scientific and Technical Information (OSTI.GOV)

Evtushenko, Y.

By using surjective mapping the initial constrained optimization problem is transformed to a problem in a new space with only equality constraints. For the numerical solution of the latter problem we use the generalized gradient-projection method and Newton`s method. After inverse transformation to the initial space we obtain the family of numerical methods for solving optimization problems with equality and inequality constraints. In the linear programming case after some simplification we obtain Dikin`s algorithm, affine scaling algorithm and generalized primal dual interior point linear programming algorithm.

Locating CVBEM collocation points for steady state heat transfer problems

USGS Publications Warehouse

Hromadka, T.V.

1985-01-01

The Complex Variable Boundary Element Method or CVBEM provides a highly accurate means of developing numerical solutions to steady state two-dimensional heat transfer problems. The numerical approach exactly solves the Laplace equation and satisfies the boundary conditions at specified points on the boundary by means of collocation. The accuracy of the approximation depends upon the nodal point distribution specified by the numerical analyst. In order to develop subsequent, refined approximation functions, four techniques for selecting additional collocation points are presented. The techniques are compared as to the governing theory, representation of the error of approximation on the problem boundary, the computational costs, and the ease of use by the numerical analyst. ?? 1985.

Development of common neural representations for distinct numerical problems

PubMed Central

Chang, Ting-Ting; Rosenberg-Lee, Miriam; Metcalfe, Arron W. S.; Chen, Tianwen; Menon, Vinod

2015-01-01

How the brain develops representations for abstract cognitive problems is a major unaddressed question in neuroscience. Here we tackle this fundamental question using arithmetic problem solving, a cognitive domain important for the development of mathematical reasoning. We first examined whether adults demonstrate common neural representations for addition and subtraction problems, two complementary arithmetic operations that manipulate the same quantities. We then examined how the common neural representations for the two problem types change with development. Whole-brain multivoxel representational similarity (MRS) analysis was conducted to examine common coding of addition and subtraction problems in children and adults. We found that adults exhibited significant levels of MRS between the two problem types, not only in the intra-parietal sulcus (IPS) region of the posterior parietal cortex (PPC), but also in ventral temporal-occipital, anterior temporal and dorsolateral prefrontal cortices. Relative to adults, children showed significantly reduced levels of MRS in these same regions. In contrast, no brain areas showed significantly greater MRS between problem types in children. Our findings provide novel evidence that the emergence of arithmetic problem solving skills from childhood to adulthood is characterized by maturation of common neural representations between distinct numerical operations, and involve distributed brain regions important for representing and manipulating numerical quantity. More broadly, our findings demonstrate that representational analysis provides a powerful approach for uncovering fundamental mechanisms by which children develop proficiencies that are a hallmark of human cognition. PMID:26160287

Review on solving the forward problem in EEG source analysis

PubMed Central

Hallez, Hans; Vanrumste, Bart; Grech, Roberta; Muscat, Joseph; De Clercq, Wim; Vergult, Anneleen; D'Asseler, Yves; Camilleri, Kenneth P; Fabri, Simon G; Van Huffel, Sabine; Lemahieu, Ignace

2007-01-01

Background The aim of electroencephalogram (EEG) source localization is to find the brain areas responsible for EEG waves of interest. It consists of solving forward and inverse problems. The forward problem is solved by starting from a given electrical source and calculating the potentials at the electrodes. These evaluations are necessary to solve the inverse problem which is defined as finding brain sources which are responsible for the measured potentials at the EEG electrodes. Methods While other reviews give an extensive summary of the both forward and inverse problem, this review article focuses on different aspects of solving the forward problem and it is intended for newcomers in this research field. Results It starts with focusing on the generators of the EEG: the post-synaptic potentials in the apical dendrites of pyramidal neurons. These cells generate an extracellular current which can be modeled by Poisson's differential equation, and Neumann and Dirichlet boundary conditions. The compartments in which these currents flow can be anisotropic (e.g. skull and white matter). In a three-shell spherical head model an analytical expression exists to solve the forward problem. During the last two decades researchers have tried to solve Poisson's equation in a realistically shaped head model obtained from 3D medical images, which requires numerical methods. The following methods are compared with each other: the boundary element method (BEM), the finite element method (FEM) and the finite difference method (FDM). In the last two methods anisotropic conducting compartments can conveniently be introduced. Then the focus will be set on the use of reciprocity in EEG source localization. It is introduced to speed up the forward calculations which are here performed for each electrode position rather than for each dipole position. Solving Poisson's equation utilizing FEM and FDM corresponds to solving a large sparse linear system. Iterative methods are required to solve these sparse linear systems. The following iterative methods are discussed: successive over-relaxation, conjugate gradients method and algebraic multigrid method. Conclusion Solving the forward problem has been well documented in the past decades. In the past simplified spherical head models are used, whereas nowadays a combination of imaging modalities are used to accurately describe the geometry of the head model. Efforts have been done on realistically describing the shape of the head model, as well as the heterogenity of the tissue types and realistically determining the conductivity. However, the determination and validation of the in vivo conductivity values is still an important topic in this field. In addition, more studies have to be done on the influence of all the parameters of the head model and of the numerical techniques on the solution of the forward problem. PMID:18053144

Numerical recovery of certain discontinuous electrical conductivities

NASA Technical Reports Server (NTRS)

Bryan, Kurt

1991-01-01

The inverse problem of recovering an electrical conductivity of the form Gamma(x) = 1 + (k-1)(sub Chi(D)) (Chi(D) is the characteristic function of D) on a region omega is a subset of 2-dimensional Euclid space from boundary data is considered, where D is a subset of omega and k is some positive constant. A linearization of the forward problem is formed and used in a least squares output method for approximately solving the inverse problem. Convergence results are proved and some numerical results presented.

Towards lexicographic multi-objective linear programming using grossone methodology

NASA Astrophysics Data System (ADS)

Cococcioni, Marco; Pappalardo, Massimo; Sergeyev, Yaroslav D.

2016-10-01

Lexicographic Multi-Objective Linear Programming (LMOLP) problems can be solved in two ways: preemptive and nonpreemptive. The preemptive approach requires the solution of a series of LP problems, with changing constraints (each time the next objective is added, a new constraint appears). The nonpreemptive approach is based on a scalarization of the multiple objectives into a single-objective linear function by a weighted combination of the given objectives. It requires the specification of a set of weights, which is not straightforward and can be time consuming. In this work we present both mathematical and software ingredients necessary to solve LMOLP problems using a recently introduced computational methodology (allowing one to work numerically with infinities and infinitesimals) based on the concept of grossone. The ultimate goal of such an attempt is an implementation of a simplex-like algorithm, able to solve the original LMOLP problem by solving only one single-objective problem and without the need to specify finite weights. The expected advantages are therefore obvious.

An iterative kernel based method for fourth order nonlinear equation with nonlinear boundary condition

NASA Astrophysics Data System (ADS)

Azarnavid, Babak; Parand, Kourosh; Abbasbandy, Saeid

2018-06-01

This article discusses an iterative reproducing kernel method with respect to its effectiveness and capability of solving a fourth-order boundary value problem with nonlinear boundary conditions modeling beams on elastic foundations. Since there is no method of obtaining reproducing kernel which satisfies nonlinear boundary conditions, the standard reproducing kernel methods cannot be used directly to solve boundary value problems with nonlinear boundary conditions as there is no knowledge about the existence and uniqueness of the solution. The aim of this paper is, therefore, to construct an iterative method by the use of a combination of reproducing kernel Hilbert space method and a shooting-like technique to solve the mentioned problems. Error estimation for reproducing kernel Hilbert space methods for nonlinear boundary value problems have yet to be discussed in the literature. In this paper, we present error estimation for the reproducing kernel method to solve nonlinear boundary value problems probably for the first time. Some numerical results are given out to demonstrate the applicability of the method.

Study of viscous flow about airfoils by the integro-differential method

NASA Technical Reports Server (NTRS)

Wu, J. C.; Sampath, S.

1975-01-01

An integro-differential method was used for numerically solving unsteady incompressible viscous flow problems. A computer program was prepared to solve the problem of an impulsively started 9% thick symmetric Joukowski airfoil at an angle of attack of 15 deg and a Reynolds number of 1000. Some of the results obtained for this problem were discussed and compared with related work completed previously. Two numerical procedures were used, an Alternating Direction Implicit (ADI) method and a Successive Line Relaxation (SLR) method. Generally, the ADI solution agrees well with the SLR solution and with previous results are stations away from the trailing edge. At the trailing edge station, the ADI solution differs substantially from previous results, while the vorticity profiles obtained from the SLR method there are in good qualitative agreement with previous results.

EIT image reconstruction based on a hybrid FE-EFG forward method and the complete-electrode model.

PubMed

Hadinia, M; Jafari, R; Soleimani, M

2016-06-01

This paper presents the application of the hybrid finite element-element free Galerkin (FE-EFG) method for the forward and inverse problems of electrical impedance tomography (EIT). The proposed method is based on the complete electrode model. Finite element (FE) and element-free Galerkin (EFG) methods are accurate numerical techniques. However, the FE technique has meshing task problems and the EFG method is computationally expensive. In this paper, the hybrid FE-EFG method is applied to take both advantages of FE and EFG methods, the complete electrode model of the forward problem is solved, and an iterative regularized Gauss-Newton method is adopted to solve the inverse problem. The proposed method is applied to compute Jacobian in the inverse problem. Utilizing 2D circular homogenous models, the numerical results are validated with analytical and experimental results and the performance of the hybrid FE-EFG method compared with the FE method is illustrated. Results of image reconstruction are presented for a human chest experimental phantom.

Activities: Activities to Introduce Maxima-Minima Problems.

ERIC Educational Resources Information Center

Pleacher, David

1991-01-01

Presented are student activities that involve two standard problems from geometry and calculus--the volume of a box and the bank shot on a pool table. Problem solving is emphasized as a method of inquiry and application with descriptions of the results using graphical, numerical, and physical models. (JJK)

Solving Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) using BRKGA with local search

NASA Astrophysics Data System (ADS)

Prasetyo, H.; Alfatsani, M. A.; Fauza, G.

2018-05-01

The main issue in vehicle routing problem (VRP) is finding the shortest route of product distribution from the depot to outlets to minimize total cost of distribution. Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) is one of the variants of VRP that accommodates vehicle capacity and distribution period. Since the main problem of CCVRPTW is considered a non-polynomial hard (NP-hard) problem, it requires an efficient and effective algorithm to solve the problem. This study was aimed to develop Biased Random Key Genetic Algorithm (BRKGA) that is combined with local search to solve the problem of CCVRPTW. The algorithm design was then coded by MATLAB. Using numerical test, optimum algorithm parameters were set and compared with the heuristic method and Standard BRKGA to solve a case study on soft drink distribution. Results showed that BRKGA combined with local search resulted in lower total distribution cost compared with the heuristic method. Moreover, the developed algorithm was found to be successful in increasing the performance of Standard BRKGA.

Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

NASA Astrophysics Data System (ADS)

Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

2018-02-01

In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

Numerical reconstruction of tsunami source using combined seismic, satellite and DART data

NASA Astrophysics Data System (ADS)

Krivorotko, Olga; Kabanikhin, Sergey; Marinin, Igor

2014-05-01

Recent tsunamis, for instance, in Japan (2011), in Sumatra (2004), and at the Indian coast (2004) showed that a system of producing exact and timely information about tsunamis is of a vital importance. Numerical simulation is an effective instrument for providing such information. Bottom relief characteristics and the initial perturbation data (a tsunami source) are required for the direct simulation of tsunamis. The seismic data about the source are usually obtained in a few tens of minutes after an event has occurred (the seismic waves velocity being about five hundred kilometres per minute, while the velocity of tsunami waves is less than twelve kilometres per minute). A difference in the arrival times of seismic and tsunami waves can be used when operationally refining the tsunami source parameters and modelling expected tsunami wave height on the shore. The most suitable physical models related to the tsunamis simulation are based on the shallow water equations. The problem of identification parameters of a tsunami source using additional measurements of a passing wave is called inverse tsunami problem. We investigate three different inverse problems of determining a tsunami source using three different additional data: Deep-ocean Assessment and Reporting of Tsunamis (DART) measurements, satellite wave-form images and seismic data. These problems are severely ill-posed. We apply regularization techniques to control the degree of ill-posedness such as Fourier expansion, truncated singular value decomposition, numerical regularization. The algorithm of selecting the truncated number of singular values of an inverse problem operator which is agreed with the error level in measured data is described and analyzed. In numerical experiment we used gradient methods (Landweber iteration and conjugate gradient method) for solving inverse tsunami problems. Gradient methods are based on minimizing the corresponding misfit function. To calculate the gradient of the misfit function, the adjoint problem is solved. The conservative finite-difference schemes for solving the direct and adjoint problems in the approximation of shallow water are constructed. Results of numerical experiments of the tsunami source reconstruction are presented and discussed. We show that using a combination of three different types of data allows one to increase the stability and efficiency of tsunami source reconstruction. Non-profit organization WAPMERR (World Agency of Planetary Monitoring and Earthquake Risk Reduction) in collaboration with Informap software development department developed the Integrated Tsunami Research and Information System (ITRIS) to simulate tsunami waves and earthquakes, river course changes, coastal zone floods, and risk estimates for coastal constructions at wave run-ups and earthquakes. The special scientific plug-in components are embedded in a specially developed GIS-type graphic shell for easy data retrieval, visualization and processing. This work was supported by the Russian Foundation for Basic Research (project No. 12-01-00773 'Theory and Numerical Methods for Solving Combined Inverse Problems of Mathematical Physics') and interdisciplinary project of SB RAS 14 'Inverse Problems and Applications: Theory, Algorithms, Software'.

Figurate Numbers in the Classroom.

ERIC Educational Resources Information Center

Norman, F. Alexander

1991-01-01

A series of activities involving figurate numbers that allow students at various levels to integrate numerical, geometric, arithmetic, patterning, measuring, and problem-solving skills are presented. A discussion of the geometric and numerical aspects of figurate numbers is included. Appended are IBM Logo procedures that will create pentagonal…

Wave scattering by an axisymmetric ice floe of varying thickness

NASA Astrophysics Data System (ADS)

Bennetts, Luke G.; Biggs, Nicholas R. T.; Porter, David

2009-04-01

The problem of water wave scattering by a circular ice floe, floating in fluid of finite depth, is formulated and solved numerically. Unlike previous investigations of such situations, here we allow the thickness of the floe (and the fluid depth) to vary axisymmetrically and also incorporate a realistic non-zero draught. A numerical approximation to the solution of this problem is obtained to an arbitrary degree of accuracy by combining a Rayleigh-Ritz approximation of the vertical motion with an appropriate variational principle. This numerical solution procedure builds upon the work of Bennets et al. (2007, J. Fluid Mech., 579, 413-443). As part of the numerical formulation, we utilize a Fourier cosine expansion of the azimuthal motion, resulting in a system of ordinary differential equations to solve in the radial coordinate for each azimuthal mode. The displayed results concentrate on the response of the floe rather than the scattered wave field and show that the effects of introducing the new features of varying floe thickness and a realistic draught are significant.

A multilevel correction adaptive finite element method for Kohn-Sham equation

NASA Astrophysics Data System (ADS)

Hu, Guanghui; Xie, Hehu; Xu, Fei

2018-02-01

In this paper, an adaptive finite element method is proposed for solving Kohn-Sham equation with the multilevel correction technique. In the method, the Kohn-Sham equation is solved on a fixed and appropriately coarse mesh with the finite element method in which the finite element space is kept improving by solving the derived boundary value problems on a series of adaptively and successively refined meshes. A main feature of the method is that solving large scale Kohn-Sham system is avoided effectively, and solving the derived boundary value problems can be handled efficiently by classical methods such as the multigrid method. Hence, the significant acceleration can be obtained on solving Kohn-Sham equation with the proposed multilevel correction technique. The performance of the method is examined by a variety of numerical experiments.

A new weak Galerkin finite element method for elliptic interface problems

DOE PAGES

Mu, Lin; Wang, Junping; Ye, Xiu; ...

2016-08-26

We introduce and analyze a new weak Galerkin (WG) finite element method in this paper for solving second order elliptic equations with discontinuous coefficients and interfaces. Comparing with the existing WG algorithm for solving the same type problems, the present WG method has a simpler variational formulation and fewer unknowns. Moreover, the new WG algorithm allows the use of finite element partitions consisting of general polytopal meshes and can be easily generalized to high orders. Optimal order error estimates in both H1 and L2 norms are established for the present WG finite element solutions. We conducted extensive numerical experiments inmore » order to examine the accuracy, flexibility, and robustness of the proposed WG interface approach. In solving regular elliptic interface problems, high order convergences are numerically confirmed by using piecewise polynomial basis functions of high degrees. Moreover, the WG method is shown to be able to accommodate very complicated interfaces, due to its flexibility in choosing finite element partitions. Finally, in dealing with challenging problems with low regularities, the piecewise linear WG method is capable of delivering a second order of accuracy in L∞ norm for both C1 and H2 continuous solutions.« less

A new weak Galerkin finite element method for elliptic interface problems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mu, Lin; Wang, Junping; Ye, Xiu

We introduce and analyze a new weak Galerkin (WG) finite element method in this paper for solving second order elliptic equations with discontinuous coefficients and interfaces. Comparing with the existing WG algorithm for solving the same type problems, the present WG method has a simpler variational formulation and fewer unknowns. Moreover, the new WG algorithm allows the use of finite element partitions consisting of general polytopal meshes and can be easily generalized to high orders. Optimal order error estimates in both H1 and L2 norms are established for the present WG finite element solutions. We conducted extensive numerical experiments inmore » order to examine the accuracy, flexibility, and robustness of the proposed WG interface approach. In solving regular elliptic interface problems, high order convergences are numerically confirmed by using piecewise polynomial basis functions of high degrees. Moreover, the WG method is shown to be able to accommodate very complicated interfaces, due to its flexibility in choosing finite element partitions. Finally, in dealing with challenging problems with low regularities, the piecewise linear WG method is capable of delivering a second order of accuracy in L∞ norm for both C1 and H2 continuous solutions.« less

Exact solution for an optimal impermeable parachute problem

NASA Astrophysics Data System (ADS)

Lupu, Mircea; Scheiber, Ernest

2002-10-01

In the paper there are solved direct and inverse boundary problems and analytical solutions are obtained for optimization problems in the case of some nonlinear integral operators. It is modeled the plane potential flow of an inviscid, incompressible and nonlimited fluid jet, witch encounters a symmetrical, curvilinear obstacle--the deflector of maximal drag. There are derived integral singular equations, for direct and inverse problems and the movement in the auxiliary canonical half-plane is obtained. Next, the optimization problem is solved in an analytical manner. The design of the optimal airfoil is performed and finally, numerical computations concerning the drag coefficient and other geometrical and aerodynamical parameters are carried out. This model corresponds to the Helmholtz impermeable parachute problem.

Environmental problem solving

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miller, A.

Human influences create both environmental problems and barriers to effective policy aimed at addressing those problems. In effect, environmental managers manage people as much as they manage the environment. Therefore, they must gain an understanding of the psychological and sociopolitical dimensions of environmental problems that they are attempting to resolve. The author reappraises conventional analyses of environmental problems using lessons from the psychosocial disciplines. The author combines the disciplines of ecology, political sociology and psychology to produce a more adaptive approach to problem-solving that is specifically geared toward the environmental field. Numerous case studies demonstrate the practical application of theorymore » in a way that is useful to technical and scientific professionals as well as to policymakers and planners.« less

On the numerical treatment of selected oscillatory evolutionary problems

NASA Astrophysics Data System (ADS)

Cardone, Angelamaria; Conte, Dajana; D'Ambrosio, Raffaele; Paternoster, Beatrice

2017-07-01

We focus on evolutionary problems whose qualitative behaviour is known a-priori and exploited in order to provide efficient and accurate numerical schemes. For classical numerical methods, depending on constant coefficients, the required computational effort could be quite heavy, due to the necessary employ of very small stepsizes needed to accurately reproduce the qualitative behaviour of the solution. In these situations, it may be convenient to use special purpose formulae, i.e. non-polynomially fitted formulae on basis functions adapted to the problem (see [16, 17] and references therein). We show examples of special purpose strategies to solve two families of evolutionary problems exhibiting periodic solutions, i.e. partial differential equations and Volterra integral equations.

Rank-k modification methods for recursive least squares problems

NASA Astrophysics Data System (ADS)

Olszanskyj, Serge; Lebak, James; Bojanczyk, Adam

1994-09-01

In least squares problems, it is often desired to solve the same problem repeatedly but with several rows of the data either added, deleted, or both. Methods for quickly solving a problem after adding or deleting one row of data at a time are known. In this paper we introduce fundamental rank-k updating and downdating methods and show how extensions of rank-1 downdating methods based on LINPACK, Corrected Semi-Normal Equations (CSNE), and Gram-Schmidt factorizations, as well as new rank-k downdating methods, can all be derived from these fundamental results. We then analyze the cost of each new algorithm and make comparisons tok applications of the corresponding rank-1 algorithms. We provide experimental results comparing the numerical accuracy of the various algorithms, paying particular attention to the downdating methods, due to their potential numerical difficulties for ill-conditioned problems. We then discuss the computation involved for each downdating method, measured in terms of operation counts and BLAS calls. Finally, we provide serial execution timing results for these algorithms, noting preferable points for improvement and optimization. From our experiments we conclude that the Gram-Schmidt methods perform best in terms of numerical accuracy, but may be too costly for serial execution for large problems.

Discontinuous Galerkin finite element method for solving population density functions of cortical pyramidal and thalamic neuronal populations.

PubMed

Huang, Chih-Hsu; Lin, Chou-Ching K; Ju, Ming-Shaung

2015-02-01

Compared with the Monte Carlo method, the population density method is efficient for modeling collective dynamics of neuronal populations in human brain. In this method, a population density function describes the probabilistic distribution of states of all neurons in the population and it is governed by a hyperbolic partial differential equation. In the past, the problem was mainly solved by using the finite difference method. In a previous study, a continuous Galerkin finite element method was found better than the finite difference method for solving the hyperbolic partial differential equation; however, the population density function often has discontinuity and both methods suffer from a numerical stability problem. The goal of this study is to improve the numerical stability of the solution using discontinuous Galerkin finite element method. To test the performance of the new approach, interaction of a population of cortical pyramidal neurons and a population of thalamic neurons was simulated. The numerical results showed good agreement between results of discontinuous Galerkin finite element and Monte Carlo methods. The convergence and accuracy of the solutions are excellent. The numerical stability problem could be resolved using the discontinuous Galerkin finite element method which has total-variation-diminishing property. The efficient approach will be employed to simulate the electroencephalogram or dynamics of thalamocortical network which involves three populations, namely, thalamic reticular neurons, thalamocortical neurons and cortical pyramidal neurons. Copyright © 2014 Elsevier Ltd. All rights reserved.

Eulerian Lagrangian Adaptive Fup Collocation Method for solving the conservative solute transport in heterogeneous porous media

NASA Astrophysics Data System (ADS)

Gotovac, Hrvoje; Srzic, Veljko

2014-05-01

Contaminant transport in natural aquifers is a complex, multiscale process that is frequently studied using different Eulerian, Lagrangian and hybrid numerical methods. Conservative solute transport is typically modeled using the advection-dispersion equation (ADE). Despite the large number of available numerical methods that have been developed to solve it, the accurate numerical solution of the ADE still presents formidable challenges. In particular, current numerical solutions of multidimensional advection-dominated transport in non-uniform velocity fields are affected by one or all of the following problems: numerical dispersion that introduces artificial mixing and dilution, grid orientation effects, unresolved spatial and temporal scales and unphysical numerical oscillations (e.g., Herrera et al, 2009; Bosso et al., 2012). In this work we will present Eulerian Lagrangian Adaptive Fup Collocation Method (ELAFCM) based on Fup basis functions and collocation approach for spatial approximation and explicit stabilized Runge-Kutta-Chebyshev temporal integration (public domain routine SERK2) which is especially well suited for stiff parabolic problems. Spatial adaptive strategy is based on Fup basis functions which are closely related to the wavelets and splines so that they are also compactly supported basis functions; they exactly describe algebraic polynomials and enable a multiresolution adaptive analysis (MRA). MRA is here performed via Fup Collocation Transform (FCT) so that at each time step concentration solution is decomposed using only a few significant Fup basis functions on adaptive collocation grid with appropriate scales (frequencies) and locations, a desired level of accuracy and a near minimum computational cost. FCT adds more collocations points and higher resolution levels only in sensitive zones with sharp concentration gradients, fronts and/or narrow transition zones. According to the our recent achievements there is no need for solving the large linear system on adaptive grid because each Fup coefficient is obtained by predefined formulas equalizing Fup expansion around corresponding collocation point and particular collocation operator based on few surrounding solution values. Furthermore, each Fup coefficient can be obtained independently which is perfectly suited for parallel processing. Adaptive grid in each time step is obtained from solution of the last time step or initial conditions and advective Lagrangian step in the current time step according to the velocity field and continuous streamlines. On the other side, we implement explicit stabilized routine SERK2 for dispersive Eulerian part of solution in the current time step on obtained spatial adaptive grid. Overall adaptive concept does not require the solving of large linear systems for the spatial and temporal approximation of conservative transport. Also, this new Eulerian-Lagrangian-Collocation scheme resolves all mentioned numerical problems due to its adaptive nature and ability to control numerical errors in space and time. Proposed method solves advection in Lagrangian way eliminating problems in Eulerian methods, while optimal collocation grid efficiently describes solution and boundary conditions eliminating usage of large number of particles and other problems in Lagrangian methods. Finally, numerical tests show that this approach enables not only accurate velocity field, but also conservative transport even in highly heterogeneous porous media resolving all spatial and temporal scales of concentration field.

Generalized Lagrange Jacobi Gauss-Lobatto (GLJGL) Collocation Method for Solving Linear and Nonlinear Fokker-Planck Equations

NASA Astrophysics Data System (ADS)

Parand, K.; Latifi, S.; Moayeri, M. M.; Delkhosh, M.

2018-05-01

In this study, we have constructed a new numerical approach for solving the time-dependent linear and nonlinear Fokker-Planck equations. In fact, we have discretized the time variable with Crank-Nicolson method and for the space variable, a numerical method based on Generalized Lagrange Jacobi Gauss-Lobatto (GLJGL) collocation method is applied. It leads to in solving the equation in a series of time steps and at each time step, the problem is reduced to a problem consisting of a system of algebraic equations that greatly simplifies the problem. One can observe that the proposed method is simple and accurate. Indeed, one of its merits is that it is derivative-free and by proposing a formula for derivative matrices, the difficulty aroused in calculation is overcome, along with that it does not need to calculate the General Lagrange basis and matrices; they have Kronecker property. Linear and nonlinear Fokker-Planck equations are given as examples and the results amply demonstrate that the presented method is very valid, effective, reliable and does not require any restrictive assumptions for nonlinear terms.

Role of beliefs and emotions in numerical problem solving in university physics education

NASA Astrophysics Data System (ADS)

Bodin, Madelen; Winberg, Mikael

2012-06-01

Numerical problem solving in classical mechanics in university physics education offers a learning situation where students have many possibilities of control and creativity. In this study, expertlike beliefs about physics and learning physics together with prior knowledge were the most important predictors of the quality of performance of a task with many degrees of freedom. Feelings corresponding to control and concentration, i.e., emotions that are expected to trigger students’ intrinsic motivation, were also important in predicting performance. Unexpectedly, intrinsic motivation, as indicated by enjoyment and interest, together with students’ personal interest and utility value beliefs did not predict performance. This indicates that although a certain degree of enjoyment is probably necessary, motivated behavior is rather regulated by integration and identification of expertlike beliefs about learning and are more strongly associated with concentration and control during learning and, ultimately, with high performance. The results suggest that the development of students’ epistemological beliefs is important for students’ ability to learn from realistic problem-solving situations with many degrees of freedom in physics education.

A comparison of numerical methods for the prediction of two-dimensional heat transfer in an electrothermal deicer pad. M.S. Thesis. Final Contractor Report

NASA Technical Reports Server (NTRS)

Wright, William B.

1988-01-01

Transient, numerical simulations of the deicing of composite aircraft components by electrothermal heating have been performed in a 2-D rectangular geometry. Seven numerical schemes and four solution methods were used to find the most efficient numerical procedure for this problem. The phase change in the ice was simulated using the Enthalpy method along with the Method for Assumed States. Numerical solutions illustrating deicer performance for various conditions are presented. Comparisons are made with previous numerical models and with experimental data. The simulation can also be used to solve a variety of other heat conduction problems involving composite bodies.

Invisibility problem in acoustics, electromagnetism and heat transfer. Inverse design method

NASA Astrophysics Data System (ADS)

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.

Enabling fast, stable and accurate peridynamic computations using multi-time-step integration

DOE PAGES

Lindsay, P.; Parks, M. L.; Prakash, A.

2016-04-13

Peridynamics is a nonlocal extension of classical continuum mechanics that is well-suited for solving problems with discontinuities such as cracks. This paper extends the peridynamic formulation to decompose a problem domain into a number of smaller overlapping subdomains and to enable the use of different time steps in different subdomains. This approach allows regions of interest to be isolated and solved at a small time step for increased accuracy while the rest of the problem domain can be solved at a larger time step for greater computational efficiency. Lastly, performance of the proposed method in terms of stability, accuracy, andmore » computational cost is examined and several numerical examples are presented to corroborate the findings.« less

Brain organization underlying superior mathematical abilities in children with autism.

PubMed

Iuculano, Teresa; Rosenberg-Lee, Miriam; Supekar, Kaustubh; Lynch, Charles J; Khouzam, Amirah; Phillips, Jennifer; Uddin, Lucina Q; Menon, Vinod

2014-02-01

Autism spectrum disorder (ASD) is a neurodevelopmental disorder characterized by social and communication deficits. While such deficits have been the focus of most research, recent evidence suggests that individuals with ASD may exhibit cognitive strengths in domains such as mathematics. Cognitive assessments and functional brain imaging were used to investigate mathematical abilities in 18 children with ASD and 18 age-, gender-, and IQ-matched typically developing (TD) children. Multivariate classification and regression analyses were used to investigate whether brain activity patterns during numerical problem solving were significantly different between the groups and predictive of individual mathematical abilities. Children with ASD showed better numerical problem solving abilities and relied on sophisticated decomposition strategies for single-digit addition problems more frequently than TD peers. Although children with ASD engaged similar brain areas as TD children, they showed different multivariate activation patterns related to arithmetic problem complexity in ventral temporal-occipital cortex, posterior parietal cortex, and medial temporal lobe. Furthermore, multivariate activation patterns in ventral temporal-occipital cortical areas typically associated with face processing predicted individual numerical problem solving abilities in children with ASD but not in TD children. Our study suggests that superior mathematical information processing in children with ASD is characterized by a unique pattern of brain organization and that cortical regions typically involved in perceptual expertise may be utilized in novel ways in ASD. Our findings of enhanced cognitive and neural resources for mathematics have critical implications for educational, professional, and social outcomes for individuals with this lifelong disorder. Copyright © 2014 Society of Biological Psychiatry. Published by Elsevier Inc. All rights reserved.

Numerical Problem Solving Using Mathcad in Undergraduate Reaction Engineering

ERIC Educational Resources Information Center

Parulekar, Satish J.

2006-01-01

Experience in using a user-friendly software, Mathcad, in the undergraduate chemical reaction engineering course is discussed. Example problems considered for illustration deal with simultaneous solution of linear algebraic equations (kinetic parameter estimation), nonlinear algebraic equations (equilibrium calculations for multiple reactions and…

Computational experiments in the optimal slewing of flexible structures

NASA Technical Reports Server (NTRS)

Baker, T. E.; Polak, Lucian Elijah

1989-01-01

Numerical experiments on the problem of moving a flexible beam are discussed. An optimal control problem is formulated and transcribed into a form which can be solved using semi-infinite optimization techniques. All experiments were carried out on a SUN 3 microcomputer.

Performance of Grey Wolf Optimizer on large scale problems

NASA Astrophysics Data System (ADS)

Gupta, Shubham; Deep, Kusum

2017-01-01

For solving nonlinear continuous problems of optimization numerous nature inspired optimization techniques are being proposed in literature which can be implemented to solve real life problems wherein the conventional techniques cannot be applied. Grey Wolf Optimizer is one of such technique which is gaining popularity since the last two years. The objective of this paper is to investigate the performance of Grey Wolf Optimization Algorithm on large scale optimization problems. The Algorithm is implemented on 5 common scalable problems appearing in literature namely Sphere, Rosenbrock, Rastrigin, Ackley and Griewank Functions. The dimensions of these problems are varied from 50 to 1000. The results indicate that Grey Wolf Optimizer is a powerful nature inspired Optimization Algorithm for large scale problems, except Rosenbrock which is a unimodal function.

A systematic approach to numerical dispersion in Maxwell solvers

NASA Astrophysics Data System (ADS)

Blinne, Alexander; Schinkel, David; Kuschel, Stephan; Elkina, Nina; Rykovanov, Sergey G.; Zepf, Matt

2018-03-01

The finite-difference time-domain (FDTD) method is a well established method for solving the time evolution of Maxwell's equations. Unfortunately the scheme introduces numerical dispersion and therefore phase and group velocities which deviate from the correct values. The solution to Maxwell's equations in more than one dimension results in non-physical predictions such as numerical dispersion or numerical Cherenkov radiation emitted by a relativistic electron beam propagating in vacuum. Improved solvers, which keep the staggered Yee-type grid for electric and magnetic fields, generally modify the spatial derivative operator in the Maxwell-Faraday equation by increasing the computational stencil. These modified solvers can be characterized by different sets of coefficients, leading to different dispersion properties. In this work we introduce a norm function to rewrite the choice of coefficients into a minimization problem. We solve this problem numerically and show that the minimization procedure leads to phase and group velocities that are considerably closer to c as compared to schemes with manually set coefficients available in the literature. Depending on a specific problem at hand (e.g. electron beam propagation in plasma, high-order harmonic generation from plasma surfaces, etc.), the norm function can be chosen accordingly, for example, to minimize the numerical dispersion in a certain given propagation direction. Particle-in-cell simulations of an electron beam propagating in vacuum using our solver are provided.

Multigrid method based on the transformation-free HOC scheme on nonuniform grids for 2D convection diffusion problems

NASA Astrophysics Data System (ADS)

Ge, Yongbin; Cao, Fujun

2011-05-01

In this paper, a multigrid method based on the high order compact (HOC) difference scheme on nonuniform grids, which has been proposed by Kalita et al. [J.C. Kalita, A.K. Dass, D.C. Dalal, A transformation-free HOC scheme for steady convection-diffusion on non-uniform grids, Int. J. Numer. Methods Fluids 44 (2004) 33-53], is proposed to solve the two-dimensional (2D) convection diffusion equation. The HOC scheme is not involved in any grid transformation to map the nonuniform grids to uniform grids, consequently, the multigrid method is brand-new for solving the discrete system arising from the difference equation on nonuniform grids. The corresponding multigrid projection and interpolation operators are constructed by the area ratio. Some boundary layer and local singularity problems are used to demonstrate the superiority of the present method. Numerical results show that the multigrid method with the HOC scheme on nonuniform grids almost gets as equally efficient convergence rate as on uniform grids and the computed solution on nonuniform grids retains fourth order accuracy while on uniform grids just gets very poor solution for very steep boundary layer or high local singularity problems. The present method is also applied to solve the 2D incompressible Navier-Stokes equations using the stream function-vorticity formulation and the numerical solutions of the lid-driven cavity flow problem are obtained and compared with solutions available in the literature.

BOOK REVIEW: Advanced Topics in Computational Partial Differential Equations: Numerical Methods and Diffpack Programming

NASA Astrophysics Data System (ADS)

Katsaounis, T. D.

2005-02-01

The scope of this book is to present well known simple and advanced numerical methods for solving partial differential equations (PDEs) and how to implement these methods using the programming environment of the software package Diffpack. A basic background in PDEs and numerical methods is required by the potential reader. Further, a basic knowledge of the finite element method and its implementation in one and two space dimensions is required. The authors claim that no prior knowledge of the package Diffpack is required, which is true, but the reader should be at least familiar with an object oriented programming language like C++ in order to better comprehend the programming environment of Diffpack. Certainly, a prior knowledge or usage of Diffpack would be a great advantage to the reader. The book consists of 15 chapters, each one written by one or more authors. Each chapter is basically divided into two parts: the first part is about mathematical models described by PDEs and numerical methods to solve these models and the second part describes how to implement the numerical methods using the programming environment of Diffpack. Each chapter closes with a list of references on its subject. The first nine chapters cover well known numerical methods for solving the basic types of PDEs. Further, programming techniques on the serial as well as on the parallel implementation of numerical methods are also included in these chapters. The last five chapters are dedicated to applications, modelled by PDEs, in a variety of fields. The first chapter is an introduction to parallel processing. It covers fundamentals of parallel processing in a simple and concrete way and no prior knowledge of the subject is required. Examples of parallel implementation of basic linear algebra operations are presented using the Message Passing Interface (MPI) programming environment. Here, some knowledge of MPI routines is required by the reader. Examples solving in parallel simple PDEs using Diffpack and MPI are also presented. Chapter 2 presents the overlapping domain decomposition method for solving PDEs. It is well known that these methods are suitable for parallel processing. The first part of the chapter covers the mathematical formulation of the method as well as algorithmic and implementational issues. The second part presents a serial and a parallel implementational framework within the programming environment of Diffpack. The chapter closes by showing how to solve two application examples with the overlapping domain decomposition method using Diffpack. Chapter 3 is a tutorial about how to incorporate the multigrid solver in Diffpack. The method is illustrated by examples such as a Poisson solver, a general elliptic problem with various types of boundary conditions and a nonlinear Poisson type problem. In chapter 4 the mixed finite element is introduced. Technical issues concerning the practical implementation of the method are also presented. The main difficulties of the efficient implementation of the method, especially in two and three space dimensions on unstructured grids, are presented and addressed in the framework of Diffpack. The implementational process is illustrated by two examples, namely the system formulation of the Poisson problem and the Stokes problem. Chapter 5 is closely related to chapter 4 and addresses the problem of how to solve efficiently the linear systems arising by the application of the mixed finite element method. The proposed method is block preconditioning. Efficient techniques for implementing the method within Diffpack are presented. Optimal block preconditioners are used to solve the system formulation of the Poisson problem, the Stokes problem and the bidomain model for the electrical activity in the heart. The subject of chapter 6 is systems of PDEs. Linear and nonlinear systems are discussed. Fully implicit and operator splitting methods are presented. Special attention is paid to how existing solvers for scalar equations in Diffpack can be used to derive fully implicit solvers for systems. The proposed techniques are illustrated in terms of two applications, namely a system of PDEs modelling pipeflow and a two-phase porous media flow. Stochastic PDEs is the topic of chapter 7. The first part of the chapter is a simple introduction to stochastic PDEs; basic analytical properties are presented for simple models like transport phenomena and viscous drag forces. The second part considers the numerical solution of stochastic PDEs. Two basic techniques are presented, namely Monte Carlo and perturbation methods. The last part explains how to implement and incorporate these solvers into Diffpack. Chapter 8 describes how to operate Diffpack from Python scripts. The main goal here is to provide all the programming and technical details in order to glue the programming environment of Diffpack with visualization packages through Python and in general take advantage of the Python interfaces. Chapter 9 attempts to show how to use numerical experiments to measure the performance of various PDE solvers. The authors gathered a rather impressive list, a total of 14 PDE solvers. Solvers for problems like Poisson, Navier--Stokes, elasticity, two-phase flows and methods such as finite difference, finite element, multigrid, and gradient type methods are presented. The authors provide a series of numerical results combining various solvers with various methods in order to gain insight into their computational performance and efficiency. In Chapter 10 the authors consider a computationally challenging problem, namely the computation of the electrical activity of the human heart. After a brief introduction on the biology of the problem the authors present the mathematical models involved and a numerical method for solving them within the framework of Diffpack. Chapter 11 and 12 are closely related; actually they could have been combined in a single chapter. Chapter 11 introduces several mathematical models used in finance, based on the Black--Scholes equation. Chapter 12 considers several numerical methods like Monte Carlo, lattice methods, finite difference and finite element methods. Implementation of these methods within Diffpack is presented in the last part of the chapter. Chapter 13 presents how the finite element method is used for the modelling and analysis of elastic structures. The authors describe the structural elements of Diffpack which include popular elements such as beams and plates and examples are presented on how to use them to simulate elastic structures. Chapter 14 describes an application problem, namely the extrusion of aluminum. This is a rather\\endcolumn complicated process which involves non-Newtonian flow, heat transfer and elasticity. The authors describe the systems of PDEs modelling the underlying process and use a finite element method to obtain a numerical solution. The implementation of the numerical method in Diffpack is presented along with some applications. The last chapter, chapter 15, focuses on mathematical and numerical models of systems of PDEs governing geological processes in sedimentary basins. The underlying mathematical model is solved using the finite element method within a fully implicit scheme. The authors discuss the implementational issues involved within Diffpack and they present results from several examples. In summary, the book focuses on the computational and implementational issues involved in solving partial differential equations. The potential reader should have a basic knowledge of PDEs and the finite difference and finite element methods. The examples presented are solved within the programming framework of Diffpack and the reader should have prior experience with the particular software in order to take full advantage of the book. Overall the book is well written, the subject of each chapter is well presented and can serve as a reference for graduate students, researchers and engineers who are interested in the numerical solution of partial differential equations modelling various applications.

Application of the perturbation iteration method to boundary layer type problems.

PubMed

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.

Prediction of Sound Waves Propagating Through a Nozzle Without/With a Shock Wave Using the Space-Time CE/SE Method

NASA Technical Reports Server (NTRS)

Wang, Xiao-Yen; Chang, Sin-Chung; Jorgenson, Philip C. E.

2000-01-01

The benchmark problems in Category 1 (Internal Propagation) of the third Computational Aeroacoustics (CAA) Work-shop sponsored by NASA Glenn Research Center are solved using the space-time conservation element and solution element (CE/SE) method. The first problem addresses the propagation of sound waves through a nearly choked transonic nozzle. The second one concerns shock-sound interaction in a supersonic nozzle. A quasi one-dimension CE/SE Euler solver for a nonuniform mesh is developed and employed to solve both problems. Numerical solutions are compared with the analytical solution for both problems. It is demonstrated that the CE/SE method is capable of solving aeroacoustic problems with/without shock waves in a simple way. Furthermore, the simple nonreflecting boundary condition used in the CE/SE method which is not based on the characteristic theory works very well.

Solution of the radiative transfer equation for Rayleigh scattering using the infinite medium Green's function

NASA Astrophysics Data System (ADS)

Biçer, M.; Kaşkaş, A.

2018-03-01

The infinite medium Green's function is used to solve the half-space albedo, slab albedo and Milne problems for the unpolarized Rayleigh scattering case; these problems are the most classical problems of radiative transfer theory. The numerical results are obtained and are compared with previous ones.

Monotonic Derivative Correction for Calculation of Supersonic Flows

ERIC Educational Resources Information Center

Bulat, Pavel V.; Volkov, Konstantin N.

2016-01-01

Aim of the study: This study examines numerical methods for solving the problems in gas dynamics, which are based on an exact or approximate solution to the problem of breakdown of an arbitrary discontinuity (the Riemann problem). Results: Comparative analysis of finite difference schemes for the Euler equations integration is conducted on the…

Some Effects of Distractions in Nonverbal Mathematical Problems

ERIC Educational Resources Information Center

Bana, J. P.; Nelson, D.

1977-01-01

The central purpose of this study was to investigate the effects of distractions in nonverbal problems on the problem solving behavior and performance of young children (grades 1-3) in 6 schools (N=360). Results indicated 66 percent of the subjects were distracted by irrelevant spatial-numerical or color attribute uses. (JC)

Exploring New Physics Frontiers Through Numerical Relativity.

PubMed

Cardoso, Vitor; Gualtieri, Leonardo; Herdeiro, Carlos; Sperhake, Ulrich

2015-01-01

The demand to obtain answers to highly complex problems within strong-field gravity has been met with significant progress in the numerical solution of Einstein's equations - along with some spectacular results - in various setups. We review techniques for solving Einstein's equations in generic spacetimes, focusing on fully nonlinear evolutions but also on how to benchmark those results with perturbative approaches. The results address problems in high-energy physics, holography, mathematical physics, fundamental physics, astrophysics and cosmology.

An accurate boundary element method for the exterior elastic scattering problem in two dimensions

NASA Astrophysics Data System (ADS)

Bao, Gang; Xu, Liwei; Yin, Tao

2017-11-01

This paper is concerned with a Galerkin boundary element method solving the two dimensional exterior elastic wave scattering problem. The original problem is first reduced to the so-called Burton-Miller [1] boundary integral formulation, and essential mathematical features of its variational form are discussed. In numerical implementations, a newly-derived and analytically accurate regularization formula [2] is employed for the numerical evaluation of hyper-singular boundary integral operator. A new computational approach is employed based on the series expansions of Hankel functions for the computation of weakly-singular boundary integral operators during the reduction of corresponding Galerkin equations into a discrete linear system. The effectiveness of proposed numerical methods is demonstrated using several numerical examples.

An unstaggered central scheme on nonuniform grids for the simulation of a compressible two-phase flow model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Touma, Rony; Zeidan, Dia

In this paper we extend a central finite volume method on nonuniform grids to the case of drift-flux two-phase flow problems. The numerical base scheme is an unstaggered, non oscillatory, second-order accurate finite volume scheme that evolves a piecewise linear numerical solution on a single grid and uses dual cells intermediately while updating the numerical solution to avoid the resolution of the Riemann problems arising at the cell interfaces. We then apply the numerical scheme and solve a classical drift-flux problem. The obtained results are in good agreement with corresponding ones appearing in the recent literature, thus confirming the potentialmore » of the proposed scheme.« less

A homotopy method based on WENO schemes for solving steady state problems of hyperbolic conservation laws

DTIC Science & Technology

2012-09-03

prac- tice to solve these initial value problems. Additionally, the predictor / corrector methods are combined with adaptive stepsize and adaptive ...for implementing a numerical path tracking algorithm is to decide which predictor / corrector method to employ, how large to take the step ∆t, and what...the endgame algorithm . Output: A steady state solution Set ǫ = 1 while ǫ >= ǫend do set the stepsize ∆ǫ by using adaptive stepsize control algorithm

The method of space-time conservation element and solution element-applications to one-dimensional and two-dimensional time-marching flow problems

NASA Technical Reports Server (NTRS)

Chang, Sin-Chung; Wang, Xiao-Yen; Chow, Chuen-Yen

1995-01-01

A nontraditional numerical method for solving conservation laws is being developed. The new method is designed from a physicist's perspective, i.e., its development is based more on physics than numerics. Even though it uses only the simplest approximation techniques, a 2D time-marching Euler solver developed recently using the new method is capable of generating nearly perfect solutions for a 2D shock reflection problem used by Helen Yee and others. Moreover, a recent application of this solver to computational aeroacoustics (CAA) problems reveals that: (1) accuracy of its results is comparable to that of a 6th order compact difference scheme even though nominally the current solver is only of 2nd-order accuracy; (2) generally, the non-reflecting boundary condition can be implemented in a simple way without involving characteristic variables; and (3) most importantly, the current solver is capable of handling both continuous and discontinuous flows very well and thus provides a unique numerical tool for solving those flow problems where the interactions between sound waves and shocks are important, such as the noise field around a supersonic over- or under-expansion jet.

A parametric finite element method for solid-state dewetting problems with anisotropic surface energies

NASA Astrophysics Data System (ADS)

Bao, Weizhu; Jiang, Wei; Wang, Yan; Zhao, Quan

2017-02-01

We propose an efficient and accurate parametric finite element method (PFEM) for solving sharp-interface continuum models for solid-state dewetting of thin films with anisotropic surface energies. The governing equations of the sharp-interface models belong to a new type of high-order (4th- or 6th-order) geometric evolution partial differential equations about open curve/surface interface tracking problems which include anisotropic surface diffusion flow and contact line migration. Compared to the traditional methods (e.g., marker-particle methods), the proposed PFEM not only has very good accuracy, but also poses very mild restrictions on the numerical stability, and thus it has significant advantages for solving this type of open curve evolution problems with applications in the simulation of solid-state dewetting. Extensive numerical results are reported to demonstrate the accuracy and high efficiency of the proposed PFEM.

Traffic Flow Density Distribution Based on FEM

NASA Astrophysics Data System (ADS)

Ma, Jing; Cui, Jianming

In analysis of normal traffic flow, it usually uses the static or dynamic model to numerical analyze based on fluid mechanics. However, in such handling process, the problem of massive modeling and data handling exist, and the accuracy is not high. Finite Element Method (FEM) is a production which is developed from the combination of a modern mathematics, mathematics and computer technology, and it has been widely applied in various domain such as engineering. Based on existing theory of traffic flow, ITS and the development of FEM, a simulation theory of the FEM that solves the problems existing in traffic flow is put forward. Based on this theory, using the existing Finite Element Analysis (FEA) software, the traffic flow is simulated analyzed with fluid mechanics and the dynamics. Massive data processing problem of manually modeling and numerical analysis is solved, and the authenticity of simulation is enhanced.

Research in progress in applied mathematics, numerical analysis, and computer science

NASA Technical Reports Server (NTRS)

1990-01-01

Research conducted at the Institute in Science and Engineering in applied mathematics, numerical analysis, and computer science is summarized. The Institute conducts unclassified basic research in applied mathematics in order to extend and improve problem solving capabilities in science and engineering, particularly in aeronautics and space.

A comparative study of four major approaches to predicting ATES performance

NASA Astrophysics Data System (ADS)

Doughty, C.; Buscheck, T. A.; Bodvarsson, G. S.; Tsang, C. F.

1982-09-01

The International Energy Agency test problem involving Aquifer Thermal Energy Storage was solved using four approaches: the numerical model PF (formerly CCC), the simpler numerical model SFM, and two graphical characterization schemes. Each of the four techniques, with the advantages and disadvantages of each, are discussed.

Novel methods for Solving Economic Dispatch of Security-Constrained Unit Commitment Based on Linear Programming

NASA Astrophysics Data System (ADS)

Guo, Sangang

2017-09-01

There are two stages in solving security-constrained unit commitment problems (SCUC) within Lagrangian framework: one is to obtain feasible units’ states (UC), the other is power economic dispatch (ED) for each unit. The accurate solution of ED is more important for enhancing the efficiency of the solution to SCUC for the fixed feasible units’ statues. Two novel methods named after Convex Combinatorial Coefficient Method and Power Increment Method respectively based on linear programming problem for solving ED are proposed by the piecewise linear approximation to the nonlinear convex fuel cost functions. Numerical testing results show that the methods are effective and efficient.

A numerical scheme to solve unstable boundary value problems

NASA Technical Reports Server (NTRS)

Kalnay Derivas, E.

1975-01-01

A new iterative scheme for solving boundary value problems is presented. It consists of the introduction of an artificial time dependence into a modified version of the system of equations. Then explicit forward integrations in time are followed by explicit integrations backwards in time. The method converges under much more general conditions than schemes based in forward time integrations (false transient schemes). In particular it can attain a steady state solution of an elliptical system of equations even if the solution is unstable, in which case other iterative schemes fail to converge. The simplicity of its use makes it attractive for solving large systems of nonlinear equations.

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

PubMed

Turovets, Sergei; Volkov, Vasily; Zherdetsky, Aleksej; Prakonina, Alena; Malony, Allen D

2014-01-01

The Electrical Impedance Tomography (EIT) and electroencephalography (EEG) forward problems in anisotropic inhomogeneous media like the human head belongs to the class of the three-dimensional boundary value problems for elliptic equations with mixed derivatives. We introduce and explore the performance of several new promising numerical techniques, which seem to be more suitable for solving these problems. The proposed numerical schemes combine the fictitious domain approach together with the finite-difference method and the optimally preconditioned Conjugate Gradient- (CG-) type iterative method for treatment of the discrete model. The numerical scheme includes the standard operations of summation and multiplication of sparse matrices and vector, as well as FFT, making it easy to implement and eligible for the effective parallel implementation. Some typical use cases for the EIT/EEG problems are considered demonstrating high efficiency of the proposed numerical technique.

Error behavior of multistep methods applied to unstable differential systems

NASA Technical Reports Server (NTRS)

Brown, R. L.

1977-01-01

The problem of modeling a dynamic system described by a system of ordinary differential equations which has unstable components for limited periods of time is discussed. It is shown that the global error in a multistep numerical method is the solution to a difference equation initial value problem, and the approximate solution is given for several popular multistep integration formulas. Inspection of the solution leads to the formulation of four criteria for integrators appropriate to unstable problems. A sample problem is solved numerically using three popular formulas and two different stepsizes to illustrate the appropriateness of the criteria.

Analysis of the incomplete Galerkin method for modelling of smoothly-irregular transition between planar waveguides

NASA Astrophysics Data System (ADS)

Divakov, D.; Sevastianov, L.; Nikolaev, N.

2017-01-01

The paper deals with a numerical solution of the problem of waveguide propagation of polarized light in smoothly-irregular transition between closed regular waveguides using the incomplete Galerkin method. This method consists in replacement of variables in the problem of reduction of the Helmholtz equation to the system of differential equations by the Kantorovich method and in formulation of the boundary conditions for the resulting system. The formulation of the boundary problem for the ODE system is realized in computer algebra system Maple. The stated boundary problem is solved using Maples libraries of numerical methods.

A feasible DY conjugate gradient method for linear equality constraints

NASA Astrophysics Data System (ADS)

LI, Can

2017-09-01

In this paper, we propose a feasible conjugate gradient method for solving linear equality constrained optimization problem. The method is an extension of the Dai-Yuan conjugate gradient method proposed by Dai and Yuan to linear equality constrained optimization problem. It can be applied to solve large linear equality constrained problem due to lower storage requirement. An attractive property of the method is that the generated direction is always feasible and descent direction. Under mild conditions, the global convergence of the proposed method with exact line search is established. Numerical experiments are also given which show the efficiency of the method.

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jeff Linderoth

2011-11-06

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

Multiscale global identification of porous structures

NASA Astrophysics Data System (ADS)

Hatłas, Marcin; Beluch, Witold

2018-01-01

The paper is devoted to the evolutionary identification of the material constants of porous structures based on measurements conducted on a macro scale. Numerical homogenization with the RVE concept is used to determine the equivalent properties of a macroscopically homogeneous material. Finite element method software is applied to solve the boundary-value problem in both scales. Global optimization methods in form of evolutionary algorithm are employed to solve the identification task. Modal analysis is performed to collect the data necessary for the identification. A numerical example presenting the effectiveness of proposed attitude is attached.

Numerical simulation of electromagnetic waves in Schwarzschild space-time by finite difference time domain method and Green function method

NASA Astrophysics Data System (ADS)

Jia, Shouqing; La, Dongsheng; Ma, Xuelian

2018-04-01

The finite difference time domain (FDTD) algorithm and Green function algorithm are implemented into the numerical simulation of electromagnetic waves in Schwarzschild space-time. FDTD method in curved space-time is developed by filling the flat space-time with an equivalent medium. Green function in curved space-time is obtained by solving transport equations. Simulation results validate both the FDTD code and Green function code. The methods developed in this paper offer a tool to solve electromagnetic scattering problems.

A Comparison of Some Difference Schemes for a Parabolic Problem of Zero-Coupon Bond Pricing

NASA Astrophysics Data System (ADS)

Chernogorova, Tatiana; Vulkov, Lubin

2009-11-01

This paper describes a comparison of some numerical methods for solving a convection-diffusion equation subjected by dynamical boundary conditions which arises in the zero-coupon bond pricing. The one-dimensional convection-diffusion equation is solved by using difference schemes with weights including standard difference schemes as the monotone Samarskii's scheme, FTCS and Crank-Nicolson methods. The schemes are free of spurious oscillations and satisfy the positivity and maximum principle as demanded for the financial and diffusive solution. Numerical results are compared with analytical solutions.

A family of conjugate gradient methods for large-scale nonlinear equations.

PubMed

Feng, Dexiang; Sun, Min; Wang, Xueyong

2017-01-01

In this paper, we present a family of conjugate gradient projection methods for solving large-scale nonlinear equations. At each iteration, it needs low storage and the subproblem can be easily solved. Compared with the existing solution methods for solving the problem, its global convergence is established without the restriction of the Lipschitz continuity on the underlying mapping. Preliminary numerical results are reported to show the efficiency of the proposed method.

Optimal Power Flow in Multiphase Radial Networks with Delta Connections: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao, Changhong; Dall-Anese, Emiliano; Low, Steven H.

This paper focuses on multiphase radial distribution networks with mixed wye and delta connections, and proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem. Two multiphase power-flow models are developed to facilitate the integration of delta-connected generation units/loads in the OPF problem. The first model extends traditional branch flow models - and it is referred to as extended branch flow model (EBFM). The second model leverages a linear relationship between per-phase power injections and delta connections, which holds under a balanced voltage approximation (BVA). Based on these models, pertinent OPF problems are formulated and relaxed to semidefinitemore » programs (SDPs). Numerical studies on IEEE test feeders show that SDP relaxations can be solved efficiently by a generic optimization solver. Numerical evidences indicate that solving the resultant SDP under BVA is faster than under EBFM. Moreover, both SDP solutions are numerically exact with respect to voltages and branch flows. It is also shown that the SDP solution under BVA has a small optimality gap, while the BVA model is accurate in the sense that it reflects actual system voltages.« less

Numerical solution of a conspicuous consumption model with constant control delay☆

PubMed Central

Huschto, Tony; Feichtinger, Gustav; Hartl, Richard F.; Kort, Peter M.; Sager, Sebastian; Seidl, Andrea

2011-01-01

We derive optimal pricing strategies for conspicuous consumption products in periods of recession. To that end, we formulate and investigate a two-stage economic optimal control problem that takes uncertainty of the recession period length and delay effects of the pricing strategy into account. This non-standard optimal control problem is difficult to solve analytically, and solutions depend on the variable model parameters. Therefore, we use a numerical result-driven approach. We propose a structure-exploiting direct method for optimal control to solve this challenging optimization problem. In particular, we discretize the uncertainties in the model formulation by using scenario trees and target the control delays by introduction of slack control functions. Numerical results illustrate the validity of our approach and show the impact of uncertainties and delay effects on optimal economic strategies. During the recession, delayed optimal prices are higher than the non-delayed ones. In the normal economic period, however, this effect is reversed and optimal prices with a delayed impact are smaller compared to the non-delayed case. PMID:22267871

Comparative study of numerical schemes of TVD3, UNO3-ACM and optimized compact scheme

NASA Technical Reports Server (NTRS)

Lee, Duck-Joo; Hwang, Chang-Jeon; Ko, Duck-Kon; Kim, Jae-Wook

1995-01-01

Three different schemes are employed to solve the benchmark problem. The first one is a conventional TVD-MUSCL (Monotone Upwind Schemes for Conservation Laws) scheme. The second scheme is a UNO3-ACM (Uniformly Non-Oscillatory Artificial Compression Method) scheme. The third scheme is an optimized compact finite difference scheme modified by us: the 4th order Runge Kutta time stepping, the 4th order pentadiagonal compact spatial discretization with the maximum resolution characteristics. The problems of category 1 are solved by using the second (UNO3-ACM) and third (Optimized Compact) schemes. The problems of category 2 are solved by using the first (TVD3) and second (UNO3-ACM) schemes. The problem of category 5 is solved by using the first (TVD3) scheme. It can be concluded from the present calculations that the Optimized Compact scheme and the UN03-ACM show good resolutions for category 1 and category 2 respectively.

A comparative study of diffraction of shallow-water waves by high-level IGN and GN equations

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao, B.B.; Ertekin, R.C.; College of Shipbuilding Engineering, Harbin Engineering University, 150001 Harbin

2015-02-15

This work is on the nonlinear diffraction analysis of shallow-water waves, impinging on submerged obstacles, by two related theories, namely the classical Green–Naghdi (GN) equations and the Irrotational Green–Naghdi (IGN) equations, both sets of equations being at high levels and derived for incompressible and inviscid flows. Recently, the high-level Green–Naghdi equations have been applied to some wave transformation problems. The high-level IGN equations have also been used in the last decade to study certain wave propagation problems. However, past works on these theories used different numerical methods to solve these nonlinear and unsteady sets of differential equations and at differentmore » levels. Moreover, different physical problems have been solved in the past. Therefore, it has not been possible to understand the differences produced by these two sets of theories and their range of applicability so far. We are thus motivated to make a direct comparison of the results produced by these theories by use of the same numerical method to solve physically the same wave diffraction problems. We focus on comparing these two theories by using similar codes; only the equations used are different but other parts of the codes, such as the wave-maker, damping zone, discretion method, matrix solver, etc., are exactly the same. This way, we eliminate many potential sources of differences that could be produced by the solution of different equations. The physical problems include the presence of various submerged obstacles that can be used for example as breakwaters or to represent the continental shelf. A numerical wave tank is created by placing a wavemaker on one end and a wave absorbing beach on the other. The nonlinear and unsteady sets of differential equations are solved by the finite-difference method. The results are compared with different equations as well as with the available experimental data.« less

A comparative study of diffraction of shallow-water waves by high-level IGN and GN equations

NASA Astrophysics Data System (ADS)

Zhao, B. B.; Ertekin, R. C.; Duan, W. Y.

2015-02-01

This work is on the nonlinear diffraction analysis of shallow-water waves, impinging on submerged obstacles, by two related theories, namely the classical Green-Naghdi (GN) equations and the Irrotational Green-Naghdi (IGN) equations, both sets of equations being at high levels and derived for incompressible and inviscid flows. Recently, the high-level Green-Naghdi equations have been applied to some wave transformation problems. The high-level IGN equations have also been used in the last decade to study certain wave propagation problems. However, past works on these theories used different numerical methods to solve these nonlinear and unsteady sets of differential equations and at different levels. Moreover, different physical problems have been solved in the past. Therefore, it has not been possible to understand the differences produced by these two sets of theories and their range of applicability so far. We are thus motivated to make a direct comparison of the results produced by these theories by use of the same numerical method to solve physically the same wave diffraction problems. We focus on comparing these two theories by using similar codes; only the equations used are different but other parts of the codes, such as the wave-maker, damping zone, discretion method, matrix solver, etc., are exactly the same. This way, we eliminate many potential sources of differences that could be produced by the solution of different equations. The physical problems include the presence of various submerged obstacles that can be used for example as breakwaters or to represent the continental shelf. A numerical wave tank is created by placing a wavemaker on one end and a wave absorbing beach on the other. The nonlinear and unsteady sets of differential equations are solved by the finite-difference method. The results are compared with different equations as well as with the available experimental data.

Plane Poiseuille flow of a rarefied gas in the presence of strong gravitation.

PubMed

Doi, Toshiyuki

2011-02-01

Plane Poiseuille flow of a rarefied gas, which flows horizontally in the presence of strong gravitation, is studied based on the Boltzmann equation. Applying the asymptotic analysis for a small variation in the flow direction [Y. Sone, Molecular Gas Dynamics (Birkhäuser, 2007)], the two-dimensional problem is reduced to a one-dimensional problem, as in the case of a Poiseuille flow in the absence of gravitation, and the solution is obtained in a semianalytical form. The reduced one-dimensional problem is solved numerically for a hard sphere molecular gas over a wide range of the gas-rarefaction degree and the gravitational strength. The presence of gravitation reduces the mass flow rate, and the effect of gravitation is significant for large Knudsen numbers. To verify the validity of the asymptotic solution, a two-dimensional problem of a flow through a long channel is directly solved numerically, and the validity of the asymptotic solution is confirmed. ©2011 American Physical Society

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bai, Zhaojun; Yang, Chao

What is common among electronic structure calculation, design of MEMS devices, vibrational analysis of high speed railways, and simulation of the electromagnetic field of a particle accelerator? The answer: they all require solving large scale nonlinear eigenvalue problems. In fact, these are just a handful of examples in which solving nonlinear eigenvalue problems accurately and efficiently is becoming increasingly important. Recognizing the importance of this class of problems, an invited minisymposium dedicated to nonlinear eigenvalue problems was held at the 2005 SIAM Annual Meeting. The purpose of the minisymposium was to bring together numerical analysts and application scientists to showcasemore » some of the cutting edge results from both communities and to discuss the challenges they are still facing. The minisymposium consisted of eight talks divided into two sessions. The first three talks focused on a type of nonlinear eigenvalue problem arising from electronic structure calculations. In this type of problem, the matrix Hamiltonian H depends, in a non-trivial way, on the set of eigenvectors X to be computed. The invariant subspace spanned by these eigenvectors also minimizes a total energy function that is highly nonlinear with respect to X on a manifold defined by a set of orthonormality constraints. In other applications, the nonlinearity of the matrix eigenvalue problem is restricted to the dependency of the matrix on the eigenvalues to be computed. These problems are often called polynomial or rational eigenvalue problems In the second session, Christian Mehl from Technical University of Berlin described numerical techniques for solving a special type of polynomial eigenvalue problem arising from vibration analysis of rail tracks excited by high-speed trains.« less

A Numerical Method for Obtaining Monoenergetic Neutron Flux Distributions and Transmissions in Multiple-Region Slabs

NASA Technical Reports Server (NTRS)

Schneider, Harold

1959-01-01

This method is investigated for semi-infinite multiple-slab configurations of arbitrary width, composition, and source distribution. Isotropic scattering in the laboratory system is assumed. Isotropic scattering implies that the fraction of neutrons scattered in the i(sup th) volume element or subregion that will make their next collision in the j(sup th) volume element or subregion is the same for all collisions. These so-called "transfer probabilities" between subregions are calculated and used to obtain successive-collision densities from which the flux and transmission probabilities directly follow. For a thick slab with little or no absorption, a successive-collisions technique proves impractical because an unreasonably large number of collisions must be followed in order to obtain the flux. Here the appropriate integral equation is converted into a set of linear simultaneous algebraic equations that are solved for the average total flux in each subregion. When ordinary diffusion theory applies with satisfactory precision in a portion of the multiple-slab configuration, the problem is solved by ordinary diffusion theory, but the flux is plotted only in the region of validity. The angular distribution of neutrons entering the remaining portion is determined from the known diffusion flux and the remaining region is solved by higher order theory. Several procedures for applying the numerical method are presented and discussed. To illustrate the calculational procedure, a symmetrical slab ia vacuum is worked by the numerical, Monte Carlo, and P(sub 3) spherical harmonics methods. In addition, an unsymmetrical double-slab problem is solved by the numerical and Monte Carlo methods. The numerical approach proved faster and more accurate in these examples. Adaptation of the method to anisotropic scattering in slabs is indicated, although no example is included in this paper.

Geometric versus numerical optimal control of a dissipative spin-(1/2) particle

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lapert, M.; Sugny, D.; Zhang, Y.

2010-12-15

We analyze the saturation of a nuclear magnetic resonance (NMR) signal using optimal magnetic fields. We consider both the problems of minimizing the duration of the control and its energy for a fixed duration. We solve the optimal control problems by using geometric methods and a purely numerical approach, the grape algorithm, the two methods being based on the application of the Pontryagin maximum principle. A very good agreement is obtained between the two results. The optimal solutions for the energy-minimization problem are finally implemented experimentally with available NMR techniques.

The development and nature of problem-solving among first-semester calculus students

NASA Astrophysics Data System (ADS)

Dawkins, Paul Christian; Mendoza Epperson, James A.

2014-08-01

This study investigates interactions between calculus learning and problem-solving in the context of two first-semester undergraduate calculus courses in the USA. We assessed students' problem-solving abilities in a common US calculus course design that included traditional lecture and assessment with problem-solving-oriented labs. We investigate this blended instruction as a local representative of the US calculus reform movements that helped foster it. These reform movements tended to emphasize problem-solving as well as multiple mathematical registers and quantitative modelling. Our statistical analysis reveals the influence of the blended traditional/reform calculus instruction on students' ability to solve calculus-related, non-routine problems through repeated measures over the semester. The calculus instruction in this study significantly improved students' performance on non-routine problems, though performance improved more regarding strategies and accuracy than it did for drawing conclusions and providing justifications. We identified problem-solving behaviours that characterized top performance or attrition in the course. Top-performing students displayed greater algebraic proficiency, calculus skills, and more general heuristics than their peers, but overused algebraic techniques even when they proved cumbersome or inappropriate. Students who subsequently withdrew from calculus often lacked algebraic fluency and understanding of the graphical register. The majority of participants, when given a choice, relied upon less sophisticated trial-and-error approaches in the numerical register and rarely used the graphical register, contrary to the goals of US calculus reform. We provide explanations for these patterns in students' problem-solving performance in view of both their preparation for university calculus and the courses' assessment structure, which preferentially rewarded algebraic reasoning. While instruction improved students' problem-solving performance, we observe that current instruction requires ongoing refinement to help students develop multi-register fluency and the ability to model quantitatively, as is called for in current US standards for mathematical instruction.

Discontinuous finite element method for vector radiative transfer

NASA Astrophysics Data System (ADS)

Wang, Cun-Hai; Yi, Hong-Liang; Tan, He-Ping

2017-03-01

The discontinuous finite element method (DFEM) is applied to solve the vector radiative transfer in participating media. The derivation in a discrete form of the vector radiation governing equations is presented, in which the angular space is discretized by the discrete-ordinates approach with a local refined modification, and the spatial domain is discretized into finite non-overlapped discontinuous elements. The elements in the whole solution domain are connected by modelling the boundary numerical flux between adjacent elements, which makes the DFEM numerically stable for solving radiative transfer equations. Several various problems of vector radiative transfer are tested to verify the performance of the developed DFEM, including vector radiative transfer in a one-dimensional parallel slab containing a Mie/Rayleigh/strong forward scattering medium and a two-dimensional square medium. The fact that DFEM results agree very well with the benchmark solutions in published references shows that the developed DFEM in this paper is accurate and effective for solving vector radiative transfer problems.

Numerical solution of the quantum Lenard-Balescu equation for a non-degenerate one-component plasma

DOE PAGES

Scullard, Christian R.; Belt, Andrew P.; Fennell, Susan C.; ...

2016-09-01

We present a numerical solution of the quantum Lenard-Balescu equation using a spectral method, namely an expansion in Laguerre polynomials. This method exactly conserves both particles and kinetic energy and facilitates the integration over the dielectric function. To demonstrate the method, we solve the equilibration problem for a spatially homogeneous one-component plasma with various initial conditions. Unlike the more usual Landau/Fokker-Planck system, this method requires no input Coulomb logarithm; the logarithmic terms in the collision integral arise naturally from the equation along with the non-logarithmic order-unity terms. The spectral method can also be used to solve the Landau equation andmore » a quantum version of the Landau equation in which the integration over the wavenumber requires only a lower cutoff. We solve these problems as well and compare them with the full Lenard-Balescu solution in the weak-coupling limit. Finally, we discuss the possible generalization of this method to include spatial inhomogeneity and velocity anisotropy.« less

Finite-analytic numerical solution of heat transfer in two-dimensional cavity flow

NASA Technical Reports Server (NTRS)

Chen, C.-J.; Naseri-Neshat, H.; Ho, K.-S.

1981-01-01

Heat transfer in cavity flow is numerically analyzed by a new numerical method called the finite-analytic method. The basic idea of the finite-analytic method is the incorporation of local analytic solutions in the numerical solutions of linear or nonlinear partial differential equations. In the present investigation, the local analytic solutions for temperature, stream function, and vorticity distributions are derived. When the local analytic solution is evaluated at a given nodal point, it gives an algebraic relationship between a nodal value in a subregion and its neighboring nodal points. A system of algebraic equations is solved to provide the numerical solution of the problem. The finite-analytic method is used to solve heat transfer in the cavity flow at high Reynolds number (1000) for Prandtl numbers of 0.1, 1, and 10.

Discretization vs. Rounding Error in Euler's Method

ERIC Educational Resources Information Center

Borges, Carlos F.

2011-01-01

Euler's method for solving initial value problems is an excellent vehicle for observing the relationship between discretization error and rounding error in numerical computation. Reductions in stepsize, in order to decrease discretization error, necessarily increase the number of steps and so introduce additional rounding error. The problem is…

A collocation-shooting method for solving fractional boundary value problems

NASA Astrophysics Data System (ADS)

Al-Mdallal, Qasem M.; Syam, Muhammed I.; Anwar, M. N.

2010-12-01

In this paper, we discuss the numerical solution of special class of fractional boundary value problems of order 2. The method of solution is based on a conjugating collocation and spline analysis combined with shooting method. A theoretical analysis about the existence and uniqueness of exact solution for the present class is proven. Two examples involving Bagley-Torvik equation subject to boundary conditions are also presented; numerical results illustrate the accuracy of the present scheme.

Comments on numerical solution of boundary value problems of the Laplace equation and calculation of eigenvalues by the grid method

NASA Technical Reports Server (NTRS)

Lyusternik, L. A.

1980-01-01

The mathematics involved in numerically solving for the plane boundary value of the Laplace equation by the grid method is developed. The approximate solution of a boundary value problem for the domain of the Laplace equation by the grid method consists of finding u at the grid corner which satisfies the equation at the internal corners (u=Du) and certain boundary value conditions at the boundary corners.

A solution for two-dimensional Fredholm integral equations of the second kind with periodic, semiperiodic, or nonperiodic kernels. [integral representation of the stationary Navier-Stokes problem

NASA Technical Reports Server (NTRS)

Gabrielsen, R. E.; Uenal, A.

1981-01-01

A numerical scheme for solving two dimensional Fredholm integral equations of the second kind is developed. The proof of the convergence of the numerical scheme is shown for three cases: the case of periodic kernels, the case of semiperiodic kernels, and the case of nonperiodic kernels. Applications to the incompressible, stationary Navier-Stokes problem are of primary interest.

On the solution of the Helmholtz equation on regions with corners.

PubMed

Serkh, Kirill; Rokhlin, Vladimir

2016-08-16

In this paper we solve several boundary value problems for the Helmholtz equation on polygonal domains. We observe that when the problems are formulated as the boundary integral equations of potential theory, the solutions are representable by series of appropriately chosen Bessel functions. In addition to being analytically perspicuous, the resulting expressions lend themselves to the construction of accurate and efficient numerical algorithms. The results are illustrated by a number of numerical examples.

On the solution of the Helmholtz equation on regions with corners

PubMed Central

Serkh, Kirill; Rokhlin, Vladimir

2016-01-01

In this paper we solve several boundary value problems for the Helmholtz equation on polygonal domains. We observe that when the problems are formulated as the boundary integral equations of potential theory, the solutions are representable by series of appropriately chosen Bessel functions. In addition to being analytically perspicuous, the resulting expressions lend themselves to the construction of accurate and efficient numerical algorithms. The results are illustrated by a number of numerical examples. PMID:27482110

Numerical Modeling of the Photothermal Processing for Bubble Forming around Nanowire in a Liquid

PubMed Central

Chaari, Anis; Giraud-Moreau, Laurence

2014-01-01

An accurate computation of the temperature is an important factor in determining the shape of a bubble around a nanowire immersed in a liquid. The study of the physical phenomenon consists in solving a photothermic coupled problem between light and nanowire. The numerical multiphysic model is used to study the variations of the temperature and the shape of the created bubble by illumination of the nanowire. The optimization process, including an adaptive remeshing scheme, is used to solve the problem through a finite element method. The study of the shape evolution of the bubble is made taking into account the physical and geometrical parameters of the nanowire. The relation between the sizes and shapes of the bubble and nanowire is deduced. PMID:24795538

Two Legendre-Dual-Petrov-Galerkin Algorithms for Solving the Integrated Forms of High Odd-Order Boundary Value Problems

PubMed Central

Abd-Elhameed, Waleed M.; Doha, Eid H.; Bassuony, Mahmoud A.

2014-01-01

Two numerical algorithms based on dual-Petrov-Galerkin method are developed for solving the integrated forms of high odd-order boundary value problems (BVPs) governed by homogeneous and nonhomogeneous boundary conditions. Two different choices of trial functions and test functions which satisfy the underlying boundary conditions of the differential equations and the dual boundary conditions are used for this purpose. These choices lead to linear systems with specially structured matrices that can be efficiently inverted, hence greatly reducing the cost. The various matrix systems resulting from these discretizations are carefully investigated, especially their complexities and their condition numbers. Numerical results are given to illustrate the efficiency of the proposed algorithms, and some comparisons with some other methods are made. PMID:24616620

Higher-Order Compact Schemes for Numerical Simulation of Incompressible Flows

NASA Technical Reports Server (NTRS)

Wilson, Robert V.; Demuren, Ayodeji O.; Carpenter, Mark

1998-01-01

A higher order accurate numerical procedure has been developed for solving incompressible Navier-Stokes equations for 2D or 3D fluid flow problems. It is based on low-storage Runge-Kutta schemes for temporal discretization and fourth and sixth order compact finite-difference schemes for spatial discretization. The particular difficulty of satisfying the divergence-free velocity field required in incompressible fluid flow is resolved by solving a Poisson equation for pressure. It is demonstrated that for consistent global accuracy, it is necessary to employ the same order of accuracy in the discretization of the Poisson equation. Special care is also required to achieve the formal temporal accuracy of the Runge-Kutta schemes. The accuracy of the present procedure is demonstrated by application to several pertinent benchmark problems.

Time-domain finite elements in optimal control with application to launch-vehicle guidance. PhD. Thesis

NASA Technical Reports Server (NTRS)

Bless, Robert R.

1991-01-01

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Special data base of Informational - Computational System 'INM RAS - Black Sea' for solving inverse and data assimilation problems

NASA Astrophysics Data System (ADS)

Zakharova, Natalia; Piskovatsky, Nicolay; Gusev, Anatoly

2014-05-01

Development of Informational-Computational Systems (ICS) for data assimilation procedures is one of multidisciplinary problems. To study and solve these problems one needs to apply modern results from different disciplines and recent developments in: mathematical modeling; theory of adjoint equations and optimal control; inverse problems; numerical methods theory; numerical algebra and scientific computing. The above problems are studied in the Institute of Numerical Mathematics of the Russian Academy of Science (INM RAS) in ICS for personal computers. In this work the results on the Special data base development for ICS "INM RAS - Black Sea" are presented. In the presentation the input information for ICS is discussed, some special data processing procedures are described. In this work the results of forecast using ICS "INM RAS - Black Sea" with operational observation data assimilation are presented. This study was supported by the Russian Foundation for Basic Research (project No 13-01-00753) and by Presidium Program of Russian Academy of Sciences (project P-23 "Black sea as an imitational ocean model"). References 1. V.I. Agoshkov, M.V. Assovskii, S.A. Lebedev, Numerical simulation of Black Sea hydrothermodynamics taking into account tide-forming forces. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, pp. 5-31. 2. E.I. Parmuzin, V.I. Agoshkov, Numerical solution of the variational assimilation problem for sea surface temperature in the model of the Black Sea dynamics. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, pp. 69-94. 3. V.B. Zalesny, N.A. Diansky, V.V. Fomin, S.N. Moshonkin, S.G. Demyshev, Numerical model of the circulation of Black Sea and Sea of Azov. Russ. J. Numer. Anal. Math. Modelling (2012) 27, No.1, pp. 95-111. 4. Agoshkov V.I.,Assovsky M.B., Giniatulin S. V., Zakharova N.B., Kuimov G.V., Parmuzin E.I., Fomin V.V. Informational Computational system of variational assimilation of observation data "INM RAS - Black sea"// Ecological safety of coastal and shelf zones and complex use of shelf resources: Collection of scientific works. Issue 26, Volume 2. - National Academy of Sciences of Ukraine, Marine Hydrophysical Institute, Sebastopol, 2012. Pages 352-360. (In russian)

A GA based penalty function technique for solving constrained redundancy allocation problem of series system with interval valued reliability of components

NASA Astrophysics Data System (ADS)

Gupta, R. K.; Bhunia, A. K.; Roy, D.

2009-10-01

In this paper, we have considered the problem of constrained redundancy allocation of series system with interval valued reliability of components. For maximizing the overall system reliability under limited resource constraints, the problem is formulated as an unconstrained integer programming problem with interval coefficients by penalty function technique and solved by an advanced GA for integer variables with interval fitness function, tournament selection, uniform crossover, uniform mutation and elitism. As a special case, considering the lower and upper bounds of the interval valued reliabilities of the components to be the same, the corresponding problem has been solved. The model has been illustrated with some numerical examples and the results of the series redundancy allocation problem with fixed value of reliability of the components have been compared with the existing results available in the literature. Finally, sensitivity analyses have been shown graphically to study the stability of our developed GA with respect to the different GA parameters.

Some issues in the simulation of two-phase flows: The relative velocity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gräbel, J.; Hensel, S.; Ueberholz, P.

In this paper we compare numerical approximations for solving the Riemann problem for a hyperbolic two-phase flow model in two-dimensional space. The model is based on mixture parameters of state where the relative velocity between the two-phase systems is taken into account. This relative velocity appears as a main discontinuous flow variable through the complete wave structure and cannot be recovered correctly by some numerical techniques when simulating the associated Riemann problem. Simulations are validated by comparing the results of the numerical calculation qualitatively with OpenFOAM software. Simulations also indicate that OpenFOAM is unable to resolve the relative velocity associatedmore » with the Riemann problem.« less

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

DOE PAGES

Liu, Jianfeng; Laird, Carl Damon

2017-09-22

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem thatmore » requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.« less

A global stochastic programming approach for the optimal placement of gas detectors with nonuniform unavailabilities

DOE Office of Scientific and Technical Information (OSTI.GOV)

Liu, Jianfeng; Laird, Carl Damon

Optimal design of a gas detection systems is challenging because of the numerous sources of uncertainty, including weather and environmental conditions, leak location and characteristics, and process conditions. Rigorous CFD simulations of dispersion scenarios combined with stochastic programming techniques have been successfully applied to the problem of optimal gas detector placement; however, rigorous treatment of sensor failure and nonuniform unavailability has received less attention. To improve reliability of the design, this paper proposes a problem formulation that explicitly considers nonuniform unavailabilities and all backup detection levels. The resulting sensor placement problem is a large-scale mixed-integer nonlinear programming (MINLP) problem thatmore » requires a tailored solution approach for efficient solution. We have developed a multitree method which depends on iteratively solving a sequence of upper-bounding master problems and lower-bounding subproblems. The tailored global solution strategy is tested on a real data problem and the encouraging numerical results indicate that our solution framework is promising in solving sensor placement problems. This study was selected for the special issue in JLPPI from the 2016 International Symposium of the MKO Process Safety Center.« less

Brain hyper-connectivity and operation-specific deficits during arithmetic problem solving in children with developmental dyscalculia

PubMed Central

Rosenberg-Lee, Miriam; Ashkenazi, Sarit; Chen, Tianwen; Young, Christina B.; Geary, David C.; Menon, Vinod

2014-01-01

Developmental dyscalculia (DD) is marked by specific deficits in processing numerical and mathematical information despite normal intelligence (IQ) and reading ability. We examined how brain circuits used by young children with DD to solve simple addition and subtraction problems differ from those used by typically developing (TD) children who were matched on age, IQ, reading ability, and working memory. Children with DD were slower and less accurate during problem solving than TD children, and were especially impaired on their ability to solve subtraction problems. Children with DD showed significantly greater activity in multiple parietal, occipito-temporal and prefrontal cortex regions while solving addition and subtraction problems. Despite poorer performance during subtraction, children with DD showed greater activity in multiple intra-parietal sulcus (IPS) and superior parietal lobule subdivisions in the dorsal posterior parietal cortex as well as fusiform gyrus in the ventral occipito-temporal cortex. Critically, effective connectivity analyses revealed hyper-connectivity, rather than reduced connectivity, between the IPS and multiple brain systems including the lateral fronto-parietal and default mode networks in children with DD during both addition and subtraction. These findings suggest the IPS and its functional circuits are a major locus of dysfunction during both addition and subtraction problem solving in DD, and that inappropriate task modulation and hyper-connectivity, rather than under-engagement and under-connectivity, are the neural mechanisms underlying problem solving difficulties in children with DD. We discuss our findings in the broader context of multiple levels of analysis and performance issues inherent in neuroimaging studies of typical and atypical development. PMID:25098903

Brain hyper-connectivity and operation-specific deficits during arithmetic problem solving in children with developmental dyscalculia.

PubMed

Rosenberg-Lee, Miriam; Ashkenazi, Sarit; Chen, Tianwen; Young, Christina B; Geary, David C; Menon, Vinod

2015-05-01

Developmental dyscalculia (DD) is marked by specific deficits in processing numerical and mathematical information despite normal intelligence (IQ) and reading ability. We examined how brain circuits used by young children with DD to solve simple addition and subtraction problems differ from those used by typically developing (TD) children who were matched on age, IQ, reading ability, and working memory. Children with DD were slower and less accurate during problem solving than TD children, and were especially impaired on their ability to solve subtraction problems. Children with DD showed significantly greater activity in multiple parietal, occipito-temporal and prefrontal cortex regions while solving addition and subtraction problems. Despite poorer performance during subtraction, children with DD showed greater activity in multiple intra-parietal sulcus (IPS) and superior parietal lobule subdivisions in the dorsal posterior parietal cortex as well as fusiform gyrus in the ventral occipito-temporal cortex. Critically, effective connectivity analyses revealed hyper-connectivity, rather than reduced connectivity, between the IPS and multiple brain systems including the lateral fronto-parietal and default mode networks in children with DD during both addition and subtraction. These findings suggest the IPS and its functional circuits are a major locus of dysfunction during both addition and subtraction problem solving in DD, and that inappropriate task modulation and hyper-connectivity, rather than under-engagement and under-connectivity, are the neural mechanisms underlying problem solving difficulties in children with DD. We discuss our findings in the broader context of multiple levels of analysis and performance issues inherent in neuroimaging studies of typical and atypical development. © 2014 John Wiley & Sons Ltd.

A complexity theory model in science education problem solving: random walks for working memory and mental capacity.

PubMed

Stamovlasis, Dimitrios; Tsaparlis, Georgios

2003-07-01

The present study examines the role of limited human channel capacity from a science education perspective. A model of science problem solving has been previously validated by applying concepts and tools of complexity theory (the working memory, random walk method). The method correlated the subjects' rank-order achievement scores in organic-synthesis chemistry problems with the subjects' working memory capacity. In this work, we apply the same nonlinear approach to a different data set, taken from chemical-equilibrium problem solving. In contrast to the organic-synthesis problems, these problems are algorithmic, require numerical calculations, and have a complex logical structure. As a result, these problems cause deviations from the model, and affect the pattern observed with the nonlinear method. In addition to Baddeley's working memory capacity, the Pascual-Leone's mental (M-) capacity is examined by the same random-walk method. As the complexity of the problem increases, the fractal dimension of the working memory random walk demonstrates a sudden drop, while the fractal dimension of the M-capacity random walk decreases in a linear fashion. A review of the basic features of the two capacities and their relation is included. The method and findings have consequences for problem solving not only in chemistry and science education, but also in other disciplines.

Fourth order Douglas implicit scheme for solving three dimension reaction diffusion equation with non-linear source term

NASA Astrophysics Data System (ADS)

Hasnain, Shahid; Saqib, Muhammad; Mashat, Daoud Suleiman

2017-07-01

This research paper represents a numerical approximation to non-linear three dimension reaction diffusion equation with non-linear source term from population genetics. Since various initial and boundary value problems exist in three dimension reaction diffusion phenomena, which are studied numerically by different numerical methods, here we use finite difference schemes (Alternating Direction Implicit and Fourth Order Douglas Implicit) to approximate the solution. Accuracy is studied in term of L2, L∞ and relative error norms by random selected grids along time levels for comparison with analytical results. The test example demonstrates the accuracy, efficiency and versatility of the proposed schemes. Numerical results showed that Fourth Order Douglas Implicit scheme is very efficient and reliable for solving 3-D non-linear reaction diffusion equation.

An acoustic-convective splitting-based approach for the Kapila two-phase flow model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eikelder, M.F.P. ten, E-mail: m.f.p.teneikelder@tudelft.nl; Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven; Daude, F.

In this paper we propose a new acoustic-convective splitting-based numerical scheme for the Kapila five-equation two-phase flow model. The splitting operator decouples the acoustic waves and convective waves. The resulting two submodels are alternately numerically solved to approximate the solution of the entire model. The Lagrangian form of the acoustic submodel is numerically solved using an HLLC-type Riemann solver whereas the convective part is approximated with an upwind scheme. The result is a simple method which allows for a general equation of state. Numerical computations are performed for standard two-phase shock tube problems. A comparison is made with a non-splittingmore » approach. The results are in good agreement with reference results and exact solutions.« less

ICASE semiannual report, April 1 - September 30, 1989

NASA Technical Reports Server (NTRS)

1990-01-01

The Institute conducts unclassified basic research in applied mathematics, numerical analysis, and computer science in order to extend and improve problem-solving capabilities in science and engineering, particularly in aeronautics and space. The major categories of the current Institute for Computer Applications in Science and Engineering (ICASE) research program are: (1) numerical methods, with particular emphasis on the development and analysis of basic numerical algorithms; (2) control and parameter identification problems, with emphasis on effective numerical methods; (3) computational problems in engineering and the physical sciences, particularly fluid dynamics, acoustics, and structural analysis; and (4) computer systems and software, especially vector and parallel computers. ICASE reports are considered to be primarily preprints of manuscripts that have been submitted to appropriate research journals or that are to appear in conference proceedings.

Space-dependent perfusion coefficient estimation in a 2D bioheat transfer problem

NASA Astrophysics Data System (ADS)

Bazán, Fermín S. V.; Bedin, Luciano; Borges, Leonardo S.

2017-05-01

In this work, a method for estimating the space-dependent perfusion coefficient parameter in a 2D bioheat transfer model is presented. In the method, the bioheat transfer model is transformed into a time-dependent semidiscrete system of ordinary differential equations involving perfusion coefficient values as parameters, and the estimation problem is solved through a nonlinear least squares technique. In particular, the bioheat problem is solved by the method of lines based on a highly accurate pseudospectral approach, and perfusion coefficient values are estimated by the regularized Gauss-Newton method coupled with a proper regularization parameter. The performance of the method on several test problems is illustrated numerically.

On the efficacy of stochastic collocation, stochastic Galerkin, and stochastic reduced order models for solving stochastic problems

DOE PAGES

Richard V. Field, Jr.; Emery, John M.; Grigoriu, Mircea Dan

2015-05-19

The stochastic collocation (SC) and stochastic Galerkin (SG) methods are two well-established and successful approaches for solving general stochastic problems. A recently developed method based on stochastic reduced order models (SROMs) can also be used. Herein we provide a comparison of the three methods for some numerical examples; our evaluation only holds for the examples considered in the paper. The purpose of the comparisons is not to criticize the SC or SG methods, which have proven very useful for a broad range of applications, nor is it to provide overall ratings of these methods as compared to the SROM method.more » Furthermore, our objectives are to present the SROM method as an alternative approach to solving stochastic problems and provide information on the computational effort required by the implementation of each method, while simultaneously assessing their performance for a collection of specific problems.« less

Direct Solve of Electrically Large Integral Equations for Problem Sizes to 1M Unknowns

NASA Technical Reports Server (NTRS)

Shaeffer, John

2008-01-01

Matrix methods for solving integral equations via direct solve LU factorization are presently limited to weeks to months of very expensive supercomputer time for problems sizes of several hundred thousand unknowns. This report presents matrix LU factor solutions for electromagnetic scattering problems for problem sizes to one million unknowns with thousands of right hand sides that run in mere days on PC level hardware. This EM solution is accomplished by utilizing the numerical low rank nature of spatially blocked unknowns using the Adaptive Cross Approximation for compressing the rank deficient blocks of the system Z matrix, the L and U factors, the right hand side forcing function and the final current solution. This compressed matrix solution is applied to a frequency domain EM solution of Maxwell's equations using standard Method of Moments approach. Compressed matrix storage and operations count leads to orders of magnitude reduction in memory and run time.

Numerical solution of the time fractional reaction-diffusion equation with a moving boundary

NASA Astrophysics Data System (ADS)

Zheng, Minling; Liu, Fawang; Liu, Qingxia; Burrage, Kevin; Simpson, Matthew J.

2017-06-01

A fractional reaction-diffusion model with a moving boundary is presented in this paper. An efficient numerical method is constructed to solve this moving boundary problem. Our method makes use of a finite difference approximation for the temporal discretization, and spectral approximation for the spatial discretization. The stability and convergence of the method is studied, and the errors of both the semi-discrete and fully-discrete schemes are derived. Numerical examples, motivated by problems from developmental biology, show a good agreement with the theoretical analysis and illustrate the efficiency of our method.

High-resolution numerical approximation of traffic flow problems with variable lanes and free-flow velocities.

PubMed

Zhang, Peng; Liu, Ru-Xun; Wong, S C

2005-05-01

This paper develops macroscopic traffic flow models for a highway section with variable lanes and free-flow velocities, that involve spatially varying flux functions. To address this complex physical property, we develop a Riemann solver that derives the exact flux values at the interface of the Riemann problem. Based on this solver, we formulate Godunov-type numerical schemes to solve the traffic flow models. Numerical examples that simulate the traffic flow around a bottleneck that arises from a drop in traffic capacity on the highway section are given to illustrate the efficiency of these schemes.

A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing.

PubMed

Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian

2015-10-23

The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation.

A hybrid nonlinear programming method for design optimization

NASA Technical Reports Server (NTRS)

Rajan, S. D.

1986-01-01

Solutions to engineering design problems formulated as nonlinear programming (NLP) problems usually require the use of more than one optimization technique. Moreover, the interaction between the user (analysis/synthesis) program and the NLP system can lead to interface, scaling, or convergence problems. An NLP solution system is presented that seeks to solve these problems by providing a programming system to ease the user-system interface. A simple set of rules is used to select an optimization technique or to switch from one technique to another in an attempt to detect, diagnose, and solve some potential problems. Numerical examples involving finite element based optimal design of space trusses and rotor bearing systems are used to illustrate the applicability of the proposed methodology.

Meshless Method for Simulation of Compressible Flow

NASA Astrophysics Data System (ADS)

Nabizadeh Shahrebabak, Ebrahim

In the present age, rapid development in computing technology and high speed supercomputers has made numerical analysis and computational simulation more practical than ever before for large and complex cases. Numerical simulations have also become an essential means for analyzing the engineering problems and the cases that experimental analysis is not practical. There are so many sophisticated and accurate numerical schemes, which do these simulations. The finite difference method (FDM) has been used to solve differential equation systems for decades. Additional numerical methods based on finite volume and finite element techniques are widely used in solving problems with complex geometry. All of these methods are mesh-based techniques. Mesh generation is an essential preprocessing part to discretize the computation domain for these conventional methods. However, when dealing with mesh-based complex geometries these conventional mesh-based techniques can become troublesome, difficult to implement, and prone to inaccuracies. In this study, a more robust, yet simple numerical approach is used to simulate problems in an easier manner for even complex problem. The meshless, or meshfree, method is one such development that is becoming the focus of much research in the recent years. The biggest advantage of meshfree methods is to circumvent mesh generation. Many algorithms have now been developed to help make this method more popular and understandable for everyone. These algorithms have been employed over a wide range of problems in computational analysis with various levels of success. Since there is no connectivity between the nodes in this method, the challenge was considerable. The most fundamental issue is lack of conservation, which can be a source of unpredictable errors in the solution process. This problem is particularly evident in the presence of steep gradient regions and discontinuities, such as shocks that frequently occur in high speed compressible flow problems. To solve this discontinuity problem, this research study deals with the implementation of a conservative meshless method and its applications in computational fluid dynamics (CFD). One of the most common types of collocating meshless method the RBF-DQ, is used to approximate the spatial derivatives. The issue with meshless methods when dealing with highly convective cases is that they cannot distinguish the influence of fluid flow from upstream or downstream and some methodology is needed to make the scheme stable. Therefore, an upwinding scheme similar to one used in the finite volume method is added to capture steep gradient or shocks. This scheme creates a flexible algorithm within which a wide range of numerical flux schemes, such as those commonly used in the finite volume method, can be employed. In addition, a blended RBF is used to decrease the dissipation ensuing from the use of a low shape parameter. All of these steps are formulated for the Euler equation and a series of test problems used to confirm convergence of the algorithm. The present scheme was first employed on several incompressible benchmarks to validate the framework. The application of this algorithm is illustrated by solving a set of incompressible Navier-Stokes problems. Results from the compressible problem are compared with the exact solution for the flow over a ramp and compared with solutions of finite volume discretization and the discontinuous Galerkin method, both requiring a mesh. The applicability of the algorithm and its robustness are shown to be applied to complex problems.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2017-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2018-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

From Numerical Problem Solving to Model-Based Experimentation Incorporating Computer-Based Tools of Various Scales into the ChE Curriculum

ERIC Educational Resources Information Center

Shacham, Mordechai; Cutlip, Michael B.; Brauner, Neima

2009-01-01

A continuing challenge to the undergraduate chemical engineering curriculum is the time-effective incorporation and use of computer-based tools throughout the educational program. Computing skills in academia and industry require some proficiency in programming and effective use of software packages for solving 1) single-model, single-algorithm…

A new iterative scheme for solving the discrete Smoluchowski equation

NASA Astrophysics Data System (ADS)

Smith, Alastair J.; Wells, Clive G.; Kraft, Markus

2018-01-01

This paper introduces a new iterative scheme for solving the discrete Smoluchowski equation and explores the numerical convergence properties of the method for a range of kernels admitting analytical solutions, in addition to some more physically realistic kernels typically used in kinetics applications. The solver is extended to spatially dependent problems with non-uniform velocities and its performance investigated in detail.

Linear diffusion-wave channel routing using a discrete Hayami convolution method

Treesearch

Li Wang; Joan Q. Wu; William J. Elliot; Fritz R. Feidler; Sergey Lapin

2014-01-01

The convolution of an input with a response function has been widely used in hydrology as a means to solve various problems analytically. Due to the high computation demand in solving the functions using numerical integration, it is often advantageous to use the discrete convolution instead of the integration of the continuous functions. This approach greatly reduces...

Competitive Facility Location with Fuzzy Random Demands

NASA Astrophysics Data System (ADS)

Uno, Takeshi; Katagiri, Hideki; Kato, Kosuke

2010-10-01

This paper proposes a new location problem of competitive facilities, e.g. shops, with uncertainty and vagueness including demands for the facilities in a plane. By representing the demands for facilities as fuzzy random variables, the location problem can be formulated as a fuzzy random programming problem. For solving the fuzzy random programming problem, first the α-level sets for fuzzy numbers are used for transforming it to a stochastic programming problem, and secondly, by using their expectations and variances, it can be reformulated to a deterministic programming problem. After showing that one of their optimal solutions can be found by solving 0-1 programming problems, their solution method is proposed by improving the tabu search algorithm with strategic oscillation. The efficiency of the proposed method is shown by applying it to numerical examples of the facility location problems.

Finite difference and Runge-Kutta methods for solving vibration problems

NASA Astrophysics Data System (ADS)

Lintang Renganis Radityani, Scolastika; Mungkasi, Sudi

2017-11-01

The vibration of a storey building can be modelled into a system of second order ordinary differential equations. If the number of floors of a building is large, then the result is a large scale system of second order ordinary differential equations. The large scale system is difficult to solve, and if it can be solved, the solution may not be accurate. Therefore, in this paper, we seek for accurate methods for solving vibration problems. We compare the performance of numerical finite difference and Runge-Kutta methods for solving large scale systems of second order ordinary differential equations. The finite difference methods include the forward and central differences. The Runge-Kutta methods include the Euler and Heun methods. Our research results show that the central finite difference and the Heun methods produce more accurate solutions than the forward finite difference and the Euler methods do.

A new extrapolation cascadic multigrid method for three dimensional elliptic boundary value problems

NASA Astrophysics Data System (ADS)

Pan, Kejia; He, Dongdong; Hu, Hongling; Ren, Zhengyong

2017-09-01

In this paper, we develop a new extrapolation cascadic multigrid method, which makes it possible to solve three dimensional elliptic boundary value problems with over 100 million unknowns on a desktop computer in half a minute. First, by combining Richardson extrapolation and quadratic finite element (FE) interpolation for the numerical solutions on two-level of grids (current and previous grids), we provide a quite good initial guess for the iterative solution on the next finer grid, which is a third-order approximation to the FE solution. And the resulting large linear system from the FE discretization is then solved by the Jacobi-preconditioned conjugate gradient (JCG) method with the obtained initial guess. Additionally, instead of performing a fixed number of iterations as used in existing cascadic multigrid methods, a relative residual tolerance is introduced in the JCG solver, which enables us to obtain conveniently the numerical solution with the desired accuracy. Moreover, a simple method based on the midpoint extrapolation formula is proposed to achieve higher-order accuracy on the finest grid cheaply and directly. Test results from four examples including two smooth problems with both constant and variable coefficients, an H3-regular problem as well as an anisotropic problem are reported to show that the proposed method has much better efficiency compared to the classical V-cycle and W-cycle multigrid methods. Finally, we present the reason why our method is highly efficient for solving these elliptic problems.

The aerodynamics of propellers and rotors using an acoustic formulation in the time domain

NASA Technical Reports Server (NTRS)

Long, L. N.

1983-01-01

The aerodynamics of propellers and rotors is especially complicated because of the highly three-dimensional and compressible nature of the flow field. However, in linearized theory the problem is governed by the wave equation, and a numerically-efficient integral formulation can be derived. This reduces the problem from one in space to one over a surface. Many such formulations exist in the aeroacoustics literature, but these become singular integral equations if one naively tries to use them to predict surface pressures, i.e., for aerodynamics. The present paper illustrates how one must interpret these equations in order to obtain nonambiguous results. After the regularized form of the integral equation is derived, a method for solving it numerically is described. This preliminary computer code uses Legendre-Gaussian quadrature to solve the equation. Numerical results are compared to experimental results for ellipsoids, wings, and rotors, including effects due to lift. Compressibility and the farfield boundary conditions are satisfied automatically using this method.

Numerical investigation of velocity slip and temperature jump effects on unsteady flow over a stretching permeable surface

NASA Astrophysics Data System (ADS)

Hosseini, E.; Loghmani, G. B.; Heydari, M.; Rashidi, M. M.

2017-02-01

In this paper, the boundary layer flow and heat transfer of unsteady flow over a porous accelerating stretching surface in the presence of the velocity slip and temperature jump effects are investigated numerically. A new effective collocation method based on rational Bernstein functions is applied to solve the governing system of nonlinear ordinary differential equations. This method solves the problem on the semi-infinite domain without truncating or transforming it to a finite domain. In addition, the presented method reduces the solution of the problem to the solution of a system of algebraic equations. Graphical and tabular results are presented to investigate the influence of the unsteadiness parameter A , Prandtl number Pr, suction parameter fw, velocity slip parameter γ and thermal slip parameter φ on the velocity and temperature profiles of the fluid. The numerical experiments are reported to show the accuracy and efficiency of the novel proposed computational procedure. Comparisons of present results are made with those obtained by previous works and show excellent agreement.

Analysis of Plane-Parallel Electron Beam Propagation in Different Media by Numerical Simulation Methods

NASA Astrophysics Data System (ADS)

Miloichikova, I. A.; Bespalov, V. I.; Krasnykh, A. A.; Stuchebrov, S. G.; Cherepennikov, Yu. M.; Dusaev, R. R.

2018-04-01

Simulation by the Monte Carlo method is widely used to calculate the character of ionizing radiation interaction with substance. A wide variety of programs based on the given method allows users to choose the most suitable package for solving computational problems. In turn, it is important to know exactly restrictions of numerical systems to avoid gross errors. Results of estimation of the feasibility of application of the program PCLab (Computer Laboratory, version 9.9) for numerical simulation of the electron energy distribution absorbed in beryllium, aluminum, gold, and water for industrial, research, and clinical beams are presented. The data obtained using programs ITS and Geant4 being the most popular software packages for solving the given problems and the program PCLab are presented in the graphic form. A comparison and an analysis of the results obtained demonstrate the feasibility of application of the program PCLab for simulation of the absorbed energy distribution and dose of electrons in various materials for energies in the range 1-20 MeV.

Applications of an exponential finite difference technique

DOE Office of Scientific and Technical Information (OSTI.GOV)

Handschuh, R.F.; Keith, T.G. Jr.

1988-07-01

An exponential finite difference scheme first presented by Bhattacharya for one dimensional unsteady heat conduction problems in Cartesian coordinates was extended. The finite difference algorithm developed was used to solve the unsteady diffusion equation in one dimensional cylindrical coordinates and was applied to two and three dimensional conduction problems in Cartesian coordinates. Heat conduction involving variable thermal conductivity was also investigated. The method was used to solve nonlinear partial differential equations in one and two dimensional Cartesian coordinates. Predicted results are compared to exact solutions where available or to results obtained by other numerical methods.

Choice of Variables and Preconditioning for Time Dependent Problems

NASA Technical Reports Server (NTRS)

Turkel, Eli; Vatsa, Verr N.

2003-01-01

We consider the use of low speed preconditioning for time dependent problems. These are solved using a dual time step approach. We consider the effect of this dual time step on the parameter of the low speed preconditioning. In addition, we compare the use of two sets of variables, conservation and primitive variables, to solve the system. We show the effect of these choices on both the convergence to a steady state and the accuracy of the numerical solutions for low Mach number steady state and time dependent flows.

Comparison of penalty functions on a penalty approach to mixed-integer optimization

NASA Astrophysics Data System (ADS)

Francisco, Rogério B.; Costa, M. Fernanda P.; Rocha, Ana Maria A. C.; Fernandes, Edite M. G. P.

2016-06-01

In this paper, we present a comparative study involving several penalty functions that can be used in a penalty approach for globally solving bound mixed-integer nonlinear programming (bMIMLP) problems. The penalty approach relies on a continuous reformulation of the bMINLP problem by adding a particular penalty term to the objective function. A penalty function based on the `erf' function is proposed. The continuous nonlinear optimization problems are sequentially solved by the population-based firefly algorithm. Preliminary numerical experiments are carried out in order to analyze the quality of the produced solutions, when compared with other penalty functions available in the literature.

Numerical solution of fluid flow and heat tranfer problems with surface radiation

NASA Technical Reports Server (NTRS)

Ahuja, S.; Bhatia, K.

1995-01-01

This paper presents a numerical scheme, based on the finite element method, to solve strongly coupled fluid flow and heat transfer problems. The surface radiation effect for gray, diffuse and isothermal surfaces is considered. A procedure for obtaining the view factors between the radiating surfaces is discussed. The overall solution strategy is verified by comparing the available results with those obtained using this approach. An analysis of a thermosyphon is undertaken and the effect of considering the surface radiation is clearly explained.

A fast marching algorithm for the factored eikonal equation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Treister, Eran, E-mail: erantreister@gmail.com; Haber, Eldad, E-mail: haber@math.ubc.ca; Department of Mathematics, The University of British Columbia, Vancouver, BC

The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM) methods. However, when used for a point source, the original eikonal equation is known to yield inaccurate numerical solutions, because of a singularity at the source. In this case, the factored eikonal equation is often preferred, and is known to yield a more accurate numerical solution. One application that requires the solution of the eikonal equation for point sources is travel time tomography. Thismore » inverse problem may be formulated using the eikonal equation as a forward problem. While this problem has been solved using FS in the past, the more recent choice for applying it involves FM methods because of the efficiency in which sensitivities can be obtained using them. However, while several FS methods are available for solving the factored equation, the FM method is available only for the original eikonal equation. In this paper we develop a Fast Marching algorithm for the factored eikonal equation, using both first and second order finite-difference schemes. Our algorithm follows the same lines as the original FM algorithm and requires the same computational effort. In addition, we show how to obtain sensitivities using this FM method and apply travel time tomography, formulated as an inverse factored eikonal equation. Numerical results in two and three dimensions show that our algorithm solves the factored eikonal equation efficiently, and demonstrate the achieved accuracy for computing the travel time. We also demonstrate a recovery of a 2D and 3D heterogeneous medium by travel time tomography using the eikonal equation for forward modeling and inversion by Gauss–Newton.« less

GPELab, a Matlab toolbox to solve Gross-Pitaevskii equations II: Dynamics and stochastic simulations

NASA Astrophysics Data System (ADS)

Antoine, Xavier; Duboscq, Romain

2015-08-01

GPELab is a free Matlab toolbox for modeling and numerically solving large classes of systems of Gross-Pitaevskii equations that arise in the physics of Bose-Einstein condensates. The aim of this second paper, which follows (Antoine and Duboscq, 2014), is to first present the various pseudospectral schemes available in GPELab for computing the deterministic and stochastic nonlinear dynamics of Gross-Pitaevskii equations (Antoine, et al., 2013). Next, the corresponding GPELab functions are explained in detail. Finally, some numerical examples are provided to show how the code works for the complex dynamics of BEC problems.

Numerical and experimental study of expiratory flow in the case of major upper airway obstructions with fluid structure interaction

NASA Astrophysics Data System (ADS)

Chouly, F.; van Hirtum, A.; Lagrée, P.-Y.; Pelorson, X.; Payan, Y.

2008-02-01

This study deals with the numerical prediction and experimental description of the flow-induced deformation in a rapidly convergent divergent geometry which stands for a simplified tongue, in interaction with an expiratory airflow. An original in vitro experimental model is proposed, which allows measurement of the deformation of the artificial tongue, in condition of major initial airway obstruction. The experimental model accounts for asymmetries in geometry and tissue properties which are two major physiological upper airway characteristics. The numerical method for prediction of the fluid structure interaction is described. The theory of linear elasticity in small deformations has been chosen to compute the mechanical behaviour of the tongue. The main features of the flow are taken into account using a boundary layer theory. The overall numerical method entails finite element solving of the solid problem and finite differences solving of the fluid problem. First, the numerical method predicts the deformation of the tongue with an overall error of the order of 20%, which can be seen as a preliminary successful validation of the theory and simulations. Moreover, expiratory flow limitation is predicted in this configuration. As a result, both the physical and numerical models could be useful to understand this phenomenon reported in heavy snorers and apneic patients during sleep.

Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem.

PubMed

Fort, J C

1988-01-01

We present an application of the Kohonen algorithm to the traveling salesman problem: Using only this algorithm, without energy function nor any parameter chosen "ad hoc", we found good suboptimal tours. We give a neural model version of this algorithm, closer to classical neural networks. This is illustrated with various numerical examples.

A Numerical Investigation of the Burnett Equations Based on the Second Law

NASA Technical Reports Server (NTRS)

Comeaux, Keith A.; Chapman, Dean R.; MacCormack, Robert W.; Edwards, Thomas A. (Technical Monitor)

1995-01-01

The Burnett equations have been shown to potentially violate the second law of thermodynamics. The objective of this investigation is to correlate the numerical problems experienced by the Burnett equations to the negative production of entropy. The equations have had a long history of numerical instability to small wavelength disturbances. Recently, Zhong corrected the instability problem and made solutions attainable for one dimensional shock waves and hypersonic blunt bodies. Difficulties still exist when attempting to solve hypersonic flat plate boundary layers and blunt body wake flows, however. Numerical experiments will include one-dimensional shock waves, quasi-one dimensional nozzles, and expanding Prandlt-Meyer flows and specifically examine the entropy production for these cases.

Some observations on a new numerical method for solving Navier-Stokes equations

NASA Technical Reports Server (NTRS)

Kumar, A.

1981-01-01

An explicit-implicit technique for solving Navier-Stokes equations is described which, is much less complex than other implicit methods. It is used to solve a complex, two-dimensional, steady-state, supersonic-flow problem. The computational efficiency of the method and the quality of the solution obtained from it at high Courant-Friedrich-Lewy (CFL) numbers are discussed. Modifications are discussed and certain observations are made about the method which may be helpful in using it successfully.

Multiple representations and free-body diagrams: Do students benefit from using them?

NASA Astrophysics Data System (ADS)

Rosengrant, David R.

2007-12-01

Introductory physics students have difficulties understanding concepts and solving problems. When they solve problems, they use surface features of the problems to find an equation to calculate a numerical answer often not understanding the physics in the problem. How do we help students approach problem solving in an expert manner? A possible answer is to help them learn to represent knowledge in multiple ways and then use these different representations for conceptual understanding and problem solving. This solution follows from research in cognitive science and in physics education. However, there are no studies in physics that investigate whether students who learn to use multiple representations are in fact better problem solvers. This study focuses on one specific representation used in physics--a free body diagram. A free-body diagram is a graphical representation of forces exerted on an object of interest by other objects. I used the free-body diagram to investigate five main questions: (1) If students are in a course where they consistently use free body diagrams to construct and test concepts in mechanics, electricity and magnetism and to solve problems in class and in homework, will they draw free-body diagrams on their own when solving exam problems? (2) Are students who use free-body diagrams to solve problems more successful then those who do not? (3) Why do students draw free-body diagrams when solving problems? (4) Are students consistent in constructing diagrams for different concepts in physics and are they consistent in the quality of their diagrams? (5) What are possible relationships between features of a problem and how likely a student will draw a free body diagram to help them solve the problem? I utilized a mixed-methods approach to answer these questions. Questions 1, 2, 4 and 5 required a quantitative approach while question 3 required a qualitative approach, a case study. When I completed my study, I found that if students are in an environment which fosters the use of representations for problem solving and for concept development, then the majority of students will consistently construct helpful free-body diagrams and use them on their own to solve problems. Additionally, those that construct correct free-body diagrams are significantly more likely to successfully solve the problem. Finally, those students that are high achieving tend to use diagrams more and for more reasons then students who have low course grades. These findings will have major impacts on how introductory physics instructors run their classes and how curriculums are designed. These results favor a problem solving strategy that is rich with representations.

Multimaterial topology optimization of contact problems using phase field regularization

NASA Astrophysics Data System (ADS)

Myśliński, Andrzej

2018-01-01

The numerical method to solve multimaterial topology optimization problems for elastic bodies in unilateral contact with Tresca friction is developed in the paper. The displacement of the elastic body in contact is governed by elliptic equation with inequality boundary conditions. The body is assumed to consists from more than two distinct isotropic elastic materials. The materials distribution function is chosen as the design variable. Since high contact stress appears during the contact phenomenon the aim of the structural optimization problem is to find such topology of the domain occupied by the body that the normal contact stress along the boundary of the body is minimized. The original cost functional is regularized using the multiphase volume constrained Ginzburg-Landau energy functional rather than the perimeter functional. The first order necessary optimality condition is recalled and used to formulate the generalized gradient flow equations of Allen-Cahn type. The optimal topology is obtained as the steady state of the phase transition governed by the generalized Allen-Cahn equation. As the interface width parameter tends to zero the transition of the phase field model to the level set model is studied. The optimization problem is solved numerically using the operator splitting approach combined with the projection gradient method. Numerical examples confirming the applicability of the proposed method are provided and discussed.

Accurate boundary conditions for exterior problems in gas dynamics

NASA Technical Reports Server (NTRS)

Hagstrom, Thomas; Hariharan, S. I.

1988-01-01

The numerical solution of exterior problems is typically accomplished by introducing an artificial, far field boundary and solving the equations on a truncated domain. For hyperbolic systems, boundary conditions at this boundary are often derived by imposing a principle of no reflection. However, waves with spherical symmetry in gas dynamics satisfy equations where incoming and outgoing Riemann variables are coupled. This suggests that natural reflections may be important. A reflecting boundary condition is proposed based on an asymptotic solution of the far field equations. Nonlinear energy estimates are obtained for the truncated problem and numerical experiments presented to validate the theory.

Accurate boundary conditions for exterior problems in gas dynamics

NASA Technical Reports Server (NTRS)

Hagstrom, Thomas; Hariharan, S. I.

1988-01-01

The numerical solution of exterior problems is typically accomplished by introducing an artificial, far-field boundary and solving the equations on a truncated domain. For hyperbolic systems, boundary conditions at this boundary are often derived by imposing a principle of no reflection. However, waves with spherical symmetry in gas dynamics satisfy equations where incoming and outgoing Riemann variables are coupled. This suggests that natural reflections may be important. A reflecting boundary condition is proposed based on an asymptotic solution of the far-field equations. Nonlinear energy estimates are obtained for the truncated problem and numerical experiments presented to validate the theory.

A fast isogeometric BEM for the three dimensional Laplace- and Helmholtz problems

NASA Astrophysics Data System (ADS)

Dölz, Jürgen; Harbrecht, Helmut; Kurz, Stefan; Schöps, Sebastian; Wolf, Felix

2018-03-01

We present an indirect higher order boundary element method utilising NURBS mappings for exact geometry representation and an interpolation-based fast multipole method for compression and reduction of computational complexity, to counteract the problems arising due to the dense matrices produced by boundary element methods. By solving Laplace and Helmholtz problems via a single layer approach we show, through a series of numerical examples suitable for easy comparison with other numerical schemes, that one can indeed achieve extremely high rates of convergence of the pointwise potential through the utilisation of higher order B-spline-based ansatz functions.

A modified form of conjugate gradient method for unconstrained optimization problems

NASA Astrophysics Data System (ADS)

Ghani, Nur Hamizah Abdul; Rivaie, Mohd.; Mamat, Mustafa

2016-06-01

Conjugate gradient (CG) methods have been recognized as an interesting technique to solve optimization problems, due to the numerical efficiency, simplicity and low memory requirements. In this paper, we propose a new CG method based on the study of Rivaie et al. [7] (Comparative study of conjugate gradient coefficient for unconstrained Optimization, Aus. J. Bas. Appl. Sci. 5(2011) 947-951). Then, we show that our method satisfies sufficient descent condition and converges globally with exact line search. Numerical results show that our proposed method is efficient for given standard test problems, compare to other existing CG methods.

Numerical Inverse Scattering for the Toda Lattice

NASA Astrophysics Data System (ADS)

Bilman, Deniz; Trogdon, Thomas

2017-06-01

We present a method to compute the inverse scattering transform (IST) for the famed Toda lattice by solving the associated Riemann-Hilbert (RH) problem numerically. Deformations for the RH problem are incorporated so that the IST can be evaluated in O(1) operations for arbitrary points in the ( n, t)-domain, including short- and long-time regimes. No time-stepping is required to compute the solution because ( n, t) appear as parameters in the associated RH problem. The solution of the Toda lattice is computed in long-time asymptotic regions where the asymptotics are not known rigorously.

A new operational approach for solving fractional variational problems depending on indefinite integrals

NASA Astrophysics Data System (ADS)

Ezz-Eldien, S. S.; Doha, E. H.; Bhrawy, A. H.; El-Kalaawy, A. A.; Machado, J. A. T.

2018-04-01

In this paper, we propose a new accurate and robust numerical technique to approximate the solutions of fractional variational problems (FVPs) depending on indefinite integrals with a type of fixed Riemann-Liouville fractional integral. The proposed technique is based on the shifted Chebyshev polynomials as basis functions for the fractional integral operational matrix (FIOM). Together with the Lagrange multiplier method, these problems are then reduced to a system of algebraic equations, which greatly simplifies the solution process. Numerical examples are carried out to confirm the accuracy, efficiency and applicability of the proposed algorithm

Cost effective campaigning in social networks

NASA Astrophysics Data System (ADS)

Kotnis, Bhushan; Kuri, Joy

2016-05-01

Campaigners are increasingly using online social networking platforms for promoting products, ideas and information. A popular method of promoting a product or even an idea is incentivizing individuals to evangelize the idea vigorously by providing them with referral rewards in the form of discounts, cash backs, or social recognition. Due to budget constraints on scarce resources such as money and manpower, it may not be possible to provide incentives for the entire population, and hence incentives need to be allocated judiciously to appropriate individuals for ensuring the highest possible outreach size. We aim to do the same by formulating and solving an optimization problem using percolation theory. In particular, we compute the set of individuals that are provided incentives for minimizing the expected cost while ensuring a given outreach size. We also solve the problem of computing the set of individuals to be incentivized for maximizing the outreach size for given cost budget. The optimization problem turns out to be non trivial; it involves quantities that need to be computed by numerically solving a fixed point equation. Our primary contribution is, that for a fairly general cost structure, we show that the optimization problems can be solved by solving a simple linear program. We believe that our approach of using percolation theory to formulate an optimization problem is the first of its kind.

Expected value analysis for integrated supplier selection and inventory control of multi-product inventory system with fuzzy cost

NASA Astrophysics Data System (ADS)

Sutrisno, Widowati, Tjahjana, R. Heru

2017-12-01

The future cost in many industrial problem is obviously uncertain. Then a mathematical analysis for a problem with uncertain cost is needed. In this article, we deals with the fuzzy expected value analysis to solve an integrated supplier selection and supplier selection problem with uncertain cost where the costs uncertainty is approached by a fuzzy variable. We formulate the mathematical model of the problems fuzzy expected value based quadratic optimization with total cost objective function and solve it by using expected value based fuzzy programming. From the numerical examples result performed by the authors, the supplier selection problem was solved i.e. the optimal supplier was selected for each time period where the optimal product volume of all product that should be purchased from each supplier for each time period was determined and the product stock level was controlled as decided by the authors i.e. it was followed the given reference level.

Reliable use of determinants to solve nonlinear structural eigenvalue problems efficiently

NASA Technical Reports Server (NTRS)

Williams, F. W.; Kennedy, D.

1988-01-01

The analytical derivation, numerical implementation, and performance of a multiple-determinant parabolic interpolation method (MDPIM) for use in solving transcendental eigenvalue (critical buckling or undamped free vibration) problems in structural mechanics are presented. The overall bounding, eigenvalue-separation, qualified parabolic interpolation, accuracy-confirmation, and convergence-recovery stages of the MDPIM are described in detail, and the numbers of iterations required to solve sample plane-frame problems using the MDPIM are compared with those for a conventional bisection method and for the Newtonian method of Simpson (1984) in extensive tables. The MDPIM is shown to use 31 percent less computation time than bisection when accuracy of 0.0001 is required, but 62 percent less when accuracy of 10 to the -8th is required; the time savings over the Newtonian method are about 10 percent.

Structure preserving parallel algorithms for solving the Bethe–Salpeter eigenvalue problem

DOE PAGES

Shao, Meiyue; da Jornada, Felipe H.; Yang, Chao; ...

2015-10-02

The Bethe–Salpeter eigenvalue problem is a dense structured eigenvalue problem arising from discretized Bethe–Salpeter equation in the context of computing exciton energies and states. A computational challenge is that at least half of the eigenvalues and the associated eigenvectors are desired in practice. In this paper, we establish the equivalence between Bethe–Salpeter eigenvalue problems and real Hamiltonian eigenvalue problems. Based on theoretical analysis, structure preserving algorithms for a class of Bethe–Salpeter eigenvalue problems are proposed. We also show that for this class of problems all eigenvalues obtained from the Tamm–Dancoff approximation are overestimated. In order to solve large scale problemsmore » of practical interest, we discuss parallel implementations of our algorithms targeting distributed memory systems. Finally, several numerical examples are presented to demonstrate the efficiency and accuracy of our algorithms.« less

Active Problem Solving and Applied Research Methods in a Graduate Course on Numerical Methods

ERIC Educational Resources Information Center

Maase, Eric L.; High, Karen A.

2008-01-01

"Chemical Engineering Modeling" is a first-semester graduate course traditionally taught in a lecture format at Oklahoma State University. The course as taught by the author for the past seven years focuses on numerical and mathematical methods as necessary skills for incoming graduate students. Recent changes to the course have included Visual…

Solution of Algebraic Equations in the Analysis, Design, and Optimization of Continuous Ultrafiltration

ERIC Educational Resources Information Center

Foley, Greg

2011-01-01

Continuous feed and bleed ultrafiltration, modeled with the gel polarization model for the limiting flux, is shown to provide a rich source of non-linear algebraic equations that can be readily solved using numerical and graphical techniques familiar to undergraduate students. We present a variety of numerical problems in the design, analysis, and…

A new scheme of the time-domain fluorescence tomography for a semi-infinite turbid medium

NASA Astrophysics Data System (ADS)

Prieto, Kernel; Nishimura, Goro

2017-04-01

A new scheme for reconstruction of a fluorophore target embedded in a semi-infinite medium was proposed and evaluated. In this scheme, we neglected the presence of the fluorophore target for the excitation light and used an analytical solution of the time-dependent radiative transfer equation (RTE) for the excitation light in a homogeneous semi-infinite media instead of solving the RTE numerically in the forward calculation. The inverse problem for imaging the fluorophore target was solved using the Landweber-Kaczmarz method with the concept of the adjoint fields. Numerical experiments show that the proposed scheme provides acceptable results of the reconstructed shape and location of the target. The computation times of the solution of the forward problem and the whole reconstruction process were reduced by about 40 and 15%, respectively.

Assessment of numerical methods for the solution of fluid dynamics equations for nonlinear resonance systems

NASA Technical Reports Server (NTRS)

Przekwas, A. J.; Yang, H. Q.

1989-01-01

The capability of accurate nonlinear flow analysis of resonance systems is essential in many problems, including combustion instability. Classical numerical schemes are either too diffusive or too dispersive especially for transient problems. In the last few years, significant progress has been made in the numerical methods for flows with shocks. The objective was to assess advanced shock capturing schemes on transient flows. Several numerical schemes were tested including TVD, MUSCL, ENO, FCT, and Riemann Solver Godunov type schemes. A systematic assessment was performed on scalar transport, Burgers' and gas dynamic problems. Several shock capturing schemes are compared on fast transient resonant pipe flow problems. A system of 1-D nonlinear hyperbolic gas dynamics equations is solved to predict propagation of finite amplitude waves, the wave steepening, formation, propagation, and reflection of shocks for several hundred wave cycles. It is shown that high accuracy schemes can be used for direct, exact nonlinear analysis of combustion instability problems, preserving high harmonic energy content for long periods of time.

A Fixed-point Scheme for the Numerical Construction of Magnetohydrostatic Atmospheres in Three Dimensions

NASA Astrophysics Data System (ADS)

Gilchrist, S. A.; Braun, D. C.; Barnes, G.

2016-12-01

Magnetohydrostatic models of the solar atmosphere are often based on idealized analytic solutions because the underlying equations are too difficult to solve in full generality. Numerical approaches, too, are often limited in scope and have tended to focus on the two-dimensional problem. In this article we develop a numerical method for solving the nonlinear magnetohydrostatic equations in three dimensions. Our method is a fixed-point iteration scheme that extends the method of Grad and Rubin ( Proc. 2nd Int. Conf. on Peaceful Uses of Atomic Energy 31, 190, 1958) to include a finite gravity force. We apply the method to a test case to demonstrate the method in general and our implementation in code in particular.

Numerical simulation of two-dimensional heat transfer in composite bodies with application to de-icing of aircraft components. Ph.D. Thesis. Final Report

NASA Technical Reports Server (NTRS)

Chao, D. F. K.

1983-01-01

Transient, numerical simulations of the de-icing of composite aircraft components by electrothermal heating were performed for a two dimensional rectangular geometry. The implicit Crank-Nicolson formulation was used to insure stability of the finite-difference heat conduction equations and the phase change in the ice layer was simulated using the Enthalpy method. The Gauss-Seidel point iterative method was used to solve the system of difference equations. Numerical solutions illustrating de-icer performance for various composite aircraft structures and environmental conditions are presented. Comparisons are made with previous studies. The simulation can also be used to solve a variety of other heat conduction problems involving composite bodies.

Mass storage: The key to success in high performance computing

NASA Technical Reports Server (NTRS)

Lee, Richard R.

1993-01-01

There are numerous High Performance Computing & Communications Initiatives in the world today. All are determined to help solve some 'Grand Challenges' type of problem, but each appears to be dominated by the pursuit of higher and higher levels of CPU performance and interconnection bandwidth as the approach to success, without any regard to the impact of Mass Storage. My colleagues and I at Data Storage Technologies believe that all will have their performance against their goals ultimately measured by their ability to efficiently store and retrieve the 'deluge of data' created by end-users who will be using these systems to solve Scientific Grand Challenges problems, and that the issue of Mass Storage will become then the determinant of success or failure in achieving each projects goals. In today's world of High Performance Computing and Communications (HPCC), the critical path to success in solving problems can only be traveled by designing and implementing Mass Storage Systems capable of storing and manipulating the truly 'massive' amounts of data associated with solving these challenges. Within my presentation I will explore this critical issue and hypothesize solutions to this problem.

Summer Proceedings 2016: The Center for Computing Research at Sandia National Laboratories

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carleton, James Brian; Parks, Michael L.

Solving sparse linear systems from the discretization of elliptic partial differential equations (PDEs) is an important building block in many engineering applications. Sparse direct solvers can solve general linear systems, but are usually slower and use much more memory than effective iterative solvers. To overcome these two disadvantages, a hierarchical solver (LoRaSp) based on H2-matrices was introduced in [22]. Here, we have developed a parallel version of the algorithm in LoRaSp to solve large sparse matrices on distributed memory machines. On a single processor, the factorization time of our parallel solver scales almost linearly with the problem size for three-dimensionalmore » problems, as opposed to the quadratic scalability of many existing sparse direct solvers. Moreover, our solver leads to almost constant numbers of iterations, when used as a preconditioner for Poisson problems. On more than one processor, our algorithm has significant speedups compared to sequential runs. With this parallel algorithm, we are able to solve large problems much faster than many existing packages as demonstrated by the numerical experiments.« less

Convex Relaxation of OPF in Multiphase Radial Networks with Wye and Delta Connections

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao, Changhong; Dall-Anese, Emiliano; Low, Steven

2017-08-01

This panel presentation focuses on multiphase radial distribution networks with wye and delta connections, and proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem. Two multiphase power flow models are developed to facilitate the integration of delta-connected loads or generation resources in the OPF problem. The first model is referred to as the extended branch flow model (EBFM). The second model leverages a linear relationship between phase-to-ground power injections and delta connections that holds under a balanced voltage approximation (BVA). Based on these models, pertinent OPF problems are formulated and relaxed to semidefinite programs (SDPs). Numerical studiesmore » on IEEE test feeders show that the proposed SDP relaxations can be solved efficiently by a generic optimization solver. Numerical evidence also indicates that solving the resultant SDP under BVA is faster than under EBFM. Moreover, both SDP solutions are numerically exact with respect to voltages and branch flows. It is further shown that the SDP solution under BVA has a small optimality gap, and the BVA model is accurate in the sense that it reproduces actual system voltages.« less

Co-state initialization for the minimum-time low-thrust trajectory optimization

NASA Astrophysics Data System (ADS)

Taheri, Ehsan; Li, Nan I.; Kolmanovsky, Ilya

2017-05-01

This paper presents an approach for co-state initialization which is a critical step in solving minimum-time low-thrust trajectory optimization problems using indirect optimal control numerical methods. Indirect methods used in determining the optimal space trajectories typically result in two-point boundary-value problems and are solved by single- or multiple-shooting numerical methods. Accurate initialization of the co-state variables facilitates the numerical convergence of iterative boundary value problem solvers. In this paper, we propose a method which exploits the trajectory generated by the so-called pseudo-equinoctial and three-dimensional finite Fourier series shape-based methods to estimate the initial values of the co-states. The performance of the approach for two interplanetary rendezvous missions from Earth to Mars and from Earth to asteroid Dionysus is compared against three other approaches which, respectively, exploit random initialization of co-states, adjoint-control transformation and a standard genetic algorithm. The results indicate that by using our proposed approach the percent of the converged cases is higher for trajectories with higher number of revolutions while the computation time is lower. These features are advantageous for broad trajectory search in the preliminary phase of mission designs.

a Novel Discrete Optimal Transport Method for Bayesian Inverse Problems

NASA Astrophysics Data System (ADS)

Bui-Thanh, T.; Myers, A.; Wang, K.; Thiery, A.

2017-12-01

We present the Augmented Ensemble Transform (AET) method for generating approximate samples from a high-dimensional posterior distribution as a solution to Bayesian inverse problems. Solving large-scale inverse problems is critical for some of the most relevant and impactful scientific endeavors of our time. Therefore, constructing novel methods for solving the Bayesian inverse problem in more computationally efficient ways can have a profound impact on the science community. This research derives the novel AET method for exploring a posterior by solving a sequence of linear programming problems, resulting in a series of transport maps which map prior samples to posterior samples, allowing for the computation of moments of the posterior. We show both theoretical and numerical results, indicating this method can offer superior computational efficiency when compared to other SMC methods. Most of this efficiency is derived from matrix scaling methods to solve the linear programming problem and derivative-free optimization for particle movement. We use this method to determine inter-well connectivity in a reservoir and the associated uncertainty related to certain parameters. The attached file shows the difference between the true parameter and the AET parameter in an example 3D reservoir problem. The error is within the Morozov discrepancy allowance with lower computational cost than other particle methods.

Numerical analysis of a main crack interactions with micro-defects/inhomogeneities using two-scale generalized/extended finite element method

NASA Astrophysics Data System (ADS)

Malekan, Mohammad; Barros, Felício B.

2017-12-01

Generalized or extended finite element method (G/XFEM) models the crack by enriching functions of partition of unity type with discontinuous functions that represent well the physical behavior of the problem. However, this enrichment functions are not available for all problem types. Thus, one can use numerically-built (global-local) enrichment functions to have a better approximate procedure. This paper investigates the effects of micro-defects/inhomogeneities on a main crack behavior by modeling the micro-defects/inhomogeneities in the local problem using a two-scale G/XFEM. The global-local enrichment functions are influenced by the micro-defects/inhomogeneities from the local problem and thus change the approximate solution of the global problem with the main crack. This approach is presented in detail by solving three different linear elastic fracture mechanics problems for different cases: two plane stress and a Reissner-Mindlin plate problems. The numerical results obtained with the two-scale G/XFEM are compared with the reference solutions from the analytical, numerical solution using standard G/XFEM method and ABAQUS as well, and from the literature.

Self-Scheduling Parallel Methods for Multiple Serial Codes with Application to WOPWOP

NASA Technical Reports Server (NTRS)

Long, Lyle N.; Brentner, Kenneth S.

2000-01-01

This paper presents a scheme for efficiently running a large number of serial jobs on parallel computers. Two examples are given of computer programs that run relatively quickly, but often they must be run numerous times to obtain all the results needed. It is very common in science and engineering to have codes that are not massive computing challenges in themselves, but due to the number of instances that must be run, they do become large-scale computing problems. The two examples given here represent common problems in aerospace engineering: aerodynamic panel methods and aeroacoustic integral methods. The first example simply solves many systems of linear equations. This is representative of an aerodynamic panel code where someone would like to solve for numerous angles of attack. The complete code for this first example is included in the appendix so that it can be readily used by others as a template. The second example is an aeroacoustics code (WOPWOP) that solves the Ffowcs Williams Hawkings equation to predict the far-field sound due to rotating blades. In this example, one quite often needs to compute the sound at numerous observer locations, hence parallelization is utilized to automate the noise computation for a large number of observers.

A Multilevel, Hierarchical Sampling Technique for Spatially Correlated Random Fields

DOE PAGES

Osborn, Sarah; Vassilevski, Panayot S.; Villa, Umberto

2017-10-26

In this paper, we propose an alternative method to generate samples of a spatially correlated random field with applications to large-scale problems for forward propagation of uncertainty. A classical approach for generating these samples is the Karhunen--Loève (KL) decomposition. However, the KL expansion requires solving a dense eigenvalue problem and is therefore computationally infeasible for large-scale problems. Sampling methods based on stochastic partial differential equations provide a highly scalable way to sample Gaussian fields, but the resulting parametrization is mesh dependent. We propose a multilevel decomposition of the stochastic field to allow for scalable, hierarchical sampling based on solving amore » mixed finite element formulation of a stochastic reaction-diffusion equation with a random, white noise source function. Lastly, numerical experiments are presented to demonstrate the scalability of the sampling method as well as numerical results of multilevel Monte Carlo simulations for a subsurface porous media flow application using the proposed sampling method.« less

Benchmarking a Visual-Basic based multi-component one-dimensional reactive transport modeling tool

NASA Astrophysics Data System (ADS)

Torlapati, Jagadish; Prabhakar Clement, T.

2013-01-01

We present the details of a comprehensive numerical modeling tool, RT1D, which can be used for simulating biochemical and geochemical reactive transport problems. The code can be run within the standard Microsoft EXCEL Visual Basic platform, and it does not require any additional software tools. The code can be easily adapted by others for simulating different types of laboratory-scale reactive transport experiments. We illustrate the capabilities of the tool by solving five benchmark problems with varying levels of reaction complexity. These literature-derived benchmarks are used to highlight the versatility of the code for solving a variety of practical reactive transport problems. The benchmarks are described in detail to provide a comprehensive database, which can be used by model developers to test other numerical codes. The VBA code presented in the study is a practical tool that can be used by laboratory researchers for analyzing both batch and column datasets within an EXCEL platform.

A Multilevel, Hierarchical Sampling Technique for Spatially Correlated Random Fields

DOE Office of Scientific and Technical Information (OSTI.GOV)

Osborn, Sarah; Vassilevski, Panayot S.; Villa, Umberto

In this paper, we propose an alternative method to generate samples of a spatially correlated random field with applications to large-scale problems for forward propagation of uncertainty. A classical approach for generating these samples is the Karhunen--Loève (KL) decomposition. However, the KL expansion requires solving a dense eigenvalue problem and is therefore computationally infeasible for large-scale problems. Sampling methods based on stochastic partial differential equations provide a highly scalable way to sample Gaussian fields, but the resulting parametrization is mesh dependent. We propose a multilevel decomposition of the stochastic field to allow for scalable, hierarchical sampling based on solving amore » mixed finite element formulation of a stochastic reaction-diffusion equation with a random, white noise source function. Lastly, numerical experiments are presented to demonstrate the scalability of the sampling method as well as numerical results of multilevel Monte Carlo simulations for a subsurface porous media flow application using the proposed sampling method.« less

Discontinuous Galerkin finite element methods for radiative transfer in spherical symmetry

NASA Astrophysics Data System (ADS)

Kitzmann, D.; Bolte, J.; Patzer, A. B. C.

2016-11-01

The discontinuous Galerkin finite element method (DG-FEM) is successfully applied to treat a broad variety of transport problems numerically. In this work, we use the full capacity of the DG-FEM to solve the radiative transfer equation in spherical symmetry. We present a discontinuous Galerkin method to directly solve the spherically symmetric radiative transfer equation as a two-dimensional problem. The transport equation in spherical atmospheres is more complicated than in the plane-parallel case owing to the appearance of an additional derivative with respect to the polar angle. The DG-FEM formalism allows for the exact integration of arbitrarily complex scattering phase functions, independent of the angular mesh resolution. We show that the discontinuous Galerkin method is able to describe accurately the radiative transfer in extended atmospheres and to capture discontinuities or complex scattering behaviour which might be present in the solution of certain radiative transfer tasks and can, therefore, cause severe numerical problems for other radiative transfer solution methods.

A model-adaptivity method for the solution of Lennard-Jones based adhesive contact problems

NASA Astrophysics Data System (ADS)

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.

Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem.

PubMed

Zhao, Ying; Shi, Luoyi

2017-01-01

This paper introduces a new extragradient-type method to solve the multiple-sets split equality problem (MSSEP). Under some suitable conditions, the strong convergence of an algorithm can be verified in the infinite-dimensional Hilbert spaces. Moreover, several numerical results are given to show the effectiveness of our algorithm.

Math Thinkercises. A Good Apple Math Activity Book for Students. Grades 4-8.

ERIC Educational Resources Information Center

Daniel, Becky

This booklet designed for students in grades 4-8 provides 52 activities, including puzzles and problems. Activities range from simple to complex, giving learners practice in finding patterns, numeration, permutation, and problem solving. Calculators should be available, and students should be encouraged to discuss solutions with classmates,…

Anger Coping Method and Skill Training for Chinese Children with Physically Aggressive Behaviors

ERIC Educational Resources Information Center

Fung, Annis L. C.; Tsang, Sandra K. M.

2007-01-01

Aggression hinders development in the child and creates numerous problems in the family, school and community. An indigenous Anger Coping Training program for Chinese children with aggressive behavior and their parents aimed to help reactively aggressive children in increasing anger coping methods and enhancing problem-solving abilities. This…

New Galerkin operational matrices for solving Lane-Emden type equations

NASA Astrophysics Data System (ADS)

Abd-Elhameed, W. M.; Doha, E. H.; Saad, A. S.; Bassuony, M. A.

2016-04-01

Lane-Emden type equations model many phenomena in mathematical physics and astrophysics, such as thermal explosions. This paper is concerned with introducing third and fourth kind Chebyshev-Galerkin operational matrices in order to solve such problems. The principal idea behind the suggested algorithms is based on converting the linear or nonlinear Lane-Emden problem, through the application of suitable spectral methods, into a system of linear or nonlinear equations in the expansion coefficients, which can be efficiently solved. The main advantage of the proposed algorithm in the linear case is that the resulting linear systems are specially structured, and this of course reduces the computational effort required to solve such systems. As an application, we consider the solar model polytrope with n=3 to show that the suggested solutions in this paper are in good agreement with the numerical results.

Multi-level adaptive finite element methods. 1: Variation problems

NASA Technical Reports Server (NTRS)

Brandt, A.

1979-01-01

A general numerical strategy for solving partial differential equations and other functional problems by cycling between coarser and finer levels of discretization is described. Optimal discretization schemes are provided together with very fast general solvers. It is described in terms of finite element discretizations of general nonlinear minimization problems. The basic processes (relaxation sweeps, fine-grid-to-coarse-grid transfers of residuals, coarse-to-fine interpolations of corrections) are directly and naturally determined by the objective functional and the sequence of approximation spaces. The natural processes, however, are not always optimal. Concrete examples are given and some new techniques are reviewed. Including the local truncation extrapolation and a multilevel procedure for inexpensively solving chains of many boundary value problems, such as those arising in the solution of time-dependent problems.

A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing

PubMed Central

Wang, Zhaocai; Pu, Jun; Cao, Liling; Tan, Jian

2015-01-01

The unbalanced assignment problem (UAP) is to optimally resolve the problem of assigning n jobs to m individuals (m < n), such that minimum cost or maximum profit obtained. It is a vitally important Non-deterministic Polynomial (NP) complete problem in operation management and applied mathematics, having numerous real life applications. In this paper, we present a new parallel DNA algorithm for solving the unbalanced assignment problem using DNA molecular operations. We reasonably design flexible-length DNA strands representing different jobs and individuals, take appropriate steps, and get the solutions of the UAP in the proper length range and O(mn) time. We extend the application of DNA molecular operations and simultaneity to simplify the complexity of the computation. PMID:26512650

Lattice gas methods for computational aeroacoustics

NASA Technical Reports Server (NTRS)

Sparrow, Victor W.

1995-01-01

This paper presents the lattice gas solution to the category 1 problems of the ICASE/LaRC Workshop on Benchmark Problems in Computational Aeroacoustics. The first and second problems were solved for Delta t = Delta x = 1, and additionally the second problem was solved for Delta t = 1/4 and Delta x = 1/2. The results are striking: even for these large time and space grids the lattice gas numerical solutions are almost indistinguishable from the analytical solutions. A simple bug in the Mathematica code was found in the solutions submitted for comparison, and the comparison plots shown at the end of this volume show the bug. An Appendix to the present paper shows an example lattice gas solution with and without the bug.

Constrained and Unconstrained Variational Finite Element Formulation of Solutions to a Stress Wave Problem - a Numerical Comparison.

DTIC Science & Technology

1982-10-01

Element Unconstrained Variational Formulations," Innovativ’e Numerical Analysis For the Applied Engineering Science, R. P. Shaw, et at, Fitor...Initial Boundary Value of Gun Dynamics Solved by Finite Element Unconstrained Variational Formulations," Innovative Numerical Analysis For the Applied ... Engineering Science, R. P. Shaw, et al, Editors, University Press of Virginia, Charlottesville, pp. 733-741, 1980. 2 J. J. Wu, "Solutions to Initial

Direct SQP-methods for solving optimal control problems with delays

DOE Office of Scientific and Technical Information (OSTI.GOV)

Goellmann, L.; Bueskens, C.; Maurer, H.

The maximum principle for optimal control problems with delays leads to a boundary value problem (BVP) which is retarded in the state and advanced in the costate function. Based on shooting techniques, solution methods for this type of BVP have been proposed. In recent years, direct optimization methods have been favored for solving control problems without delays. Direct methods approximate the control and the state over a fixed mesh and solve the resulting NLP-problem with SQP-methods. These methods dispense with the costate function and have shown to be robust and efficient. In this paper, we propose a direct SQP-method formore » retarded control problems. In contrast to conventional direct methods, only the control variable is approximated by e.g. spline-functions. The state is computed via a high order Runge-Kutta type algorithm and does not enter explicitly the NLP-problem through an equation. This approach reduces the number of optimization variables considerably and is implementable even on a PC. Our method is illustrated by the numerical solution of retarded control problems with constraints. In particular, we consider the control of a continuous stirred tank reactor which has been solved by dynamic programming. This example illustrates the robustness and efficiency of the proposed method. Open questions concerning sufficient conditions and convergence of discretized NLP-problems are discussed.« less

Benchmark problems in computational aeroacoustics

NASA Technical Reports Server (NTRS)

Porter-Locklear, Freda

1994-01-01

A recent directive at NASA Langley is aimed at numerically predicting principal noise sources. During my summer stay, I worked with high-order ENO code, developed by Dr. Harold Atkins, for solving the unsteady compressible Navier-Stokes equations, as it applies to computational aeroacoustics (CAA). A CAA workshop, composed of six categories of benchmark problems, has been organized to test various numerical properties of code. My task was to determine the robustness of Atkins' code for these test problems. In one category, we tested the nonlinear wave propagation of the code for the one-dimensional Euler equations, with initial pressure, density, and velocity conditions. Using freestream boundary conditions, our results were plausible. In another category, we solved the linearized two-dimensional Euler equations to test the effectiveness of radiation boundary conditions. Here we utilized MAPLE to compute eigenvalues and eigenvectors of the Jacobian given variable and flux vectors. We experienced a minor problem with inflow and outflow boundary conditions. Next, we solved the quasi one dimensional unsteady flow equations with an incoming acoustic wave of amplitude 10(exp -6). The small amplitude sound wave was incident on a convergent-divergent nozzle. After finding a steady-state solution and then marching forward, our solution indicated that after 30 periods the acoustic wave had dissipated (a period is time required for sound wave to traverse one end of nozzle to other end).

Linear and nonlinear dynamic analysis by boundary element method. Ph.D. Thesis, 1986 Final Report

NASA Technical Reports Server (NTRS)

Ahmad, Shahid

1991-01-01

An advanced implementation of the direct boundary element method (BEM) applicable to free-vibration, periodic (steady-state) vibration and linear and nonlinear transient dynamic problems involving two and three-dimensional isotropic solids of arbitrary shape is presented. Interior, exterior, and half-space problems can all be solved by the present formulation. For the free-vibration analysis, a new real variable BEM formulation is presented which solves the free-vibration problem in the form of algebraic equations (formed from the static kernels) and needs only surface discretization. In the area of time-domain transient analysis, the BEM is well suited because it gives an implicit formulation. Although the integral formulations are elegant, because of the complexity of the formulation it has never been implemented in exact form. In the present work, linear and nonlinear time domain transient analysis for three-dimensional solids has been implemented in a general and complete manner. The formulation and implementation of the nonlinear, transient, dynamic analysis presented here is the first ever in the field of boundary element analysis. Almost all the existing formulation of BEM in dynamics use the constant variation of the variables in space and time which is very unrealistic for engineering problems and, in some cases, it leads to unacceptably inaccurate results. In the present work, linear and quadratic isoparametric boundary elements are used for discretization of geometry and functional variations in space. In addition, higher order variations in time are used. These methods of analysis are applicable to piecewise-homogeneous materials, such that not only problems of the layered media and the soil-structure interaction can be analyzed but also a large problem can be solved by the usual sub-structuring technique. The analyses have been incorporated in a versatile, general-purpose computer program. Some numerical problems are solved and, through comparisons with available analytical and numerical results, the stability and high accuracy of these dynamic analysis techniques are established.

A Semi-Infinite Programming based algorithm for determining T-optimum designs for model discrimination

PubMed Central

Duarte, Belmiro P.M.; Wong, Weng Kee; Atkinson, Anthony C.

2016-01-01

T-optimum designs for model discrimination are notoriously difficult to find because of the computational difficulty involved in solving an optimization problem that involves two layers of optimization. Only a handful of analytical T-optimal designs are available for the simplest problems; the rest in the literature are found using specialized numerical procedures for a specific problem. We propose a potentially more systematic and general way for finding T-optimal designs using a Semi-Infinite Programming (SIP) approach. The strategy requires that we first reformulate the original minimax or maximin optimization problem into an equivalent semi-infinite program and solve it using an exchange-based method where lower and upper bounds produced by solving the outer and the inner programs, are iterated to convergence. A global Nonlinear Programming (NLP) solver is used to handle the subproblems, thus finding the optimal design and the least favorable parametric configuration that minimizes the residual sum of squares from the alternative or test models. We also use a nonlinear program to check the global optimality of the SIP-generated design and automate the construction of globally optimal designs. The algorithm is successfully used to produce results that coincide with several T-optimal designs reported in the literature for various types of model discrimination problems with normally distributed errors. However, our method is more general, merely requiring that the parameters of the model be estimated by a numerical optimization. PMID:27330230

A Semi-Infinite Programming based algorithm for determining T-optimum designs for model discrimination.

PubMed

Duarte, Belmiro P M; Wong, Weng Kee; Atkinson, Anthony C

2015-03-01

T-optimum designs for model discrimination are notoriously difficult to find because of the computational difficulty involved in solving an optimization problem that involves two layers of optimization. Only a handful of analytical T-optimal designs are available for the simplest problems; the rest in the literature are found using specialized numerical procedures for a specific problem. We propose a potentially more systematic and general way for finding T-optimal designs using a Semi-Infinite Programming (SIP) approach. The strategy requires that we first reformulate the original minimax or maximin optimization problem into an equivalent semi-infinite program and solve it using an exchange-based method where lower and upper bounds produced by solving the outer and the inner programs, are iterated to convergence. A global Nonlinear Programming (NLP) solver is used to handle the subproblems, thus finding the optimal design and the least favorable parametric configuration that minimizes the residual sum of squares from the alternative or test models. We also use a nonlinear program to check the global optimality of the SIP-generated design and automate the construction of globally optimal designs. The algorithm is successfully used to produce results that coincide with several T-optimal designs reported in the literature for various types of model discrimination problems with normally distributed errors. However, our method is more general, merely requiring that the parameters of the model be estimated by a numerical optimization.

Methods of Conceptual Clustering and their Relation to Numerical Taxonomy.

DTIC Science & Technology

1985-07-22

the conceptual clustering problem is to first solve theaggregation problem, and then the characterization problem. In machine learning, the...cluster- ings by first generating some number of possible clusterings. For each clustering generated, one calls a learning from examples subroutine, which...class 1 from class 2, and vice versa, only the first combination implies a partition over the set of theoretically possible objects. The first

Buckling Of Shells Of Revolution /BOSOR/ with various wall constructions

NASA Technical Reports Server (NTRS)

Almroth, B. O.; Bushnell, D.; Sobel, L. H.

1969-01-01

Computer program, using numerical integration and finite difference techniques, solves almost any buckling problem for shells exhibiting orthotropic behavior. Stability analyses can be performed with reasonable accuracy and without unduly restrictive approximations.

Multigrid method for stability problems

NASA Technical Reports Server (NTRS)

Ta'asan, Shlomo

1988-01-01

The problem of calculating the stability of steady state solutions of differential equations is addressed. Leading eigenvalues of large matrices that arise from discretization are calculated, and an efficient multigrid method for solving these problems is presented. The resulting grid functions are used as initial approximations for appropriate eigenvalue problems. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a nonstandard way in which the right-hand side of the coarse grid equations involves unknown parameters to be solved on the coarse grid. This leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem are presented which demonstrate the effectiveness of the method.

LSENS: A General Chemical Kinetics and Sensitivity Analysis Code for homogeneous gas-phase reactions. Part 1: Theory and numerical solution procedures

NASA Technical Reports Server (NTRS)

Radhakrishnan, Krishnan

1994-01-01

LSENS, the Lewis General Chemical Kinetics and Sensitivity Analysis Code, has been developed for solving complex, homogeneous, gas-phase chemical kinetics problems and contains sensitivity analysis for a variety of problems, including nonisothermal situations. This report is part 1 of a series of three reference publications that describe LENS, provide a detailed guide to its usage, and present many example problems. Part 1 derives the governing equations and describes the numerical solution procedures for the types of problems that can be solved. The accuracy and efficiency of LSENS are examined by means of various test problems, and comparisons with other methods and codes are presented. LSENS is a flexible, convenient, accurate, and efficient solver for chemical reaction problems such as static system; steady, one-dimensional, inviscid flow; reaction behind incident shock wave, including boundary layer correction; and perfectly stirred (highly backmixed) reactor. In addition, the chemical equilibrium state can be computed for the following assigned states: temperature and pressure, enthalpy and pressure, temperature and volume, and internal energy and volume. For static problems the code computes the sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of the dependent variables and/or the three rate coefficient parameters of the chemical reactions.

Optimization-based mesh correction with volume and convexity constraints

DOE PAGES

D'Elia, Marta; Ridzal, Denis; Peterson, Kara J.; ...

2016-02-24

In this study, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. This volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimizationmore » problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.« less

Expected value based fuzzy programming approach to solve integrated supplier selection and inventory control problem with fuzzy demand

NASA Astrophysics Data System (ADS)

Sutrisno; Widowati; Sunarsih; Kartono

2018-01-01

In this paper, a mathematical model in quadratic programming with fuzzy parameter is proposed to determine the optimal strategy for integrated inventory control and supplier selection problem with fuzzy demand. To solve the corresponding optimization problem, we use the expected value based fuzzy programming. Numerical examples are performed to evaluate the model. From the results, the optimal amount of each product that have to be purchased from each supplier for each time period and the optimal amount of each product that have to be stored in the inventory for each time period were determined with minimum total cost and the inventory level was sufficiently closed to the reference level.

Neural network for solving convex quadratic bilevel programming problems.

PubMed

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

2014-03-01

In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

Uzawa algorithm to solve elastic and elastic-plastic fretting wear problems within the bipotential framework

NASA Astrophysics Data System (ADS)

Ning, Po; Feng, Zhi-Qiang; Quintero, Juan Antonio Rojas; Zhou, Yang-Jing; Peng, Lei

2018-03-01

This paper deals with elastic and elastic-plastic fretting problems. The wear gap is taken into account along with the initial contact distance to obtain the Signorini conditions. Both the Signorini conditions and the Coulomb friction laws are written in a compact form. Within the bipotential framework, an augmented Lagrangian method is applied to calculate the contact forces. The Archard wear law is then used to calculate the wear gap at the contact surface. The local fretting problems are solved via the Uzawa algorithm. Numerical examples are performed to show the efficiency and accuracy of the proposed approach. The influence of plasticity has been discussed.

Scilab software as an alternative low-cost computing in solving the linear equations problem

NASA Astrophysics Data System (ADS)

Agus, Fahrul; Haviluddin

2017-02-01

Numerical computation packages are widely used both in teaching and research. These packages consist of license (proprietary) and open source software (non-proprietary). One of the reasons to use the package is a complexity of mathematics function (i.e., linear problems). Also, number of variables in a linear or non-linear function has been increased. The aim of this paper was to reflect on key aspects related to the method, didactics and creative praxis in the teaching of linear equations in higher education. If implemented, it could be contribute to a better learning in mathematics area (i.e., solving simultaneous linear equations) that essential for future engineers. The focus of this study was to introduce an additional numerical computation package of Scilab as an alternative low-cost computing programming. In this paper, Scilab software was proposed some activities that related to the mathematical models. In this experiment, four numerical methods such as Gaussian Elimination, Gauss-Jordan, Inverse Matrix, and Lower-Upper Decomposition (LU) have been implemented. The results of this study showed that a routine or procedure in numerical methods have been created and explored by using Scilab procedures. Then, the routine of numerical method that could be as a teaching material course has exploited.

Automating FEA programming

NASA Technical Reports Server (NTRS)

Sharma, Naveen

1992-01-01

In this paper we briefly describe a combined symbolic and numeric approach for solving mathematical models on parallel computers. An experimental software system, PIER, is being developed in Common Lisp to synthesize computationally intensive and domain formulation dependent phases of finite element analysis (FEA) solution methods. Quantities for domain formulation like shape functions, element stiffness matrices, etc., are automatically derived using symbolic mathematical computations. The problem specific information and derived formulae are then used to generate (parallel) numerical code for FEA solution steps. A constructive approach to specify a numerical program design is taken. The code generator compiles application oriented input specifications into (parallel) FORTRAN77 routines with the help of built-in knowledge of the particular problem, numerical solution methods and the target computer.

An optimization-based approach for solving a time-harmonic multiphysical wave problem with higher-order schemes

NASA Astrophysics Data System (ADS)

Mönkölä, Sanna

2013-06-01

This study considers developing numerical solution techniques for the computer simulations of time-harmonic fluid-structure interaction between acoustic and elastic waves. The focus is on the efficiency of an iterative solution method based on a controllability approach and spectral elements. We concentrate on the model, in which the acoustic waves in the fluid domain are modeled by using the velocity potential and the elastic waves in the structure domain are modeled by using displacement. Traditionally, the complex-valued time-harmonic equations are used for solving the time-harmonic problems. Instead of that, we focus on finding periodic solutions without solving the time-harmonic problems directly. The time-dependent equations can be simulated with respect to time until a time-harmonic solution is reached, but the approach suffers from poor convergence. To overcome this challenge, we follow the approach first suggested and developed for the acoustic wave equations by Bristeau, Glowinski, and Périaux. Thus, we accelerate the convergence rate by employing a controllability method. The problem is formulated as a least-squares optimization problem, which is solved with the conjugate gradient (CG) algorithm. Computation of the gradient of the functional is done directly for the discretized problem. A graph-based multigrid method is used for preconditioning the CG algorithm.

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

Network optimization is being an increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. In many applications, however, there are several criteria associated with traversing each edge of a network. For example, cost and flow measures are both important in the networks. As a result, there has been recent interest in solving Bicriteria Network Optimization Problem. The Bicriteria Network Optimization Problem is known a NP-hard. The efficient set of paths may be very large, possibly exponential in size. Thus the computational effort required to solve it can increase exponentially with the problem size in the worst case. In this paper, we propose a genetic algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including maximum flow (MXF) model and minimum cost flow (MCF) model. The objective is to find the set of Pareto optimal solutions that give possible maximum flow with minimum cost. This paper also combines Adaptive Weight Approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressure toward a positive ideal point. Computer simulations show the several numerical experiments by using some difficult-to-solve network design problems, and show the effectiveness of the proposed method.

Calculation of transmission probability by solving an eigenvalue problem

NASA Astrophysics Data System (ADS)

Bubin, Sergiy; Varga, Kálmán

2010-11-01

The electron transmission probability in nanodevices is calculated by solving an eigenvalue problem. The eigenvalues are the transmission probabilities and the number of nonzero eigenvalues is equal to the number of open quantum transmission eigenchannels. The number of open eigenchannels is typically a few dozen at most, thus the computational cost amounts to the calculation of a few outer eigenvalues of a complex Hermitian matrix (the transmission matrix). The method is implemented on a real space grid basis providing an alternative to localized atomic orbital based quantum transport calculations. Numerical examples are presented to illustrate the efficiency of the method.

A globally convergent LCL method for nonlinear optimization.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Friedlander, M. P.; Saunders, M. A.; Mathematics and Computer Science

2005-01-01

For optimization problems with nonlinear constraints, linearly constrained Lagrangian (LCL) methods solve a sequence of subproblems of the form 'minimize an augmented Lagrangian function subject to linearized constraints.' Such methods converge rapidly near a solution but may not be reliable from arbitrary starting points. Nevertheless, the well-known software package MINOS has proved effective on many large problems. Its success motivates us to derive a related LCL algorithm that possesses three important properties: it is globally convergent, the subproblem constraints are always feasible, and the subproblems may be solved inexactly. The new algorithm has been implemented in Matlab, with an optionmore » to use either MINOS or SNOPT (Fortran codes) to solve the linearly constrained subproblems. Only first derivatives are required. We present numerical results on a subset of the COPS, HS, and CUTE test problems, which include many large examples. The results demonstrate the robustness and efficiency of the stabilized LCL procedure.« less

A Legendre tau-spectral method for solving time-fractional heat equation with nonlocal conditions.

PubMed

Bhrawy, A H; Alghamdi, M A

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem.

A Legendre tau-Spectral Method for Solving Time-Fractional Heat Equation with Nonlocal Conditions

PubMed Central

Bhrawy, A. H.; Alghamdi, M. A.

2014-01-01

We develop the tau-spectral method to solve the time-fractional heat equation (T-FHE) with nonlocal condition. In order to achieve highly accurate solution of this problem, the operational matrix of fractional integration (described in the Riemann-Liouville sense) for shifted Legendre polynomials is investigated in conjunction with tau-spectral scheme and the Legendre operational polynomials are used as the base function. The main advantage in using the presented scheme is that it converts the T-FHE with nonlocal condition to a system of algebraic equations that simplifies the problem. For demonstrating the validity and applicability of the developed spectral scheme, two numerical examples are presented. The logarithmic graphs of the maximum absolute errors is presented to achieve the exponential convergence of the proposed method. Comparing between our spectral method and other methods ensures that our method is more accurate than those solved similar problem. PMID:25057507

A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.

PubMed

Liu, Qingshan; Guo, Zhishan; Wang, Jun

2012-02-01

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

An Elementary Introduction to Recently Developed Computational Methods for Solving Singularly Perturbed Partial Differential Equations Arising in Science and Engineering

NASA Astrophysics Data System (ADS)

Kumar, Manoj; Srivastava, Akanksha

2013-01-01

This paper presents a survey of innovative approaches of the most effective computational techniques for solving singular perturbed partial differential equations, which are useful because of their numerical and computer realizations. Many applied problems appearing in semiconductors theory, biochemistry, kinetics, theory of electrical chains, economics, solid mechanics, fluid dynamics, quantum mechanics, and many others can be modelled as singularly perturbed systems. Here, we summarize a wide range of research articles published by numerous researchers during the last ten years to get a better view of the present scenario in this area of research.

Modeling flow at the nozzle of a solid rocket motor

NASA Technical Reports Server (NTRS)

Chow, Alan S.; Jin, Kang-Ren

1991-01-01

The mechanical behavior of a rocket motor internal flow field results in a system of nonlinear partial differential equations which can be solved numerically. The accuracy and the convergence of the solution of the system of equations depends largely on how precisely the sharp gradients can be resolved. An adaptive grid generation scheme is incorporated into the computer algorithm to enhance the capability of numerical modeling. With this scheme, the grid is refined as the solution evolves. This scheme significantly improves the methodology of solving flow problems in rocket nozzle by putting the refinement part of grid generation into the computer algorithm.

A Model-Free No-arbitrage Price Bound for Variance Options

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bonnans, J. Frederic, E-mail: frederic.bonnans@inria.fr; Tan Xiaolu, E-mail: xiaolu.tan@polytechnique.edu

2013-08-01

We suggest a numerical approximation for an optimization problem, motivated by its applications in finance to find the model-free no-arbitrage bound of variance options given the marginal distributions of the underlying asset. A first approximation restricts the computation to a bounded domain. Then we propose a gradient projection algorithm together with the finite difference scheme to solve the optimization problem. We prove the general convergence, and derive some convergence rate estimates. Finally, we give some numerical examples to test the efficiency of the algorithm.

On the solution of integral equations with a generalized Cauchy kernel

NASA Technical Reports Server (NTRS)

Kaya, A. C.; Erdogan, F.

1987-01-01

A numerical technique is developed analytically to solve a class of singular integral equations occurring in mixed boundary-value problems for nonhomogeneous elastic media with discontinuities. The approach of Kaya and Erdogan (1987) is extended to treat equations with generalized Cauchy kernels, reformulating the boundary-value problems in terms of potentials as the unknown functions. The numerical implementation of the solution is discussed, and results for an epoxy-Al plate with a crack terminating at the interface and loading normal to the crack are presented in tables.

Numerical Modeling in Problems of Near-Earth Object Dynamics

NASA Astrophysics Data System (ADS)

Aleksandrova, A. G.; Bordovitsyna, T. V.; Chuvashov, I. N.

2017-05-01

A method of numerical modeling is used to solve three most interesting problems of artificial Earth satellite (AES) dynamics. Orbital evolution of an ensemble of near-Earth objects at altitudes in the range from 1 500 to 60 000 km is considered, chaoticity of motion of objects in the geosynchronous zone is studied by the MEGNOanalysis, the parameters of AES motion are determined, and the models of forces are considered from measurements for GLONASS satellites. The recent versions of algorithms and programs used to perform investigations are briefly described.

A weak Galerkin generalized multiscale finite element method

DOE PAGES

Mu, Lin; Wang, Junping; Ye, Xiu

2016-03-31

In this study, we propose a general framework for weak Galerkin generalized multiscale (WG-GMS) finite element method for the elliptic problems with rapidly oscillating or high contrast coefficients. This general WG-GMS method features in high order accuracy on general meshes and can work with multiscale basis derived by different numerical schemes. A special case is studied under this WG-GMS framework in which the multiscale basis functions are obtained by solving local problem with the weak Galerkin finite element method. Convergence analysis and numerical experiments are obtained for the special case.

A weak Galerkin generalized multiscale finite element method

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mu, Lin; Wang, Junping; Ye, Xiu

In this study, we propose a general framework for weak Galerkin generalized multiscale (WG-GMS) finite element method for the elliptic problems with rapidly oscillating or high contrast coefficients. This general WG-GMS method features in high order accuracy on general meshes and can work with multiscale basis derived by different numerical schemes. A special case is studied under this WG-GMS framework in which the multiscale basis functions are obtained by solving local problem with the weak Galerkin finite element method. Convergence analysis and numerical experiments are obtained for the special case.

Mathematics of tsunami: modelling and identification

NASA Astrophysics Data System (ADS)

Krivorotko, Olga; Kabanikhin, Sergey

2015-04-01

Tsunami (long waves in the deep water) motion caused by underwater earthquakes is described by shallow water equations ( { ηtt = div (gH (x,y)-gradη), (x,y) ∈ Ω, t ∈ (0,T ); η|t=0 = q(x,y), ηt|t=0 = 0, (x,y) ∈ Ω. ( (1) Bottom relief H(x,y) characteristics and the initial perturbation data (a tsunami source q(x,y)) are required for the direct simulation of tsunamis. The main difficulty problem of tsunami modelling is a very big size of the computational domain (Ω = 500 × 1000 kilometres in space and about one hour computational time T for one meter of initial perturbation amplitude max|q|). The calculation of the function η(x,y,t) of three variables in Ω × (0,T) requires large computing resources. We construct a new algorithm to solve numerically the problem of determining the moving tsunami wave height S(x,y) which is based on kinematic-type approach and analytical representation of fundamental solution. Proposed algorithm of determining the function of two variables S(x,y) reduces the number of operations in 1.5 times than solving problem (1). If all functions does not depend on the variable y (one dimensional case), then the moving tsunami wave height satisfies of the well-known Airy-Green formula: S(x) = S(0)° --- 4H (0)/H (x). The problem of identification parameters of a tsunami source using additional measurements of a passing wave is called inverse tsunami problem. We investigate two different inverse problems of determining a tsunami source q(x,y) using two different additional data: Deep-ocean Assessment and Reporting of Tsunamis (DART) measurements and satellite altimeters wave-form images. These problems are severely ill-posed. The main idea consists of combination of two measured data to reconstruct the source parameters. We apply regularization techniques to control the degree of ill-posedness such as Fourier expansion, truncated singular value decomposition, numerical regularization. The algorithm of selecting the truncated number of singular values of an inverse problem operator which is agreed with the error level in measured data is described and analysed. In numerical experiment we used conjugate gradient method for solving inverse tsunami problems. Gradient methods are based on minimizing the corresponding misfit function. To calculate the gradient of the misfit function, the adjoint problem is solved. The conservative finite-difference schemes for solving the direct and adjoint problems in the approximation of shallow water are constructed. Results of numerical experiments of the tsunami source reconstruction are presented and discussed. We show that using a combination of two types of data allows one to increase the stability and efficiency of tsunami source reconstruction. Non-profit organization WAPMERR (World Agency of Planetary Monitoring and Earthquake Risk Reduction) in collaboration with Institute of Computational Mathematics and Mathematical Geophysics of SB RAS developed the Integrated Tsunami Research and Information System (ITRIS) to simulate tsunami waves and earthquakes, river course changes, coastal zone floods, and risk estimates for coastal constructions at wave run-ups and earthquakes. The special scientific plug-in components are embedded in a specially developed GIS-type graphic shell for easy data retrieval, visualization and processing. We demonstrate the tsunami simulation plug-in for historical tsunami events (2004 Indian Ocean tsunami, Simushir tsunami 2006 and others). This work was supported by the Ministry of Education and Science of the Russian Federation.

Comment on "Calculations for the one-dimensional soft Coulomb problem and the hard Coulomb limit".

PubMed

Carrillo-Bernal, M A; Núñez-Yépez, H N; Salas-Brito, A L; Solis, Didier A

2015-02-01

In the referred paper, the authors use a numerical method for solving ordinary differential equations and a softened Coulomb potential -1/√[x(2)+β(2)] to study the one-dimensional Coulomb problem by approaching the parameter β to zero. We note that even though their numerical findings in the soft potential scenario are correct, their conclusions do not extend to the one-dimensional Coulomb problem (β=0). Their claims regarding the possible existence of an even ground state with energy -∞ with a Dirac-δ eigenfunction and of well-defined parity eigenfunctions in the one-dimensional hydrogen atom are questioned.

Incremental analysis of large elastic deformation of a rotating cylinder

NASA Technical Reports Server (NTRS)

Buchanan, G. R.

1976-01-01

The effect of finite deformation upon a rotating, orthotropic cylinder was investigated using a general incremental theory. The incremental equations of motion are developed using the variational principle. The governing equations are derived using the principle of virtual work for a body with initial stress. The governing equations are reduced to those for the title problem and a numerical solution is obtained using finite difference approximations. Since the problem is defined in terms of one independent space coordinate, the finite difference grid can be modified as the incremental deformation occurs without serious numerical difficulties. The nonlinear problem is solved incrementally by totaling a series of linear solutions.

An Effective Hybrid Evolutionary Algorithm for Solving the Numerical Optimization Problems

NASA Astrophysics Data System (ADS)

Qian, Xiaohong; Wang, Xumei; Su, Yonghong; He, Liu

2018-04-01

There are many different algorithms for solving complex optimization problems. Each algorithm has been applied successfully in solving some optimization problems, but not efficiently in other problems. In this paper the Cauchy mutation and the multi-parent hybrid operator are combined to propose a hybrid evolutionary algorithm based on the communication (Mixed Evolutionary Algorithm based on Communication), hereinafter referred to as CMEA. The basic idea of the CMEA algorithm is that the initial population is divided into two subpopulations. Cauchy mutation operators and multiple paternal crossover operators are used to perform two subpopulations parallelly to evolve recursively until the downtime conditions are met. While subpopulation is reorganized, the individual is exchanged together with information. The algorithm flow is given and the performance of the algorithm is compared using a number of standard test functions. Simulation results have shown that this algorithm converges significantly faster than FEP (Fast Evolutionary Programming) algorithm, has good performance in global convergence and stability and is superior to other compared algorithms.

An efficient computational method for solving nonlinear stochastic Itô integral equations: Application for stochastic problems in physics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Heydari, M.H., E-mail: heydari@stu.yazd.ac.ir; The Laboratory of Quantum Information Processing, Yazd University, Yazd; Hooshmandasl, M.R., E-mail: hooshmandasl@yazd.ac.ir

Because of the nonlinearity, closed-form solutions of many important stochastic functional equations are virtually impossible to obtain. Thus, numerical solutions are a viable alternative. In this paper, a new computational method based on the generalized hat basis functions together with their stochastic operational matrix of Itô-integration is proposed for solving nonlinear stochastic Itô integral equations in large intervals. In the proposed method, a new technique for computing nonlinear terms in such problems is presented. The main advantage of the proposed method is that it transforms problems under consideration into nonlinear systems of algebraic equations which can be simply solved. Errormore » analysis of the proposed method is investigated and also the efficiency of this method is shown on some concrete examples. The obtained results reveal that the proposed method is very accurate and efficient. As two useful applications, the proposed method is applied to obtain approximate solutions of the stochastic population growth models and stochastic pendulum problem.« less

u-w formulation for dynamic problems in large deformation regime solved through an implicit meshfree scheme

NASA Astrophysics Data System (ADS)

Navas, Pedro; Sanavia, Lorenzo; López-Querol, Susana; Yu, Rena C.

2017-12-01

Solving dynamic problems for fluid saturated porous media at large deformation regime is an interesting but complex issue. An implicit time integration scheme is herein developed within the framework of the u-w (solid displacement-relative fluid displacement) formulation for the Biot's equations. In particular, liquid water saturated porous media is considered and the linearization of the linear momentum equations taking into account all the inertia terms for both solid and fluid phases is for the first time presented. The spatial discretization is carried out through a meshfree method, in which the shape functions are based on the principle of local maximum entropy LME. The current methodology is firstly validated with the dynamic consolidation of a soil column and the plastic shear band formulation of a square domain loaded by a rigid footing. The feasibility of this new numerical approach for solving large deformation dynamic problems is finally demonstrated through the application to an embankment problem subjected to an earthquake.

Making the EZ Choice

NASA Technical Reports Server (NTRS)

2001-01-01

Analytical Mechanics Associates, Inc. (AMA), of Hampton, Virginia, created the EZopt software application through Small Business Innovation Research (SBIR) funding from NASA's Langley Research Center. The new software is a user-friendly tool kit that provides quick and logical solutions to complex optimal control problems. In its most basic form, EZopt converts process data into math equations and then proceeds to utilize those equations to solve problems within control systems. EZopt successfully proved its advantage when applied to short-term mission planning and onboard flight computer implementation. The technology has also solved multiple real-life engineering problems faced in numerous commercial operations. For instance, mechanical engineers use EZopt to solve control problems with robots, while chemical plants implement the application to overcome situations with batch reactors and temperature control. In the emerging field of commercial aerospace, EZopt is able to optimize trajectories for launch vehicles and perform potential space station- keeping tasks. Furthermore, the software also helps control electromagnetic devices in the automotive industry.

Resource Economics

NASA Astrophysics Data System (ADS)

Conrad, Jon M.

2000-01-01

Resource Economics is a text for students with a background in calculus, intermediate microeconomics, and a familiarity with the spreadsheet software Excel. The book covers basic concepts, shows how to set up spreadsheets to solve dynamic allocation problems, and presents economic models for fisheries, forestry, nonrenewable resources, stock pollutants, option value, and sustainable development. Within the text, numerical examples are posed and solved using Excel's Solver. These problems help make concepts operational, develop economic intuition, and serve as a bridge to the study of real-world problems of resource management. Through these examples and additional exercises at the end of Chapters 1 to 8, students can make dynamic models operational, develop their economic intuition, and learn how to set up spreadsheets for the simulation of optimization of resource and environmental systems. Book is unique in its use of spreadsheet software (Excel) to solve dynamic allocation problems Conrad is co-author of a previous book for the Press on the subject for graduate students Approach is extremely student-friendly; gives students the tools to apply research results to actual environmental issues

SOIL AND SEDIMENT SAMPLING METHODS

EPA Science Inventory

The EPA Office of Solid Waste and Emergency Response's (OSWER) Office of Superfund Remediation and Technology Innovation (OSRTI) needs innovative methods and techniques to solve new and difficult sampling and analytical problems found at the numerous Superfund sites throughout th...

Suppliers solve processing problems

USDA-ARS?s Scientific Manuscript database

The year's IFT food expo showcased numerous companies and organizations offering solutions to food processing needs and challenges. From small-scale unit operations to commercial-scale equipment lines, exhibitors highlighted both traditional and novel food processing operations fro food product dev...

High-order finite-volume solutions of the steady-state advection-diffusion equation with nonlinear Robin boundary conditions

NASA Astrophysics Data System (ADS)

Lin, Zhi; Zhang, Qinghai

2017-09-01

We propose high-order finite-volume schemes for numerically solving the steady-state advection-diffusion equation with nonlinear Robin boundary conditions. Although the original motivation comes from a mathematical model of blood clotting, the nonlinear boundary conditions may also apply to other scientific problems. The main contribution of this work is a generic algorithm for generating third-order, fourth-order, and even higher-order explicit ghost-filling formulas to enforce nonlinear Robin boundary conditions in multiple dimensions. Under the framework of finite volume methods, this appears to be the first algorithm of its kind. Numerical experiments on boundary value problems show that the proposed fourth-order formula can be much more accurate and efficient than a simple second-order formula. Furthermore, the proposed ghost-filling formulas may also be useful for solving other partial differential equations.

Bio-Inspired Functional Surfaces Based on Laser-Induced Periodic Surface Structures

PubMed Central

Müller, Frank A.; Kunz, Clemens; Gräf, Stephan

2016-01-01

Nature developed numerous solutions to solve various technical problems related to material surfaces by combining the physico-chemical properties of a material with periodically aligned micro/nanostructures in a sophisticated manner. The utilization of ultra-short pulsed lasers allows mimicking numerous of these features by generating laser-induced periodic surface structures (LIPSS). In this review paper, we describe the physical background of LIPSS generation as well as the physical principles of surface related phenomena like wettability, reflectivity, and friction. Then we introduce several biological examples including e.g., lotus leafs, springtails, dessert beetles, moth eyes, butterfly wings, weevils, sharks, pangolins, and snakes to illustrate how nature solves technical problems, and we give a comprehensive overview of recent achievements related to the utilization of LIPSS to generate superhydrophobic, anti-reflective, colored, and drag resistant surfaces. Finally, we conclude with some future developments and perspectives related to forthcoming applications of LIPSS-based surfaces. PMID:28773596

A new 3D immersed boundary method for non-Newtonian fluid-structure-interaction with application

NASA Astrophysics Data System (ADS)

Zhu, Luoding

2017-11-01

Motivated by fluid-structure-interaction (FSI) phenomena in life sciences (e.g., motions of sperm and cytoskeleton in complex fluids), we introduce a new immersed boundary method for FSI problems involving non-Newtonian fluids in three dimensions. The non-Newtonian fluids are modelled by the FENE-P model (including the Oldroyd-B model as an especial case) and numerically solved by a lattice Boltzmann scheme (the D3Q7 model). The fluid flow is modelled by the lattice Boltzmann equations and numerically solved by the D3Q19 model. The deformable structure and the fluid-structure-interaction are handled by the immersed boundary method. As an application, we study a FSI toy problem - interaction of an elastic plate (flapped at its leading edge and restricted nowhere else) with a non-Newtonian fluid in a 3D flow. Thanks to the support of NSF-DMS support under research Grant 1522554.

Bio-Inspired Functional Surfaces Based on Laser-Induced Periodic Surface Structures.

PubMed

Müller, Frank A; Kunz, Clemens; Gräf, Stephan

2016-06-15

Nature developed numerous solutions to solve various technical problems related to material surfaces by combining the physico-chemical properties of a material with periodically aligned micro/nanostructures in a sophisticated manner. The utilization of ultra-short pulsed lasers allows mimicking numerous of these features by generating laser-induced periodic surface structures (LIPSS). In this review paper, we describe the physical background of LIPSS generation as well as the physical principles of surface related phenomena like wettability, reflectivity, and friction. Then we introduce several biological examples including e.g., lotus leafs, springtails, dessert beetles, moth eyes, butterfly wings, weevils, sharks, pangolins, and snakes to illustrate how nature solves technical problems, and we give a comprehensive overview of recent achievements related to the utilization of LIPSS to generate superhydrophobic, anti-reflective, colored, and drag resistant surfaces. Finally, we conclude with some future developments and perspectives related to forthcoming applications of LIPSS-based surfaces.

LORENE: Spectral methods differential equations solver

NASA Astrophysics Data System (ADS)

Gourgoulhon, Eric; Grandclément, Philippe; Marck, Jean-Alain; Novak, Jérôme; Taniguchi, Keisuke

2016-08-01

LORENE (Langage Objet pour la RElativité NumériquE) solves various problems arising in numerical relativity, and more generally in computational astrophysics. It is a set of C++ classes and provides tools to solve partial differential equations by means of multi-domain spectral methods. LORENE classes implement basic structures such as arrays and matrices, but also abstract mathematical objects, such as tensors, and astrophysical objects, such as stars and black holes.

Do different types of school mathematics development depend on different constellations of numerical versus general cognitive abilities?

PubMed

Fuchs, Lynn S; Geary, David C; Compton, Donald L; Fuchs, Douglas; Hamlett, Carol L; Seethaler, Pamela M; Bryant, Joan D; Schatschneider, Christopher

2010-11-01

The purpose of this study was to examine the interplay between basic numerical cognition and domain-general abilities (such as working memory) in explaining school mathematics learning. First graders (N = 280; mean age = 5.77 years) were assessed on 2 types of basic numerical cognition, 8 domain-general abilities, procedural calculations, and word problems in fall and then reassessed on procedural calculations and word problems in spring. Development was indexed by latent change scores, and the interplay between numerical and domain-general abilities was analyzed by multiple regression. Results suggest that the development of different types of formal school mathematics depends on different constellations of numerical versus general cognitive abilities. When controlling for 8 domain-general abilities, both aspects of basic numerical cognition were uniquely predictive of procedural calculations and word problems development. Yet, for procedural calculations development, the additional amount of variance explained by the set of domain-general abilities was not significant, and only counting span was uniquely predictive. By contrast, for word problems development, the set of domain-general abilities did provide additional explanatory value, accounting for about the same amount of variance as the basic numerical cognition variables. Language, attentive behavior, nonverbal problem solving, and listening span were uniquely predictive.

Multilevel decomposition of complete vehicle configuration in a parallel computing environment

NASA Technical Reports Server (NTRS)

Bhatt, Vinay; Ragsdell, K. M.

1989-01-01

This research summarizes various approaches to multilevel decomposition to solve large structural problems. A linear decomposition scheme based on the Sobieski algorithm is selected as a vehicle for automated synthesis of a complete vehicle configuration in a parallel processing environment. The research is in a developmental state. Preliminary numerical results are presented for several example problems.

An implicit semianalytic numerical method for the solution of nonequilibrium chemistry problems

NASA Technical Reports Server (NTRS)

Graves, R. A., Jr.; Gnoffo, P. A.; Boughner, R. E.

1974-01-01

The first order differential equation form systems of equations. They are solved by a simple and relatively accurate implicit semianalytic technique which is derived from a quadrature solution of the governing equation. This method is mathematically simpler than most implicit methods and has the exponential nature of the problem embedded in the solution.

Convergent Evolution in the Interest of Integrative Problem Solving: Connecting the Policy Sciences and Interdisciplinary Studies

ERIC Educational Resources Information Center

Wallace, Richard L.; Clark, Susan G.

2014-01-01

The contemporary fields of interdisciplinary studies and the policy sciences have evolved over similar intellectual paths and timelines, beginning in the early 20th century. Both have their roots in professional efforts--within and outside the academy--to address numerous, growing, and complex problems that face humanity. The policy sciences'…

Variational methods for direct/inverse problems of atmospheric dynamics and chemistry

NASA Astrophysics Data System (ADS)

Penenko, Vladimir; Penenko, Alexey; Tsvetova, Elena

2013-04-01

We present a variational approach for solving direct and inverse problems of atmospheric hydrodynamics and chemistry. It is important that the accurate matching of numerical schemes has to be provided in the chain of objects: direct/adjoint problems - sensitivity relations - inverse problems, including assimilation of all available measurement data. To solve the problems we have developed a new enhanced set of cost-effective algorithms. The matched description of the multi-scale processes is provided by a specific choice of the variational principle functionals for the whole set of integrated models. Then all functionals of variational principle are approximated in space and time by splitting and decomposition methods. Such approach allows us to separately consider, for example, the space-time problems of atmospheric chemistry in the frames of decomposition schemes for the integral identity sum analogs of the variational principle at each time step and in each of 3D finite-volumes. To enhance the realization efficiency, the set of chemical reactions is divided on the subsets related to the operators of production and destruction. Then the idea of the Euler's integrating factors is applied in the frames of the local adjoint problem technique [1]-[3]. The analytical solutions of such adjoint problems play the role of integrating factors for differential equations describing atmospheric chemistry. With their help, the system of differential equations is transformed to the equivalent system of integral equations. As a result we avoid the construction and inversion of preconditioning operators containing the Jacobi matrixes which arise in traditional implicit schemes for ODE solution. This is the main advantage of our schemes. At the same time step but on the different stages of the "global" splitting scheme, the system of atmospheric dynamic equations is solved. For convection - diffusion equations for all state functions in the integrated models we have developed the monotone and stable discrete-analytical numerical schemes [1]-[3] conserving the positivity of the chemical substance concentrations and possessing the properties of energy and mass balance that are postulated in the general variational principle for integrated models. All algorithms for solution of transport, diffusion and transformation problems are direct (without iterations). The work is partially supported by the Programs No 4 of Presidium RAS and No 3 of Mathematical Department of RAS, by RFBR project 11-01-00187 and Integrating projects of SD RAS No 8 and 35. Our studies are in the line with the goals of COST Action ES1004. References Penenko V., Tsvetova E. Discrete-analytical methods for the implementation of variational principles in environmental applications// Journal of computational and applied mathematics, 2009, v. 226, 319-330. Penenko A.V. Discrete-analytic schemes for solving an inverse coefficient heat conduction problem in a layered medium with gradient methods// Numerical Analysis and Applications, 2012, V. 5, pp 326-341. V. Penenko, E. Tsvetova. Variational methods for constructing the monotone approximations for atmospheric chemistry models //Numerical Analysis and Applications, 2013 (in press).

Numerical simulation of cavitating flows in shipbuilding

NASA Astrophysics Data System (ADS)

Bagaev, D.; Yegorov, S.; Lobachev, M.; Rudnichenko, A.; Taranov, A.

2018-05-01

The paper presents validation of numerical simulations of cavitating flows around different marine objects carried out at the Krylov State Research Centre (KSRC). Preliminary validation was done with reference to international test objects. The main part of the paper contains results of solving practical problems of ship propulsion design. The validation of numerical simulations by comparison with experimental data shows a good accuracy of the supercomputer technologies existing at Krylov State Research Centre for both hydrodynamic and cavitation characteristics prediction.

Numerical stability in problems of linear algebra.

NASA Technical Reports Server (NTRS)

Babuska, I.

1972-01-01

Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.

Conformal Infinity.

PubMed

Frauendiener, Jörg

2000-01-01

The notion of conformal infinity has a long history within the research in Einstein's theory of gravity. Today, "conformal infinity" is related with almost all other branches of research in general relativity, from quantisation procedures to abstract mathematical issues to numerical applications. This review article attempts to show how this concept gradually and inevitably evolved out of physical issues, namely the need to understand gravitational radiation and isolated systems within the theory of gravitation and how it lends itself very naturally to solve radiation problems in numerical relativity. The fundamental concept of null-infinity is introduced. Friedrich's regular conformal field equations are presented and various initial value problems for them are discussed. Finally, it is shown that the conformal field equations provide a very powerful method within numerical relativity to study global problems such as gravitational wave propagation and detection.

An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.

PubMed

Deb, Kalyanmoy; Sinha, Ankur

2010-01-01

Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.

Controllability of semi-infinite rod heating by a point source

NASA Astrophysics Data System (ADS)

Khurshudyan, A.

2018-04-01

The possibility of control over heating of a semi-infinite thin rod by a point source concentrated at an inner point of the rod, is studied. Quadratic and piecewise constant solutions of the problem are derived, and the possibilities of solving appropriate problems of optimal control are indicated. Determining of the parameters of the piecewise constant solution is reduced to a problem of nonlinear programming. Numerical examples are considered.

Numerical methods in Markov chain modeling

NASA Technical Reports Server (NTRS)

Philippe, Bernard; Saad, Youcef; Stewart, William J.

1989-01-01

Several methods for computing stationary probability distributions of Markov chains are described and compared. The main linear algebra problem consists of computing an eigenvector of a sparse, usually nonsymmetric, matrix associated with a known eigenvalue. It can also be cast as a problem of solving a homogeneous singular linear system. Several methods based on combinations of Krylov subspace techniques are presented. The performance of these methods on some realistic problems are compared.

Symbolic computation of the Birkhoff normal form in the problem of stability of the triangular libration points

NASA Astrophysics Data System (ADS)

Shevchenko, I. I.

2008-05-01

The problem of stability of the triangular libration points in the planar circular restricted three-body problem is considered. A software package, intended for normalization of autonomous Hamiltonian systems by means of computer algebra, is designed so that normalization problems of high analytical complexity could be solved. It is used to obtain the Birkhoff normal form of the Hamiltonian in the given problem. The normalization is carried out up to the 6th order of expansion of the Hamiltonian in the coordinates and momenta. Analytical expressions for the coefficients of the normal form of the 6th order are derived. Though intermediary expressions occupy gigabytes of the computer memory, the obtained coefficients of the normal form are compact enough for presentation in typographic format. The analogue of the Deprit formula for the stability criterion is derived in the 6th order of normalization. The obtained floating-point numerical values for the normal form coefficients and the stability criterion confirm the results by Markeev (1969) and Coppola and Rand (1989), while the obtained analytical and exact numeric expressions confirm the results by Meyer and Schmidt (1986) and Schmidt (1989). The given computational problem is solved without constructing a specialized algebraic processor, i.e., the designed computer algebra package has a broad field of applicability.

Adaptive Neural Networks Decentralized FTC Design for Nonstrict-Feedback Nonlinear Interconnected Large-Scale Systems Against Actuator Faults.

PubMed

Li, Yongming; Tong, Shaocheng

The problem of active fault-tolerant control (FTC) is investigated for the large-scale nonlinear systems in nonstrict-feedback form. The nonstrict-feedback nonlinear systems considered in this paper consist of unstructured uncertainties, unmeasured states, unknown interconnected terms, and actuator faults (e.g., bias fault and gain fault). A state observer is designed to solve the unmeasurable state problem. Neural networks (NNs) are used to identify the unknown lumped nonlinear functions so that the problems of unstructured uncertainties and unknown interconnected terms can be solved. By combining the adaptive backstepping design principle with the combination Nussbaum gain function property, a novel NN adaptive output-feedback FTC approach is developed. The proposed FTC controller can guarantee that all signals in all subsystems are bounded, and the tracking errors for each subsystem converge to a small neighborhood of zero. Finally, numerical results of practical examples are presented to further demonstrate the effectiveness of the proposed control strategy.The problem of active fault-tolerant control (FTC) is investigated for the large-scale nonlinear systems in nonstrict-feedback form. The nonstrict-feedback nonlinear systems considered in this paper consist of unstructured uncertainties, unmeasured states, unknown interconnected terms, and actuator faults (e.g., bias fault and gain fault). A state observer is designed to solve the unmeasurable state problem. Neural networks (NNs) are used to identify the unknown lumped nonlinear functions so that the problems of unstructured uncertainties and unknown interconnected terms can be solved. By combining the adaptive backstepping design principle with the combination Nussbaum gain function property, a novel NN adaptive output-feedback FTC approach is developed. The proposed FTC controller can guarantee that all signals in all subsystems are bounded, and the tracking errors for each subsystem converge to a small neighborhood of zero. Finally, numerical results of practical examples are presented to further demonstrate the effectiveness of the proposed control strategy.

A projection gradient method for computing ground state of spin-2 Bose–Einstein condensates

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, Hanquan, E-mail: hanquan.wang@gmail.com; Yunnan Tongchang Scientific Computing and Data Mining Research Center, Kunming, Yunnan Province, 650221

In this paper, a projection gradient method is presented for computing ground state of spin-2 Bose–Einstein condensates (BEC). We first propose the general projection gradient method for solving energy functional minimization problem under multiple constraints, in which the energy functional takes real functions as independent variables. We next extend the method to solve a similar problem, where the energy functional now takes complex functions as independent variables. We finally employ the method into finding the ground state of spin-2 BEC. The key of our method is: by constructing continuous gradient flows (CGFs), the ground state of spin-2 BEC can bemore » computed as the steady state solution of such CGFs. We discretized the CGFs by a conservative finite difference method along with a proper way to deal with the nonlinear terms. We show that the numerical discretization is normalization and magnetization conservative and energy diminishing. Numerical results of the ground state and their energy of spin-2 BEC are reported to demonstrate the effectiveness of the numerical method.« less

An accelerated lambda iteration method for multilevel radiative transfer. I - Non-overlapping lines with background continuum

NASA Technical Reports Server (NTRS)

Rybicki, G. B.; Hummer, D. G.

1991-01-01

A method is presented for solving multilevel transfer problems when nonoverlapping lines and background continuum are present and active continuum transfer is absent. An approximate lambda operator is employed to derive linear, 'preconditioned', statistical-equilibrium equations. A method is described for finding the diagonal elements of the 'true' numerical lambda operator, and therefore for obtaining the coefficients of the equations. Iterations of the preconditioned equations, in conjunction with the transfer equation's formal solution, are used to solve linear equations. Some multilevel problems are considered, including an eleven-level neutral helium atom. Diagonal and tridiagonal approximate lambda operators are utilized in the problems to examine the convergence properties of the method, and it is found to be effective for the line transfer problems.

Overset meshing coupled with hybridizable discontinuous Galerkin finite elements

DOE PAGES

Kauffman, Justin A.; Sheldon, Jason P.; Miller, Scott T.

2017-03-01

We introduce the use of hybridizable discontinuous Galerkin (HDG) finite element methods on overlapping (overset) meshes. Overset mesh methods are advantageous for solving problems on complex geometrical domains. We also combine geometric flexibility of overset methods with the advantages of HDG methods: arbitrarily high-order accuracy, reduced size of the global discrete problem, and the ability to solve elliptic, parabolic, and/or hyperbolic problems with a unified form of discretization. This approach to developing the ‘overset HDG’ method is to couple the global solution from one mesh to the local solution on the overset mesh. We present numerical examples for steady convection–diffusionmore » and static elasticity problems. The examples demonstrate optimal order convergence in all primal fields for an arbitrary amount of overlap of the underlying meshes.« less

Application of the Finite Element Method in Atomic and Molecular Physics

NASA Technical Reports Server (NTRS)

Shertzer, Janine

2007-01-01

The finite element method (FEM) is a numerical algorithm for solving second order differential equations. It has been successfully used to solve many problems in atomic and molecular physics, including bound state and scattering calculations. To illustrate the diversity of the method, we present here details of two applications. First, we calculate the non-adiabatic dipole polarizability of Hi by directly solving the first and second order equations of perturbation theory with FEM. In the second application, we calculate the scattering amplitude for e-H scattering (without partial wave analysis) by reducing the Schrodinger equation to set of integro-differential equations, which are then solved with FEM.

Comparing genetic algorithm and particle swarm optimization for solving capacitated vehicle routing problem

NASA Astrophysics Data System (ADS)

Iswari, T.; Asih, A. M. S.

2018-04-01

In the logistics system, transportation plays an important role to connect every element in the supply chain, but it can produces the greatest cost. Therefore, it is important to make the transportation costs as minimum as possible. Reducing the transportation cost can be done in several ways. One of the ways to minimizing the transportation cost is by optimizing the routing of its vehicles. It refers to Vehicle Routing Problem (VRP). The most common type of VRP is Capacitated Vehicle Routing Problem (CVRP). In CVRP, the vehicles have their own capacity and the total demands from the customer should not exceed the capacity of the vehicle. CVRP belongs to the class of NP-hard problems. These NP-hard problems make it more complex to solve such that exact algorithms become highly time-consuming with the increases in problem sizes. Thus, for large-scale problem instances, as typically found in industrial applications, finding an optimal solution is not practicable. Therefore, this paper uses two kinds of metaheuristics approach to solving CVRP. Those are Genetic Algorithm and Particle Swarm Optimization. This paper compares the results of both algorithms and see the performance of each algorithm. The results show that both algorithms perform well in solving CVRP but still needs to be improved. From algorithm testing and numerical example, Genetic Algorithm yields a better solution than Particle Swarm Optimization in total distance travelled.

Fuzzy α-minimum spanning tree problem: definition and solutions

NASA Astrophysics Data System (ADS)

Zhou, Jian; Chen, Lu; Wang, Ke; Yang, Fan

2016-04-01

In this paper, the minimum spanning tree problem is investigated on the graph with fuzzy edge weights. The notion of fuzzy ? -minimum spanning tree is presented based on the credibility measure, and then the solutions of the fuzzy ? -minimum spanning tree problem are discussed under different assumptions. First, we respectively, assume that all the edge weights are triangular fuzzy numbers and trapezoidal fuzzy numbers and prove that the fuzzy ? -minimum spanning tree problem can be transformed to a classical problem on a crisp graph in these two cases, which can be solved by classical algorithms such as the Kruskal algorithm and the Prim algorithm in polynomial time. Subsequently, as for the case that the edge weights are general fuzzy numbers, a fuzzy simulation-based genetic algorithm using Prüfer number representation is designed for solving the fuzzy ? -minimum spanning tree problem. Some numerical examples are also provided for illustrating the effectiveness of the proposed solutions.

General relativistic hydrodynamics with Adaptive-Mesh Refinement (AMR) and modeling of accretion disks

NASA Astrophysics Data System (ADS)

Donmez, Orhan

We present a general procedure to solve the General Relativistic Hydrodynamical (GRH) equations with Adaptive-Mesh Refinement (AMR) and model of an accretion disk around a black hole. To do this, the GRH equations are written in a conservative form to exploit their hyperbolic character. The numerical solutions of the general relativistic hydrodynamic equations is done by High Resolution Shock Capturing schemes (HRSC), specifically designed to solve non-linear hyperbolic systems of conservation laws. These schemes depend on the characteristic information of the system. We use Marquina fluxes with MUSCL left and right states to solve GRH equations. First, we carry out different test problems with uniform and AMR grids on the special relativistic hydrodynamics equations to verify the second order convergence of the code in 1D, 2 D and 3D. Second, we solve the GRH equations and use the general relativistic test problems to compare the numerical solutions with analytic ones. In order to this, we couple the flux part of general relativistic hydrodynamic equation with a source part using Strang splitting. The coupling of the GRH equations is carried out in a treatment which gives second order accurate solutions in space and time. The test problems examined include shock tubes, geodesic flows, and circular motion of particle around the black hole. Finally, we apply this code to the accretion disk problems around the black hole using the Schwarzschild metric at the background of the computational domain. We find spiral shocks on the accretion disk. They are observationally expected results. We also examine the star-disk interaction near a massive black hole. We find that when stars are grounded down or a hole is punched on the accretion disk, they create shock waves which destroy the accretion disk.

A new numerical approximation of the fractal ordinary differential equation

NASA Astrophysics Data System (ADS)

Atangana, Abdon; Jain, Sonal

2018-02-01

The concept of fractal medium is present in several real-world problems, for instance, in the geological formation that constitutes the well-known subsurface water called aquifers. However, attention has not been quite devoted to modeling for instance, the flow of a fluid within these media. We deem it important to remind the reader that the concept of fractal derivative is not to represent the fractal sharps but to describe the movement of the fluid within these media. Since this class of ordinary differential equations is highly complex to solve analytically, we present a novel numerical scheme that allows to solve fractal ordinary differential equations. Error analysis of the method is also presented. Application of the method and numerical approximation are presented for fractal order differential equation. The stability and the convergence of the numerical schemes are investigated in detail. Also some exact solutions of fractal order differential equations are presented and finally some numerical simulations are presented.

Learning to forget: continual prediction with LSTM.

PubMed

Gers, F A; Schmidhuber, J; Cummins, F

2000-10-01

Long short-term memory (LSTM; Hochreiter & Schmidhuber, 1997) can solve numerous tasks not solvable by previous learning algorithms for recurrent neural networks (RNNs). We identify a weakness of LSTM networks processing continual input streams that are not a priori segmented into subsequences with explicitly marked ends at which the network's internal state could be reset. Without resets, the state may grow indefinitely and eventually cause the network to break down. Our remedy is a novel, adaptive "forget gate" that enables an LSTM cell to learn to reset itself at appropriate times, thus releasing internal resources. We review illustrative benchmark problems on which standard LSTM outperforms other RNN algorithms. All algorithms (including LSTM) fail to solve continual versions of these problems. LSTM with forget gates, however, easily solves them, and in an elegant way.

Aeroacoustics of Turbulent High-Speed Jets

NASA Technical Reports Server (NTRS)

Rao, Ram Mohan; Lundgren, Thomas S.

1996-01-01

Aeroacoustic noise generation in a supersonic round jet is studied to understand in particular the effect of turbulence structure on the noise without numerically compromising the turbulence itself. This means that direct numerical simulations (DNS's) are needed. In order to use DNS at high enough Reynolds numbers to get sufficient turbulence structure we have decided to solve the temporal jet problem, using periodicity in the direction of the jet axis. Physically this means that turbulent structures in the jet are repeated in successive downstream cells instead of being gradually modified downstream into a jet plume. Therefore in order to answer some questions about the turbulence we will partially compromise the overall structure of the jet. The first section of chapter 1 describes some work on the linear stability of a supersonic round jet and the implications of this for the jet noise problem. In the second section we present preliminary work done using a TVD numerical scheme on a CM5. This work is only two-dimensional (plane) but shows very interesting results, including weak shock waves. However this is a nonviscous computation and the method resolves the shocks by adding extra numerical dissipation where the gradients are large. One wonders whether the extra dissipation would influence small turbulent structures like small intense vortices. The second chapter is an extensive discussion of preliminary numerical work using the spectral method to solve the compressible Navier-Stokes equations to study turbulent jet flows. The method uses Fourier expansions in the azimuthal and streamwise direction and a 1-D B-spline basis representation in the radial direction. The B-spline basis is locally supported and this ensures block diagonal matrix equations which are solved in O(N) steps. A very accurate highly resolved DNS of a turbulent jet flow is expected.

Numerical Analysis Objects

NASA Astrophysics Data System (ADS)

Henderson, Michael

1997-08-01

The Numerical Analysis Objects project (NAO) is a project in the Mathematics Department of IBM's TJ Watson Research Center. While there are plenty of numerical tools available today, it is not an easy task to combine them into a custom application. NAO is directed at the dual problems of building applications from a set of tools, and creating those tools. There are several "reuse" projects, which focus on the problems of identifying and cataloging tools. NAO is directed at the specific context of scientific computing. Because the type of tools is restricted, problems such as tools with incompatible data structures for input and output, and dissimilar interfaces to tools which solve similar problems can be addressed. The approach we've taken is to define interfaces to those objects used in numerical analysis, such as geometries, functions and operators, and to start collecting (and building) a set of tools which use these interfaces. We have written a class library (a set of abstract classes and implementations) in C++ which demonstrates the approach. Besides the classes, the class library includes "stub" routines which allow the library to be used from C or Fortran, and an interface to a Visual Programming Language. The library has been used to build a simulator for petroleum reservoirs, using a set of tools for discretizing nonlinear differential equations that we have written, and includes "wrapped" versions of packages from the Netlib repository. Documentation can be found on the Web at "http://www.research.ibm.com/nao". I will describe the objects and their interfaces, and give examples ranging from mesh generation to solving differential equations.

Semi-analytical Karhunen-Loeve representation of irregular waves based on the prolate spheroidal wave functions

NASA Astrophysics Data System (ADS)

Lee, Gibbeum; Cho, Yeunwoo

2018-01-01

A new semi-analytical approach is presented to solving the matrix eigenvalue problem or the integral equation in Karhunen-Loeve (K-L) representation of random data such as irregular ocean waves. Instead of direct numerical approach to this matrix eigenvalue problem, which may suffer from the computational inaccuracy for big data, a pair of integral and differential equations are considered, which are related to the so-called prolate spheroidal wave functions (PSWF). First, the PSWF is expressed as a summation of a small number of the analytical Legendre functions. After substituting them into the PSWF differential equation, a much smaller size matrix eigenvalue problem is obtained than the direct numerical K-L matrix eigenvalue problem. By solving this with a minimal numerical effort, the PSWF and the associated eigenvalue of the PSWF differential equation are obtained. Then, the eigenvalue of the PSWF integral equation is analytically expressed by the functional values of the PSWF and the eigenvalues obtained in the PSWF differential equation. Finally, the analytically expressed PSWFs and the eigenvalues in the PWSF integral equation are used to form the kernel matrix in the K-L integral equation for the representation of exemplary wave data such as ordinary irregular waves. It is found that, with the same accuracy, the required memory size of the present method is smaller than that of the direct numerical K-L representation and the computation time of the present method is shorter than that of the semi-analytical method based on the sinusoidal functions.

Development of Condensing Mesh Method for Corner Domain at Numerical Simulation Magnetic System

NASA Astrophysics Data System (ADS)

Perepelkin, E.; Tarelkin, A.; Polyakova, R.; Kovalenko, A.

2018-05-01

A magnetostatic problem arises in searching for the distribution of the magnetic field generated by magnet systems of many physics research facilities, e.g., accelerators. The domain in which the boundaryvalue problem is solved often has a piecewise smooth boundary. In this case, numerical calculations of the problem require the consideration of the solution behavior in the corner domain. In this work we obtained the upper estimation of the magnetic field growth and propose a method of condensing the differential grid near the corner domain of vacuum in case of 3-dimensional space based on this estimation. An example of calculating a real model problem for SDP NICA in the domain containing a corner point is given.

Modeling and simulation of different and representative engineering problems using Network Simulation Method

PubMed Central

2018-01-01

Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model. PMID:29518121

A new smoothing modified three-term conjugate gradient method for [Formula: see text]-norm minimization problem.

PubMed

Du, Shouqiang; Chen, Miao

2018-01-01

We consider a kind of nonsmooth optimization problems with [Formula: see text]-norm minimization, which has many applications in compressed sensing, signal reconstruction, and the related engineering problems. Using smoothing approximate techniques, this kind of nonsmooth optimization problem can be transformed into a general unconstrained optimization problem, which can be solved by the proposed smoothing modified three-term conjugate gradient method. The smoothing modified three-term conjugate gradient method is based on Polak-Ribière-Polyak conjugate gradient method. For the Polak-Ribière-Polyak conjugate gradient method has good numerical properties, the proposed method possesses the sufficient descent property without any line searches, and it is also proved to be globally convergent. Finally, the numerical experiments show the efficiency of the proposed method.

Modeling and simulation of different and representative engineering problems using Network Simulation Method.

PubMed

Sánchez-Pérez, J F; Marín, F; Morales, J L; Cánovas, M; Alhama, F

2018-01-01

Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model.

Numerical solution of a coupled pair of elliptic equations from solid state electronics

NASA Technical Reports Server (NTRS)

Phillips, T. N.

1983-01-01

Iterative methods are considered for the solution of a coupled pair of second order elliptic partial differential equations which arise in the field of solid state electronics. A finite difference scheme is used which retains the conservative form of the differential equations. Numerical solutions are obtained in two ways, by multigrid and dynamic alternating direction implicit methods. Numerical results are presented which show the multigrid method to be an efficient way of solving this problem.

Numerical solution of fluid-structure interaction represented by human vocal folds in airflow

NASA Astrophysics Data System (ADS)

Valášek, J.; Sváček, P.; Horáček, J.

2016-03-01

The paper deals with the human vocal folds vibration excited by the fluid flow. The vocal fold is modelled as an elastic body assuming small displacements and therefore linear elasticity theory is used. The viscous incompressible fluid flow is considered. For purpose of numerical solution the arbitrary Lagrangian-Euler method (ALE) is used. The whole problem is solved by the finite element method (FEM) based solver. Results of numerical experiments with different boundary conditions are presented.

Spectral method for pricing options in illiquid markets

NASA Astrophysics Data System (ADS)

Pindza, Edson; Patidar, Kailash C.

2012-09-01

We present a robust numerical method to solve a problem of pricing options in illiquid markets. The governing equation is described by a nonlinear Black-Scholes partial differential equation (BS-PDE) of the reaction-diffusion-advection type. To discretise this BS-PDE numerically, we use a spectral method in the asset (spatial) direction and couple it with a fifth order RADAU method for the discretisation in the time direction. Numerical experiments illustrate that our approach is very efficient for pricing financial options in illiquid markets.

Improvements in surface singularity analysis and design methods. [applicable to airfoils

NASA Technical Reports Server (NTRS)

Bristow, D. R.

1979-01-01

The coupling of the combined source vortex distribution of Green's potential flow function with contemporary numerical techniques is shown to provide accurate, efficient, and stable solutions to subsonic inviscid analysis and design problems for multi-element airfoils. The analysis problem is solved by direct calculation of the surface singularity distribution required to satisfy the flow tangency boundary condition. The design or inverse problem is solved by an iteration process. In this process, the geometry and the associated pressure distribution are iterated until the pressure distribution most nearly corresponding to the prescribed design distribution is obtained. Typically, five iteration cycles are required for convergence. A description of the analysis and design method is presented, along with supporting examples.

Eddy Current Testing and Sizing of Deep Cracks in a Thick Structure

DOE Office of Scientific and Technical Information (OSTI.GOV)

Huang, H.; Endo, H.; Uchimoto, T.

2004-02-26

Due to the skin effect of eddy current testing, target of ECT restricts to thin structure such as steam generator tubes with 1.27mm thickness. Detecting and sizing of a deep crack in a thick structure remains a problem. In this paper, an ECT probe is presented to solve this problem with the help of numerical analysis. The parameters such as frequency, coil size etc. are discussed. The inverse problem of crack sizing is solved by applying a fast simulator of ECT based on an edge based finite element method and steepest descent method, and reconstructed results of 5, 10 andmore » 15mm depth cracks from experimental signals are shown.« less

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

NASA Astrophysics Data System (ADS)

Lin, Guang; Liu, Jiangguo; Mu, Lin; Ye, Xiu

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors. We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.

Stress intensity factors in two bonded elastic layers containing cracks perpendicular to and on the interface. Part 2: Solution and results

NASA Technical Reports Server (NTRS)

Lu, M. C.; Erdogan, F.

1980-01-01

The numerical method is given for solving the plane problem for two bonded infinite dissimilar elastic strips which contain cracks of various configurations. The problem is intended to approximate a composite beam or a plate having cracks perpendicular to and on the interface of the two layers.

Systematic Approach for Calculating the Concentrations of Chemical Species in Multiequilibrium Problems: Inclusion of the Ionic Strength Effects

ERIC Educational Resources Information Center

Baeza-Baeza, Juan J.; Garcia-Alvarez-Coque, M. Celia

2012-01-01

A general systematic approach including ionic strength effects is proposed for the numerical calculation of concentrations of chemical species in multiequilibrium problems. This approach extends the versatility of the approach presented in a previous article and is applied using the Solver option of the Excel spreadsheet to solve real problems…

Development of Proportional Reasoning: Where Young Children Go Wrong

PubMed Central

Boyer, Ty W.; Levine, Susan C.; Huttenlocher, Janellen

2008-01-01

Previous studies have found that children have difficulty solving proportional reasoning problems involving discrete units until 10- to 12-years of age, but can solve parallel problems involving continuous quantities by 6-years of age. The present studies examine where children go wrong in processing proportions that involve discrete quantities. A computerized proportional equivalence choice task was administered to kindergartners through fourth-graders in Study 1, and to first- and third-graders in Study 2. Both studies involved four between-subjects conditions that were formed by pairing continuous and discrete target proportions with continuous and discrete choice alternatives. In Study 1, target and choice alternatives were presented simultaneously and in Study 2 target and choice alternatives were presented sequentially. In both studies, children performed significantly worse when both the target and choice alternatives were represented with discrete quantities than when either or both of the proportions involved continuous quantities. Taken together, these findings indicate that children go astray on proportional reasoning problems involving discrete units only when a numerical match is possible, suggesting that their difficulty is due to an overextension of numerical equivalence concepts to proportional equivalence problems. PMID:18793078

Numerical simulation of Forchheimer flow to a partially penetrating well with a mixed-type boundary condition

NASA Astrophysics Data System (ADS)

Mathias, Simon A.; Wen, Zhang

2015-05-01

This article presents a numerical study to investigate the combined role of partial well penetration (PWP) and non-Darcy effects concerning the performance of groundwater production wells. A finite difference model is developed in MATLAB to solve the two-dimensional mixed-type boundary value problem associated with flow to a partially penetrating well within a cylindrical confined aquifer. Non-Darcy effects are incorporated using the Forchheimer equation. The model is verified by comparison to results from existing semi-analytical solutions concerning the same problem but assuming Darcy's law. A sensitivity analysis is presented to explore the problem of concern. For constant pressure production, Non-Darcy effects lead to a reduction in production rate, as compared to an equivalent problem solved using Darcy's law. For fully penetrating wells, this reduction in production rate becomes less significant with time. However, for partially penetrating wells, the reduction in production rate persists for much larger times. For constant production rate scenarios, the combined effect of PWP and non-Darcy flow takes the form of a constant additional drawdown term. An approximate solution for this loss term is obtained by performing linear regression on the modeling results.

OpenGeoSys: Performance-Oriented Computational Methods for Numerical Modeling of Flow in Large Hydrogeological Systems

NASA Astrophysics Data System (ADS)

Naumov, D.; Fischer, T.; Böttcher, N.; Watanabe, N.; Walther, M.; Rink, K.; Bilke, L.; Shao, H.; Kolditz, O.

2014-12-01

OpenGeoSys (OGS) is a scientific open source code for numerical simulation of thermo-hydro-mechanical-chemical processes in porous and fractured media. Its basic concept is to provide a flexible numerical framework for solving multi-field problems for applications in geoscience and hydrology as e.g. for CO2 storage applications, geothermal power plant forecast simulation, salt water intrusion, water resources management, etc. Advances in computational mathematics have revolutionized the variety and nature of the problems that can be addressed by environmental scientists and engineers nowadays and an intensive code development in the last years enables in the meantime the solutions of much larger numerical problems and applications. However, solving environmental processes along the water cycle at large scales, like for complete catchment or reservoirs, stays computationally still a challenging task. Therefore, we started a new OGS code development with focus on execution speed and parallelization. In the new version, a local data structure concept improves the instruction and data cache performance by a tight bundling of data with an element-wise numerical integration loop. Dedicated analysis methods enable the investigation of memory-access patterns in the local and global assembler routines, which leads to further data structure optimization for an additional performance gain. The concept is presented together with a technical code analysis of the recent development and a large case study including transient flow simulation in the unsaturated / saturated zone of the Thuringian Syncline, Germany. The analysis is performed on a high-resolution mesh (up to 50M elements) with embedded fault structures.

An optimization method for the problems of thermal cloaking of material bodies

NASA Astrophysics Data System (ADS)

Alekseev, G. V.; Levin, V. A.

2016-11-01

Inverse heat-transfer problems related to constructing special thermal devices such as cloaking shells, thermal-illusion or thermal-camouflage devices, and heat-flux concentrators are studied. The heatdiffusion equation with a variable heat-conductivity coefficient is used as the initial heat-transfer model. An optimization method is used to reduce the above inverse problems to the respective control problem. The solvability of the above control problem is proved, an optimality system that describes necessary extremum conditions is derived, and a numerical algorithm for solving the control problem is proposed.

Asymptotic theory of neutral stability of the Couette flow of a vibrationally excited gas

NASA Astrophysics Data System (ADS)

Grigor'ev, Yu. N.; Ershov, I. V.

2017-01-01

An asymptotic theory of the neutral stability curve for a supersonic plane Couette flow of a vibrationally excited gas is developed. The initial mathematical model consists of equations of two-temperature viscous gas dynamics, which are used to derive a spectral problem for a linear system of eighth-order ordinary differential equations within the framework of the classical linear stability theory. Unified transformations of the system for all shear flows are performed in accordance with the classical Lin scheme. The problem is reduced to an algebraic secular equation with separation into the "inviscid" and "viscous" parts, which is solved numerically. It is shown that the thus-calculated neutral stability curves agree well with the previously obtained results of the direct numerical solution of the original spectral problem. In particular, the critical Reynolds number increases with excitation enhancement, and the neutral stability curve is shifted toward the domain of higher wave numbers. This is also confirmed by means of solving an asymptotic equation for the critical Reynolds number at the Mach number M ≤ 4.

Skin friction enhancement in a model problem of undulatory swimming

NASA Astrophysics Data System (ADS)

Ehrenstein, Uwe; Eloy, Christophe

2013-10-01

To calculate the energy costs of swimming, it is crucial to evaluate the drag force originating from skin friction. In this paper we examine the assumption, known as the 'Bone-Lighthill boundary-layer thinning hypothesis', that undulatory swimming motions induce a drag increase because of the compression of the boundary layer. Studying analytically an incoming flow along a flat plate moving at a normal velocity as a limit case of a yawed cylinder in uniform flow under the laminar boundary layer assumption, we demonstrate that the longitudinal drag scales as the square root of the normal velocity component. This analytical prediction is interpreted in the light of a three-dimensional numerical simulation result for a plate of finite length and width. An analogous two-dimensional Navier-Stokes problem by artificially accelerating the flow in a channel of finite height is proposed and solved numerically, showing the robustness of the analytical results. Solving the problem for an undulatory plate motion similar to fish swimming, we find a drag enhancement which can be estimated to be of the order of 20 %.

Sinc-Galerkin estimation of diffusivity in parabolic problems

NASA Technical Reports Server (NTRS)

Smith, Ralph C.; Bowers, Kenneth L.

1991-01-01

A fully Sinc-Galerkin method for the numerical recovery of spatially varying diffusion coefficients in linear partial differential equations is presented. Because the parameter recovery problems are inherently ill-posed, an output error criterion in conjunction with Tikhonov regularization is used to formulate them as infinite-dimensional minimization problems. The forward problems are discretized with a sinc basis in both the spatial and temporal domains thus yielding an approximate solution which displays an exponential convergence rate and is valid on the infinite time interval. The minimization problems are then solved via a quasi-Newton/trust region algorithm. The L-curve technique for determining an approximate value of the regularization parameter is briefly discussed, and numerical examples are given which show the applicability of the method both for problems with noise-free data as well as for those whose data contains white noise.

Computation of Transonic Nozzle Sound Transmission and Rotor Problems by the Dispersion-Relation-Preserving Scheme

NASA Technical Reports Server (NTRS)

Tam, Christopher K. W.; Aganin, Alexei

2000-01-01

The transonic nozzle transmission problem and the open rotor noise radiation problem are solved computationally. Both are multiple length scales problems. For efficient and accurate numerical simulation, the multiple-size-mesh multiple-time-step Dispersion-Relation-Preserving scheme is used to calculate the time periodic solution. To ensure an accurate solution, high quality numerical boundary conditions are also needed. For the nozzle problem, a set of nonhomogeneous, outflow boundary conditions are required. The nonhomogeneous boundary conditions not only generate the incoming sound waves but also, at the same time, allow the reflected acoustic waves and entropy waves, if present, to exit the computation domain without reflection. For the open rotor problem, there is an apparent singularity at the axis of rotation. An analytic extension approach is developed to provide a high quality axis boundary treatment.

Numerical Optimization Algorithms and Software for Systems Biology

DOE Office of Scientific and Technical Information (OSTI.GOV)

Saunders, Michael

2013-02-02

The basic aims of this work are: to develop reliable algorithms for solving optimization problems involving large stoi- chiometric matrices; to investigate cyclic dependency between metabolic and macromolecular biosynthetic networks; and to quantify the significance of thermodynamic constraints on prokaryotic metabolism.

Our Common Cause

ERIC Educational Resources Information Center

Eklund, Lowell

1976-01-01

Adult educators, providing necessary lifelong, comprehensive education, face the major imperative of solving the problem of racism. Numerous other imperatives concerning program design and content must be fulfilled in effectively meeting adult learners' needs. Guidance from the principles expressed in a proposed adult educator's Hippocratic Oath…

Data access and decision tools for coastal water resources management

EPA Science Inventory

US EPA has supported the development of numerous models and tools to support implementation of environmental regulations. However, transfer of knowledge and methods from detailed technical models to support practical problem solving by local communities and watershed or coastal ...

Numerical Study of Plasmonic Efficiency of Gold Nanostripes for Molecule Detection

PubMed Central

2015-01-01

In plasmonics, the accurate computation of the electromagnetic field enhancement is necessary in determining the amplitude and the spatial extension of the field around nanostructures. Here, the problem of the interaction between an electromagnetic excitation and gold nanostripes is solved. An optimization scheme, including an adaptive remeshing process with error estimator, is used to solve the problem through a finite element method. The variations of the electromagnetic field amplitude and the plasmonic active zones around nanostructures for molecule detection are studied in this paper taking into account the physical and geometrical parameters of the nanostripes. The evolution between the sizes and number of nanostripes is shown. PMID:25734184

On inconsistency in frictional granular systems

NASA Astrophysics Data System (ADS)

Alart, Pierre; Renouf, Mathieu

2018-04-01

Numerical simulation of granular systems is often based on a discrete element method. The nonsmooth contact dynamics approach can be used to solve a broad range of granular problems, especially involving rigid bodies. However, difficulties could be encountered and hamper successful completion of some simulations. The slow convergence of the nonsmooth solver may sometimes be attributed to an ill-conditioned system, but the convergence may also fail. The prime aim of the present study was to identify situations that hamper the consistency of the mathematical problem to solve. Some simple granular systems were investigated in detail while reviewing and applying the related theoretical results. A practical alternative is briefly analyzed and tested.

Coherent mode decomposition using mixed Wigner functions of Hermite-Gaussian beams.

PubMed

Tanaka, Takashi

2017-04-15

A new method of coherent mode decomposition (CMD) is proposed that is based on a Wigner-function representation of Hermite-Gaussian beams. In contrast to the well-known method using the cross spectral density (CSD), it directly determines the mode functions and their weights without solving the eigenvalue problem. This facilitates the CMD of partially coherent light whose Wigner functions (and thus CSDs) are not separable, in which case the conventional CMD requires solving an eigenvalue problem with a large matrix and thus is numerically formidable. An example is shown regarding the CMD of synchrotron radiation, one of the most important applications of the proposed method.

Performance evaluation of OpenFOAM on many-core architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brzobohatý, Tomáš; Říha, Lubomír; Karásek, Tomáš, E-mail: tomas.karasek@vsb.cz

In this article application of Open Source Field Operation and Manipulation (OpenFOAM) C++ libraries for solving engineering problems on many-core architectures is presented. Objective of this article is to present scalability of OpenFOAM on parallel platforms solving real engineering problems of fluid dynamics. Scalability test of OpenFOAM is performed using various hardware and different implementation of standard PCG and PBiCG Krylov iterative methods. Speed up of various implementations of linear solvers using GPU and MIC accelerators are presented in this paper. Numerical experiments of 3D lid-driven cavity flow for several cases with various number of cells are presented.

A recurrent neural network for solving bilevel linear programming problem.

PubMed

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian

2014-04-01

In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.

Alternative theoretical method for motion of a sand-filled funnel experiment

NASA Astrophysics Data System (ADS)

Byrd, David; White, Gary

2001-11-01

In "Motion of a Sand-Filled Funnel," Peter Sullivan and Anna McLoon described how to use numerical methods and a Microsoft Excel spreadsheet to predict the motion of a variant of Atwood's machine with variable mass. They wrote for noncalculus-based physics classes, but we solve the same problem using the methods of calculus. Our method highlights the less-familiar but more accurate version of Newton's second law, ∑F =dp/dt. This can help introductory physics students understand a broader definition of Newton's second law and enhance their calculus skills. It also teaches students how to solve a variable-mass problem.

Numerical Solution of the Extended Nernst-Planck Model.

PubMed

Samson; Marchand

1999-07-01

The main features of a numerical model aiming at predicting the drift of ions in an electrolytic solution upon a chemical potential gradient are presented. The mechanisms of ionic diffusion are described by solving the extended Nernst-Planck system of equations. The electrical coupling between the various ionic fluxes is accounted for by the Poisson equation. Furthermore, chemical activity effects are considered in the model. The whole system of nonlinear equations is solved using the finite-element method. Results yielded by the model for simple test cases are compared to those obtained using an analytical solution. Applications of the model to more complex problems are also presented and discussed. Copyright 1999 Academic Press.

Two-Level Hierarchical FEM Method for Modeling Passive Microwave Devices

NASA Astrophysics Data System (ADS)

Polstyanko, Sergey V.; Lee, Jin-Fa

1998-03-01

In recent years multigrid methods have been proven to be very efficient for solving large systems of linear equations resulting from the discretization of positive definite differential equations by either the finite difference method or theh-version of the finite element method. In this paper an iterative method of the multiple level type is proposed for solving systems of algebraic equations which arise from thep-version of the finite element analysis applied to indefinite problems. A two-levelV-cycle algorithm has been implemented and studied with a Gauss-Seidel iterative scheme used as a smoother. The convergence of the method has been investigated, and numerical results for a number of numerical examples are presented.

Heat transfer of phase-change materials in two-dimensional cylindrical coordinates

NASA Technical Reports Server (NTRS)

Labdon, M. B.; Guceri, S. I.

1981-01-01

Two-dimensional phase-change problem is numerically solved in cylindrical coordinates (r and z) by utilizing two Taylor series expansions for the temperature distributions in the neighborhood of the interface location. These two expansions form two polynomials in r and z directions. For the regions sufficiently away from the interface the temperature field equations are numerically solved in the usual way and the results are coupled with the polynomials. The main advantages of this efficient approach include ability to accept arbitrarily time dependent boundary conditions of all types and arbitrarily specified initial temperature distributions. A modified approach using a single Taylor series expansion in two variables is also suggested.

Numerical Solution of Systems of Loaded Ordinary Differential Equations with Multipoint Conditions

NASA Astrophysics Data System (ADS)

Assanova, A. T.; Imanchiyev, A. E.; Kadirbayeva, Zh. M.

2018-04-01

A system of loaded ordinary differential equations with multipoint conditions is considered. The problem under study is reduced to an equivalent boundary value problem for a system of ordinary differential equations with parameters. A system of linear algebraic equations for the parameters is constructed using the matrices of the loaded terms and the multipoint condition. The conditions for the unique solvability and well-posedness of the original problem are established in terms of the matrix made up of the coefficients of the system of linear algebraic equations. The coefficients and the righthand side of the constructed system are determined by solving Cauchy problems for linear ordinary differential equations. The solutions of the system are found in terms of the values of the desired function at the initial points of subintervals. The parametrization method is numerically implemented using the fourth-order accurate Runge-Kutta method as applied to the Cauchy problems for ordinary differential equations. The performance of the constructed numerical algorithms is illustrated by examples.

Accuracy Study of the Space-Time CE/SE Method for Computational Aeroacoustics Problems Involving Shock Waves

NASA Technical Reports Server (NTRS)

Wang, Xiao Yen; Chang, Sin-Chung; Jorgenson, Philip C. E.

1999-01-01

The space-time conservation element and solution element(CE/SE) method is used to study the sound-shock interaction problem. The order of accuracy of numerical schemes is investigated. The linear model problem.govemed by the 1-D scalar convection equation, sound-shock interaction problem governed by the 1-D Euler equations, and the 1-D shock-tube problem which involves moving shock waves and contact surfaces are solved to investigate the order of accuracy of numerical schemes. It is concluded that the accuracy of the CE/SE numerical scheme with designed 2nd-order accuracy becomes 1st order when a moving shock wave exists. However, the absolute error in the CE/SE solution downstream of the shock wave is on the same order as that obtained using a fourth-order accurate essentially nonoscillatory (ENO) scheme. No special techniques are used for either high-frequency low-amplitude waves or shock waves.

A fast numerical method for ideal fluid flow in domains with multiple stirrers

NASA Astrophysics Data System (ADS)

Nasser, Mohamed M. S.; Green, Christopher C.

2018-03-01

A collection of arbitrarily-shaped solid objects, each moving at a constant speed, can be used to mix or stir ideal fluid, and can give rise to interesting flow patterns. Assuming these systems of fluid stirrers are two-dimensional, the mathematical problem of resolving the flow field—given a particular distribution of any finite number of stirrers of specified shape and speed—can be formulated as a Riemann-Hilbert (R-H) problem. We show that this R-H problem can be solved numerically using a fast and accurate algorithm for any finite number of stirrers based around a boundary integral equation with the generalized Neumann kernel. Various systems of fluid stirrers are considered, and our numerical scheme is shown to handle highly multiply connected domains (i.e. systems of many fluid stirrers) with minimal computational expense.

A Numerical-Analytical Approach Based on Canonical Transformations for Computing Optimal Low-Thrust Transfers

NASA Astrophysics Data System (ADS)

da Silva Fernandes, S.; das Chagas Carvalho, F.; Bateli Romão, J. V.

2018-04-01

A numerical-analytical procedure based on infinitesimal canonical transformations is developed for computing optimal time-fixed low-thrust limited power transfers (no rendezvous) between coplanar orbits with small eccentricities in an inverse-square force field. The optimization problem is formulated as a Mayer problem with a set of non-singular orbital elements as state variables. Second order terms in eccentricity are considered in the development of the maximum Hamiltonian describing the optimal trajectories. The two-point boundary value problem of going from an initial orbit to a final orbit is solved by means of a two-stage Newton-Raphson algorithm which uses an infinitesimal canonical transformation. Numerical results are presented for some transfers between circular orbits with moderate radius ratio, including a preliminary analysis of Earth-Mars and Earth-Venus missions.

An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

NASA Astrophysics Data System (ADS)

Kassa, Semu Mitiku; Tsegay, Teklay Hailay

2017-08-01

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of problems. In this paper, we investigate a tri-level programming problem with quadratic fractional objective functions at each of the three levels. A solution algorithm has been proposed by applying fuzzy goal programming approach and by reformulating the fractional constraints to equivalent but non-fractional non-linear constraints. Based on the transformed formulation, an iterative procedure is developed that can yield a satisfactory solution to the tri-level problem. The numerical results on various illustrative examples demonstrated that the proposed algorithm is very much promising and it can also be used to solve larger-sized as well as n-level problems of similar structure.

Flight control with adaptive critic neural network

NASA Astrophysics Data System (ADS)

Han, Dongchen

2001-10-01

In this dissertation, the adaptive critic neural network technique is applied to solve complex nonlinear system control problems. Based on dynamic programming, the adaptive critic neural network can embed the optimal solution into a neural network. Though trained off-line, the neural network forms a real-time feedback controller. Because of its general interpolation properties, the neurocontroller has inherit robustness. The problems solved here are an agile missile control for U.S. Air Force and a midcourse guidance law for U.S. Navy. In the first three papers, the neural network was used to control an air-to-air agile missile to implement a minimum-time heading-reverse in a vertical plane corresponding to following conditions: a system without constraint, a system with control inequality constraint, and a system with state inequality constraint. While the agile missile is a one-dimensional problem, the midcourse guidance law is the first test-bed for multiple-dimensional problem. In the fourth paper, the neurocontroller is synthesized to guide a surface-to-air missile to a fixed final condition, and to a flexible final condition from a variable initial condition. In order to evaluate the adaptive critic neural network approach, the numerical solutions for these cases are also obtained by solving two-point boundary value problem with a shooting method. All of the results showed that the adaptive critic neural network could solve complex nonlinear system control problems.

Application of high-order numerical schemes and Newton-Krylov method to two-phase drift-flux model

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

This study concerns the application and solver robustness of the Newton-Krylov method in solving two-phase flow drift-flux model problems using high-order numerical schemes. In our previous studies, the Newton-Krylov method has been proven as a promising solver for two-phase flow drift-flux model problems. However, these studies were limited to use first-order numerical schemes only. Moreover, the previous approach to treating the drift-flux closure correlations was later revealed to cause deteriorated solver convergence performance, when the mesh was highly refined, and also when higher-order numerical schemes were employed. In this study, a second-order spatial discretization scheme that has been tested withmore » two-fluid two-phase flow model was extended to solve drift-flux model problems. In order to improve solver robustness, and therefore efficiency, a new approach was proposed to treating the mean drift velocity of the gas phase as a primary nonlinear variable to the equation system. With this new approach, significant improvement in solver robustness was achieved. With highly refined mesh, the proposed treatment along with the Newton-Krylov solver were extensively tested with two-phase flow problems that cover a wide range of thermal-hydraulics conditions. Satisfactory convergence performances were observed for all test cases. Numerical verification was then performed in the form of mesh convergence studies, from which expected orders of accuracy were obtained for both the first-order and the second-order spatial discretization schemes. Finally, the drift-flux model, along with numerical methods presented, were validated with three sets of flow boiling experiments that cover different flow channel geometries (round tube, rectangular tube, and rod bundle), and a wide range of test conditions (pressure, mass flux, wall heat flux, inlet subcooling and outlet void fraction).« less

Application of high-order numerical schemes and Newton-Krylov method to two-phase drift-flux model

DOE PAGES

Zou, Ling; Zhao, Haihua; Zhang, Hongbin

2017-08-07

This study concerns the application and solver robustness of the Newton-Krylov method in solving two-phase flow drift-flux model problems using high-order numerical schemes. In our previous studies, the Newton-Krylov method has been proven as a promising solver for two-phase flow drift-flux model problems. However, these studies were limited to use first-order numerical schemes only. Moreover, the previous approach to treating the drift-flux closure correlations was later revealed to cause deteriorated solver convergence performance, when the mesh was highly refined, and also when higher-order numerical schemes were employed. In this study, a second-order spatial discretization scheme that has been tested withmore » two-fluid two-phase flow model was extended to solve drift-flux model problems. In order to improve solver robustness, and therefore efficiency, a new approach was proposed to treating the mean drift velocity of the gas phase as a primary nonlinear variable to the equation system. With this new approach, significant improvement in solver robustness was achieved. With highly refined mesh, the proposed treatment along with the Newton-Krylov solver were extensively tested with two-phase flow problems that cover a wide range of thermal-hydraulics conditions. Satisfactory convergence performances were observed for all test cases. Numerical verification was then performed in the form of mesh convergence studies, from which expected orders of accuracy were obtained for both the first-order and the second-order spatial discretization schemes. Finally, the drift-flux model, along with numerical methods presented, were validated with three sets of flow boiling experiments that cover different flow channel geometries (round tube, rectangular tube, and rod bundle), and a wide range of test conditions (pressure, mass flux, wall heat flux, inlet subcooling and outlet void fraction).« less

Human-computer interfaces applied to numerical solution of the Plateau problem

NASA Astrophysics Data System (ADS)

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.

A DRBEM for steady infiltration from periodic semi-circular channels with two different types of roots distribution

NASA Astrophysics Data System (ADS)

Solekhudin, Imam; Sumardi

2017-05-01

In this study, problems involving steady Infiltration from periodic semicircular channels with root-water uptake function are considered. These problems are governed by Richards equation. This equation can be studied more conveniently by transforming the equation into a modified Helmholtz equation. In these problems, two different types of root-water uptake are considered. A dual reciprocity boundary element method (DRBEM) with a predictor-corrector scheme is used to solve the modified Helmholtz equation numerically. Using the solution obtained, numerical values of suction potential and root-water uptake function can be computed. In addition, amount of water absorbed by the different plant roots distribution can also be computed and compared.

Numerical Simulation of Two Phase Flows

NASA Technical Reports Server (NTRS)

Liou, Meng-Sing

2001-01-01

Two phase flows can be found in broad situations in nature, biology, and industry devices and can involve diverse and complex mechanisms. While the physical models may be specific for certain situations, the mathematical formulation and numerical treatment for solving the governing equations can be general. Hence, we will require information concerning each individual phase as needed in a single phase. but also the interactions between them. These interaction terms, however, pose additional numerical challenges because they are beyond the basis that we use to construct modern numerical schemes, namely the hyperbolicity of equations. Moreover, due to disparate differences in time scales, fluid compressibility and nonlinearity become acute, further complicating the numerical procedures. In this paper, we will show the ideas and procedure how the AUSM-family schemes are extended for solving two phase flows problems. Specifically, both phases are assumed in thermodynamic equilibrium, namely, the time scales involved in phase interactions are extremely short in comparison with those in fluid speeds and pressure fluctuations. Details of the numerical formulation and issues involved are discussed and the effectiveness of the method are demonstrated for several industrial examples.

On Spurious Numerics in Solving Reactive Equations

NASA Technical Reports Server (NTRS)

Kotov, D. V; Yee, H. C.; Wang, W.; Shu, C.-W.

2013-01-01

The objective of this study is to gain a deeper understanding of the behavior of high order shock-capturing schemes for problems with stiff source terms and discontinuities and on corresponding numerical prediction strategies. The studies by Yee et al. (2012) and Wang et al. (2012) focus only on solving the reactive system by the fractional step method using the Strang splitting (Strang 1968). It is a common practice by developers in computational physics and engineering simulations to include a cut off safeguard if densities are outside the permissible range. Here we compare the spurious behavior of the same schemes by solving the fully coupled reactive system without the Strang splitting vs. using the Strang splitting. Comparison between the two procedures and the effects of a cut off safeguard is the focus the present study. The comparison of the performance of these schemes is largely based on the degree to which each method captures the correct location of the reaction front for coarse grids. Here "coarse grids" means standard mesh density requirement for accurate simulation of typical non-reacting flows of similar problem setup. It is remarked that, in order to resolve the sharp reaction front, local refinement beyond standard mesh density is still needed.

Transient thermal stress problem for a circumferentially cracked hollow cylinder

NASA Technical Reports Server (NTRS)

Nied, H. F.; Erdogan, F.

1982-01-01

The transient thermal stress problem for a hollow elasticity cylinder containing an internal circumferential edge crack is considered. It is assumed that the problem is axisymmetric with regard to the crack geometry and the loading, and that the inertia effects are negligible. The problem is solved for a cylinder which is suddenly cooled from inside. First the transient temperature and stress distributions in an uncracked cylinder are calculated. By using the equal and opposite of this thermal stress as the crack surface traction in the isothermal cylinder the crack problem is then solved and the stress intensity factor is calculated. The numerical results are obtained as a function of the Fourier number tD/b(2) representing the time for various inner-to-outer radius ratios and relative crack depths, where D and b are respectively the coefficient of diffusivity and the outer radius of the cylinder.

Application of GA, PSO, and ACO algorithms to path planning of autonomous underwater vehicles

NASA Astrophysics Data System (ADS)

Aghababa, Mohammad Pourmahmood; Amrollahi, Mohammad Hossein; Borjkhani, Mehdi

2012-09-01

In this paper, an underwater vehicle was modeled with six dimensional nonlinear equations of motion, controlled by DC motors in all degrees of freedom. Near-optimal trajectories in an energetic environment for underwater vehicles were computed using a numerical solution of a nonlinear optimal control problem (NOCP). An energy performance index as a cost function, which should be minimized, was defined. The resulting problem was a two-point boundary value problem (TPBVP). A genetic algorithm (GA), particle swarm optimization (PSO), and ant colony optimization (ACO) algorithms were applied to solve the resulting TPBVP. Applying an Euler-Lagrange equation to the NOCP, a conjugate gradient penalty method was also adopted to solve the TPBVP. The problem of energetic environments, involving some energy sources, was discussed. Some near-optimal paths were found using a GA, PSO, and ACO algorithms. Finally, the problem of collision avoidance in an energetic environment was also taken into account.

Distributed optimisation problem with communication delay and external disturbance

NASA Astrophysics Data System (ADS)

Tran, Ngoc-Tu; Xiao, Jiang-Wen; Wang, Yan-Wu; Yang, Wu

2017-12-01

This paper investigates the distributed optimisation problem for the multi-agent systems (MASs) with the simultaneous presence of external disturbance and the communication delay. To solve this problem, a two-step design scheme is introduced. In the first step, based on the internal model principle, the internal model term is constructed to compensate the disturbance asymptotically. In the second step, a distributed optimisation algorithm is designed to solve the distributed optimisation problem based on the MASs with the simultaneous presence of disturbance and communication delay. Moreover, in the proposed algorithm, each agent interacts with its neighbours through the connected topology and the delay occurs during the information exchange. By utilising Lyapunov-Krasovskii functional, the delay-dependent conditions are derived for both slowly and fast time-varying delay, respectively, to ensure the convergence of the algorithm to the optimal solution of the optimisation problem. Several numerical simulation examples are provided to illustrate the effectiveness of the theoretical results.

An interior-point method-based solver for simulation of aircraft parts riveting

NASA Astrophysics Data System (ADS)

Stefanova, Maria; Yakunin, Sergey; Petukhova, Margarita; Lupuleac, Sergey; Kokkolaras, Michael

2018-05-01

The particularities of the aircraft parts riveting process simulation necessitate the solution of a large amount of contact problems. A primal-dual interior-point method-based solver is proposed for solving such problems efficiently. The proposed method features a worst case polynomial complexity bound ? on the number of iterations, where n is the dimension of the problem and ε is a threshold related to desired accuracy. In practice, the convergence is often faster than this worst case bound, which makes the method applicable to large-scale problems. The computational challenge is solving the system of linear equations because the associated matrix is ill conditioned. To that end, the authors introduce a preconditioner and a strategy for determining effective initial guesses based on the physics of the problem. Numerical results are compared with ones obtained using the Goldfarb-Idnani algorithm. The results demonstrate the efficiency of the proposed method.

Solving optimization problems by the public goods game

NASA Astrophysics Data System (ADS)

Javarone, Marco Alberto

2017-09-01

We introduce a method based on the Public Goods Game for solving optimization tasks. In particular, we focus on the Traveling Salesman Problem, i.e. a NP-hard problem whose search space exponentially grows increasing the number of cities. The proposed method considers a population whose agents are provided with a random solution to the given problem. In doing so, agents interact by playing the Public Goods Game using the fitness of their solution as currency of the game. Notably, agents with better solutions provide higher contributions, while those with lower ones tend to imitate the solution of richer agents for increasing their fitness. Numerical simulations show that the proposed method allows to compute exact solutions, and suboptimal ones, in the considered search spaces. As result, beyond to propose a new heuristic for combinatorial optimization problems, our work aims to highlight the potentiality of evolutionary game theory beyond its current horizons.

Numerical Analysis of a Class of THM Coupled Model for Porous Materials

NASA Astrophysics Data System (ADS)

Liu, Tangwei; Zhou, Jingying; Lu, Hongzhi

2018-01-01

We consider the coupled models of the Thermo-hydro-mechanical (THM) problem for porous materials which arises in many engineering applications. Firstly, mathematical models of the THM coupled problem for porous materials were discussed. Secondly, for different cases, some numerical difference schemes of coupled model were constructed, respectively. Finally, aassuming that the original water vapour effect is neglectable and that the volume fraction of liquid phase and the solid phase are constants, the nonlinear equations can be reduced to linear equations. The discrete equations corresponding to the linear equations were solved by the Arnodli method.

The numerical solution of linear multi-term fractional differential equations: systems of equations

NASA Astrophysics Data System (ADS)

Edwards, John T.; Ford, Neville J.; Simpson, A. Charles

2002-11-01

In this paper, we show how the numerical approximation of the solution of a linear multi-term fractional differential equation can be calculated by reduction of the problem to a system of ordinary and fractional differential equations each of order at most unity. We begin by showing how our method applies to a simple class of problems and we give a convergence result. We solve the Bagley Torvik equation as an example. We show how the method can be applied to a general linear multi-term equation and give two further examples.

Numerical viscosity and resolution of high-order weighted essentially nonoscillatory schemes for compressible flows with high Reynolds numbers.

PubMed

Zhang, Yong-Tao; Shi, Jing; Shu, Chi-Wang; Zhou, Ye

2003-10-01

A quantitative study is carried out in this paper to investigate the size of numerical viscosities and the resolution power of high-order weighted essentially nonoscillatory (WENO) schemes for solving one- and two-dimensional Navier-Stokes equations for compressible gas dynamics with high Reynolds numbers. A one-dimensional shock tube problem, a one-dimensional example with parameters motivated by supernova and laser experiments, and a two-dimensional Rayleigh-Taylor instability problem are used as numerical test problems. For the two-dimensional Rayleigh-Taylor instability problem, or similar problems with small-scale structures, the details of the small structures are determined by the physical viscosity (therefore, the Reynolds number) in the Navier-Stokes equations. Thus, to obtain faithful resolution to these small-scale structures, the numerical viscosity inherent in the scheme must be small enough so that the physical viscosity dominates. A careful mesh refinement study is performed to capture the threshold mesh for full resolution, for specific Reynolds numbers, when WENO schemes of different orders of accuracy are used. It is demonstrated that high-order WENO schemes are more CPU time efficient to reach the same resolution, both for the one-dimensional and two-dimensional test problems.

Numerical Simulation of Hysteretic Live Load Effect in a Soil-Steel Bridge

NASA Astrophysics Data System (ADS)

Sobótka, Maciej

2014-03-01

The paper presents numerical simulation of hysteretic live load effect in a soil-steel bridge. The effect was originally identified experimentally by Machelski [1], [2]. The truck was crossing the bridge one way and the other in the full-scale test performed. At the same time, displacements and stress in the shell were measured. The major conclusion from the research was that the measured quantities formed hysteretic loops. A numerical simulation of that effect is addressed in the present work. The analysis was performed using Flac finite difference code. The methodology of solving the mechanical problems implemented in Flac enables us to solve the problem concerning a sequence of load and non-linear mechanical behaviour of the structure. The numerical model incorporates linear elastic constitutive relations for the soil backfill, for the steel shell and the sheet piles, being a flexible substructure for the shell. Contact zone between the shell and the soil backfill is assumed to reflect elastic-plastic constitutive model. Maximum shear stress in contact zone is limited by the Coulomb condition. The plastic flow rule is described by dilation angle ψ = 0. The obtained results of numerical analysis are in fair agreement with the experimental evidence. The primary finding from the performed simulation is that the slip in the interface can be considered an explanation of the hysteresis occurrence in the charts of displacement and stress in the shell.

A generalized Condat's algorithm of 1D total variation regularization

NASA Astrophysics Data System (ADS)

Makovetskii, Artyom; Voronin, Sergei; Kober, Vitaly

2017-09-01

A common way for solving the denosing problem is to utilize the total variation (TV) regularization. Many efficient numerical algorithms have been developed for solving the TV regularization problem. Condat described a fast direct algorithm to compute the processed 1D signal. Also there exists a direct algorithm with a linear time for 1D TV denoising referred to as the taut string algorithm. The Condat's algorithm is based on a dual problem to the 1D TV regularization. In this paper, we propose a variant of the Condat's algorithm based on the direct 1D TV regularization problem. The usage of the Condat's algorithm with the taut string approach leads to a clear geometric description of the extremal function. Computer simulation results are provided to illustrate the performance of the proposed algorithm for restoration of degraded signals.

A meshless method for solving two-dimensional variable-order time fractional advection-diffusion equation

NASA Astrophysics Data System (ADS)

Tayebi, A.; Shekari, Y.; Heydari, M. H.

2017-07-01

Several physical phenomena such as transformation of pollutants, energy, particles and many others can be described by the well-known convection-diffusion equation which is a combination of the diffusion and advection equations. In this paper, this equation is generalized with the concept of variable-order fractional derivatives. The generalized equation is called variable-order time fractional advection-diffusion equation (V-OTFA-DE). An accurate and robust meshless method based on the moving least squares (MLS) approximation and the finite difference scheme is proposed for its numerical solution on two-dimensional (2-D) arbitrary domains. In the time domain, the finite difference technique with a θ-weighted scheme and in the space domain, the MLS approximation are employed to obtain appropriate semi-discrete solutions. Since the newly developed method is a meshless approach, it does not require any background mesh structure to obtain semi-discrete solutions of the problem under consideration, and the numerical solutions are constructed entirely based on a set of scattered nodes. The proposed method is validated in solving three different examples including two benchmark problems and an applied problem of pollutant distribution in the atmosphere. In all such cases, the obtained results show that the proposed method is very accurate and robust. Moreover, a remarkable property so-called positive scheme for the proposed method is observed in solving concentration transport phenomena.

Computational Methods for Identification, Optimization and Control of PDE Systems

DTIC Science & Technology

2010-04-30

focused on the development of numerical methods and software specifically for the purpose of solving control, design, and optimization prob- lems where...that provide the foundations of simulation software must play an important role in any research of this type, the demands placed on numerical methods...y sus Aplicaciones , Ciudad de Cor- doba - Argentina, October 2007. 3. Inverse Problems in Deployable Space Structures, Fourth Conference on Inverse

The NASTRAN theoretical manual

NASA Technical Reports Server (NTRS)

1981-01-01

Designed to accommodate additions and modifications, this commentary on NASTRAN describes the problem solving capabilities of the program in a narrative fashion and presents developments of the analytical and numerical procedures that underlie the program. Seventeen major sections and numerous subsections cover; the organizational aspects of the program, utility matrix routines, static structural analysis, heat transfer, dynamic structural analysis, computer graphics, special structural modeling techniques, error analysis, interaction between structures and fluids, and aeroelastic analysis.

New methods for the numerical integration of ordinary differential equations and their application to the equations of motion of spacecraft

NASA Technical Reports Server (NTRS)

Banyukevich, A.; Ziolkovski, K.

1975-01-01

A number of hybrid methods for solving Cauchy problems are described on the basis of an evaluation of advantages of single and multiple-point numerical integration methods. The selection criterion is the principle of minimizing computer time. The methods discussed include the Nordsieck method, the Bulirsch-Stoer extrapolation method, and the method of recursive Taylor-Steffensen power series.

Approximate method for calculating a thickwalled cylinder with rigidly clamped ends

NASA Astrophysics Data System (ADS)

Andreev, Vladimir

2018-03-01

Numerous papers dealing with the calculations of cylindrical bodies [1 -8 and others] have shown that analytic and numerical-analytical solutions in both homogeneous and inhomogeneous thick-walled shells can be obtained quite simply, using expansions in Fourier series on trigonometric functions, if the ends are hinged movable (sliding support). It is much more difficult to solve the problem of calculating shells with builtin ends.

A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.

PubMed

Wang, Zhaocai; Huang, Dongmei; Meng, Huajun; Tang, Chengpei

2013-10-01

The minimum spanning tree (MST) problem is to find minimum edge connected subsets containing all the vertex of a given undirected graph. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications. Moreover in previous studies, DNA molecular operations usually were used to solve NP-complete head-to-tail path search problems, rarely for NP-hard problems with multi-lateral path solutions result, such as the minimum spanning tree problem. In this paper, we present a new fast DNA algorithm for solving the MST problem using DNA molecular operations. For an undirected graph with n vertex and m edges, we reasonably design flexible length DNA strands representing the vertex and edges, take appropriate steps and get the solutions of the MST problem in proper length range and O(3m+n) time complexity. We extend the application of DNA molecular operations and simultaneity simplify the complexity of the computation. Results of computer simulative experiments show that the proposed method updates some of the best known values with very short time and that the proposed method provides a better performance with solution accuracy over existing algorithms. Copyright © 2013 The Authors. Published by Elsevier Ireland Ltd.. All rights reserved.

Visualization in Science and the Arts.

ERIC Educational Resources Information Center

Roth, Susan King

Visualization as a factor of intelligence includes the mental manipulation of spatial configurations and has been associated with spatial abilities, creative thinking, and conceptual problem solving. There are numerous reports of scientists and mathematicians using visualization to anticipate transformation of the external world. Artists and…

Finite length filters with maximally confined spectral power

NASA Technical Reports Server (NTRS)

Knight, J. W.; Newman, C. E.

1975-01-01

The problem of finding a function which, in addition to being zero outside a specified range in x-space, has its spectral power well confined to a certain range in k-space is solved numerically. Properties of the solutions are also discussed.

Extending the Regular Curriculum through Creative Problem Solving.

ERIC Educational Resources Information Center

Bohan, Harry; Bohan, Susan

1993-01-01

Uses ancient Egyptian numeration system in a new setting to extend the concepts of base, place value, and correspondence. Discusses similarities and differences between the Egyptian and decimal systems. Students are asked to propose changes to make the Egyptian system easier. (LDR)

Application of a Chimera Full Potential Algorithm for Solving Aerodynamic Problems

NASA Technical Reports Server (NTRS)

Holst, Terry L.; Kwak, Dochan (Technical Monitor)

1997-01-01

A numerical scheme utilizing a chimera zonal grid approach for solving the three dimensional full potential equation is described. Special emphasis is placed on describing the spatial differencing algorithm around the chimera interface. Results from two spatial discretization variations are presented; one using a hybrid first-order/second-order-accurate scheme and the second using a fully second-order-accurate scheme. The presentation is highlighted with a number of transonic wing flow field computations.

Algorithms and software for solving finite element equations on serial and parallel architectures

NASA Technical Reports Server (NTRS)

George, Alan

1989-01-01

Over the past 15 years numerous new techniques have been developed for solving systems of equations and eigenvalue problems arising in finite element computations. A package called SPARSPAK has been developed by the author and his co-workers which exploits these new methods. The broad objective of this research project is to incorporate some of this software in the Computational Structural Mechanics (CSM) testbed, and to extend the techniques for use on multiprocessor architectures.

Computational methods for inverse problems in geophysics: inversion of travel time observations

USGS Publications Warehouse

Pereyra, V.; Keller, H.B.; Lee, W.H.K.

1980-01-01

General ways of solving various inverse problems are studied for given travel time observations between sources and receivers. These problems are separated into three components: (a) the representation of the unknown quantities appearing in the model; (b) the nonlinear least-squares problem; (c) the direct, two-point ray-tracing problem used to compute travel time once the model parameters are given. Novel software is described for (b) and (c), and some ideas given on (a). Numerical results obtained with artificial data and an implementation of the algorithm are also presented. ?? 1980.

Fuzzy Hungarian Method for Solving Intuitionistic Fuzzy Travelling Salesman Problem

NASA Astrophysics Data System (ADS)

Prabakaran, K.; Ganesan, K.

2018-04-01

The travelling salesman problem is to identify the shortest route that the salesman journey all the places and return the starting place with minimum cost. We develop a fuzzy version of Hungarian algorithm for the solution of intuitionistic fuzzy travelling salesman problem using triangular intuitionistic fuzzy numbers without changing them to classical travelling salesman problem. The purposed method is easy to empathize and to implement for finding solution of intuitionistic travelling salesman problem happening in real life situations. To illustrate the proposed method numerical example are provided.

The meshless local Petrov-Galerkin method based on moving Kriging interpolation for solving the time fractional Navier-Stokes equations.

PubMed

Thamareerat, N; Luadsong, A; Aschariyaphotha, N

2016-01-01

In this paper, we present a numerical scheme used to solve the nonlinear time fractional Navier-Stokes equations in two dimensions. We first employ the meshless local Petrov-Galerkin (MLPG) method based on a local weak formulation to form the system of discretized equations and then we will approximate the time fractional derivative interpreted in the sense of Caputo by a simple quadrature formula. The moving Kriging interpolation which possesses the Kronecker delta property is applied to construct shape functions. This research aims to extend and develop further the applicability of the truly MLPG method to the generalized incompressible Navier-Stokes equations. Two numerical examples are provided to illustrate the accuracy and efficiency of the proposed algorithm. Very good agreement between the numerically and analytically computed solutions can be observed in the verification. The present MLPG method has proved its efficiency and reliability for solving the two-dimensional time fractional Navier-Stokes equations arising in fluid dynamics as well as several other problems in science and engineering.

A New Runge-Kutta Discontinuous Galerkin Method with Conservation Constraint to Improve CFL Condition for Solving Conservation Laws

PubMed Central

Xu, Zhiliang; Chen, Xu-Yan; Liu, Yingjie

2014-01-01

We present a new formulation of the Runge-Kutta discontinuous Galerkin (RKDG) method [9, 8, 7, 6] for solving conservation Laws with increased CFL numbers. The new formulation requires the computed RKDG solution in a cell to satisfy additional conservation constraint in adjacent cells and does not increase the complexity or change the compactness of the RKDG method. Numerical computations for solving one-dimensional and two-dimensional scalar and systems of nonlinear hyperbolic conservation laws are performed with approximate solutions represented by piecewise quadratic and cubic polynomials, respectively. The hierarchical reconstruction [17, 33] is applied as a limiter to eliminate spurious oscillations in discontinuous solutions. From both numerical experiments and the analytic estimate of the CFL number of the newly formulated method, we find that: 1) this new formulation improves the CFL number over the original RKDG formulation by at least three times or more and thus reduces the overall computational cost; and 2) the new formulation essentially does not compromise the resolution of the numerical solutions of shock wave problems compared with ones computed by the RKDG method. PMID:25414520

Improved Quasi-Newton method via PSB update for solving systems of nonlinear equations

NASA Astrophysics Data System (ADS)

Mamat, Mustafa; Dauda, M. K.; Waziri, M. Y.; Ahmad, Fadhilah; Mohamad, Fatma Susilawati

2016-10-01

The Newton method has some shortcomings which includes computation of the Jacobian matrix which may be difficult or even impossible to compute and solving the Newton system in every iteration. Also, the common setback with some quasi-Newton methods is that they need to compute and store an n × n matrix at each iteration, this is computationally costly for large scale problems. To overcome such drawbacks, an improved Method for solving systems of nonlinear equations via PSB (Powell-Symmetric-Broyden) update is proposed. In the proposed method, the approximate Jacobian inverse Hk of PSB is updated and its efficiency has improved thereby require low memory storage, hence the main aim of this paper. The preliminary numerical results show that the proposed method is practically efficient when applied on some benchmark problems.

Topology optimization of finite strain viscoplastic systems under transient loads

DOE PAGES

Ivarsson, Niklas; Wallin, Mathias; Tortorelli, Daniel

2018-02-08

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capabilitymore » of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.« less

Implicit methods for efficient musculoskeletal simulation and optimal control

PubMed Central

van den Bogert, Antonie J.; Blana, Dimitra; Heinrich, Dieter

2011-01-01

The ordinary differential equations for musculoskeletal dynamics are often numerically stiff and highly nonlinear. Consequently, simulations require small time steps, and optimal control problems are slow to solve and have poor convergence. In this paper, we present an implicit formulation of musculoskeletal dynamics, which leads to new numerical methods for simulation and optimal control, with the expectation that we can mitigate some of these problems. A first order Rosenbrock method was developed for solving forward dynamic problems using the implicit formulation. It was used to perform real-time dynamic simulation of a complex shoulder arm system with extreme dynamic stiffness. Simulations had an RMS error of only 0.11 degrees in joint angles when running at real-time speed. For optimal control of musculoskeletal systems, a direct collocation method was developed for implicitly formulated models. The method was applied to predict gait with a prosthetic foot and ankle. Solutions were obtained in well under one hour of computation time and demonstrated how patients may adapt their gait to compensate for limitations of a specific prosthetic limb design. The optimal control method was also applied to a state estimation problem in sports biomechanics, where forces during skiing were estimated from noisy and incomplete kinematic data. Using a full musculoskeletal dynamics model for state estimation had the additional advantage that forward dynamic simulations, could be done with the same implicitly formulated model to simulate injuries and perturbation responses. While these methods are powerful and allow solution of previously intractable problems, there are still considerable numerical challenges, especially related to the convergence of gradient-based solvers. PMID:22102983

Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barker, Andrew T.; Benson, Thomas R.; Lee, Chak Shing

ParELAG is a parallel C++ library for numerical upscaling of finite element discretizations and element-based algebraic multigrid solvers. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured meshes. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems.

PubMed

Wang, An; Cao, Yang; Shi, Quan

2018-01-01

In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl. 23:629-641, 2016). New convergence conditions are presented when the system matrix is a positive-definite matrix and an [Formula: see text]-matrix, respectively.

Local polynomial chaos expansion for linear differential equations with high dimensional random inputs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Yi; Jakeman, John; Gittelson, Claude

2015-01-08

In this paper we present a localized polynomial chaos expansion for partial differential equations (PDE) with random inputs. In particular, we focus on time independent linear stochastic problems with high dimensional random inputs, where the traditional polynomial chaos methods, and most of the existing methods, incur prohibitively high simulation cost. Furthermore, the local polynomial chaos method employs a domain decomposition technique to approximate the stochastic solution locally. In each subdomain, a subdomain problem is solved independently and, more importantly, in a much lower dimensional random space. In a postprocesing stage, accurate samples of the original stochastic problems are obtained frommore » the samples of the local solutions by enforcing the correct stochastic structure of the random inputs and the coupling conditions at the interfaces of the subdomains. Overall, the method is able to solve stochastic PDEs in very large dimensions by solving a collection of low dimensional local problems and can be highly efficient. In our paper we present the general mathematical framework of the methodology and use numerical examples to demonstrate the properties of the method.« less

A novel neural network for variational inequalities with linear and nonlinear constraints.

PubMed

Gao, Xing-Bao; Liao, Li-Zhi; Qi, Liqun

2005-11-01

Variational inequality is a uniform approach for many important optimization and equilibrium problems. Based on the sufficient and necessary conditions of the solution, this paper presents a novel neural network model for solving variational inequalities with linear and nonlinear constraints. Three sufficient conditions are provided to ensure that the proposed network with an asymmetric mapping is stable in the sense of Lyapunov and converges to an exact solution of the original problem. Meanwhile, the proposed network with a gradient mapping is also proved to be stable in the sense of Lyapunov and to have a finite-time convergence under some mild condition by using a new energy function. Compared with the existing neural networks, the new model can be applied to solve some nonmonotone problems, has no adjustable parameter, and has lower complexity. Thus, the structure of the proposed network is very simple. Since the proposed network can be used to solve a broad class of optimization problems, it has great application potential. The validity and transient behavior of the proposed neural network are demonstrated by several numerical examples.

Domain decomposition method for the Baltic Sea based on theory of adjoint equation and inverse problem.

NASA Astrophysics Data System (ADS)

Lezina, Natalya; Agoshkov, Valery

2017-04-01

Domain decomposition method (DDM) allows one to present a domain with complex geometry as a set of essentially simpler subdomains. This method is particularly applied for the hydrodynamics of oceans and seas. In each subdomain the system of thermo-hydrodynamic equations in the Boussinesq and hydrostatic approximations is solved. The problem of obtaining solution in the whole domain is that it is necessary to combine solutions in subdomains. For this purposes iterative algorithm is created and numerical experiments are conducted to investigate an effectiveness of developed algorithm using DDM. For symmetric operators in DDM, Poincare-Steklov's operators [1] are used, but for the problems of the hydrodynamics, it is not suitable. In this case for the problem, adjoint equation method [2] and inverse problem theory are used. In addition, it is possible to create algorithms for the parallel calculations using DDM on multiprocessor computer system. DDM for the model of the Baltic Sea dynamics is numerically studied. The results of numerical experiments using DDM are compared with the solution of the system of hydrodynamic equations in the whole domain. The work was supported by the Russian Science Foundation (project 14-11-00609, the formulation of the iterative process and numerical experiments). [1] V.I. Agoshkov, Domain Decompositions Methods in the Mathematical Physics Problem // Numerical processes and systems, No 8, Moscow, 1991 (in Russian). [2] V.I. Agoshkov, Optimal Control Approaches and Adjoint Equations in the Mathematical Physics Problem, Institute of Numerical Mathematics, RAS, Moscow, 2003 (in Russian).

New modified multi-level residue harmonic balance method for solving nonlinearly vibrating double-beam problem

NASA Astrophysics Data System (ADS)

Rahman, Md. Saifur; Lee, Yiu-Yin

2017-10-01

In this study, a new modified multi-level residue harmonic balance method is presented and adopted to investigate the forced nonlinear vibrations of axially loaded double beams. Although numerous nonlinear beam or linear double-beam problems have been tackled and solved, there have been few studies of this nonlinear double-beam problem. The geometric nonlinear formulations for a double-beam model are developed. The main advantage of the proposed method is that a set of decoupled nonlinear algebraic equations is generated at each solution level. This heavily reduces the computational effort compared with solving the coupled nonlinear algebraic equations generated in the classical harmonic balance method. The proposed method can generate the higher-level nonlinear solutions that are neglected by the previous modified harmonic balance method. The results from the proposed method agree reasonably well with those from the classical harmonic balance method. The effects of damping, axial force, and excitation magnitude on the nonlinear vibrational behaviour are examined.

High Performance Parallel Analysis of Coupled Problems for Aircraft Propulsion

NASA Technical Reports Server (NTRS)

Felippa, C. A.; Farhat, C.; Lanteri, S.; Maman, N.; Piperno, S.; Gumaste, U.

1994-01-01

In order to predict the dynamic response of a flexible structure in a fluid flow, the equations of motion of the structure and the fluid must be solved simultaneously. In this paper, we present several partitioned procedures for time-integrating this focus coupled problem and discuss their merits in terms of accuracy, stability, heterogeneous computing, I/O transfers, subcycling, and parallel processing. All theoretical results are derived for a one-dimensional piston model problem with a compressible flow, because the complete three-dimensional aeroelastic problem is difficult to analyze mathematically. However, the insight gained from the analysis of the coupled piston problem and the conclusions drawn from its numerical investigation are confirmed with the numerical simulation of the two-dimensional transient aeroelastic response of a flexible panel in a transonic nonlinear Euler flow regime.

Numerical simulation of electrophoresis separation processes

NASA Technical Reports Server (NTRS)

Ganjoo, D. K.; Tezduyar, T. E.

1986-01-01

A new Petrov-Galerkin finite element formulation has been proposed for transient convection-diffusion problems. Most Petrov-Galerkin formulations take into account the spatial discretization, and the weighting functions so developed give satisfactory solutions for steady state problems. Though these schemes can be used for transient problems, there is scope for improvement. The schemes proposed here, which consider temporal as well as spatial discretization, provide improved solutions. Electrophoresis, which involves the motion of charged entities under the influence of an applied electric field, is governed by equations similiar to those encountered in fluid flow problems, i.e., transient convection-diffusion equations. Test problems are solved in electrophoresis and fluid flow. The results obtained are satisfactory. It is also expected that these schemes, suitably adapted, will improve the numerical solutions of the compressible Euler and the Navier-Stokes equations.

On the analytic and numeric optimisation of airplane trajectories under real atmospheric conditions

NASA Astrophysics Data System (ADS)

Gonzalo, J.; Domínguez, D.; López, D.

2014-12-01

From the beginning of aviation era, economic constraints have forced operators to continuously improve the planning of the flights. The revenue is proportional to the cost per flight and the airspace occupancy. Many methods, the first started in the middle of last century, have explore analytical, numerical and artificial intelligence resources to reach the optimal flight planning. In parallel, advances in meteorology and communications allow an almost real-time knowledge of the atmospheric conditions and a reliable, error-bounded forecast for the near future. Thus, apart from weather risks to be avoided, airplanes can dynamically adapt their trajectories to minimise their costs. International regulators are aware about these capabilities, so it is reasonable to envisage some changes to allow this dynamic planning negotiation to soon become operational. Moreover, current unmanned airplanes, very popular and often small, suffer the impact of winds and other weather conditions in form of dramatic changes in their performance. The present paper reviews analytic and numeric solutions for typical trajectory planning problems. Analytic methods are those trying to solve the problem using the Pontryagin principle, where influence parameters are added to state variables to form a split condition differential equation problem. The system can be solved numerically -indirect optimisation- or using parameterised functions -direct optimisation-. On the other hand, numerical methods are based on Bellman's dynamic programming (or Dijkstra algorithms), where the fact that two optimal trajectories can be concatenated to form a new optimal one if the joint point is demonstrated to belong to the final optimal solution. There is no a-priori conditions for the best method. Traditionally, analytic has been more employed for continuous problems whereas numeric for discrete ones. In the current problem, airplane behaviour is defined by continuous equations, while wind fields are given in a discrete grid at certain time intervals. The research demonstrates advantages and disadvantages of each method as well as performance figures of the solutions found for typical flight conditions under static and dynamic atmospheres. This provides significant parameters to be used in the selection of solvers for optimal trajectories.

An interative solution of an integral equation for radiative transfer by using variational technique

NASA Technical Reports Server (NTRS)

Yoshikawa, K. K.

1973-01-01

An effective iterative technique is introduced to solve a nonlinear integral equation frequently associated with radiative transfer problems. The problem is formulated in such a way that each step of an iterative sequence requires the solution of a linear integral equation. The advantage of a previously introduced variational technique which utilizes a stepwise constant trial function is exploited to cope with the nonlinear problem. The method is simple and straightforward. Rapid convergence is obtained by employing a linear interpolation of the iterative solutions. Using absorption coefficients of the Milne-Eddington type, which are applicable to some planetary atmospheric radiation problems. Solutions are found in terms of temperature and radiative flux. These solutions are presented numerically and show excellent agreement with other numerical solutions.

The uniform asymptotic swallowtail approximation - Practical methods for oscillating integrals with four coalescing saddle points

NASA Technical Reports Server (NTRS)

Connor, J. N. L.; Curtis, P. R.; Farrelly, D.

1984-01-01

Methods that can be used in the numerical implementation of the uniform swallowtail approximation are described. An explicit expression for that approximation is presented to the lowest order, showing that there are three problems which must be overcome in practice before the approximation can be applied to any given problem. It is shown that a recently developed quadrature method can be used for the accurate numerical evaluation of the swallowtail canonical integral and its partial derivatives. Isometric plots of these are presented to illustrate some of their properties. The problem of obtaining the arguments of the swallowtail integral from an analytical function of its argument is considered, describing two methods of solving this problem. The asymptotic evaluation of the butterfly canonical integral is addressed.

Weak Galerkin finite element methods for Darcy flow: Anisotropy and heterogeneity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lin, Guang; Liu, Jiangguo; Mu, Lin

2014-11-01

This paper presents a family of weak Galerkin finite element methods (WGFEMs) for Darcy flow computation. The WGFEMs are new numerical methods that rely on the novel concept of discrete weak gradients. The WGFEMs solve for pressure unknowns both in element interiors and on the mesh skeleton. The numerical velocity is then obtained from the discrete weak gradient of the numerical pressure. The new methods are quite different than many existing numerical methods in that they are locally conservative by design, the resulting discrete linear systems are symmetric and positive-definite, and there is no need for tuning problem-dependent penalty factors.more » We test the WGFEMs on benchmark problems to demonstrate the strong potential of these new methods in handling strong anisotropy and heterogeneity in Darcy flow.« less

Optimal determination of the elastic constants of composite materials from ultrasonic wave-speed measurements

NASA Astrophysics Data System (ADS)

Castagnède, Bernard; Jenkins, James T.; Sachse, Wolfgang; Baste, Stéphane

1990-03-01

A method is described to optimally determine the elastic constants of anisotropic solids from wave-speeds measurements in arbitrary nonprincipal planes. For such a problem, the characteristic equation is a degree-three polynomial which generally does not factorize. By developing and rearranging this polynomial, a nonlinear system of equations is obtained. The elastic constants are then recovered by minimizing a functional derived from this overdetermined system of equations. Calculations of the functional are given for two specific cases, i.e., the orthorhombic and the hexagonal symmetries. Some numerical results showing the efficiency of the algorithm are presented. A numerical method is also described for the recovery of the orientation of the principal acoustical axes. This problem is solved through a double-iterative numerical scheme. Numerical as well as experimental results are presented for a unidirectional composite material.

Forward Field Computation with OpenMEEG

PubMed Central

Gramfort, Alexandre; Papadopoulo, Théodore; Olivi, Emmanuel; Clerc, Maureen

2011-01-01

To recover the sources giving rise to electro- and magnetoencephalography in individual measurements, realistic physiological modeling is required, and accurate numerical solutions must be computed. We present OpenMEEG, which solves the electromagnetic forward problem in the quasistatic regime, for head models with piecewise constant conductivity. The core of OpenMEEG consists of the symmetric Boundary Element Method, which is based on an extended Green Representation theorem. OpenMEEG is able to provide lead fields for four different electromagnetic forward problems: Electroencephalography (EEG), Magnetoencephalography (MEG), Electrical Impedance Tomography (EIT), and intracranial electric potentials (IPs). OpenMEEG is open source and multiplatform. It can be used from Python and Matlab in conjunction with toolboxes that solve the inverse problem; its integration within FieldTrip is operational since release 2.0. PMID:21437231

Harmony search optimization algorithm for a novel transportation problem in a consolidation network

NASA Astrophysics Data System (ADS)

Davod Hosseini, Seyed; Akbarpour Shirazi, Mohsen; Taghi Fatemi Ghomi, Seyed Mohammad

2014-11-01

This article presents a new harmony search optimization algorithm to solve a novel integer programming model developed for a consolidation network. In this network, a set of vehicles is used to transport goods from suppliers to their corresponding customers via two transportation systems: direct shipment and milk run logistics. The objective of this problem is to minimize the total shipping cost in the network, so it tries to reduce the number of required vehicles using an efficient vehicle routing strategy in the solution approach. Solving several numerical examples confirms that the proposed solution approach based on the harmony search algorithm performs much better than CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for realistic size problem instances.