WorldWideScience

Sample records for function approximation problems

  1. Monotone Approximations of Minimum and Maximum Functions and Multi-objective Problems

    Stipanović, Dušan M.; Tomlin, Claire J.; Leitmann, George

    2012-01-01

    In this paper the problem of accomplishing multiple objectives by a number of agents represented as dynamic systems is considered. Each agent is assumed to have a goal which is to accomplish one or more objectives where each objective is mathematically formulated using an appropriate objective function. Sufficient conditions for accomplishing objectives are derived using particular convergent approximations of minimum and maximum functions depending on the formulation of the goals and objectives. These approximations are differentiable functions and they monotonically converge to the corresponding minimum or maximum function. Finally, an illustrative pursuit-evasion game example with two evaders and two pursuers is provided.

  2. Monotone Approximations of Minimum and Maximum Functions and Multi-objective Problems

    Stipanovic, Dusan M., E-mail: dusan@illinois.edu [University of Illinois at Urbana-Champaign, Coordinated Science Laboratory, Department of Industrial and Enterprise Systems Engineering (United States); Tomlin, Claire J., E-mail: tomlin@eecs.berkeley.edu [University of California at Berkeley, Department of Electrical Engineering and Computer Science (United States); Leitmann, George, E-mail: gleit@berkeley.edu [University of California at Berkeley, College of Engineering (United States)

    2012-12-15

    In this paper the problem of accomplishing multiple objectives by a number of agents represented as dynamic systems is considered. Each agent is assumed to have a goal which is to accomplish one or more objectives where each objective is mathematically formulated using an appropriate objective function. Sufficient conditions for accomplishing objectives are derived using particular convergent approximations of minimum and maximum functions depending on the formulation of the goals and objectives. These approximations are differentiable functions and they monotonically converge to the corresponding minimum or maximum function. Finally, an illustrative pursuit-evasion game example with two evaders and two pursuers is provided.

  3. Rational function approximation method for discrete ordinates problems in slab geometry

    Leal, Andre Luiz do C.; Barros, Ricardo C.

    2009-01-01

    In this work we use rational function approaches to obtain the transfer functions that appear in the spectral Green's function (SGF) auxiliary equations for one-speed isotropic scattering SN equations in one-dimensional Cartesian geometry. For this task we use the computation of the Pade approximants to compare the results with the standard SGF method's applied to deep penetration problems in homogeneous domains. This work is a preliminary investigation of a new proposal for handling leakage terms that appear in the two transverse integrated one-dimensional SN equations in the exponential SGF method (SGF-ExpN). Numerical results are presented to illustrate the rational function approximation accuracy. (author)

  4. Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

    Ito, Kazufumi; Teglas, Russell

    1987-01-01

    The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

  5. Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

    Ito, K.; Teglas, R.

    1984-01-01

    The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

  6. Multiple kernel learning using single stage function approximation for binary classification problems

    Shiju, S.; Sumitra, S.

    2017-12-01

    In this paper, the multiple kernel learning (MKL) is formulated as a supervised classification problem. We dealt with binary classification data and hence the data modelling problem involves the computation of two decision boundaries of which one related with that of kernel learning and the other with that of input data. In our approach, they are found with the aid of a single cost function by constructing a global reproducing kernel Hilbert space (RKHS) as the direct sum of the RKHSs corresponding to the decision boundaries of kernel learning and input data and searching that function from the global RKHS, which can be represented as the direct sum of the decision boundaries under consideration. In our experimental analysis, the proposed model had shown superior performance in comparison with that of existing two stage function approximation formulation of MKL, where the decision functions of kernel learning and input data are found separately using two different cost functions. This is due to the fact that single stage representation helps the knowledge transfer between the computation procedures for finding the decision boundaries of kernel learning and input data, which inturn boosts the generalisation capacity of the model.

  7. Approximation algorithms for facility location problems with a special class of subadditive cost functions

    Gabor, A.F.; Ommeren, van J.C.W.

    2006-01-01

    In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a (1+e,1)-reduction of the facility

  8. Approximation algorithms for facility location problems with a special class of subadditive cost functions

    Gabor, Adriana F.; van Ommeren, Jan C.W.

    2006-01-01

    In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present three facility location problems with stochastic demand and exponential servers, respectively inventory. We present a $(1+\\varepsilon, 1)$-reduction of

  9. Approximation algorithms for facility location problems with discrete subadditive cost functions

    Gabor, A.F.; van Ommeren, Jan C.W.

    2005-01-01

    In this article we focus on approximation algorithms for facility location problems with subadditive costs. As examples of such problems, we present two facility location problems with stochastic demand and exponential servers, respectively inventory. We present a $(1+\\epsilon,1)$- reduction of the

  10. The use of Trefftz functions for approximation of measurement data in an inverse problem of flow boiling in a minichannel

    Hozejowski Leszek

    2012-04-01

    Full Text Available The paper is devoted to a computational problem of predicting a local heat transfer coefficient from experimental temperature data. The experimental part refers to boiling flow of a refrigerant in a minichannel. Heat is dissipated from heating alloy to the flowing liquid due to forced convection. The mathematical model of the problem consists of the governing Poisson equation and the proper boundary conditions. For accurate results it is required to smooth the measurements which was obtained by using Trefftz functions. The measurements were approximated with a linear combination of Trefftz functions. Due to the computational procedure in which the measurement errors are known, it was possible to smooth the data and also to reduce the residuals of approximation on the boundaries.

  11. Operator approximant problems arising from quantum theory

    Maher, Philip J

    2017-01-01

    This book offers an account of a number of aspects of operator theory, mainly developed since the 1980s, whose problems have their roots in quantum theory. The research presented is in non-commutative operator approximation theory or, to use Halmos' terminology, in operator approximants. Focusing on the concept of approximants, this self-contained book is suitable for graduate courses.

  12. Diagonal Pade approximations for initial value problems

    Reusch, M.F.; Ratzan, L.; Pomphrey, N.; Park, W.

    1987-06-01

    Diagonal Pade approximations to the time evolution operator for initial value problems are applied in a novel way to the numerical solution of these problems by explicitly factoring the polynomials of the approximation. A remarkable gain over conventional methods in efficiency and accuracy of solution is obtained. 20 refs., 3 figs., 1 tab

  13. Approximative solutions of stochastic optimization problem

    Lachout, Petr

    2010-01-01

    Roč. 46, č. 3 (2010), s. 513-523 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539 Institutional research plan: CEZ:AV0Z10750506 Keywords : Stochastic optimization problem * sensitivity * approximative solution Subject RIV: BA - General Mathematics Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/SI/lachout-approximative solutions of stochastic optimization problem.pdf

  14. Solving Math Problems Approximately: A Developmental Perspective.

    Dana Ganor-Stern

    Full Text Available Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults' ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger than the exact answer and when it was far (vs. close from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner.

  15. Function approximation of tasks by neural networks

    Gougam, L.A.; Chikhi, A.; Mekideche-Chafa, F.

    2008-01-01

    For several years now, neural network models have enjoyed wide popularity, being applied to problems of regression, classification and time series analysis. Neural networks have been recently seen as attractive tools for developing efficient solutions for many real world problems in function approximation. The latter is a very important task in environments where computation has to be based on extracting information from data samples in real world processes. In a previous contribution, we have used a well known simplified architecture to show that it provides a reasonably efficient, practical and robust, multi-frequency analysis. We have investigated the universal approximation theory of neural networks whose transfer functions are: sigmoid (because of biological relevance), Gaussian and two specified families of wavelets. The latter have been found to be more appropriate to use. The aim of the present contribution is therefore to use a m exican hat wavelet a s transfer function to approximate different tasks relevant and inherent to various applications in physics. The results complement and provide new insights into previously published results on this problem

  16. Approximation Preserving Reductions among Item Pricing Problems

    Hamane, Ryoso; Itoh, Toshiya; Tomita, Kouhei

    When a store sells items to customers, the store wishes to determine the prices of the items to maximize its profit. Intuitively, if the store sells the items with low (resp. high) prices, the customers buy more (resp. less) items, which provides less profit to the store. So it would be hard for the store to decide the prices of items. Assume that the store has a set V of n items and there is a set E of m customers who wish to buy those items, and also assume that each item i ∈ V has the production cost di and each customer ej ∈ E has the valuation vj on the bundle ej ⊆ V of items. When the store sells an item i ∈ V at the price ri, the profit for the item i is pi = ri - di. The goal of the store is to decide the price of each item to maximize its total profit. We refer to this maximization problem as the item pricing problem. In most of the previous works, the item pricing problem was considered under the assumption that pi ≥ 0 for each i ∈ V, however, Balcan, et al. [In Proc. of WINE, LNCS 4858, 2007] introduced the notion of “loss-leader, ” and showed that the seller can get more total profit in the case that pi < 0 is allowed than in the case that pi < 0 is not allowed. In this paper, we derive approximation preserving reductions among several item pricing problems and show that all of them have algorithms with good approximation ratio.

  17. Approximation algorithms for a genetic diagnostics problem.

    Kosaraju, S R; Schäffer, A A; Biesecker, L G

    1998-01-01

    We define and study a combinatorial problem called WEIGHTED DIAGNOSTIC COVER (WDC) that models the use of a laboratory technique called genotyping in the diagnosis of an important class of chromosomal aberrations. An optimal solution to WDC would enable us to define a genetic assay that maximizes the diagnostic power for a specified cost of laboratory work. We develop approximation algorithms for WDC by making use of the well-known problem SET COVER for which the greedy heuristic has been extensively studied. We prove worst-case performance bounds on the greedy heuristic for WDC and for another heuristic we call directional greedy. We implemented both heuristics. We also implemented a local search heuristic that takes the solutions obtained by greedy and dir-greedy and applies swaps until they are locally optimal. We report their performance on a real data set that is representative of the options that a clinical geneticist faces for the real diagnostic problem. Many open problems related to WDC remain, both of theoretical interest and practical importance.

  18. Reliable Function Approximation and Estimation

    2016-08-16

    compressed sensing results to a wide class of infinite -dimensional problems. We discuss four key application domains for the methods developed in this... infinite -dimensional problems. We discuss four key findings arising from this project, as related to uncertainty quantification, image processing, matrix...compressed sensing results to a wide class of infinite -dimensional problems. We discuss four key application domains for the methods developed in this project

  19. On root mean square approximation by exponential functions

    Sharipov, Ruslan

    2014-01-01

    The problem of root mean square approximation of a square integrable function by finite linear combinations of exponential functions is considered. It is subdivided into linear and nonlinear parts. The linear approximation problem is solved. Then the nonlinear problem is studied in some particular example.

  20. Capped Lp approximations for the composite L0 regularization problem

    Li, Qia; Zhang, Na

    2017-01-01

    The composite L0 function serves as a sparse regularizer in many applications. The algorithmic difficulty caused by the composite L0 regularization (the L0 norm composed with a linear mapping) is usually bypassed through approximating the L0 norm. We consider in this paper capped Lp approximations with $p>0$ for the composite L0 regularization problem. For each $p>0$, the capped Lp function converges to the L0 norm pointwisely as the approximation parameter tends to infinity. We point out tha...

  1. Galerkin approximations of nonlinear optimal control problems in Hilbert spaces

    Mickael D. Chekroun

    2017-07-01

    Full Text Available Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on the identification of a set of natural assumptions that allows us to deal with a broad class of nonlinear evolution equations and cost functionals for which we derive convergence of the value functions associated with the optimal control problem of the Galerkin approximations. This convergence result holds for a broad class of nonlinear control strategies as well. In particular, we show that the framework applies to the optimal control of semilinear heat equations posed on a general compact manifold without boundary. The framework is then shown to apply to geoengineering and mitigation of greenhouse gas emissions formulated here in terms of optimal control of energy balance climate models posed on the sphere $\\mathbb{S}^2$.

  2. Measure Fields for Function Approximation

    1993-06-01

    intelligence research is provided by ONR contract N00014-91-J-4038 J.L. Marroquin was supported in part by a grant from the Consejo Nacional de Ciencia y ... Tecnologia , Mexico. _ 93-28011 9-3 -- -" nnuM IInu 4 0 0 0 1 Introduction imating functions are always discontinuous, and the dis- continuities are...capacity and generalization capabili- is present panel (a) of figure 1 shows a function z(z, y ) ties. that is equal to a tilted plane inside an L

  3. Approximation of Bayesian Inverse Problems for PDEs

    Cotter, S. L.; Dashti, M.; Stuart, A. M.

    2010-01-01

    Inverse problems are often ill posed, with solutions that depend sensitively on data.n any numerical approach to the solution of such problems, regularization of some form is needed to counteract the resulting instability. This paper is based on an approach to regularization, employing a Bayesian formulation of the problem, which leads to a notion of well posedness for inverse problems, at the level of probability measures. The stability which results from this well posedness may be used as t...

  4. Nonlinear Ritz approximation for Fredholm functionals

    Mudhir A. Abdul Hussain

    2015-11-01

    Full Text Available In this article we use the modify Lyapunov-Schmidt reduction to find nonlinear Ritz approximation for a Fredholm functional. This functional corresponds to a nonlinear Fredholm operator defined by a nonlinear fourth-order differential equation.

  5. Boundary Value Problems and Approximate Solutions

    Tadesse

    Department of Mathematics, College of Natural and Computational Scineces, Mekelle ..... In this section, the Variational Iteration Method is applied to different forms of .... Some problems in non-Newtonian fluid mechanics, Ph.D. thesis, Wales.

  6. A partition function approximation using elementary symmetric functions.

    Ramu Anandakrishnan

    Full Text Available In statistical mechanics, the canonical partition function [Formula: see text] can be used to compute equilibrium properties of a physical system. Calculating [Formula: see text] however, is in general computationally intractable, since the computation scales exponentially with the number of particles [Formula: see text] in the system. A commonly used method for approximating equilibrium properties, is the Monte Carlo (MC method. For some problems the MC method converges slowly, requiring a very large number of MC steps. For such problems the computational cost of the Monte Carlo method can be prohibitive. Presented here is a deterministic algorithm - the direct interaction algorithm (DIA - for approximating the canonical partition function [Formula: see text] in [Formula: see text] operations. The DIA approximates the partition function as a combinatorial sum of products known as elementary symmetric functions (ESFs, which can be computed in [Formula: see text] operations. The DIA was used to compute equilibrium properties for the isotropic 2D Ising model, and the accuracy of the DIA was compared to that of the basic Metropolis Monte Carlo method. Our results show that the DIA may be a practical alternative for some problems where the Monte Carlo method converge slowly, and computational speed is a critical constraint, such as for very large systems or web-based applications.

  7. Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

    Gordon, Sheldon P.; Yang, Yajun

    2017-01-01

    This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…

  8. Approximating multi-objective scheduling problems

    Dabia, S.; Talbi, El-Ghazali; Woensel, van T.; Kok, de A.G.

    2013-01-01

    In many practical situations, decisions are multi-objective by nature. In this paper, we propose a generic approach to deal with multi-objective scheduling problems (MOSPs). The aim is to determine the set of Pareto solutions that represent the interactions between the different objectives. Due to

  9. Polynomial approximation of functions in Sobolev spaces

    Dupont, T.; Scott, R.

    1980-01-01

    Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomical plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces

  10. On a novel iterative method to compute polynomial approximations to Bessel functions of the first kind and its connection to the solution of fractional diffusion/diffusion-wave problems

    Yuste, Santos Bravo; Abad, Enrique

    2011-01-01

    We present an iterative method to obtain approximations to Bessel functions of the first kind J p (x) (p > -1) via the repeated application of an integral operator to an initial seed function f 0 (x). The class of seed functions f 0 (x) leading to sets of increasingly accurate approximations f n (x) is considerably large and includes any polynomial. When the operator is applied once to a polynomial of degree s, it yields a polynomial of degree s + 2, and so the iteration of this operator generates sets of increasingly better polynomial approximations of increasing degree. We focus on the set of polynomial approximations generated from the seed function f 0 (x) = 1. This set of polynomials is useful not only for the computation of J p (x) but also from a physical point of view, as it describes the long-time decay modes of certain fractional diffusion and diffusion-wave problems.

  11. Explicitly solvable complex Chebyshev approximation problems related to sine polynomials

    Freund, Roland

    1989-01-01

    Explicitly solvable real Chebyshev approximation problems on the unit interval are typically characterized by simple error curves. A similar principle is presented for complex approximation problems with error curves induced by sine polynomials. As an application, some new explicit formulae for complex best approximations are derived.

  12. Semiclassical initial value approximation for Green's function.

    Kay, Kenneth G

    2010-06-28

    A semiclassical initial value approximation is obtained for the energy-dependent Green's function. For a system with f degrees of freedom the Green's function expression has the form of a (2f-1)-dimensional integral over points on the energy surface and an integral over time along classical trajectories initiated from these points. This approximation is derived by requiring an integral ansatz for Green's function to reduce to Gutzwiller's semiclassical formula when the integrations are performed by the stationary phase method. A simpler approximation is also derived involving only an (f-1)-dimensional integral over momentum variables on a Poincare surface and an integral over time. The relationship between the present expressions and an earlier initial value approximation for energy eigenfunctions is explored. Numerical tests for two-dimensional systems indicate that good accuracy can be obtained from the initial value Green's function for calculations of autocorrelation spectra and time-independent wave functions. The relative advantages of initial value approximations for the energy-dependent Green's function and the time-dependent propagator are discussed.

  13. RATIONAL APPROXIMATIONS TO GENERALIZED HYPERGEOMETRIC FUNCTIONS.

    Under weak restrictions on the various free parameters, general theorems for rational representations of the generalized hypergeometric functions...and certain Meijer G-functions are developed. Upon specialization, these theorems yield a sequency of rational approximations which converge to the

  14. Efficient approximation of black-box functions and Pareto sets

    Rennen, G.

    2009-01-01

    In the case of time-consuming simulation models or other so-called black-box functions, we determine a metamodel which approximates the relation between the input- and output-variables of the simulation model. To solve multi-objective optimization problems, we approximate the Pareto set, i.e. the

  15. Smooth function approximation using neural networks.

    Ferrari, Silvia; Stengel, Robert F

    2005-01-01

    An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.

  16. Multidimensional stochastic approximation using locally contractive functions

    Lawton, W. M.

    1975-01-01

    A Robbins-Monro type multidimensional stochastic approximation algorithm which converges in mean square and with probability one to the fixed point of a locally contractive regression function is developed. The algorithm is applied to obtain maximum likelihood estimates of the parameters for a mixture of multivariate normal distributions.

  17. Function approximation using combined unsupervised and supervised learning.

    Andras, Peter

    2014-03-01

    Function approximation is one of the core tasks that are solved using neural networks in the context of many engineering problems. However, good approximation results need good sampling of the data space, which usually requires exponentially increasing volume of data as the dimensionality of the data increases. At the same time, often the high-dimensional data is arranged around a much lower dimensional manifold. Here we propose the breaking of the function approximation task for high-dimensional data into two steps: (1) the mapping of the high-dimensional data onto a lower dimensional space corresponding to the manifold on which the data resides and (2) the approximation of the function using the mapped lower dimensional data. We use over-complete self-organizing maps (SOMs) for the mapping through unsupervised learning, and single hidden layer neural networks for the function approximation through supervised learning. We also extend the two-step procedure by considering support vector machines and Bayesian SOMs for the determination of the best parameters for the nonlinear neurons in the hidden layer of the neural networks used for the function approximation. We compare the approximation performance of the proposed neural networks using a set of functions and show that indeed the neural networks using combined unsupervised and supervised learning outperform in most cases the neural networks that learn the function approximation using the original high-dimensional data.

  18. Essays on variational approximation techniques for stochastic optimization problems

    Deride Silva, Julio A.

    This dissertation presents five essays on approximation and modeling techniques, based on variational analysis, applied to stochastic optimization problems. It is divided into two parts, where the first is devoted to equilibrium problems and maxinf optimization, and the second corresponds to two essays in statistics and uncertainty modeling. Stochastic optimization lies at the core of this research as we were interested in relevant equilibrium applications that contain an uncertain component, and the design of a solution strategy. In addition, every stochastic optimization problem relies heavily on the underlying probability distribution that models the uncertainty. We studied these distributions, in particular, their design process and theoretical properties such as their convergence. Finally, the last aspect of stochastic optimization that we covered is the scenario creation problem, in which we described a procedure based on a probabilistic model to create scenarios for the applied problem of power estimation of renewable energies. In the first part, Equilibrium problems and maxinf optimization, we considered three Walrasian equilibrium problems: from economics, we studied a stochastic general equilibrium problem in a pure exchange economy, described in Chapter 3, and a stochastic general equilibrium with financial contracts, in Chapter 4; finally from engineering, we studied an infrastructure planning problem in Chapter 5. We stated these problems as belonging to the maxinf optimization class and, in each instance, we provided an approximation scheme based on the notion of lopsided convergence and non-concave duality. This strategy is the foundation of the augmented Walrasian algorithm, whose convergence is guaranteed by lopsided convergence, that was implemented computationally, obtaining numerical results for relevant examples. The second part, Essays about statistics and uncertainty modeling, contains two essays covering a convergence problem for a sequence

  19. An outer approximation method for the road network design problem.

    Asadi Bagloee, Saeed; Sarvi, Majid

    2018-01-01

    Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybrid exact-heuristic methodology based on a two-stage relaxation as follows: (i) the bilevel feature is relaxed to a single-level problem by taking the network performance function of the upper level into the user equilibrium traffic assignment problem (UE-TAP) in the lower level as a constraint. It results in a mixed-integer nonlinear programming (MINLP) problem which is then solved using the Outer Approximation (OA) algorithm (ii) we further relax the multi-commodity UE-TAP to a single-commodity MILP problem, that is, the multiple OD pairs are aggregated to a single OD pair. This methodology has two main advantages: (i) the method is proven to be highly efficient to solve the DNDP for a large-sized network of Winnipeg, Canada. The results suggest that within a limited number of iterations (as termination criterion), global optimum solutions are quickly reached in most of the cases; otherwise, good solutions (close to global optimum solutions) are found in early iterations. Comparative analysis of the networks of Gao and Sioux-Falls shows that for such a non-exact method the global optimum solutions are found in fewer iterations than those found in some analytically exact algorithms in the literature. (ii) Integration of the objective function among the constraints provides a commensurate capability to tackle the multi-objective (or multi-criteria) DNDP as well.

  20. On approximation of functions by product operators

    Hare Krishna Nigam

    2013-12-01

    Full Text Available In the present paper, two quite new reults on the degree of approximation of a function f belonging to the class Lip(α,r, 1≤ r <∞ and the weighted class W(Lr,ξ(t, 1≤ r <∞ by (C,2(E,1 product operators have been obtained. The results obtained in the present paper generalize various known results on single operators.

  1. An overview on polynomial approximation of NP-hard problems

    Paschos Vangelis Th.

    2009-01-01

    Full Text Available The fact that polynomial time algorithm is very unlikely to be devised for an optimal solving of the NP-hard problems strongly motivates both the researchers and the practitioners to try to solve such problems heuristically, by making a trade-off between computational time and solution's quality. In other words, heuristic computation consists of trying to find not the best solution but one solution which is 'close to' the optimal one in reasonable time. Among the classes of heuristic methods for NP-hard problems, the polynomial approximation algorithms aim at solving a given NP-hard problem in poly-nomial time by computing feasible solutions that are, under some predefined criterion, as near to the optimal ones as possible. The polynomial approximation theory deals with the study of such algorithms. This survey first presents and analyzes time approximation algorithms for some classical examples of NP-hard problems. Secondly, it shows how classical notions and tools of complexity theory, such as polynomial reductions, can be matched with polynomial approximation in order to devise structural results for NP-hard optimization problems. Finally, it presents a quick description of what is commonly called inapproximability results. Such results provide limits on the approximability of the problems tackled.

  2. Approximated Function Based Spectral Gradient Algorithm for Sparse Signal Recovery

    Weifeng Wang

    2014-02-01

    Full Text Available Numerical algorithms for the l0-norm regularized non-smooth non-convex minimization problems have recently became a topic of great interest within signal processing, compressive sensing, statistics, and machine learning. Nevertheless, the l0-norm makes the problem combinatorial and generally computationally intractable. In this paper, we construct a new surrogate function to approximate l0-norm regularization, and subsequently make the discrete optimization problem continuous and smooth. Then we use the well-known spectral gradient algorithm to solve the resulting smooth optimization problem. Experiments are provided which illustrate this method is very promising.

  3. Approximate motion integrals and the quantum chaos problem

    Bunakov, V.E.; Ivanov, I.B.

    2001-01-01

    One discusses the problem of occurrence and seek for the motion integrals in the stationary quantum mechanics and its relation to the quantum chaos. One studies decomposition of quantum numbers and derives the criterion of chaos. To seek the motion integrals one applies the convergence method. One derived the approximate integrals in the Hennone-Hales problem. One discusses the problem of compatibility of chaos and integrability [ru

  4. Numerical approximations of difference functional equations and applications

    Zdzisław Kamont

    2005-01-01

    Full Text Available We give a theorem on the error estimate of approximate solutions for difference functional equations of the Volterra type. We apply this general result in the investigation of the stability of difference schemes generated by nonlinear first order partial differential functional equations and by parabolic problems. We show that all known results on difference methods for initial or initial boundary value problems can be obtained as particular cases of this general and simple result. We assume that the right hand sides of equations satisfy nonlinear estimates of the Perron type with respect to functional variables.

  5. Analytical approximations to seawater optical phase functions of scattering

    Haltrin, Vladimir I.

    2004-11-01

    This paper proposes a number of analytical approximations to the classic and recently measured seawater light scattering phase functions. The three types of analytical phase functions are derived: individual representations for 15 Petzold, 41 Mankovsky, and 91 Gulf of Mexico phase functions; collective fits to Petzold phase functions; and analytical representations that take into account dependencies between inherent optical properties of seawater. The proposed phase functions may be used for problems of radiative transfer, remote sensing, visibility and image propagation in natural waters of various turbidity.

  6. When Density Functional Approximations Meet Iron Oxides.

    Meng, Yu; Liu, Xing-Wu; Huo, Chun-Fang; Guo, Wen-Ping; Cao, Dong-Bo; Peng, Qing; Dearden, Albert; Gonze, Xavier; Yang, Yong; Wang, Jianguo; Jiao, Haijun; Li, Yongwang; Wen, Xiao-Dong

    2016-10-11

    Three density functional approximations (DFAs), PBE, PBE+U, and Heyd-Scuseria-Ernzerhof screened hybrid functional (HSE), were employed to investigate the geometric, electronic, magnetic, and thermodynamic properties of four iron oxides, namely, α-FeOOH, α-Fe 2 O 3 , Fe 3 O 4 , and FeO. Comparing our calculated results with available experimental data, we found that HSE (a = 0.15) (containing 15% "screened" Hartree-Fock exchange) can provide reliable values of lattice constants, Fe magnetic moments, band gaps, and formation energies of all four iron oxides, while standard HSE (a = 0.25) seriously overestimates the band gaps and formation energies. For PBE+U, a suitable U value can give quite good results for the electronic properties of each iron oxide, but it is challenging to accurately get other properties of the four iron oxides using the same U value. Subsequently, we calculated the Gibbs free energies of transformation reactions among iron oxides using the HSE (a = 0.15) functional and plotted the equilibrium phase diagrams of the iron oxide system under various conditions, which provide reliable theoretical insight into the phase transformations of iron oxides.

  7. Discovery of functional and approximate functional dependencies in relational databases

    Ronald S. King

    2003-01-01

    Full Text Available This study develops the foundation for a simple, yet efficient method for uncovering functional and approximate functional dependencies in relational databases. The technique is based upon the mathematical theory of partitions defined over a relation's row identifiers. Using a levelwise algorithm the minimal non-trivial functional dependencies can be found using computations conducted on integers. Therefore, the required operations on partitions are both simple and fast. Additionally, the row identifiers provide the added advantage of nominally identifying the exceptions to approximate functional dependencies, which can be used effectively in practical data mining applications.

  8. Perturbative stability of the approximate Killing field eigenvalue problem

    Beetle, Christopher; Wilder, Shawn

    2014-01-01

    An approximate Killing field may be defined on a compact, Riemannian geometry by solving an eigenvalue problem for a certain elliptic operator. This paper studies the effect of small perturbations in the Riemannian metric on the resulting vector field. It shows that small metric perturbations, as measured using a Sobolev-type supremum norm on the space of Riemannian geometries on a fixed manifold, yield small perturbations in the approximate Killing field, as measured using a Hilbert-type square integral norm. It also discusses applications to the problem of computing the spin of a generic black hole in general relativity. (paper)

  9. Discontinuous approximate molecular electronic wave-functions

    Stuebing, E.W.; Weare, J.H.; Parr, R.G.

    1977-01-01

    Following Kohn, Schlosser and Marcus and Weare and Parr an energy functional is defined for a molecular problem which is stationary in the neighborhood of the exact solution and permits the use of trial functions that are discontinuous. The functional differs from the functional of the standard Rayleigh--Ritz method in the replacement of the usual kinetic energy operators circumflex T(μ) with operators circumflex T'(μ) = circumflex T(μ) + circumflex I(μ) generates contributions from surfaces of nonsmooth behavior. If one uses the nabla PSI . nabla PSI way of writing the usual kinetic energy contributions, one must add surface integrals of the product of the average of nabla PSI and the change of PSI across surfaces of discontinuity. Various calculations are carried out for the hydrogen molecule-ion and the hydrogen molecule. It is shown that ab initio calculations on molecules can be carried out quite generally with a basis of atomic orbitals exactly obeying the zero-differential overlap (ZDO) condition, and a firm basis is thereby provided for theories of molecular electronic structure invoking the ZDO aoproximation. It is demonstrated that a valence bond theory employing orbitals exactly obeying ZDO can provide an adequate account of chemical bonding, and several suggestions are made regarding molecular orbital methods

  10. Stability Analysis of Discontinuous Galerkin Approximations to the Elastodynamics Problem

    Antonietti, Paola F.

    2015-11-21

    We consider semi-discrete discontinuous Galerkin approximations of both displacement and displacement-stress formulations of the elastodynamics problem. We prove the stability analysis in the natural energy norm and derive optimal a-priori error estimates. For the displacement-stress formulation, schemes preserving the total energy of the system are introduced and discussed. We verify our theoretical estimates on two and three dimensions test problems.

  11. Stability Analysis of Discontinuous Galerkin Approximations to the Elastodynamics Problem

    Antonietti, Paola F.; Ayuso de Dios, Blanca; Mazzieri, Ilario; Quarteroni, Alfio

    2015-01-01

    We consider semi-discrete discontinuous Galerkin approximations of both displacement and displacement-stress formulations of the elastodynamics problem. We prove the stability analysis in the natural energy norm and derive optimal a-priori error estimates. For the displacement-stress formulation, schemes preserving the total energy of the system are introduced and discussed. We verify our theoretical estimates on two and three dimensions test problems.

  12. Approximation of Analytic Functions by Bessel's Functions of Fractional Order

    Soon-Mo Jung

    2011-01-01

    Full Text Available We will solve the inhomogeneous Bessel's differential equation x2y″(x+xy′(x+(x2-ν2y(x=∑m=0∞amxm, where ν is a positive nonintegral number and apply this result for approximating analytic functions of a special type by the Bessel functions of fractional order.

  13. An Approximate Method for Solving Optimal Control Problems for Discrete Systems Based on Local Approximation of an Attainability Set

    V. A. Baturin

    2017-03-01

    Full Text Available An optimal control problem for discrete systems is considered. A method of successive improvements along with its modernization based on the expansion of the main structures of the core algorithm about the parameter is suggested. The idea of the method is based on local approximation of attainability set, which is described by the zeros of the Bellman function in the special problem of optimal control. The essence of the problem is as follows: from the end point of the phase is required to find a path that minimizes functional deviations of the norm from the initial state. If the initial point belongs to the attainability set of the original controlled system, the value of the Bellman function equal to zero, otherwise the value of the Bellman function is greater than zero. For this special task Bellman equation is considered. The support approximation and Bellman equation are selected. The Bellman function is approximated by quadratic terms. Along the allowable trajectory, this approximation gives nothing, because Bellman function and its expansion coefficients are zero. We used a special trick: an additional variable is introduced, which characterizes the degree of deviation of the system from the initial state, thus it is obtained expanded original chain. For the new variable initial nonzero conditions is selected, thus obtained trajectory is lying outside attainability set and relevant Bellman function is greater than zero, which allows it to hold a non-trivial approximation. As a result of these procedures algorithms of successive improvements is designed. Conditions for relaxation algorithms and conditions for the necessary conditions of optimality are also obtained.

  14. Approximate solutions of some problems of scattering of surface ...

    A Choudhary

    Abstract. A class of mixed boundary value problems (bvps), occurring in the study of scattering of surface water waves by thin vertical rigid barriers placed in water of finite depth, is examined for their approximate solutions. Two different placings of vertical barriers are analyzed, namely, (i) a partially immersed barrier and.

  15. Cheap contouring of costly functions: the Pilot Approximation Trajectory algorithm

    Huttunen, Janne M J; Stark, Philip B

    2012-01-01

    The Pilot Approximation Trajectory (PAT) contour algorithm can find the contour of a function accurately when it is not practical to evaluate the function on a grid dense enough to use a standard contour algorithm, for instance, when evaluating the function involves conducting a physical experiment or a computationally intensive simulation. PAT relies on an inexpensive pilot approximation to the function, such as interpolating from a sparse grid of inexact values, or solving a partial differential equation (PDE) numerically using a coarse discretization. For each level of interest, the location and ‘trajectory’ of an approximate contour of this pilot function are used to decide where to evaluate the original function to find points on its contour. Those points are joined by line segments to form the PAT approximation of the contour of the original function. Approximating a contour numerically amounts to estimating a lower level set of the function, the set of points on which the function does not exceed the contour level. The area of the symmetric difference between the true lower level set and the estimated lower level set measures the accuracy of the contour. PAT measures its own accuracy by finding an upper confidence bound for this area. In examples, PAT can estimate a contour more accurately than standard algorithms, using far fewer function evaluations than standard algorithms require. We illustrate PAT by constructing a confidence set for viscosity and thermal conductivity of a flowing gas from simulated noisy temperature measurements, a problem in which each evaluation of the function to be contoured requires solving a different set of coupled nonlinear PDEs. (paper)

  16. An A Posteriori Error Estimate for Symplectic Euler Approximation of Optimal Control Problems

    Karlsson, Peer Jesper; Larsson, Stig; Sandberg, Mattias; Szepessy, Anders; Tempone, Raul

    2015-01-01

    This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns Symplectic Euler solutions of the Hamiltonian system

  17. Solving network design problems via decomposition, aggregation and approximation

    Bärmann, Andreas

    2016-01-01

    Andreas Bärmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time. Contents Decomposition for Multi-Period Network Design Solving Network Design Problems via Ag...

  18. Complete hierarchies of efficient approximations to problems in entanglement theory

    Eisert, Jens; Hyllus, Philipp; Guehne, Otfried; Curty, Marcos

    2004-01-01

    We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multiparty entangled, (B) the minimization of expectation values of entanglement witnesses with respect to pure product states, (C) the closely related evaluation of the geometric measure of entanglement to quantify pure multiparty entanglement, (D) the test whether states are multiparty entangled on the basis of witnesses based on second moments and on the basis of linear entropic criteria, and (E) the evaluation of instances of maximal output purities of quantum channels. We show that these problems can be formulated as certain optimization problems: as polynomially constrained problems employing polynomials of degree 3 or less. We then apply very recently established known methods from the theory of semidefinite relaxations to the formulated optimization problems. By this construction we arrive at a hierarchy of efficiently solvable approximations to the solution, approximating the exact solution as closely as desired, in a way that is asymptotically complete. For example, this results in a hierarchy of efficiently decidable sufficient criteria for multiparticle entanglement, such that every entangled state will necessarily be detected in some step of the hierarchy. Finally, we present numerical examples to demonstrate the practical accessibility of this approach

  19. Approximate Coulomb effects in the three-body scattering problem

    Haftel, M.I.; Zankel, H.

    1981-01-01

    From the momentum space Faddeev equations we derive approximate expressions which describe the Coulomb-nuclear interference in the three-body elastic scattering, rearrangement, and breakup problems and apply the formalism to p-d elastic scattering. The approximations treat the Coulomb interference as mainly a two-body effect, but we allow for the charge distribution of the deuteron in the p-d calculations. Real and imaginary parts of the Coulomb correction to the elastic scattering phase shifts are described in terms of on-shell quantities only. In the case of pure Coulomb breakup we recover the distorted-wave Born approximation result. Comparing the derived approximation with the full Faddeev p-d elastic scattering calculation, which includes the Coulomb force, we obtain good qualitative agreement in S and P waves, but disagreement in repulsive higher partial waves. The on-shell approximation investigated is found to be superior to other current approximations. The calculated differential cross sections at 10 MeV raise the question of whether there is a significant Coulomb-nuclear interference at backward angles

  20. Analytical Evaluation of Beam Deformation Problem Using Approximate Methods

    Barari, Amin; Kimiaeifar, A.; Domairry, G.

    2010-01-01

    The beam deformation equation has very wide applications in structural engineering. As a differential equation, it has its own problem concerning existence, uniqueness and methods of solutions. Often, original forms of governing differential equations used in engineering problems are simplified......, and this process produces noise in the obtained answers. This paper deals with the solution of second order of differential equation governing beam deformation using four analytical approximate methods, namely the Perturbation, Homotopy Perturbation Method (HPM), Homotopy Analysis Method (HAM) and Variational...... Iteration Method (VIM). The comparisons of the results reveal that these methods are very effective, convenient and quite accurate for systems of non-linear differential equation....

  1. Approximation of sums of oscillating summands in certain physical problems

    Karatsuba, Ekatherina A.

    2004-01-01

    The motion of a one-dimensional harmonic oscillator caused by recurring pushes in the absence of friction is considered. In particular, two cases are studied: the case when the pushes become more frequent and the other one when the pushes become less frequent. By means of an application of the Hardy-Littlewood-Vinogradov-Van der Corput theorem on the approximation of exponential sums by shorter ones, new asymptotic formulas for the solution of the problem are obtained

  2. Finite element approximation to a model problem of transonic flow

    Tangmanee, S.

    1986-12-01

    A model problem of transonic flow ''the Tricomi equation'' in Ω is contained in IR 2 bounded by the rectangular-curve boundary is posed in the form of symmetric positive differential equations. The finite element method is then applied. When the triangulation of Ω-bar is made of quadrilaterals and the approximation space is the Lagrange polynomial, we get the error estimates. 14 refs, 1 fig

  3. Approximate solutions of common fixed-point problems

    Zaslavski, Alexander J

    2016-01-01

    This book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take place. We show that our algorithms generate a good approximate solution if computational errors are bounded from above by a small positive constant. Beginning with an introduction, this monograph moves on to study: · dynamic string-averaging methods for common fixed point problems in a Hilbert space · dynamic string methods for common fixed point problems in a metric space · dynamic string-averaging version of the proximal...

  4. Function approximation with polynomial regression slines

    Urbanski, P.

    1996-01-01

    Principles of the polynomial regression splines as well as algorithms and programs for their computation are presented. The programs prepared using software package MATLAB are generally intended for approximation of the X-ray spectra and can be applied in the multivariate calibration of radiometric gauges. (author)

  5. On rational approximation methods for inverse source problems

    Rundell, William

    2011-02-01

    The basis of most imaging methods is to detect hidden obstacles or inclusions within a body when one can only make measurements on an exterior surface. Such is the ubiquity of these problems, the underlying model can lead to a partial differential equation of any of the major types, but here we focus on the case of steady-state electrostatic or thermal imaging and consider boundary value problems for Laplace\\'s equation. Our inclusions are interior forces with compact support and our data consists of a single measurement of (say) voltage/current or temperature/heat flux on the external boundary. We propose an algorithm that under certain assumptions allows for the determination of the support set of these forces by solving a simpler "equivalent point source" problem, and which uses a Newton scheme to improve the corresponding initial approximation. © 2011 American Institute of Mathematical Sciences.

  6. On rational approximation methods for inverse source problems

    Rundell, William; Hanke, Martin

    2011-01-01

    The basis of most imaging methods is to detect hidden obstacles or inclusions within a body when one can only make measurements on an exterior surface. Such is the ubiquity of these problems, the underlying model can lead to a partial differential equation of any of the major types, but here we focus on the case of steady-state electrostatic or thermal imaging and consider boundary value problems for Laplace's equation. Our inclusions are interior forces with compact support and our data consists of a single measurement of (say) voltage/current or temperature/heat flux on the external boundary. We propose an algorithm that under certain assumptions allows for the determination of the support set of these forces by solving a simpler "equivalent point source" problem, and which uses a Newton scheme to improve the corresponding initial approximation. © 2011 American Institute of Mathematical Sciences.

  7. Approximability of optimization problems through adiabatic quantum computation

    Cruz-Santos, William

    2014-01-01

    The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrödinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This Hamiltonian is expressed as a linear interpolation of an initial Hamiltonian whose ground state is easy to compute, and a final Hamiltonian whose ground state corresponds to the solution of a given combinatorial optimization problem. The adiabatic theorem asserts that if the time evolution of a quantum system described by a Hamiltonian is l

  8. Approximation Algorithms for the Highway Problem under the Coupon Model

    Hamane, Ryoso; Itoh, Toshiya; Tomita, Kouhei

    When a store sells items to customers, the store wishes to decide the prices of items to maximize its profit. Intuitively, if the store sells the items with low (resp. high) prices, the customers buy more (resp. less) items, which provides less profit to the store. So it would be hard for the store to decide the prices of items. Assume that the store has a set V of n items and there is a set E of m customers who wish to buy the items, and also assume that each item i ∈ V has the production cost di and each customer ej ∈ E has the valuation vj on the bundle ej ⊆ V of items. When the store sells an item i ∈ V at the price ri, the profit for the item i is pi = ri - di. The goal of the store is to decide the price of each item to maximize its total profit. We refer to this maximization problem as the item pricing problem. In most of the previous works, the item pricing problem was considered under the assumption that pi ≥ 0 for each i ∈ V, however, Balcan, et al. [In Proc. of WINE, LNCS 4858, 2007] introduced the notion of “loss-leader, ” and showed that the seller can get more total profit in the case that pi < 0 is allowed than in the case that pi < 0 is not allowed. In this paper, we consider the line highway problem (in which each customer is interested in an interval on the line of the items) and the cycle highway problem (in which each customer is interested in an interval on the cycle of the items), and show approximation algorithms for the line highway problem and the cycle highway problem in which the smallest valuation is s and the largest valuation is l (this is called an [s, l]-valuation setting) or all valuations are identical (this is called a single valuation setting).

  9. Approximate Dual Averaging Method for Multiagent Saddle-Point Problems with Stochastic Subgradients

    Deming Yuan

    2014-01-01

    Full Text Available This paper considers the problem of solving the saddle-point problem over a network, which consists of multiple interacting agents. The global objective function of the problem is a combination of local convex-concave functions, each of which is only available to one agent. Our main focus is on the case where the projection steps are calculated approximately and the subgradients are corrupted by some stochastic noises. We propose an approximate version of the standard dual averaging method and show that the standard convergence rate is preserved, provided that the projection errors decrease at some appropriate rate and the noises are zero-mean and have bounded variance.

  10. Topological approximation methods for evolutionary problem of nonlinear hydrodynamics

    Zvyagin, Victor

    2008-01-01

    The authors present functional analytical methods for solving a class of partial differential equations. The results have important applications to the numerical treatment of rheology (specific examples are the behaviour of blood or print colours) and to other applications in fluid mechanics. A class of methods for solving problems in hydrodynamics is presented.

  11. Variational P1 approximations of general-geometry multigroup transport problems

    Rulko, R.P.; Tomasevic, D.; Larsen, E.W.

    1995-01-01

    A variational approximation is developed for general-geometry multigroup transport problems with arbitrary anisotropic scattering. The variational principle is based on a functional that approximates a reaction rate in a subdomain of the system. In principle, approximations that result from this functional ''optimally'' determine such reaction rates. The functional contains an arbitrary parameter α and requires the approximate solutions of a forward and an adjoint transport problem. If the basis functions for the forward and adjoint solutions are chosen to be linear functions of the angular variable Ω, the functional yields the familiar multigroup P 1 equations for all values of α. However, the boundary conditions that result from the functional depend on α. In particular, for problems with vacuum boundaries, one obtains the conventional mixed boundary condition, but with an extrapolation distance that depends continuously on α. The choice α = 0 yields a generalization of boundary conditions derived earlier by Federighi and Pomraning for a more limited class of problems. The choice α = 1 yields a generalization of boundary conditions derived previously by Davis for monoenergetic problems. Other boundary conditions are obtained by choosing different values of α. The authors discuss this indeterminancy of α in conjunction with numerical experiments

  12. Chance constrained problems: penalty reformulation and performance of sample approximation technique

    Branda, Martin

    2012-01-01

    Roč. 48, č. 1 (2012), s. 105-122 ISSN 0023-5954 R&D Projects: GA ČR(CZ) GBP402/12/G097 Institutional research plan: CEZ:AV0Z10750506 Keywords : chance constrained problems * penalty functions * asymptotic equivalence * sample approximation technique * investment problem Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.619, year: 2012 http://library.utia.cas.cz/separaty/2012/E/branda-chance constrained problems penalty reformulation and performance of sample approximation technique.pdf

  13. Approximate Analytic Solutions for the Two-Phase Stefan Problem Using the Adomian Decomposition Method

    Xiao-Ying Qin

    2014-01-01

    Full Text Available An Adomian decomposition method (ADM is applied to solve a two-phase Stefan problem that describes the pure metal solidification process. In contrast to traditional analytical methods, ADM avoids complex mathematical derivations and does not require coordinate transformation for elimination of the unknown moving boundary. Based on polynomial approximations for some known and unknown boundary functions, approximate analytic solutions for the model with undetermined coefficients are obtained using ADM. Substitution of these expressions into other equations and boundary conditions of the model generates some function identities with the undetermined coefficients. By determining these coefficients, approximate analytic solutions for the model are obtained. A concrete example of the solution shows that this method can easily be implemented in MATLAB and has a fast convergence rate. This is an efficient method for finding approximate analytic solutions for the Stefan and the inverse Stefan problems.

  14. An inductive algorithm for smooth approximation of functions

    Kupenova, T.N.

    2011-01-01

    An inductive algorithm is presented for smooth approximation of functions, based on the Tikhonov regularization method and applied to a specific kind of the Tikhonov parametric functional. The discrepancy principle is used for estimation of the regularization parameter. The principle of heuristic self-organization is applied for assessment of some parameters of the approximating function

  15. An Approximate Proximal Bundle Method to Minimize a Class of Maximum Eigenvalue Functions

    Wei Wang

    2014-01-01

    Full Text Available We present an approximate nonsmooth algorithm to solve a minimization problem, in which the objective function is the sum of a maximum eigenvalue function of matrices and a convex function. The essential idea to solve the optimization problem in this paper is similar to the thought of proximal bundle method, but the difference is that we choose approximate subgradient and function value to construct approximate cutting-plane model to solve the above mentioned problem. An important advantage of the approximate cutting-plane model for objective function is that it is more stable than cutting-plane model. In addition, the approximate proximal bundle method algorithm can be given. Furthermore, the sequences generated by the algorithm converge to the optimal solution of the original problem.

  16. Comparison of four support-vector based function approximators

    de Kruif, B.J.; de Vries, Theodorus J.A.

    2004-01-01

    One of the uses of the support vector machine (SVM), as introduced in V.N. Vapnik (2000), is as a function approximator. The SVM and approximators based on it, approximate a relation in data by applying interpolation between so-called support vectors, being a limited number of samples that have been

  17. Approximate stresses in 2-D flat elastic contact fretting problems

    Urban, Michael Rene

    Fatigue results from the cyclic loading of a solid body. If the body subject to fatigue is in contact with another body and relative sliding motion occurs between these two bodies, then rubbing surface damage can accelerate fatigue failure. The acceleration of fatigue failure is especially important if the relative motion between the two bodies results in surface damage without excessive surface removal via wear. The situation just described is referred to as fretting fatigue. Understanding of fretting fatigue is greatly enhanced if the stress state associated with fretting can be characterized. For Hertzian contact, this can readily be done. Unfortunately, simple stress formulae are not available for flat body contact. The primary result of the present research is the development of a new, reasonably accurate, approximate closed form expression for 2-dimensional contact stresses which has been verified using finite element modeling. This expression is also combined with fracture mechanics to provide a simple method of determining when a crack is long enough to no longer be affected by the contact stress field. Lower bounds on fatigue life can then easily be calculated using fracture mechanics. This closed form expression can also be used to calculate crack propagation within the contact stress field. The problem of determining the cycles required to generate an initial crack and what to choose as an initial crack size is unresolved as it is in non-fretting fatigue.

  18. On the Application of Iterative Methods of Nondifferentiable Optimization to Some Problems of Approximation Theory

    Stefan M. Stefanov

    2014-01-01

    Full Text Available We consider the data fitting problem, that is, the problem of approximating a function of several variables, given by tabulated data, and the corresponding problem for inconsistent (overdetermined systems of linear algebraic equations. Such problems, connected with measurement of physical quantities, arise, for example, in physics, engineering, and so forth. A traditional approach for solving these two problems is the discrete least squares data fitting method, which is based on discrete l2-norm. In this paper, an alternative approach is proposed: with each of these problems, we associate a nondifferentiable (nonsmooth unconstrained minimization problem with an objective function, based on discrete l1- and/or l∞-norm, respectively; that is, these two norms are used as proximity criteria. In other words, the problems under consideration are solved by minimizing the residual using these two norms. Respective subgradients are calculated, and a subgradient method is used for solving these two problems. The emphasis is on implementation of the proposed approach. Some computational results, obtained by an appropriate iterative method, are given at the end of the paper. These results are compared with the results, obtained by the iterative gradient method for the corresponding “differentiable” discrete least squares problems, that is, approximation problems based on discrete l2-norm.

  19. Numerical methods for hyperbolic differential functional problems

    Roman Ciarski

    2008-01-01

    Full Text Available The paper deals with the initial boundary value problem for quasilinear first order partial differential functional systems. A general class of difference methods for the problem is constructed. Theorems on the error estimate of approximate solutions for difference functional systems are presented. The convergence results are proved by means of consistency and stability arguments. A numerical example is given.

  20. Quasi-fractional approximation to the Bessel functions

    Guerrero, P.M.L.

    1989-01-01

    In this paper the authors presents a simple Quasi-Fractional Approximation for Bessel Functions J ν (x), (- 1 ≤ ν < 0.5). This has been obtained by extending a method published which uses simultaneously power series and asymptotic expansions. Both functions, exact and approximated, coincide in at least two digits for positive x, and ν between - 1 and 0,4

  1. Existence and discrete approximation for optimization problems governed by fractional differential equations

    Bai, Yunru; Baleanu, Dumitru; Wu, Guo-Cheng

    2018-06-01

    We investigate a class of generalized differential optimization problems driven by the Caputo derivative. Existence of weak Carathe ´odory solution is proved by using Weierstrass existence theorem, fixed point theorem and Filippov implicit function lemma etc. Then a numerical approximation algorithm is introduced, and a convergence theorem is established. Finally, a nonlinear programming problem constrained by the fractional differential equation is illustrated and the results verify the validity of the algorithm.

  2. Analytic Approximations to the Free Boundary and Multi-dimensional Problems in Financial Derivatives Pricing

    Lau, Chun Sing

    This thesis studies two types of problems in financial derivatives pricing. The first type is the free boundary problem, which can be formulated as a partial differential equation (PDE) subject to a set of free boundary condition. Although the functional form of the free boundary condition is given explicitly, the location of the free boundary is unknown and can only be determined implicitly by imposing continuity conditions on the solution. Two specific problems are studied in details, namely the valuation of fixed-rate mortgages and CEV American options. The second type is the multi-dimensional problem, which involves multiple correlated stochastic variables and their governing PDE. One typical problem we focus on is the valuation of basket-spread options, whose underlying asset prices are driven by correlated geometric Brownian motions (GBMs). Analytic approximate solutions are derived for each of these three problems. For each of the two free boundary problems, we propose a parametric moving boundary to approximate the unknown free boundary, so that the original problem transforms into a moving boundary problem which can be solved analytically. The governing parameter of the moving boundary is determined by imposing the first derivative continuity condition on the solution. The analytic form of the solution allows the price and the hedging parameters to be computed very efficiently. When compared against the benchmark finite-difference method, the computational time is significantly reduced without compromising the accuracy. The multi-stage scheme further allows the approximate results to systematically converge to the benchmark results as one recasts the moving boundary into a piecewise smooth continuous function. For the multi-dimensional problem, we generalize the Kirk (1995) approximate two-asset spread option formula to the case of multi-asset basket-spread option. Since the final formula is in closed form, all the hedging parameters can also be derived in

  3. Legendre-tau approximations for functional differential equations

    Ito, K.; Teglas, R.

    1986-01-01

    The numerical approximation of solutions to linear retarded functional differential equations are considered using the so-called Legendre-tau method. The functional differential equation is first reformulated as a partial differential equation with a nonlocal boundary condition involving time-differentiation. The approximate solution is then represented as a truncated Legendre series with time-varying coefficients which satisfy a certain system of ordinary differential equations. The method is very easy to code and yields very accurate approximations. Convergence is established, various numerical examples are presented, and comparison between the latter and cubic spline approximation is made.

  4. An Approximation Approach for Solving the Subpath Planning Problem

    Safilian, Masoud; Tashakkori, S. Mehdi; Eghbali, Sepehr; Safilian, Aliakbar

    2016-01-01

    The subpath planning problem is a branch of the path planning problem, which has widespread applications in automated manufacturing process as well as vehicle and robot navigation. This problem is to find the shortest path or tour subject for travelling a set of given subpaths. The current approaches for dealing with the subpath planning problem are all based on meta-heuristic approaches. It is well-known that meta-heuristic based approaches have several deficiencies. To address them, we prop...

  5. Precise analytic approximations for the Bessel function J1 (x)

    Maass, Fernando; Martin, Pablo

    2018-03-01

    Precise and straightforward analytic approximations for the Bessel function J1 (x) have been found. Power series and asymptotic expansions have been used to determine the parameters of the approximation, which is as a bridge between both expansions, and it is a combination of rational and trigonometric functions multiplied with fractional powers of x. Here, several improvements with respect to the so called Multipoint Quasirational Approximation technique have been performed. Two procedures have been used to determine the parameters of the approximations. The maximum absolute errors are in both cases smaller than 0.01. The zeros of the approximation are also very precise with less than 0.04 per cent for the first one. A second approximation has been also determined using two more parameters, and in this way the accuracy has been increased to less than 0.001.

  6. Longitudinal functional principal component modelling via Stochastic Approximation Monte Carlo

    Martinez, Josue G.

    2010-06-01

    The authors consider the analysis of hierarchical longitudinal functional data based upon a functional principal components approach. In contrast to standard frequentist approaches to selecting the number of principal components, the authors do model averaging using a Bayesian formulation. A relatively straightforward reversible jump Markov Chain Monte Carlo formulation has poor mixing properties and in simulated data often becomes trapped at the wrong number of principal components. In order to overcome this, the authors show how to apply Stochastic Approximation Monte Carlo (SAMC) to this problem, a method that has the potential to explore the entire space and does not become trapped in local extrema. The combination of reversible jump methods and SAMC in hierarchical longitudinal functional data is simplified by a polar coordinate representation of the principal components. The approach is easy to implement and does well in simulated data in determining the distribution of the number of principal components, and in terms of its frequentist estimation properties. Empirical applications are also presented.

  7. Adaptive Linear and Normalized Combination of Radial Basis Function Networks for Function Approximation and Regression

    Yunfeng Wu

    2014-01-01

    Full Text Available This paper presents a novel adaptive linear and normalized combination (ALNC method that can be used to combine the component radial basis function networks (RBFNs to implement better function approximation and regression tasks. The optimization of the fusion weights is obtained by solving a constrained quadratic programming problem. According to the instantaneous errors generated by the component RBFNs, the ALNC is able to perform the selective ensemble of multiple leaners by adaptively adjusting the fusion weights from one instance to another. The results of the experiments on eight synthetic function approximation and six benchmark regression data sets show that the ALNC method can effectively help the ensemble system achieve a higher accuracy (measured in terms of mean-squared error and the better fidelity (characterized by normalized correlation coefficient of approximation, in relation to the popular simple average, weighted average, and the Bagging methods.

  8. The Pade approximate method for solving problems in plasma kinetic theory

    Jasperse, J.R.; Basu, B.

    1992-01-01

    The method of Pade Approximates has been a powerful tool in solving for the time dependent propagator (Green function) in model quantum field theories. We have developed a modified Pade method which we feel has promise for solving linearized collisional and weakly nonlinear problems in plasma kinetic theory. In order to illustrate the general applicability of the method, in this paper we discuss Pade solutions for the linearized collisional propagator and the collisional dielectric function for a model collisional problem. (author) 3 refs., 2 tabs

  9. Approximation algorithms for the parallel flow shop problem

    X. Zhang (Xiandong); S.L. van de Velde (Steef)

    2012-01-01

    textabstractWe consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson's

  10. Approximation algorithms for replenishment problems with fixed turnover times

    T. Bosman (Thomas); M. van Ee (Martijn); Y. Jiao (Yang); A. Marchetti Spaccamela (Alberto); R. Ravi; L. Stougie (Leen)

    2018-01-01

    textabstractWe introduce and study a class of optimization problems we coin replenishment problems with fixed turnover times: a very natural model that has received little attention in the literature. Nodes with capacity for storing a certain commodity are located at various places; at each node the

  11. Reducing Approximation Error in the Fourier Flexible Functional Form

    Tristan D. Skolrud

    2017-12-01

    Full Text Available The Fourier Flexible form provides a global approximation to an unknown data generating process. In terms of limiting function specification error, this form is preferable to functional forms based on second-order Taylor series expansions. The Fourier Flexible form is a truncated Fourier series expansion appended to a second-order expansion in logarithms. By replacing the logarithmic expansion with a Box-Cox transformation, we show that the Fourier Flexible form can reduce approximation error by 25% on average in the tails of the data distribution. The new functional form allows for nested testing of a larger set of commonly implemented functional forms.

  12. Approximation Algorithm for a Heterogeneous Vehicle Routing Problem

    Jungyun Bae

    2015-08-01

    Full Text Available This article addresses a fundamental path planning problem which aims to route a collection of heterogeneous vehicles such that each target location is visited by some vehicle and the sum of the travel costs of the vehicles is minimal. Vehicles are heterogeneous as the cost of traveling between any two locations depends on the type of the vehicle. Algorithms are developed for this path planning problem with bounds on the quality of the solutions produced by the algorithms. Computational results show that high quality solutions can be obtained for the path planning problem involving four vehicles and 40 targets using the proposed approach.

  13. Approximation of scalar and vector transport problems on polyhedral meshes

    Cantin, Pierre

    2016-01-01

    This thesis analyzes, at the continuous and at the discrete level on polyhedral meshes, the scalar and the vector transport problems in three-dimensional domains. These problems are composed of a diffusive term, an advective term, and a reactive term. In the context of Friedrichs systems, the continuous problems are analyzed in Lebesgue graph spaces. The classical positivity assumption on the Friedrichs tensor is generalized so as to consider the case of practical interest where this tensor takes null or slightly negative values. A new scheme converging at the order 3/2 is devised for the scalar advection-reaction problem using scalar degrees of freedom attached to mesh vertices. Two new schemes considering as well scalar degrees of freedom attached to mesh vertices are devised for the scalar transport problem and are robust with respect to the dominant regime. The first scheme converges at the order 1/2 when advection effects are dominant and at the order 1 when diffusion effects are dominant. The second scheme improves the accuracy by converging at the order 3/2 when advection effects are dominant. Finally, a new scheme converging at the order 1/2 is devised for the vector advection-reaction problem considering only one scalar degree of freedom per mesh edge. The accuracy and the efficiency of all these schemes are assessed on various test cases using three-dimensional polyhedral meshes. (author)

  14. Problems with the quenched approximation in the chiral limit

    Sharpe, S.R.

    1992-01-01

    In the quenched approximation, loops of the light singlet meson (the η') give rise to a type of chiral logarithm absent in full QCD. These logarithms are singular in the chiral limit, throwing doubt upon the utility of the quenched approximation. In previous work, I summed a class of diagrams, leading to non-analytic power dependencies such as left-angle anti ψψ right-angle ∝ m q -δ /(1+δ) I suggested, however, that these peculiar results could be redefined away. Here I give an alternative derivation of the results, based on the renormalization group, and argue that they cannot be redefined away. I discuss the evidence (or lack thereof) for such effects in numerical data

  15. An A Posteriori Error Estimate for Symplectic Euler Approximation of Optimal Control Problems

    Karlsson, Peer Jesper

    2015-01-07

    This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns Symplectic Euler solutions of the Hamiltonian system connected with the optimal control problem. The error representation has a leading order term consisting of an error density that is computable from Symplectic Euler solutions. Under an assumption of the pathwise convergence of the approximate dual function as the maximum time step goes to zero, we prove that the remainder is of higher order than the leading error density part in the error representation. With the error representation, it is possible to perform adaptive time stepping. We apply an adaptive algorithm originally developed for ordinary differential equations.

  16. An Error Estimate for Symplectic Euler Approximation of Optimal Control Problems

    Karlsson, Jesper; Larsson, Stig; Sandberg, Mattias; Szepessy, Anders; Tempone, Raul

    2015-01-01

    This work focuses on numerical solutions of optimal control problems. A time discretization error representation is derived for the approximation of the associated value function. It concerns symplectic Euler solutions of the Hamiltonian system connected with the optimal control problem. The error representation has a leading-order term consisting of an error density that is computable from symplectic Euler solutions. Under an assumption of the pathwise convergence of the approximate dual function as the maximum time step goes to zero, we prove that the remainder is of higher order than the leading-error density part in the error representation. With the error representation, it is possible to perform adaptive time stepping. We apply an adaptive algorithm originally developed for ordinary differential equations. The performance is illustrated by numerical tests.

  17. Analysis of a Cartesian PML approximation to acoustic scattering problems in and

    Bramble, James H.

    2013-08-01

    We consider the application of a perfectly matched layer (PML) technique applied in Cartesian geometry to approximate solutions of the acoustic scattering problem in the frequency domain. The PML is viewed as a complex coordinate shift ("stretching") and leads to a variable complex coefficient equation for the acoustic wave posed on an infinite domain, the complement of the bounded scatterer. The use of Cartesian geometry leads to a PML operator with simple coefficients, although, still complex symmetric (non-Hermitian). The PML reformulation results in a problem whose solution coincides with the original solution inside the PML layer while decaying exponentially outside. The rapid decay of the PML solution suggests truncation to a bounded domain with a convenient outer boundary condition and subsequent finite element approximation (for the truncated problem). This paper provides new stability estimates for the Cartesian PML approximations both on the infinite and the truncated domain. We first investigate the stability of the infinite PML approximation as a function of the PML strength σ0. This is done for PML methods which involve continuous piecewise smooth stretching as well as piecewise constant stretching functions. We next introduce a truncation parameter M which determines the size of the PML layer. Our analysis shows that the truncated PML problem is stable provided that the product of Mσ0 is sufficiently large, in which case the solution of the problem on the truncated domain converges exponentially to that of the original problem in the domain of interest near the scatterer. This justifies the simple computational strategy of selecting a fixed PML layer and increasing σ0 to obtain the desired accuracy. The results of numerical experiments varying M and σ0 are given which illustrate the theoretically predicted behavior. © 2013 Elsevier B.V. All rights reserved.

  18. On approximation and energy estimates for delta 6-convex functions.

    Saleem, Muhammad Shoaib; Pečarić, Josip; Rehman, Nasir; Khan, Muhammad Wahab; Zahoor, Muhammad Sajid

    2018-01-01

    The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted [Formula: see text]-norm.

  19. On approximation and energy estimates for delta 6-convex functions

    Muhammad Shoaib Saleem

    2018-02-01

    Full Text Available Abstract The smooth approximation and weighted energy estimates for delta 6-convex functions are derived in this research. Moreover, we conclude that if 6-convex functions are closed in uniform norm, then their third derivatives are closed in weighted L2 $L^{2}$-norm.

  20. The Approximability of Learning and Constraint Satisfaction Problems

    2010-10-07

    further improved this result to NP ⊆ naPCP1,3/4+²(O(log(n)),3). Around the same time, Zwick [141] showed that naPCP1,5/8(O(log(n)),3)⊆ BPP by giving a...randomized polynomial-time 5/8-approximation algorithm for satisfiable 3CSP. Therefore unless NP⊆ BPP , the best s must be bigger than 5/8. Zwick... BPP [141]. We think that Question 5.1.2 addresses an important missing part in understanding the 3-query PCP systems. In addition, as is mentioned the

  1. Complexity of Gaussian-Radial-Basis Networks Approximating Smooth Functions

    Kainen, P.C.; Kůrková, Věra; Sanguineti, M.

    2009-01-01

    Roč. 25, č. 1 (2009), s. 63-74 ISSN 0885-064X R&D Projects: GA ČR GA201/08/1744 Institutional research plan: CEZ:AV0Z10300504 Keywords : Gaussian-radial-basis-function networks * rates of approximation * model complexity * variation norms * Bessel and Sobolev norms * tractability of approximation Subject RIV: IN - Informatics, Computer Science Impact factor: 1.227, year: 2009

  2. The Hartree-Fock approximation applied to nuclear structure problems

    Oliveira, D.R. de.

    1972-01-01

    The Hartree-Fock indepedent-particle state basis is firstly constructed, whose wave functions are expressed as linear combinations of states of a Known basis. The coefficients of these combinations are reals e from themselves the Hartree-Fock density matrix is defined. The symmetries which characterize the system in study are embedded in these coefficients and in the density matrix. The formalism is applied to the Ne 20 , Si 28 and Ar 36 nuclei whose lowest Hartree-Fock energies are obtained admitting that theirs wave functions having axial symmetry. Once known the Hartree-Fock wave function, states are projected from it with well-defined total angular momentum using the Peierls and Yoccoz method. From these wave functions energy levels of the ground band are calculated as well as the electric quadrupole transition probabilities among these levels. (L.C.) [pt

  3. Mathieu functions and its useful approximation for elliptical waveguides

    Pillay, Shamini; Kumar, Deepak

    2017-11-01

    The standard form of the Mathieu differential equation is where a and q are real parameters and q > 0. In this paper we obtain closed formula for the generic term of expansions of modified Mathieu functions in terms of Bessel and modified Bessel functions in the following cases: Let ξ0 = ξ0, where i can take the values 1 and 2 corresponding to the first and the second boundary. These approximations also provide alternative methods for numerical evaluation of Mathieu functions.

  4. Using function approximation to determine neural network accuracy

    Wichman, R.F.; Alexander, J.

    2013-01-01

    Many, if not most, control processes demonstrate nonlinear behavior in some portion of their operating range and the ability of neural networks to model non-linear dynamics makes them very appealing for control. Control of high reliability safety systems, and autonomous control in process or robotic applications, however, require accurate and consistent control and neural networks are only approximators of various functions so their degree of approximation becomes important. In this paper, the factors affecting the ability of a feed-forward back-propagation neural network to accurately approximate a non-linear function are explored. Compared to pattern recognition using a neural network for function approximation provides an easy and accurate method for determining the network's accuracy. In contrast to other techniques, we show that errors arising in function approximation or curve fitting are caused by the neural network itself rather than scatter in the data. A method is proposed that provides improvements in the accuracy achieved during training and resulting ability of the network to generalize after training. Binary input vectors provided a more accurate model than with scalar inputs and retraining using a small number of the outlier x,y pairs improved generalization. (author)

  5. Approximation in generalized Hardy classes and resolution of inverse problems for tokamaks

    Fisher, Y.

    2011-11-01

    This thesis concerns both the theoretical and constructive resolution of inverse problems for isotropic diffusion equation in planar domains, simply and doubly connected. From partial Cauchy boundary data (potential, flux), we look for those quantities on the remaining part of the boundary, where no information is available, as well as inside the domain. The proposed approach proceeds by considering solutions to the diffusion equation as real parts of complex valued solutions to some conjugated Beltrami equation. These particular generalized analytic functions allow to introduce Hardy classes, where the inverse problem is stated as a best constrained approximation issue (bounded extrema problem), and thereby is regularized. Hence, existence and smoothness properties, together with density results of traces on the boundary, ensure well-posedness. An application is studied, to a free boundary problem for a magnetically confined plasma in the tokamak Tore Supra (CEA Cadarache France). The resolution of the approximation problem on a suitable basis of functions (toroidal harmonics) leads to a qualification criterion for the estimated plasma boundary. A descent algorithm makes it decrease, and refines the estimations. The method does not require any integration of the solution in the overall domain. It furnishes very accurate numerical results, and could be extended to other devices, like JET or ITER. (author)

  6. On Approximate Solutions of Functional Equations in Vector Lattices

    Bogdan Batko

    2014-01-01

    Full Text Available We provide a method of approximation of approximate solutions of functional equations in the class of functions acting into a Riesz space (algebra. The main aim of the paper is to provide a general theorem that can act as a tool applicable to a possibly wide class of functional equations. The idea is based on the use of the Spectral Representation Theory for Riesz spaces. The main result will be applied to prove the stability of an alternative Cauchy functional equation F(x+y+F(x+F(y≠0⇒F(x+y=F(x+F(y in Riesz spaces, the Cauchy equation with squares F(x+y2=(F(x+F(y2 in f-algebras, and the quadratic functional equation F(x+y+F(x-y=2F(x+2F(y in Riesz spaces.

  7. Approximation of the Doppler broadening function by Frobenius method

    Palma, Daniel A.P.; Martinez, Aquilino S.; Silva, Fernando C.

    2005-01-01

    An analytical approximation of the Doppler broadening function ψ(x,ξ) is proposed. This approximation is based on the solution of the differential equation for ψ(x,ξ) using the methods of Frobenius and the parameters variation. The analytical form derived for ψ(x,ξ) in terms of elementary functions is very simple and precise. It can be useful for applications related to the treatment of nuclear resonances mainly for the calculations of multigroup parameters and self-protection factors of the resonances, being the last used to correct microscopic cross-sections measurements by the activation technique. (author)

  8. Muonic molecules as three-body Coulomb problem in adiabatic approximation

    Decker, M.

    1994-04-01

    The three-body Coulomb problem is treated within the framework of the hyperspherical adiabatic approach. The surface functions are expanded into Faddeev-type components in order to ensure the equivalent representation of all possible two-body contributions. It is shown that this decomposition reduces the numerical effort considerably. The remaining radial equations are solved both in the extreme and the uncoupled adiabatic approximation to determine the binding energies of the systems (dtμ) and (d 3 Heμ). Whereas the ground state is described very well in the uncoupled adiabatic approximation, the excited states should be treated within the coupled adiabatic approximation to obtain good agreement with variational calculations. (orig.)

  9. Approximate convex hull of affine iterated function system attractors

    Mishkinis, Anton; Gentil, Christian; Lanquetin, Sandrine; Sokolov, Dmitry

    2012-01-01

    Highlights: ► We present an iterative algorithm to approximate affine IFS attractor convex hull. ► Elimination of the interior points significantly reduces the complexity. ► To optimize calculations, we merge the convex hull images at each iteration. ► Approximation by ellipses increases speed of convergence to the exact convex hull. ► We present a method of the output convex hull simplification. - Abstract: In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output approximate convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximate convex hull without loss of accuracy.

  10. Lowest order Virtual Element approximation of magnetostatic problems

    Beirão da Veiga, L.; Brezzi, F.; Dassi, F.; Marini, L. D.; Russo, A.

    2018-04-01

    We give here a simplified presentation of the lowest order Serendipity Virtual Element method, and show its use for the numerical solution of linear magneto-static problems in three dimensions. The method can be applied to very general decompositions of the computational domain (as is natural for Virtual Element Methods) and uses as unknowns the (constant) tangential component of the magnetic field $\\mathbf{H}$ on each edge, and the vertex values of the Lagrange multiplier $p$ (used to enforce the solenoidality of the magnetic induction $\\mathbf{B}=\\mu\\mathbf{H}$). In this respect the method can be seen as the natural generalization of the lowest order Edge Finite Element Method (the so-called "first kind N\\'ed\\'elec" elements) to polyhedra of almost arbitrary shape, and as we show on some numerical examples it exhibits very good accuracy (for being a lowest order element) and excellent robustness with respect to distortions.

  11. Study of some approximation schemes in the spin-boson problem

    Kenkre, V.M.; Giuggioli, L.

    2004-01-01

    Some approximation schemes used in the description of the evolution of the spin-boson system are studied through numerical and analytic methods. Among the procedures investigated are semiclassical approximations and the memory function approach. An infinitely large number of semiclassical approximations are discussed. Their two extreme limits are shown to be characterized, respectively, by effective energy mismatch and effective intersite transfer. The validity of the two limits is explored by explicit numerical calculations for important regions in parameter space, and it is shown that they can provide good descriptions in the so-called adiabatic and anti-adiabatic regimes, respectively. The memory function approach, which provides an excellent approximation scheme for a certain range of parameters, is shown to be connected to other approaches such as the non-interacting blip approximation. New results are derived from the memory approach in semiclassical contexts. Comments are made on thermal effects in the spin-boson problem, the discrete non-linear Schroedinger equation, and connections to the areas of dynamic localization, and quantum control

  12. Integral approximants for functions of higher monodromic dimension

    Baker, G.A. Jr.

    1987-01-01

    In addition to the description of multiform, locally analytic functions as covering a many sheeted version of the complex plane, Riemann also introduced the notion of considering them as describing a space whose ''monodromic'' dimension is the number of linearly independent coverings by the monogenic analytic function at each point of the complex plane. I suggest that this latter concept is natural for integral approximants (sub-class of Hermite-Pade approximants) and discuss results for both ''horizontal'' and ''diagonal'' sequences of approximants. Some theorems are now available in both cases and make clear the natural domain of convergence of the horizontal sequences is a disk centered on the origin and that of the diagonal sequences is a suitably cut complex-plane together with its identically cut pendant Riemann sheets. Some numerical examples have also been computed.

  13. Sequential function approximation on arbitrarily distributed point sets

    Wu, Kailiang; Xiu, Dongbin

    2018-02-01

    We present a randomized iterative method for approximating unknown function sequentially on arbitrary point set. The method is based on a recently developed sequential approximation (SA) method, which approximates a target function using one data point at each step and avoids matrix operations. The focus of this paper is on data sets with highly irregular distribution of the points. We present a nearest neighbor replacement (NNR) algorithm, which allows one to sample the irregular data sets in a near optimal manner. We provide mathematical justification and error estimates for the NNR algorithm. Extensive numerical examples are also presented to demonstrate that the NNR algorithm can deliver satisfactory convergence for the SA method on data sets with high irregularity in their point distributions.

  14. Pade approximants for entire functions with regularly decreasing Taylor coefficients

    Rusak, V N; Starovoitov, A P

    2002-01-01

    For a class of entire functions the asymptotic behaviour of the Hadamard determinants D n,m as 0≤m≤m(n)→∞ and n→∞ is described. This enables one to study the behaviour of parabolic sequences from Pade and Chebyshev tables for many individual entire functions. The central result of the paper is as follows: for some sequences {(n,m(n))} in certain classes of entire functions (with regular Taylor coefficients) the Pade approximants {π n,m(n) }, which provide the locally best possible rational approximations, converge to the given function uniformly on the compact set D={z:|z|≤1} with asymptotically best rate

  15. A new class of ensemble conserving algorithms for approximate quantum dynamics: Theoretical formulation and model problems

    Smith, Kyle K. G.; Poulsen, Jens Aage; Nyman, Gunnar; Rossky, Peter J.

    2015-01-01

    We develop two classes of quasi-classical dynamics that are shown to conserve the initial quantum ensemble when used in combination with the Feynman-Kleinert approximation of the density operator. These dynamics are used to improve the Feynman-Kleinert implementation of the classical Wigner approximation for the evaluation of quantum time correlation functions known as Feynman-Kleinert linearized path-integral. As shown, both classes of dynamics are able to recover the exact classical and high temperature limits of the quantum time correlation function, while a subset is able to recover the exact harmonic limit. A comparison of the approximate quantum time correlation functions obtained from both classes of dynamics is made with the exact results for the challenging model problems of the quartic and double-well potentials. It is found that these dynamics provide a great improvement over the classical Wigner approximation, in which purely classical dynamics are used. In a special case, our first method becomes identical to centroid molecular dynamics

  16. Approximation solutions for indifference pricing under general utility functions

    Chen, An; Pelsser, Antoon; Vellekoop, M.H.

    2008-01-01

    With the aid of Taylor-based approximations, this paper presents results for pricing insurance contracts by using indifference pricing under general utility functions. We discuss the connection between the resulting "theoretical" indifference prices and the pricing rule-of-thumb that practitioners

  17. Animating Nested Taylor Polynomials to Approximate a Function

    Mazzone, Eric F.; Piper, Bruce R.

    2010-01-01

    The way that Taylor polynomials approximate functions can be demonstrated by moving the center point while keeping the degree fixed. These animations are particularly nice when the Taylor polynomials do not intersect and form a nested family. We prove a result that shows when this nesting occurs. The animations can be shown in class or…

  18. Approximate Solutions for Indifference Pricing under General Utility Functions

    Chen, A.; Pelsser, A.; Vellekoop, M.

    2007-01-01

    With the aid of Taylor-based approximations, this paper presents results for pricing insurance contracts by using indifference pricing under general utility functions. We discuss the connection between the resulting "theoretical" indifference prices and the pricing rule-of-thumb that practitioners

  19. Applications exponential approximation by integer shifts of Gaussian functions

    S. M. Sitnik

    2013-01-01

    Full Text Available In this paper we consider approximations of functions using integer shifts of Gaussians – quadratic exponentials. A method is proposed to find coefficients of node functions by solving linear systems of equations. The explicit formula for the determinant of the system is found, based on it solvability of linear system under consideration is proved and uniqueness of its solution. We compare results with known ones and briefly indicate applications to signal theory.

  20. Are there approximate relations among transverse momentum dependent distribution functions?

    Harutyun AVAKIAN; Anatoli Efremov; Klaus Goeke; Andreas Metz; Peter Schweitzer; Tobias Teckentrup

    2007-10-11

    Certain {\\sl exact} relations among transverse momentum dependent parton distribution functions due to QCD equations of motion turn into {\\sl approximate} ones upon the neglect of pure twist-3 terms. On the basis of available data from HERMES we test the practical usefulness of one such ``Wandzura-Wilczek-type approximation'', namely of that connecting $h_{1L}^{\\perp(1)a}(x)$ to $h_L^a(x)$, and discuss how it can be further tested by future CLAS and COMPASS data.

  1. Strong semiclassical approximation of Wigner functions for the Hartree dynamics

    Athanassoulis, Agissilaos; Paul, Thierry; Pezzotti, Federica; Pulvirenti, Mario

    2011-01-01

    We consider the Wigner equation corresponding to a nonlinear Schrödinger evolution of the Hartree type in the semiclassical limit h → 0. Under appropriate assumptions on the initial data and the interaction potential, we show that the Wigner function is close in L 2 to its weak limit, the solution of the corresponding Vlasov equation. The strong approximation allows the construction of semiclassical operator-valued observables, approximating their quantum counterparts in Hilbert-Schmidt topology. The proof makes use of a pointwise-positivity manipulation, which seems necessary in working with the L 2 norm and the precise form of the nonlinearity. We employ the Husimi function as a pivot between the classical probability density and the Wigner function, which - as it is well known - is not pointwise positive in general.

  2. Quantal density functional theory II. Approximation methods and applications

    Sahni, Viraht

    2010-01-01

    This book is on approximation methods and applications of Quantal Density Functional Theory (QDFT), a new local effective-potential-energy theory of electronic structure. What distinguishes the theory from traditional density functional theory is that the electron correlations due to the Pauli exclusion principle, Coulomb repulsion, and the correlation contribution to the kinetic energy -- the Correlation-Kinetic effects -- are separately and explicitly defined. As such it is possible to study each property of interest as a function of the different electron correlations. Approximations methods based on the incorporation of different electron correlations, as well as a many-body perturbation theory within the context of QDFT, are developed. The applications are to the few-electron inhomogeneous electron gas systems in atoms and molecules, as well as to the many-electron inhomogeneity at metallic surfaces. (orig.)

  3. Approximation methods for the partition functions of anharmonic systems

    Lew, P.; Ishida, T.

    1979-07-01

    The analytical approximations for the classical, quantum mechanical and reduced partition functions of the diatomic molecule oscillating internally under the influence of the Morse potential have been derived and their convergences have been tested numerically. This successful analytical method is used in the treatment of anharmonic systems. Using Schwinger perturbation method in the framework of second quantization formulism, the reduced partition function of polyatomic systems can be put into an expression which consists separately of contributions from the harmonic terms, Morse potential correction terms and interaction terms due to the off-diagonal potential coefficients. The calculated results of the reduced partition function from the approximation method on the 2-D and 3-D model systems agree well with the numerical exact calculations

  4. Reduced-Contrast Approximations for High-Contrast Multiscale Flow Problems

    Chung, Eric T.; Efendiev, Yalchin

    2010-01-01

    In this paper, we study multiscale methods for high-contrast elliptic problems where the media properties change dramatically. The disparity in the media properties (also referred to as high contrast in the paper) introduces an additional scale that needs to be resolved in multiscale simulations. First, we present a construction that uses an integral equation to represent the highcontrast component of the solution. This representation involves solving an integral equation along the interface where the coefficients are discontinuous. The integral representation suggests some multiscale approaches that are discussed in the paper. One of these approaches entails the use of interface functions in addition to multiscale basis functions representing the heterogeneities without high contrast. In this paper, we propose an approximation for the solution of the integral equation using the interface problems in reduced-contrast media. Reduced-contrast media are obtained by lowering the variance of the coefficients. We also propose a similar approach for the solution of the elliptic equation without using an integral representation. This approach is simpler to use in the computations because it does not involve setting up integral equations. The main idea of this approach is to approximate the solution of the high-contrast problem by the solutions of the problems formulated in reduced-contrast media. In this approach, a rapidly converging sequence is proposed where only problems with lower contrast are solved. It was shown that this sequence possesses the convergence rate that is inversely proportional to the reduced contrast. This approximation allows choosing the reduced-contrast problem based on the coarse-mesh size as discussed in this paper. We present a simple application of this approach to homogenization of elliptic equations with high-contrast coefficients. The presented approaches are limited to the cases where there are sharp changes in the contrast (i.e., the high

  5. Application of the N-quantum approximation method to bound state problems

    Raychaudhuri, A.

    1977-01-01

    The N-quantum approximation (NQA) method is examined in the light of its application to bound state problems. Bound state wave functions are obtained as expansion coefficients in a truncated Haag expansion. From the equations of motion for the Heisenberg field and the NQA expansion, an equation satisfied by the wave function is derived. Two different bound state systems are considered. In one case, the bound state problem of two identical scalars by scalar exchange is analyzed using the NQA. An integral equation satisfied by the wave function is derived. In the nonrelativistic limit, the equation is shown to reduce to the Schroedinger equation. The equation is solved numerically, and the results compared with those obtained for this system by other methods. The NQA method is also applied to the bound state of two spin 1/2 particles with electromagnetic interaction. The integral equation for the wave function is shown to agree with the corresponding Bethe Salpeter equation in the nonrelativistic limit. Using the Dirac (4 x 4) matrices the wave function is expanded in terms of structure functions and the equation for the wave function is reduced to two disjoint sets of coupled equation for the structure functions

  6. On the approximation of the limit cycles function

    L. Cherkas

    2007-11-01

    Full Text Available We consider planar vector fields depending on a real parameter. It is assumed that this vector field has a family of limit cycles which can be described by means of the limit cycles function $l$. We prove a relationship between the multiplicity of a limit cycle of this family and the order of a zero of the limit cycles function. Moreover, we present a procedure to approximate $l(x$, which is based on the Newton scheme applied to the Poincaré function and represents a continuation method. Finally, we demonstrate the effectiveness of the proposed procedure by means of a Liénard system.

  7. Approximate inference for spatial functional data on massively parallel processors

    Raket, Lars Lau; Markussen, Bo

    2014-01-01

    With continually increasing data sizes, the relevance of the big n problem of classical likelihood approaches is greater than ever. The functional mixed-effects model is a well established class of models for analyzing functional data. Spatial functional data in a mixed-effects setting...... in linear time. An extremely efficient GPU implementation is presented, and the proposed methods are illustrated by conducting a classical statistical analysis of 2D chromatography data consisting of more than 140 million spatially correlated observation points....

  8. Approximate models for the analysis of laser velocimetry correlation functions

    Robinson, D.P.

    1981-01-01

    Velocity distributions in the subchannels of an eleven pin test section representing a slice through a Fast Reactor sub-assembly were measured with a dual beam laser velocimeter system using a Malvern K 7023 digital photon correlator for signal processing. Two techniques were used for data reduction of the correlation function to obtain velocity and turbulence values. Whilst both techniques were in excellent agreement on the velocity, marked discrepancies were apparent in the turbulence levels. As a consequence of this the turbulence data were not reported. Subsequent investigation has shown that the approximate technique used as the basis of Malvern's Data Processor 7023V is restricted in its range of application. In this note alternative approximate models are described and evaluated. The objective of this investigation was to develop an approximate model which could be used for on-line determination of the turbulence level. (author)

  9. Approximation of the exponential integral (well function) using sampling methods

    Baalousha, Husam Musa

    2015-04-01

    Exponential integral (also known as well function) is often used in hydrogeology to solve Theis and Hantush equations. Many methods have been developed to approximate the exponential integral. Most of these methods are based on numerical approximations and are valid for a certain range of the argument value. This paper presents a new approach to approximate the exponential integral. The new approach is based on sampling methods. Three different sampling methods; Latin Hypercube Sampling (LHS), Orthogonal Array (OA), and Orthogonal Array-based Latin Hypercube (OA-LH) have been used to approximate the function. Different argument values, covering a wide range, have been used. The results of sampling methods were compared with results obtained by Mathematica software, which was used as a benchmark. All three sampling methods converge to the result obtained by Mathematica, at different rates. It was found that the orthogonal array (OA) method has the fastest convergence rate compared with LHS and OA-LH. The root mean square error RMSE of OA was in the order of 1E-08. This method can be used with any argument value, and can be used to solve other integrals in hydrogeology such as the leaky aquifer integral.

  10. Sparse approximation of multilinear problems with applications to kernel-based methods in UQ

    Nobile, Fabio; Tempone, Raul; Wolfers, Sö ren

    2017-01-01

    We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map. We propose and analyze a generalized version of Smolyak’s algorithm, which provides sparse approximation formulas with convergence rates that mitigate the curse of dimension that appears in multilinear approximation problems with a large number of arguments. We apply the general framework to response surface approximation and optimization under uncertainty for parametric partial differential equations using kernel-based approximation. The theoretical results are supplemented by numerical experiments.

  11. Sparse approximation of multilinear problems with applications to kernel-based methods in UQ

    Nobile, Fabio

    2017-11-16

    We provide a framework for the sparse approximation of multilinear problems and show that several problems in uncertainty quantification fit within this framework. In these problems, the value of a multilinear map has to be approximated using approximations of different accuracy and computational work of the arguments of this map. We propose and analyze a generalized version of Smolyak’s algorithm, which provides sparse approximation formulas with convergence rates that mitigate the curse of dimension that appears in multilinear approximation problems with a large number of arguments. We apply the general framework to response surface approximation and optimization under uncertainty for parametric partial differential equations using kernel-based approximation. The theoretical results are supplemented by numerical experiments.

  12. Inverse periodic problem for the discrete approximation of the Schroedinger nonlinear equation

    Bogolyubov, N.N.; Prikarpatskij, A.K.; AN Ukrainskoj SSR, Lvov. Inst. Prikladnykh Problem Mekhaniki i Matematiki)

    1982-01-01

    The problem of numerical solution of the Schroedinger nonlinear equation (1) iPSIsub(t) = PSIsub(xx)+-2(PSI)sup(2)PSI. The numerical solution of nonlinear differential equation supposes its discrete approximation is required for the realization of the computer calculation process. Tor the equation (1) there exists the following discrete approximation by variable x(2) iPSIsub(n, t) = (PSIsub(n+1)-2PSIsub(n)+PSIsub(n-1))/(Δx)sup(2)+-(PSIsub(n))sup(2)(PSIsub(n+1)+PSIsub(n-1)), n=0, +-1, +-2... where PSIsub(n)(+) is the corresponding value of PSI(x, t) function in the node and divisions with the equilibrium step Δx. The main problem is obtaining analytically exact solutions of the equations (2). The analysis of the equation system (2) is performed on the base of the discrete analogue of the periodic variant of the inverse scattering problem method developed with the aid of nonlinear equations of the Korteweg-de Vries type. Obtained in explicit form are analytical solutions of the equations system (2). The solutions are expressed through the Riemann THETA-function [ru

  13. Corrected Fourier series and its application to function approximation

    Qing-Hua Zhang

    2005-01-01

    Full Text Available Any quasismooth function f(x in a finite interval [0,x0], which has only a finite number of finite discontinuities and has only a finite number of extremes, can be approximated by a uniformly convergent Fourier series and a correction function. The correction function consists of algebraic polynomials and Heaviside step functions and is required by the aperiodicity at the endpoints (i.e., f(0≠f(x0 and the finite discontinuities in between. The uniformly convergent Fourier series and the correction function are collectively referred to as the corrected Fourier series. We prove that in order for the mth derivative of the Fourier series to be uniformly convergent, the order of the polynomial need not exceed (m+1. In other words, including the no-more-than-(m+1 polynomial has eliminated the Gibbs phenomenon of the Fourier series until its mth derivative. The corrected Fourier series is then applied to function approximation; the procedures to determine the coefficients of the corrected Fourier series are illustrated in detail using examples.

  14. Exact and approximate interior corner problem in neutron diffusion by integral transform methods

    Bareiss, E.H.; Chang, K.S.J.; Constatinescu, D.A.

    1976-09-01

    The mathematical solution of the neutron diffusion equation exhibits singularities in its derivatives at material corners. A mathematical treatment of the nature of these singularities and its impact on coarse network approximation methods in computational work is presented. The mathematical behavior is deduced from Green's functions, based on a generalized theory for two space dimensions, and the resulting systems of integral equations, as well as from the Kontorovich--Lebedev Transform. The effect on numerical calculations is demonstrated for finite difference and finite element methods for a two-region corner problem

  15. Bessel harmonic analysis and approximation of functions on the half-line

    Platonov, Sergei S

    2007-01-01

    We study problems of approximation of functions on [0,+∞) in the metric of L p with power weight using generalized Bessel shifts. We prove analogues of direct Jackson theorems for the modulus of smoothness of arbitrary order defined in terms of generalized Bessel shifts. We establish the equivalence of the modulus of smoothness and the K-functional. We define function spaces of Nikol'skii-Besov type and describe them in terms of best approximations. As a tool for approximation, we use a certain class of entire functions of exponential type. In this class, we prove analogues of Bernstein's inequality and others for the Bessel differential operator and its fractional powers. The main tool we use to solve these problems is Bessel harmonic analysis

  16. The approximation gap for the metric facility location problem is not yet closed

    Byrka, J.; Aardal, K.I.

    2007-01-01

    We consider the 1.52-approximation algorithm of Mahdian et al. for the metric uncapacitated facility location problem. We show that their algorithm does not close the gap with the lower bound on approximability, 1.463, by providing a construction of instances for which its approximation ratio is not

  17. An approximate solution of the two-group critical problem for reflected slabs

    Ishiguro, Y.; Garcia, R.D.M.

    1977-01-01

    A new approximation is developed to solve two group slab problems involving two media where one of the media is infinite. The method consists in combining the P sub(L) approximation with invariance principles. Several numerical results are reported for the critical slab problem [pt

  18. Approximate solutions to the deep bed filtration problem; Solucoes aproximadas para o problema de deposicao profunda

    Silva, Julio M.; Marchesin, Dan [Instituto de Matematica Pura e Aplicada (IMPA), Rio de Janeiro, RJ (Brazil)

    2008-07-01

    The deep bed filtration problem is closely related to secondary oil recovery. In this work we derive explicit solutions to two filtration problems. The filtration function varies non-linearly with the Darcy speed and linearly with the deposition, but very little. The first solution is built by the method of perturbations and although it is only an approximation it is available in multiple symmetries, including the radial geometry used in the field. The main motivation is the validation of numerical methods. The second solution is exact but it is only available in the linear symmetry, i.e., laboratory geometry. We use it to verify the accuracy of the first solution, but it can also be used to simulate the deposition in experiments. (author)

  19. Structural stability of solutions to the Riemann problem for a non-strictly hyperbolic system with flux approximation

    Meina Sun

    2016-05-01

    Full Text Available We study the Riemann problem for a non-strictly hyperbolic system of conservation laws under the linear approximations of flux functions with three parameters. The approximated system also belongs to the type of triangular systems of conservation laws and this approximation does not change the structure of Riemann solutions to the original system. Furthermore, it is proven that the Riemann solutions to the approximated system converge to the corresponding ones to the original system as the perturbation parameter tends to zero.

  20. The approximate analytical solution of the internal problem of conductive and laminar free convection

    M. I. Popov

    2016-01-01

    Full Text Available The approximate analytical solution of a problem about nonstationary free convection in the conductive and laminar mode of the Newtonian liquid in square area at the instantaneous change of temperature of a sidewall and lack of heat fluxes is submitted on top and bottom the bases. The equations of free convection in an approximation of Oberbeka-Bussinesk are linearized due to neglect by convective items. For reduction of number of hydrothermal parameters the system is given to the dimensionless look by introduction of scales for effect and explanatory variables. Transition from classical variables to the variables "whirlwind-a flow function" allowed to reduce system to a nonstationary heat conduction equation and a nonstationary nonuniform biharmonic equation, and the first is not dependent on the second. The decision in the form of a flow function is received by application integral a sine - Fourier transforms with terminating limits to a biharmonic equation at first on a variable x, and then on a variable y. The flow function has an appearance of a double series of Fourier on sine with coefficients in an integral form. Coefficients of a row represent integrals from unknown functions. On the basis of a hypothesis of an express type of integrals coefficients are calculated from the linear equation system received from boundary conditions on partial derivatives of function. Dependence of structure of a current on Prandtl's number is investigated. The cards of streamlines and isolines of components of speed describing development of a current from the moment of emergence before transition to a stationary state are received. The schedules of a field of vectors of speeds in various time illustrating dynamics of a current are provided. Reliability of a hypothesis of an express type of integral coefficients is confirmed by adequacy to physical sense and coherence of the received results with the numerical solution of a problem.

  1. Three-body scattering problem in the fixed center approximation: The case of attraction

    Kudryavtsev, Alexander E. [National Research Center Kurchatov Institute, Institute for Theoretical and Experimental Physics, Moscow (Russian Federation); Gani, Vakhid A. [National Research Center Kurchatov Institute, Institute for Theoretical and Experimental Physics, Moscow (Russian Federation); National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), Moscow (Russian Federation); Romanov, Alexander I. [National Research Nuclear University MEPhI (Moscow Engineering Physics Institute), Moscow (Russian Federation)

    2016-12-15

    We study the scattering of a light particle on a bound pair of heavy particles (e.g., the deuteron) within the fixed center approximation in the case of light-heavy attraction, solving the integral equation for the three-body Green's function both in the coordinate and in the momentum space. The results for the three-body scattering amplitude appear to be ambiguous -they depend on a single real parameter. This parameter may be fixed by a three-body input, e.g., the three-body scattering length. We also solve the integral equation for the three-body Green function in the momentum space, introducing a finite cut-off. We show that all three approaches are equivalent. We also discuss how our approach to the problem matches with the introduction of three-body contact interaction as done by other authors. (orig.)

  2. Approximate Treatment of the Dirac Equation with Hyperbolic Potential Function

    Durmus, Aysen

    2018-03-01

    The time independent Dirac equation is solved analytically for equal scalar and vector hyperbolic potential function in the presence of Greene and Aldrich approximation scheme. The bound state energy equation and spinor wave functions expressed by the hypergeometric function have been obtained in detail with asymptotic iteration approach. In order to indicate the accuracy of this different approach proposed to solve second order linear differential equations, we present that in the non-relativistic limit, analytical solutions of the Dirac equation converge to those of the Schrödinger one. We introduce numerical results of the theoretical analysis for hyperbolic potential function. Bound states corresponding to arbitrary values of n and l are reported for potential parameters covering a wide range of interaction. Also, we investigate relativistic vibrational energy spectra of alkali metal diatomic molecules in the different electronic states. It is observed that theoretical vibrational energy values are consistent with experimental Rydberg-Klein-Rees (RKR) results and vibrational energies of NaK, K_2 and KRb diatomic molecules interacting with hyperbolic potential smoothly converge to the experimental dissociation limit D_e=2508cm^{-1}, 254cm^{-1} and 4221cm^{-1}, respectively.

  3. Big geo data surface approximation using radial basis functions: A comparative study

    Majdisova, Zuzana; Skala, Vaclav

    2017-12-01

    Approximation of scattered data is often a task in many engineering problems. The Radial Basis Function (RBF) approximation is appropriate for big scattered datasets in n-dimensional space. It is a non-separable approximation, as it is based on the distance between two points. This method leads to the solution of an overdetermined linear system of equations. In this paper the RBF approximation methods are briefly described, a new approach to the RBF approximation of big datasets is presented, and a comparison for different Compactly Supported RBFs (CS-RBFs) is made with respect to the accuracy of the computation. The proposed approach uses symmetry of a matrix, partitioning the matrix into blocks and data structures for storage of the sparse matrix. The experiments are performed for synthetic and real datasets.

  4. On the Approximate Controllability of Some Semilinear Parabolic Boundary-Value Problems

    Diaz, J. I.; Henry, J.; Ramos, A. M.

    1998-01-01

    We prove the approximate controllability of several nonlinear parabolic boundary-value problems by means of two different methods: the first one can be called a Cancellation method and the second one uses the Kakutani fixed-point theorem

  5. Quadratic head loss approximations for optimisation problems in water supply networks

    Pecci, Filippo; Abraham, E.; I, Stoianov

    2017-01-01

    This paper presents a novel analysis of the accuracy of quadratic approximations for the Hazen–Williams (HW) head loss formula, which enables the control of constraint violations in optimisation problems for water supply networks. The two smooth polynomial approximations considered here minimise the

  6. Bayesian Parameter Estimation via Filtering and Functional Approximations

    Matthies, Hermann G.

    2016-11-25

    The inverse problem of determining parameters in a model by comparing some output of the model with observations is addressed. This is a description for what hat to be done to use the Gauss-Markov-Kalman filter for the Bayesian estimation and updating of parameters in a computational model. This is a filter acting on random variables, and while its Monte Carlo variant --- the Ensemble Kalman Filter (EnKF) --- is fairly straightforward, we subsequently only sketch its implementation with the help of functional representations.

  7. Bayesian Parameter Estimation via Filtering and Functional Approximations

    Matthies, Hermann G.; Litvinenko, Alexander; Rosic, Bojana V.; Zander, Elmar

    2016-01-01

    The inverse problem of determining parameters in a model by comparing some output of the model with observations is addressed. This is a description for what hat to be done to use the Gauss-Markov-Kalman filter for the Bayesian estimation and updating of parameters in a computational model. This is a filter acting on random variables, and while its Monte Carlo variant --- the Ensemble Kalman Filter (EnKF) --- is fairly straightforward, we subsequently only sketch its implementation with the help of functional representations.

  8. Optimized implementations of rational approximations for the Voigt and complex error function

    Schreier, Franz

    2011-01-01

    Rational functions are frequently used as efficient yet accurate numerical approximations for real and complex valued functions. For the complex error function w(x+iy), whose real part is the Voigt function K(x,y), code optimizations of rational approximations are investigated. An assessment of requirements for atmospheric radiative transfer modeling indicates a y range over many orders of magnitude and accuracy better than 10 -4 . Following a brief survey of complex error function algorithms in general and rational function approximations in particular the problems associated with subdivisions of the x, y plane (i.e., conditional branches in the code) are discussed and practical aspects of Fortran and Python implementations are considered. Benchmark tests of a variety of algorithms demonstrate that programming language, compiler choice, and implementation details influence computational speed and there is no unique ranking of algorithms. A new implementation, based on subdivision of the upper half-plane in only two regions, combining Weideman's rational approximation for small |x|+y<15 and Humlicek's rational approximation otherwise is shown to be efficient and accurate for all x, y.

  9. FUNPACK-2, Subroutine Library, Bessel Function, Elliptical Integrals, Min-max Approximation

    Cody, W.J.; Garbow, Burton S.

    1975-01-01

    1 - Description of problem or function: FUNPACK is a collection of FORTRAN subroutines to evaluate certain special functions. The individual subroutines are (Identification/Description): NATSI0 F2I0 Bessel function I 0 ; NATSI1 F2I1 Bessel function I 1 ; NATSJ0 F2J0 Bessel function J 0 ; NATSJ1 F2J1 Bessel function J 1 ; NATSK0 F2K0 Bessel function K 0 ; NATSK1 F2K1 Bessel function K 1 ; NATSBESY F2BY Bessel function Y ν ; DAW F1DW Dawson's integral; DELIPK F1EK Complete elliptic integral of the first kind; DELIPE F1EE Complete elliptic integral of the second kind; DEI F1EI Exponential integrals; NATSPSI F2PS Psi (logarithmic derivative of gamma function); MONERR F1MO Error monitoring package . 2 - Method of solution: FUNPACK uses evaluation of min-max approximations

  10. On the functional integral approach in quantum statistics. 1. Some approximations

    Dai Xianxi.

    1990-08-01

    In this paper the susceptibility of a Kondo system in a fairly wide temperature region is calculated in the first harmonic approximation in a functional integral approach. The comparison with that of the renormalization group theory shows that in this region the two results agree quite well. The expansion of the partition function with infinite independent harmonics for the Anderson model is studied. Some symmetry relations are generalized. It is a challenging problem to develop a functional integral approach including diagram analysis, mixed mode effects and some exact relations in the Anderson system proved in the functional integral approach. These topics will be discussed in the next paper. (author). 22 refs, 1 fig

  11. Approximation problems with the divergence criterion for Gaussian variablesand Gaussian processes

    A.A. Stoorvogel; J.H. van Schuppen (Jan)

    1996-01-01

    textabstractSystem identification for stationary Gaussian processes includes an approximation problem. Currently the subspace algorithm for this problem enjoys much attention. This algorithm is based on a transformation of a finite time series to canonical variable form followed by a truncation.

  12. The single-collision thermalization approximation for application to cold neutron moderation problems

    Ritenour, R.L.

    1989-01-01

    The single collision thermalization (SCT) approximation models the thermalization process by assuming that neutrons attain a thermalized distribution with only a single collision within the moderating material, independent of the neutron's incident energy. The physical intuition on which this approximation is based is that the salient properties of neutron thermalization are accounted for in the first collision, and the effects of subsequent collisions tend to average out statistically. The independence of the neutron incident and outscattering energy leads to variable separability in the scattering kernel and, thus, significant simplification of the neutron thermalization problem. The approximation also addresses detailed balance and neutron conservation concerns. All of the tests performed on the SCT approximation yielded excellent results. The significance of the SCT approximation is that it greatly simplifies thermalization calculations for CNS design. Preliminary investigations with cases involving strong absorbers also indicates that this approximation may have broader applicability, as in the upgrading of the thermalization codes

  13. Nodal collocation approximation for the multidimensional PL equations applied to transport source problems

    Verdu, G.; Capilla, M.; Talavera, C. F.; Ginestar, D.

    2012-01-01

    PL equations are classical high order approximations to the transport equations which are based on the expansion of the angular dependence of the angular neutron flux and the nuclear cross sections in terms of spherical harmonics. A nodal collocation method is used to discretize the PL equations associated with a neutron source transport problem. The performance of the method is tested solving two 1D problems with analytical solution for the transport equation and a classical 2D problem. (authors)

  14. Nodal collocation approximation for the multidimensional PL equations applied to transport source problems

    Verdu, G. [Departamento de Ingenieria Quimica Y Nuclear, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain); Capilla, M.; Talavera, C. F.; Ginestar, D. [Dept. of Nuclear Engineering, Departamento de Matematica Aplicada, Universitat Politecnica de Valencia, Cami de Vera, 14, 46022. Valencia (Spain)

    2012-07-01

    PL equations are classical high order approximations to the transport equations which are based on the expansion of the angular dependence of the angular neutron flux and the nuclear cross sections in terms of spherical harmonics. A nodal collocation method is used to discretize the PL equations associated with a neutron source transport problem. The performance of the method is tested solving two 1D problems with analytical solution for the transport equation and a classical 2D problem. (authors)

  15. Singlet structure function F_1 in double-logarithmic approximation

    Ermolaev, B. I.; Troyan, S. I.

    2018-03-01

    The conventional ways to calculate the perturbative component of the DIS singlet structure function F_1 involve approaches based on BFKL which account for the single-logarithmic contributions accompanying the Born factor 1 / x. In contrast, we account for the double-logarithmic (DL) contributions unrelated to 1 / x and because of that they were disregarded as negligibly small. We calculate the singlet F_1 in the double-logarithmic approximation (DLA) and account at the same time for the running α _s effects. We start with a total resummation of both quark and gluon DL contributions and obtain the explicit expression for F_1 in DLA. Then, applying the saddle-point method, we calculate the small- x asymptotics of F_1, which proves to be of the Regge form with the leading singularity ω _0 = 1.066. Its large value compensates for the lack of the factor 1 / x in the DLA contributions. Therefore, this Reggeon can be identified as a new Pomeron, which can be quite important for the description of all QCD processes involving the vacuum (Pomeron) exchanges at very high energies. We prove that the expression for the small- x asymptotics of F_1 scales: it depends on a single variable Q^2/x^2 only instead of x and Q^2 separately. Finally, we show that the small- x asymptotics reliably represent F_1 at x ≤ 10^{-6}.

  16. Application of the random phase approximation to complex problems in materials science

    Schimka, L.

    2012-01-01

    This thesis is devoted to the assessment and application of the random phase approximation (RPA) in the adiabatic-connection fluctuation-dissipation (ACFD) framework in solid state physics. The first part presents a review of density functional theory (DFT) and the ACFD theorem in the RPA. This includes an introduction to the many-body problem as well as a description of the implementation of the RPA in the Vienna Ab-initio Simulation Package (VASP). In the results part, the quality of the RPA is assessed and its performance compared to three (beyond) DFT functionals. The experimental values are corrected for the effect of phonon zero-point vibrational energies which were calculated at the DFT level from ab-initio. We find that the RPA describes all bonding situations very accurately, making it a promising candidate for more complex problems in solid state physics. In light of these findings, we investigate the carbon-water interaction in two specific cases: the adsorption of water on benzene and the adsorption of water on a graphene layer. We compare our results to a different correlated method: diffusion Monte Carlo (DMC). We find very good agreement and thus believe that our values can serve as a benchmark for the development of other DFT functionals to treat water-carbon interfaces. The highlight of this thesis is the successful application of the RPA to the long-standing and (at DFT level) unsolved CO adsorption puzzle. We show results for CO adsorption on Cu, late 4d metals and Pt. RPA is at present the only ab-initio method that describes adsorption and surface energies accurately at the same time and predicts the correct adsorption site in every single case. (author) [de

  17. Piecewise-linear and bilinear approaches to nonlinear differential equations approximation problem of computational structural mechanics

    Leibov Roman

    2017-01-01

    This paper presents a bilinear approach to nonlinear differential equations system approximation problem. Sometimes the nonlinear differential equations right-hand sides linearization is extremely difficult or even impossible. Then piecewise-linear approximation of nonlinear differential equations can be used. The bilinear differential equations allow to improve piecewise-linear differential equations behavior and reduce errors on the border of different linear differential equations systems ...

  18. Exact self-energy of the many-body problem from conserving approximations

    Takada, Y.

    1995-01-01

    A procedure is proposed to obtain the exact self-energy in the many-body problem. This algorithm is based on the formal analysis to reach the exact theory by repeated applications of an operator F to an arbitrarily chosen input self-energy represented as a functional of the dressed Green's function. The operator F is so defined that the microscopic conservation law for particle number is satisfied. The rigorous self-energy is obtained by the solution of an eigenfunction of F. Particular attention is paid to the relation between the present procedure and the Baym-Kadanoff framework of conserving approximations. By simplifying the procedure in F with use of the generalized Ward identity, we suggest a practical method to implement this algorithm rather easily in actual systems. In order to suggest future directions to improve on this practical method, the recently developed mean-field theory for the Hubbard model in the limit of high spatial dimensions is also discussed in the context of our theory

  19. Laplace transform homotopy perturbation method for the approximation of variational problems.

    Filobello-Nino, U; Vazquez-Leal, H; Rashidi, M M; Sedighi, H M; Perez-Sesma, A; Sandoval-Hernandez, M; Sarmiento-Reyes, A; Contreras-Hernandez, A D; Pereyra-Diaz, D; Hoyos-Reyes, C; Jimenez-Fernandez, V M; Huerta-Chua, J; Castro-Gonzalez, F; Laguna-Camacho, J R

    2016-01-01

    This article proposes the application of Laplace Transform-Homotopy Perturbation Method and some of its modifications in order to find analytical approximate solutions for the linear and nonlinear differential equations which arise from some variational problems. As case study we will solve four ordinary differential equations, and we will show that the proposed solutions have good accuracy, even we will obtain an exact solution. In the sequel, we will see that the square residual error for the approximate solutions, belongs to the interval [0.001918936920, 0.06334882582], which confirms the accuracy of the proposed methods, taking into account the complexity and difficulty of variational problems.

  20. Some approximating formulae to the solution of an abstract evolution problem

    Ngongo, M.E.

    1991-12-01

    We consider discrete semigroups of operators associated with the first two primary sub-families of A-acceptable Norsett's rational approximations to e q , S 1 (γ;q) and S 2 (γ;q) with q is an element of C and γ a real parameter, and construct approximating formulae to the solution of an abstract evolution problem. The study of convergence is reduced to exploiting previous fundamental results of the author for this class of semigroups and this results, for associated numerical schemes, in a convergence independent of the regularity of the data of the problem. (author). 17 refs, 3 tabs

  1. Analysis of a finite PML approximation to the three dimensional elastic wave scattering problem

    Bramble, James H.

    2010-01-01

    We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed as a complex coordinate shift in spherical coordinates which leads to a variable complex coefficient equation for the displacement vector posed on an infinite domain (the complement of the scatterer). The rapid decay of the PML solution suggests truncation to a bounded domain with a convenient outer boundary condition and subsequent finite element approximation (for the truncated problem). We prove existence and uniqueness of the solutions to the infinite domain and truncated domain PML equations (provided that the truncated domain is sufficiently large). We also show exponential convergence of the solution of the truncated PML problem to the solution of the original scattering problem in the region of interest. We then analyze a Galerkin numerical approximation to the truncated PML problem and prove that it is well posed provided that the PML damping parameter and mesh size are small enough. Finally, computational results illustrating the efficiency of the finite element PML approximation are presented. © 2010 American Mathematical Society.

  2. Subsystem density functional theory with meta-generalized gradient approximation exchange-correlation functionals.

    Śmiga, Szymon; Fabiano, Eduardo; Laricchia, Savio; Constantin, Lucian A; Della Sala, Fabio

    2015-04-21

    We analyze the methodology and the performance of subsystem density functional theory (DFT) with meta-generalized gradient approximation (meta-GGA) exchange-correlation functionals for non-bonded molecular systems. Meta-GGA functionals depend on the Kohn-Sham kinetic energy density (KED), which is not known as an explicit functional of the density. Therefore, they cannot be directly applied in subsystem DFT calculations. We propose a Laplacian-level approximation to the KED which overcomes this limitation and provides a simple and accurate way to apply meta-GGA exchange-correlation functionals in subsystem DFT calculations. The so obtained density and energy errors, with respect to the corresponding supermolecular calculations, are comparable with conventional approaches, depending almost exclusively on the approximations in the non-additive kinetic embedding term. An embedding energy error decomposition explains the accuracy of our method.

  3. The Core Problem within a Linear Approximation Problem $AX/approx B$ with Multiple Right-Hand Sides

    Hnětynková, Iveta; Plešinger, Martin; Strakoš, Z.

    2013-01-01

    Roč. 34, č. 3 (2013), s. 917-931 ISSN 0895-4798 R&D Projects: GA ČR GA13-06684S Grant - others:GA ČR(CZ) GA201/09/0917; GA MŠk(CZ) EE2.3.09.0155; GA MŠk(CZ) EE2.3.30.0065 Program:GA Institutional support: RVO:67985807 Keywords : total least squares problem * multiple right-hand sides * core problem * linear approximation problem * error-in-variables modeling * orthogonal regression * singular value decomposition Subject RIV: BA - General Mathematics Impact factor: 1.806, year: 2013

  4. Hybridization of Sensing Methods of the Search Domain and Adaptive Weighted Sum in the Pareto Approximation Problem

    A. P. Karpenko

    2015-01-01

    Full Text Available We consider the relatively new and rapidly developing class of methods to solve a problem of multi-objective optimization, based on the preliminary built finite-dimensional approximation of the set, and thereby, the Pareto front of this problem as well. The work investigates the efficiency of several modifications of the method of adaptive weighted sum (AWS. This method proposed in the paper of Ryu and Kim Van (JH. Ryu, S. Kim, H. Wan is intended to build Pareto approximation of the multi-objective optimization problem.The AWS method uses quadratic approximation of the objective functions in the current sub-domain of the search space (the area of trust based on the gradient and Hessian matrix of the objective functions. To build the (quadratic meta objective functions this work uses methods of the experimental design theory, which involves calculating the values of these functions in the grid nodes covering the area of trust (a sensing method of the search domain. There are two groups of the sensing methods under consideration: hypercube- and hyper-sphere-based methods. For each of these groups, a number of test multi-objective optimization tasks has been used to study the efficiency of the following grids: "Latin Hypercube"; grid, which is uniformly random for each measurement; grid, based on the LP  sequences.

  5. On the equivalence of optimality criterion and sequential approximate optimization methods in the classical layout problem

    Groenwold, A.A.; Etman, L.F.P.

    2008-01-01

    We study the classical topology optimization problem, in which minimum compliance is sought, subject to linear constraints. Using a dual statement, we propose two separable and strictly convex subproblems for use in sequential approximate optimization (SAO) algorithms.Respectively, the subproblems

  6. Approximation of the eigenvalue problem for the time harmonic Maxwell system by continuous Lagrange finite elements

    Bonito, Andrea; Guermond, Jean-Luc

    2011-01-01

    We propose and analyze an approximation technique for the Maxwell eigenvalue problem using H1-conforming finite elements. The key idea consists of considering a mixed method controlling the divergence of the electric field in a fractional Sobolev space H-α with α ∈ (1/2, 1). The method is shown to be convergent and spectrally correct. © 2011 American Mathematical Society.

  7. A non linear half space problem for radiative transfer equations. Application to the Rosseland approximation

    Sentis, R.

    1984-07-01

    The radiative transfer equations may be approximated by a non linear diffusion equation (called Rosseland equation) when the mean free paths of the photons are small with respect to the size of the medium. Some technical assomptions are made, namely about the initial conditions, to avoid any problem of initial layer terms

  8. Analytic number theory, approximation theory, and special functions in honor of Hari M. Srivastava

    Rassias, Michael

    2014-01-01

    This book, in honor of Hari M. Srivastava, discusses essential developments in mathematical research in a variety of problems. It contains thirty-five articles, written by eminent scientists from the international mathematical community, including both research and survey works. Subjects covered include analytic number theory, combinatorics, special sequences of numbers and polynomials, analytic inequalities and applications, approximation of functions and quadratures, orthogonality, and special and complex functions. The mathematical results and open problems discussed in this book are presented in a simple and self-contained manner. The book contains an overview of old and new results, methods, and theories toward the solution of longstanding problems in a wide scientific field, as well as new results in rapidly progressing areas of research. The book will be useful for researchers and graduate students in the fields of mathematics, physics, and other computational and applied sciences.

  9. An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective

    Ľuboš Buzna

    2014-01-01

    Full Text Available We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. The lexicographic minimax optimum is a concept that allows to find equitable location of facilities serving a large number of customers. The algorithm is independent of general purpose solvers and instead uses algorithms originally designed to solve the p-median problem. By numerical experiments, we demonstrate that our algorithm allows increasing the size of solvable problems and provides high-quality solutions. The algorithm found an optimal solution for all tested instances where we could compare the results with the exact algorithm.

  10. Approximate controllability of a semilinear elliptic problem with Robin condition in a periodically perforated domain

    Nikita Agarwal

    2017-07-01

    Full Text Available In this article, we study the approximate controllability and homegenization results of a semi-linear elliptic problem with Robin boundary condition in a periodically perforated domain. We prove the existence of minimal norm control using Lions constructive approach, which is based on Fenchel-Rockafeller duality theory, and by means of Zuazua's fixed point arguments. Then, as the homogenization parameter goes to zero, we link the limit of the optimal controls (the limit of fixed point of the controllability problems with the optimal control of the corresponding homogenized problem.

  11. Wavelet series approximation using wavelet function with compactly ...

    The Wavelets generated by Scaling Function with Compactly Support are useful in various applications especially for reconstruction of functions. Generally, the computational process will be faster if Scaling Function support descends, so computational errors are summarized from one level to another level. In this article, the ...

  12. Hermite-distributed approximating functional-based formulation of ...

    2016-07-29

    Jul 29, 2016 ... number of quantum mechanical methods are currently available in literature for handling a wide variety of dynamical problems [3,4]. In all cases ..... For the characterization of tunnelling time in two dimensions, we have ...

  13. A metaheuristic for a numerical approximation to the mass transfer problem

    Avendaño-Garrido Martha L.

    2016-12-01

    Full Text Available This work presents an improvement of the approximation scheme for the Monge-Kantorovich (MK mass transfer problem on compact spaces, which is studied by Gabriel et al. (2010, whose scheme discretizes the MK problem, reduced to solve a sequence of finite transport problems. The improvement presented in this work uses a metaheuristic algorithm inspired by scatter search in order to reduce the dimensionality of each transport problem. The new scheme solves a sequence of linear programming problems similar to the transport ones but with a lower dimension. The proposed metaheuristic is supported by a convergence theorem. Finally, examples with an exact solution are used to illustrate the performance of our proposal.

  14. Multi-level methods and approximating distribution functions

    Wilson, D.; Baker, R. E.

    2016-01-01

    Biochemical reaction networks are often modelled using discrete-state, continuous-time Markov chains. System statistics of these Markov chains usually cannot be calculated analytically and therefore estimates must be generated via simulation techniques. There is a well documented class of simulation techniques known as exact stochastic simulation algorithms, an example of which is Gillespie’s direct method. These algorithms often come with high computational costs, therefore approximate stochastic simulation algorithms such as the tau-leap method are used. However, in order to minimise the bias in the estimates generated using them, a relatively small value of tau is needed, rendering the computational costs comparable to Gillespie’s direct method. The multi-level Monte Carlo method (Anderson and Higham, Multiscale Model. Simul. 10:146–179, 2012) provides a reduction in computational costs whilst minimising or even eliminating the bias in the estimates of system statistics. This is achieved by first crudely approximating required statistics with many sample paths of low accuracy. Then correction terms are added until a required level of accuracy is reached. Recent literature has primarily focussed on implementing the multi-level method efficiently to estimate a single system statistic. However, it is clearly also of interest to be able to approximate entire probability distributions of species counts. We present two novel methods that combine known techniques for distribution reconstruction with the multi-level method. We demonstrate the potential of our methods using a number of examples.

  15. Multi-level methods and approximating distribution functions

    Wilson, D., E-mail: daniel.wilson@dtc.ox.ac.uk; Baker, R. E. [Mathematical Institute, University of Oxford, Radcliffe Observatory Quarter, Woodstock Road, Oxford, OX2 6GG (United Kingdom)

    2016-07-15

    Biochemical reaction networks are often modelled using discrete-state, continuous-time Markov chains. System statistics of these Markov chains usually cannot be calculated analytically and therefore estimates must be generated via simulation techniques. There is a well documented class of simulation techniques known as exact stochastic simulation algorithms, an example of which is Gillespie’s direct method. These algorithms often come with high computational costs, therefore approximate stochastic simulation algorithms such as the tau-leap method are used. However, in order to minimise the bias in the estimates generated using them, a relatively small value of tau is needed, rendering the computational costs comparable to Gillespie’s direct method. The multi-level Monte Carlo method (Anderson and Higham, Multiscale Model. Simul. 10:146–179, 2012) provides a reduction in computational costs whilst minimising or even eliminating the bias in the estimates of system statistics. This is achieved by first crudely approximating required statistics with many sample paths of low accuracy. Then correction terms are added until a required level of accuracy is reached. Recent literature has primarily focussed on implementing the multi-level method efficiently to estimate a single system statistic. However, it is clearly also of interest to be able to approximate entire probability distributions of species counts. We present two novel methods that combine known techniques for distribution reconstruction with the multi-level method. We demonstrate the potential of our methods using a number of examples.

  16. APPROX, 1-D and 2-D Function Approximation by Polynomials, Splines, Finite Elements Method

    Tollander, Bengt

    1975-01-01

    1 - Nature of physical problem solved: Approximates one- and two- dimensional functions using different forms of the approximating function, as polynomials, rational functions, Splines and (or) the finite element method. Different kinds of transformations of the dependent and (or) the independent variables can easily be made by data cards using a FORTRAN-like language. 2 - Method of solution: Approximations by polynomials, Splines and (or) the finite element method are made in L2 norm using the least square method by which the answer is directly given. For rational functions in one dimension the result given in L(infinite) norm is achieved by iterations moving the zero points of the error curve. For rational functions in two dimensions, the norm is L2 and the result is achieved by iteratively changing the coefficients of the denominator and then solving the coefficients of the numerator by the least square method. The transformation of the dependent and (or) independent variables is made by compiling the given transform data card(s) to an array of integers from which the transformation can be made

  17. Unit Stratified Sampling as a Tool for Approximation of Stochastic Optimization Problems

    Šmíd, Martin

    2012-01-01

    Roč. 19, č. 30 (2012), s. 153-169 ISSN 1212-074X R&D Projects: GA ČR GAP402/11/0150; GA ČR GAP402/10/0956; GA ČR GA402/09/0965 Institutional research plan: CEZ:AV0Z10750506 Institutional support: RVO:67985556 Keywords : Stochastic programming * approximation * stratified sampling Subject RIV: BB - Applied Statistics, Operational Research http://library.utia.cas.cz/separaty/2013/E/smid-unit stratified sampling as a tool for approximation of stochastic optimization problems.pdf

  18. Deep-inelastic structure functions in an approximation to the bag theory

    Jaffe, R.L.

    1975-01-01

    A cavity approximation to the bag theory developed earlier is extended to the treatment of forward virtual Compton scattering. In the Bjorken limit and for small values of ω (ω = vertical-bar2p center-dot q/q 2 vertical-bar) it is argued that the operator nature of the bag boundaries might be ignored. Structure functions are calculated in one and three dimensions. Bjorken scaling is obtained. The model provides a realization of light-cone current algebra and possesses a parton interpretation. The structure functions show a quasielastic peak. The spreading of the structure functions about the peak is associated with confinement. As expected, Regge behavior is not obtained for large ω. The ''momentum sum rule'' is saturated, indicating that the hadron's charged constituents carry all the momentum in this model. νW/subL/ is found to scale and is calculable. Application of the model to the calculation of spin-dependent and chiral-symmetry--violating structure functions is proposed. The nature of the intermediate states in this approximation is discussed. Problems associated with the cavity approximation are also discussed

  19. An Approximate Redistributed Proximal Bundle Method with Inexact Data for Minimizing Nonsmooth Nonconvex Functions

    Jie Shen

    2015-01-01

    Full Text Available We describe an extension of the redistributed technique form classical proximal bundle method to the inexact situation for minimizing nonsmooth nonconvex functions. The cutting-planes model we construct is not the approximation to the whole nonconvex function, but to the local convexification of the approximate objective function, and this kind of local convexification is modified dynamically in order to always yield nonnegative linearization errors. Since we only employ the approximate function values and approximate subgradients, theoretical convergence analysis shows that an approximate stationary point or some double approximate stationary point can be obtained under some mild conditions.

  20. Solving multi-objective job shop problem using nature-based algorithms: new Pareto approximation features

    Jarosław Rudy

    2015-01-01

    Full Text Available In this paper the job shop scheduling problem (JSP with minimizing two criteria simultaneously is considered. JSP is frequently used model in real world applications of combinatorial optimization. Multi-objective job shop problems (MOJSP were rarely studied. We implement and compare two multi-agent nature-based methods, namely ant colony optimization (ACO and genetic algorithm (GA for MOJSP. Both of those methods employ certain technique, taken from the multi-criteria decision analysis in order to establish ranking of solutions. ACO and GA differ in a method of keeping information about previously found solutions and their quality, which affects the course of the search. In result, new features of Pareto approximations provided by said algorithms are observed: aside from the slight superiority of the ACO method the Pareto frontier approximations provided by both methods are disjoint sets. Thus, both methods can be used to search mutually exclusive areas of the Pareto frontier.

  1. On Approximation of Hyper-geometric Function Values of a Special Class

    P. L. Ivankov

    2017-01-01

    Full Text Available Investigations of arithmetic properties of the hyper-geometric function values make it possible to single out two trends, namely, Siegel’s method and methods based on the effective construction of a linear approximating form. There are also methods combining both approaches mentioned.  The Siegel’s method allows obtaining the most general results concerning the abovementioned problems. In many cases it was used to establish the algebraic independence of the values of corresponding functions. Although the effective methods do not allow obtaining propositions of such generality they have nevertheless some advantages. Among these advantages one can distinguish at least two: a higher precision of the quantitative results obtained by effective methods and a possibility to study the hyper-geometric functions with irrational parameters.In this paper we apply the effective construction to estimate a measure of the linear independence of the hyper-geometric function values over the imaginary quadratic field. The functions themselves were chosen by a special way so that it could be possible to demonstrate a new approach to the effective construction of a linear approximating form. This approach makes it possible also to extend the well-known effective construction methods of the linear approximating forms for poly-logarithms to the functions of more general type.To obtain the arithmetic result we had to establish a linear independence of the functions under consideration over the field of rational functions. It is apparently impossible to apply directly known theorems containing sufficient (and in some cases needful and sufficient conditions for the system of functions appearing in the theorems mentioned. For this reason, a special technique has been developed to solve this problem.The paper presents the obtained arithmetic results concerning the values of integral functions, but, with appropriate alterations, the theorems proved can be adapted to

  2. A uniformly valid approximation algorithm for nonlinear ordinary singular perturbation problems with boundary layer solutions.

    Cengizci, Süleyman; Atay, Mehmet Tarık; Eryılmaz, Aytekin

    2016-01-01

    This paper is concerned with two-point boundary value problems for singularly perturbed nonlinear ordinary differential equations. The case when the solution only has one boundary layer is examined. An efficient method so called Successive Complementary Expansion Method (SCEM) is used to obtain uniformly valid approximations to this kind of solutions. Four test problems are considered to check the efficiency and accuracy of the proposed method. The numerical results are found in good agreement with exact and existing solutions in literature. The results confirm that SCEM has a superiority over other existing methods in terms of easy-applicability and effectiveness.

  3. An approximation solution to refinery crude oil scheduling problem with demand uncertainty using joint constrained programming.

    Duan, Qianqian; Yang, Genke; Xu, Guanglin; Pan, Changchun

    2014-01-01

    This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.

  4. An Approximation Solution to Refinery Crude Oil Scheduling Problem with Demand Uncertainty Using Joint Constrained Programming

    Qianqian Duan

    2014-01-01

    Full Text Available This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand uncertainty is treated by specifying proximity level on the satisfaction of product demands. However, the joint chance constraints usually hold strong nonlinearity and consequently, it is still hard to handle it directly. In this paper, an approximation method combines a relax-and-tight technique to approximately transform the joint chance constraints to a serial of parameterized linear constraints so that the complicated problem can be attacked iteratively. The basic idea behind this approach is to approximate, as much as possible, nonlinear constraints by a lot of easily handled linear constraints which will lead to a well balance between the problem complexity and tractability. Case studies are conducted to demonstrate the proposed methods. Results show that the operation cost can be reduced effectively compared with the case without considering the demand correlation.

  5. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    Domínguez, Luis F.

    2012-06-25

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).

  6. Approximate scattering wave functions for few-particle continua

    Briggs, J.S.

    1990-01-01

    An operator identity which allows the wave operator for N particles interacting pairwise to be expanded as products of operators in which fewer than N particles interact is given. This identity is used to derive appproximate scattering wave functions for N-particle continua that avoid certain difficulties associated with Faddeev-type expansions. For example, a derivation is given of a scattering wave function used successfully recently to describe the three-particle continuum occurring in the electron impact ionization of the hydrogen atom

  7. On an Approximate Solution Method for the Problem of Surface and Groundwater Combined Movement with Exact Approximation on the Section Line

    L.L. Glazyrina

    2016-12-01

    Full Text Available In this paper, the initial-boundary problem for two nonlinear parabolic combined equations has been considered. One of the equations is set on the bounded domain Ω from R2, another equation is set along the curve lying in Ω. Both of the equations are parabolic equations with double degeneration. The degeneration can be present at the space operator. Furthermore, the nonlinear function which is under the sign of partial derivative with respect to the variable t, can be bound to zero. This problem has an applied character: such structure is needed to describe the process of surface and ground water combined movement. In this case, the desired function determines the level of water above the given impenetrable bottom, the section simulates the riverbed. The Bussinesk equation has been used for mathematical description of the groundwater filtration process in the domain Ω; a diffusion analogue of the Saint-Venant's system has been used on the section for description of the process of water level change in the open channel. Earlier, the authors proved the theorems of generalized solution existence and uniqueness for the considered problem from the functions classes which are called strengthened Sobolev spaces in the literature. To obtain these results, we used the technique which was created by the German mathematicians (H.W. Alt, S. Luckhaus, F. Otto to establish the correctness of the problems with a double degeneration. In this paper, we have proposed and investigated an approximate solution method for the above-stated problem. This method has been constructed using semidiscretization with respect to the variable t and the finite element method for space variables. Triangulation of the domain has been accomplished by triangles. The mesh has been set on the section line. On each segment of the line section lying between the nearby mesh points, on both side of this segment we have constructed the triangles with a common side which matches with

  8. Approximate formulas for elasticity of the Tornquist functions and some their advantages

    Issin, Meyram

    2017-09-01

    In this article functions of demand for prime necessity, second necessity and luxury goods depending on the income are considered. These functions are called Tornquist functions. By means of the return model the demand for prime necessity goods and second necessity goods are approximately described. Then on the basis of a method of the smallest squares approximate formulas for elasticity of these Tornquist functions are received. To receive an approximate formula for elasticity of function of demand for luxury goods, the linear asymptotic formula is constructed for this function. Some benefits of approximate formulas for elasticity of Tornquist functions are specified.

  9. Combination of Wavefunction and Density Functional Approximations for Describing Electronic Correlation

    Garza, Alejandro J.

    Perhaps the most important approximations to the electronic structure problem in quantum chemistry are those based on coupled cluster and density functional theories. Coupled cluster theory has been called the ``gold standard'' of quantum chemistry due to the high accuracy that it achieves for weakly correlated systems. Kohn-Sham density functionals based on semilocal approximations are, without a doubt, the most widely used methods in chemistry and material science because of their high accuracy/cost ratio. The root of the success of coupled cluster and density functionals is their ability to efficiently describe the dynamic part of the electron correlation. However, both traditional coupled cluster and density functional approximations may fail catastrophically when substantial static correlation is present. This severely limits the applicability of these methods to a plethora of important chemical and physical problems such as, e.g., the description of bond breaking, transition states, transition metal-, lanthanide- and actinide-containing compounds, and superconductivity. In an attempt to tackle this problem, nonstandard (single-reference) coupled cluster-based techniques that aim to describe static correlation have been recently developed: pair coupled cluster doubles (pCCD) and singlet-paired coupled cluster doubles (CCD0). The ability to describe static correlation in pCCD and CCD0 comes, however, at the expense of important amounts of dynamic correlation so that the high accuracy of standard coupled cluster becomes unattainable. Thus, the reliable and efficient description of static and dynamic correlation in a simultaneous manner remains an open problem for quantum chemistry and many-body theory in general. In this thesis, different ways to combine pCCD and CCD0 with density functionals in order to describe static and dynamic correlation simultaneously (and efficiently) are explored. The combination of wavefunction and density functional methods has a long

  10. Fall with linear drag and Wien's displacement law: approximate solution and Lambert function

    Vial, Alexandre

    2012-01-01

    We present an approximate solution for the downward time of travel in the case of a mass falling with a linear drag force. We show how a quasi-analytical solution implying the Lambert function can be found. We also show that solving the previous problem is equivalent to the search for Wien's displacement law. These results can be of interest for undergraduate students, as they show that some transcendental equations found in physics may be solved without purely numerical methods. Moreover, as will be seen in the case of Wien's displacement law, solutions based on series expansion can be very accurate even with few terms. (paper)

  11. Extended Krylov subspaces approximations of matrix functions. Application to computational electromagnetics

    Druskin, V.; Lee, Ping [Schlumberger-Doll Research, Ridgefield, CT (United States); Knizhnerman, L. [Central Geophysical Expedition, Moscow (Russian Federation)

    1996-12-31

    There is now a growing interest in the area of using Krylov subspace approximations to compute the actions of matrix functions. The main application of this approach is the solution of ODE systems, obtained after discretization of partial differential equations by method of lines. In the event that the cost of computing the matrix inverse is relatively inexpensive, it is sometimes attractive to solve the ODE using the extended Krylov subspaces, originated by actions of both positive and negative matrix powers. Examples of such problems can be found frequently in computational electromagnetics.

  12. Study on Feasibility of Applying Function Approximation Moment Method to Achieve Reliability-Based Design Optimization

    Huh, Jae Sung; Kwak, Byung Man

    2011-01-01

    Robust optimization or reliability-based design optimization are some of the methodologies that are employed to take into account the uncertainties of a system at the design stage. For applying such methodologies to solve industrial problems, accurate and efficient methods for estimating statistical moments and failure probability are required, and further, the results of sensitivity analysis, which is needed for searching direction during the optimization process, should also be accurate. The aim of this study is to employ the function approximation moment method into the sensitivity analysis formulation, which is expressed as an integral form, to verify the accuracy of the sensitivity results, and to solve a typical problem of reliability-based design optimization. These results are compared with those of other moment methods, and the feasibility of the function approximation moment method is verified. The sensitivity analysis formula with integral form is the efficient formulation for evaluating sensitivity because any additional function calculation is not needed provided the failure probability or statistical moments are calculated

  13. Energy spectrum inverse problem of q -deformed harmonic oscillator and WBK approximation

    Sang, Nguyen Anh; Thuy, Do Thi Thu; Loan, Nguyen Thi Ha; Lan, Nguyen Tri; Viet, Nguyen Ai

    2016-01-01

    Using the connection between q-deformed harmonic oscillator and Morse-like anharmonic potential we investigate the energy spectrum inverse problem. Consider some energy levels of energy spectrum of q -deformed harmonic oscillator are known, we construct the corresponding Morse-like potential then find out the deform parameter q . The application possibility of using the WKB approximation in the energy spectrum inverse problem was discussed for the cases of parabolic potential (harmonic oscillator), Morse-like potential ( q -deformed harmonic oscillator). so we consider our deformed-three-levels simple model, where the set-parameters of Morse potential and the corresponding set-parameters of level deformations are easily and explicitly defined. For practical problems, we propose the deformed- three-levels simple model, where the set-parameters of Morse potential and the corresponding set-parameters of level deformations are easily and explicitly defined. (paper)

  14. Approximate self-consistent potentials for density-functional-theory exchange-correlation functionals

    Cafiero, Mauricio; Gonzalez, Carlos

    2005-01-01

    We show that potentials for exchange-correlation functionals within the Kohn-Sham density-functional-theory framework may be written as potentials for simpler functionals multiplied by a factor close to unity, and in a self-consistent field calculation, these effective potentials find the correct self-consistent solutions. This simple theory is demonstrated with self-consistent exchange-only calculations of the atomization energies of some small molecules using the Perdew-Kurth-Zupan-Blaha (PKZB) meta-generalized-gradient-approximation (meta-GGA) exchange functional. The atomization energies obtained with our method agree with or surpass previous meta-GGA calculations performed in a non-self-consistent manner. The results of this work suggest the utility of this simple theory to approximate exchange-correlation potentials corresponding to energy functionals too complicated to generate closed forms for their potentials. We hope that this method will encourage the development of complex functionals which have correct boundary conditions and are free of self-interaction errors without the worry that the functionals are too complex to differentiate to obtain potentials

  15. H4: A challenging system for natural orbital functional approximations

    Ramos-Cordoba, Eloy; Lopez, Xabier; Piris, Mario; Matito, Eduard

    2015-01-01

    The correct description of nondynamic correlation by electronic structure methods not belonging to the multireference family is a challenging issue. The transition of D 2h to D 4h symmetry in H 4 molecule is among the most simple archetypal examples to illustrate the consequences of missing nondynamic correlation effects. The resurgence of interest in density matrix functional methods has brought several new methods including the family of Piris Natural Orbital Functionals (PNOF). In this work, we compare PNOF5 and PNOF6, which include nondynamic electron correlation effects to some extent, with other standard ab initio methods in the H 4 D 4h /D 2h potential energy surface (PES). Thus far, the wrongful behavior of single-reference methods at the D 2h –D 4h transition of H 4 has been attributed to wrong account of nondynamic correlation effects, whereas in geminal-based approaches, it has been assigned to a wrong coupling of spins and the localized nature of the orbitals. We will show that actually interpair nondynamic correlation is the key to a cusp-free qualitatively correct description of H 4 PES. By introducing interpair nondynamic correlation, PNOF6 is shown to avoid cusps and provide the correct smooth PES features at distances close to the equilibrium, total and local spin properties along with the correct electron delocalization, as reflected by natural orbitals and multicenter delocalization indices

  16. H4: A challenging system for natural orbital functional approximations

    Ramos-Cordoba, Eloy; Lopez, Xabier; Piris, Mario; Matito, Eduard

    2015-10-01

    The correct description of nondynamic correlation by electronic structure methods not belonging to the multireference family is a challenging issue. The transition of D2h to D4h symmetry in H4 molecule is among the most simple archetypal examples to illustrate the consequences of missing nondynamic correlation effects. The resurgence of interest in density matrix functional methods has brought several new methods including the family of Piris Natural Orbital Functionals (PNOF). In this work, we compare PNOF5 and PNOF6, which include nondynamic electron correlation effects to some extent, with other standard ab initio methods in the H4 D4h/D2h potential energy surface (PES). Thus far, the wrongful behavior of single-reference methods at the D2h-D4h transition of H4 has been attributed to wrong account of nondynamic correlation effects, whereas in geminal-based approaches, it has been assigned to a wrong coupling of spins and the localized nature of the orbitals. We will show that actually interpair nondynamic correlation is the key to a cusp-free qualitatively correct description of H4 PES. By introducing interpair nondynamic correlation, PNOF6 is shown to avoid cusps and provide the correct smooth PES features at distances close to the equilibrium, total and local spin properties along with the correct electron delocalization, as reflected by natural orbitals and multicenter delocalization indices.

  17. Approximating Smooth Step Functions Using Partial Fourier Series Sums

    2012-09-01

    interp1(xt(ii), smoothstepbez( t(ii), min(t(ii)), max(t(ii)), ’y’), t(ii), ’linear’, ’ extrap ’); ii = find( abs(t - tau/2) <= epi ); iii = t(ii...interp1( xt(ii), smoothstepbez( rt, min(rt), max(rt), ’y’), t(ii), ’linear’, ’ extrap ’ ); % stepm(ii) = 1 - interp1(xt(ii), smoothstepbez( t(ii...min(t(ii)), max(t(ii)), ’y’), t(ii), ’linear’, ’ extrap ’); In this case, because x is also defined as a function of the independent parameter

  18. Approximate relativistic corrections to atomic radial wave functions

    Cowan, R.D.; Griffin, D.C.

    1976-01-01

    The mass-velocity and Darwin terms of the one-electron-atom Pauli equation have been added to the Hartree-Fock differential equations by using the HX formula to calculate a local central field potential for use in these terms. Introduction of the quantum number j is avoided by omitting the spin-orbit term of the Pauli equation. The major relativistic effects, both direct and indirect, are thereby incorporated into the wave functions, while allowing retention of the commonly used nonrelativistic formulation of energy level calculations. The improvement afforded in calculated total binding energies, excitation energies, spin-orbit parameters, and expectation values of r/sub m/ is comparable with that provided by fully relativistic Dirac-Hartree-Fock calculations

  19. On the solvability of asymmetric quasilinear finite element approximate problems in nonlinear incompressible elasticity

    Ruas, V.

    1982-09-01

    A class of simplicial finite elements for solving incompressible elasticity problems in n-dimensional space, n=2 or 3, is presented. An asymmetric structure of the shape functions with respect to the centroid of the simplex, renders them particularly stable in the large strain case, in which the incompressibility condition is nonlinear. It is proved that under certain assembling conditions of the elements, there exists a solution to the corresponding discrete problems. Numerical examples illustrate the efficiency of the method. (Author) [pt

  20. Application of the finite-difference approximation to electrostatic problems in gaseous proportional counters

    Waligorski, M.P.R.; Urbanczyk, K.M.

    1975-01-01

    The basic principles of the finite-difference approximation applied to the solution of electrostatic field distributions in gaseous proportional counters are given. Using this method, complicated two-dimensional electrostatic problems may be solved, taking into account any number of anodes, each with its own radius, and any cathode shape. A general formula for introducing the anode radii into the calculations is derived and a method of obtaining extremely accurate (up to 0.1%) solutions is developed. Several examples of potential and absolute field distributions for single rectangular and multiwire proportional counters are calculated and compared with exact results according to Tomitani, in order to discuss in detail errors of the finite-difference approximation. (author)

  1. Bridging the gap between the Babinet principle and the physical optics approximation: Vectorial problem

    Kubické, Gildas; Bourlier, Christophe; Delahaye, Morgane; Corbel, Charlotte; Pinel, Nicolas; Pouliguen, Philippe

    2013-09-01

    For a three-dimensional problem and by assuming perfectly electric conducting objects, this paper shows that the Babinet principle (BP) can be derived from the physical optics (PO) approximation. Indeed, following the same idea as Ufimtsev, from the PO approximation and in the far-field zone, the field scattered by an object can be split up into a field which mainly contributes around the specular direction (illuminated zone) and a field which mainly contributes around the forward direction (shadowed zone), which is strongly related to the scattered field obtained from the BP. The only difference resides in the integration surface. We show mathematically that the involved integral does not depend on the shape of the object but only on its contour. Simulations are provided to illustrate the link between BP and PO. The main gain of this work is that it provides a more complete physical insight into the connection between PO and BP.

  2. An analytical approximation scheme to two-point boundary value problems of ordinary differential equations

    Boisseau, Bruno; Forgacs, Peter; Giacomini, Hector

    2007-01-01

    A new (algebraic) approximation scheme to find global solutions of two-point boundary value problems of ordinary differential equations (ODEs) is presented. The method is applicable for both linear and nonlinear (coupled) ODEs whose solutions are analytic near one of the boundary points. It is based on replacing the original ODEs by a sequence of auxiliary first-order polynomial ODEs with constant coefficients. The coefficients in the auxiliary ODEs are uniquely determined from the local behaviour of the solution in the neighbourhood of one of the boundary points. The problem of obtaining the parameters of the global (connecting) solutions, analytic at one of the boundary points, reduces to find the appropriate zeros of algebraic equations. The power of the method is illustrated by computing the approximate values of the 'connecting parameters' for a number of nonlinear ODEs arising in various problems in field theory. We treat in particular the static and rotationally symmetric global vortex, the skyrmion, the Abrikosov-Nielsen-Olesen vortex, as well as the 't Hooft-Polyakov magnetic monopole. The total energy of the skyrmion and of the monopole is also computed by the new method. We also consider some ODEs coming from the exact renormalization group. The ground-state energy level of the anharmonic oscillator is also computed for arbitrary coupling strengths with good precision. (fast track communication)

  3. Analysis of the spectrum of a Cartesian Perfectly Matched Layer (PML) approximation to acoustic scattering problems

    Kim, Seungil

    2010-01-01

    In this paper, we study the spectrum of the operator which results when the Perfectly Matched Layer (PML) is applied in Cartesian geometry to the Laplacian on an unbounded domain. This is often thought of as a complex change of variables or "complex stretching." The reason that such an operator is of interest is that it can be used to provide a very effective domain truncation approach for approximating acoustic scattering problems posed on unbounded domains. Stretching associated with polar or spherical geometry lead to constant coefficient operators outside of a bounded transition layer and so even though they are on unbounded domains, they (and their numerical approximations) can be analyzed by more standard compact perturbation arguments. In contrast, operators associated with Cartesian stretching are non-constant in unbounded regions and hence cannot be analyzed via a compact perturbation approach. Alternatively, to show that the scattering problem PML operator associated with Cartesian geometry is stable for real nonzero wave numbers, we show that the essential spectrum of the higher order part only intersects the real axis at the origin. This enables us to conclude stability of the PML scattering problem from a uniqueness result given in a subsequent publication. © 2009 Elsevier Inc. All rights reserved.

  4. Analytic approximation for the modified Bessel function I -2/3(x)

    Martin, Pablo; Olivares, Jorge; Maass, Fernando

    2017-12-01

    In the present work an analytic approximation to modified Bessel function of negative fractional order I -2/3(x) is presented. The validity of the approximation is for every positive value of the independent variable. The accuracy is high in spite of the small number (4) of parameters used. The approximation is a combination of elementary functions with rational ones. Power series and assymptotic expansions are simultaneously used to obtain the approximation.

  5. Quantum wave packet dynamics with trajectories: Implementation with distributed approximating functionals

    Wyatt, Robert E.; Kouri, Donald J.; Hoffman, David K.

    2000-01-01

    The quantum trajectory method (QTM) was recently developed to solve the hydrodynamic equations of motion in the Lagrangian, moving-with-the-fluid, picture. In this approach, trajectories are integrated for N fluid elements (particles) moving under the influence of both the force from the potential surface and from the quantum potential. In this study, distributed approximating functionals (DAFs) are used on a uniform grid to compute the necessary derivatives in the equations of motion. Transformations between the physical grid where the particle coordinates are defined and the uniform grid are handled through a Jacobian, which is also computed using DAFs. A difficult problem associated with computing derivatives on finite grids is the edge problem. This is handled effectively by using DAFs within a least squares approach to extrapolate from the known function region into the neighboring regions. The QTM-DAF is then applied to wave packet transmission through a one-dimensional Eckart potential. Emphasis is placed upon computation of the transmitted density and wave function. A problem that develops when part of the wave packet reflects back into the reactant region is avoided in this study by introducing a potential ramp to sweep the reflected particles away from the barrier region. (c) 2000 American Institute of Physics

  6. About approximation of integer factorization problem by the combination fixed-point iteration method and Bayesian rounding for quantum cryptography

    Ogorodnikov, Yuri; Khachay, Michael; Pljonkin, Anton

    2018-04-01

    We describe the possibility of employing the special case of the 3-SAT problem stemming from the well known integer factorization problem for the quantum cryptography. It is known, that for every instance of our 3-SAT setting the given 3-CNF is satisfiable by a unique truth assignment, and the goal is to find this assignment. Since the complexity status of the factorization problem is still undefined, development of approximation algorithms and heuristics adopts interest of numerous researchers. One of promising approaches to construction of approximation techniques is based on real-valued relaxation of the given 3-CNF followed by minimizing of the appropriate differentiable loss function, and subsequent rounding of the fractional minimizer obtained. Actually, algorithms developed this way differ by the rounding scheme applied on their final stage. We propose a new rounding scheme based on Bayesian learning. The article shows that the proposed method can be used to determine the security in quantum key distribution systems. In the quantum distribution the Shannon rules is applied and the factorization problem is paramount when decrypting secret keys.

  7. Application of a 2-D approximation technique for solving stress analyses problem in FEM

    H Khawaja

    2016-10-01

    Full Text Available With the advent of computational techniques and methods like finite element method, complex engineering problems are no longer difficult to solve. These methods have helped engineers and designers to simulate and solve engineering problems in much more details than possible with experimental techniques. However, applying these techniques is not a simple task and require lots of acumen, understanding, and experience in obtaining a solution that is as close to an exact solution as possible with minimum computer resources. In this work using the finite element (FE method, stress analyzes of the low-pressure turbine of a small turbofan engine is carried out by employing two different techniques. Initially, a complete solid model of the turbine is prepared which is then finite element modelled with the eight-node brick element. Stresses are calculated using this model. Subsequently, the same turbine is modelled with four-node shell element for calculation of stresses. Material properties, applied loads (inertial, aerodynamic, and thermal, and constraints were same for both the cases. Authors have developed a “2-D approximation technique” to approximate a 3-D problem into a 2-D problem to study the saving invaluable computational time and resources. In this statistics technique, the 3-D domain of variable thickness is divided into many small areas of constant thickness. It is ensured that the value of the thickness for each sub-area is the correct representative thickness of that sub area, and it is within three sigma limit. The results revealed that technique developed is accurate, less time consuming and computational effort saving; the stresses obtained by 2-D technique are within five percent of 3-D results. The solution is obtained in CPU time which is six times less than the 3-D model. Similarly, the number of nodes and elements are more than ten times less than that of the 3-D model. ANSYS ® was used in this work.

  8. The generalized successive approximation and Padé Approximants method for solving an elasticity problem of based on the elastic ground with variable coefficients

    Mustafa Bayram

    2017-01-01

    Full Text Available In this study, we have applied a generalized successive numerical technique to solve the elasticity problem of based on the elastic ground with variable coefficient. In the first stage, we have calculated the generalized successive approximation of being given BVP and in the second stage we have transformed it into Padé series. At the end of study a test problem has been given to clarify the method.

  9. Single image super-resolution based on approximated Heaviside functions and iterative refinement

    Wang, Xin-Yu; Huang, Ting-Zhu; Deng, Liang-Jian

    2018-01-01

    One method of solving the single-image super-resolution problem is to use Heaviside functions. This has been done previously by making a binary classification of image components as “smooth” and “non-smooth”, describing these with approximated Heaviside functions (AHFs), and iteration including l1 regularization. We now introduce a new method in which the binary classification of image components is extended to different degrees of smoothness and non-smoothness, these components being represented by various classes of AHFs. Taking into account the sparsity of the non-smooth components, their coefficients are l1 regularized. In addition, to pick up more image details, the new method uses an iterative refinement for the residuals between the original low-resolution input and the downsampled resulting image. Experimental results showed that the new method is superior to the original AHF method and to four other published methods. PMID:29329298

  10. Inverse scattering problem for a magnetic field in the Glauber approximation

    Bogdanov, I.V.

    1985-01-01

    New results in the general theory of scattering are obtained. An inverse problem at fixed energy for an axisymmetric magnetic field is formulated and solved within the frames of the quantum-mechanical Glauber approximation. The solution is found in quadratures in the form of an explicit inversion algorithm reproducing a vector potential by the angular dependence of the scattering amplitude. Extreme transitions from the eikonal inversion method to the classical and Born ones are investigated. Integral and differential equations are derived for the eikonal amplitude that ensure the real value of the vector potential and its energy independence. Magnetoelectric analogies the existence of equivalent axisymmetric electric and magnetic fields scattering charged particles in the same manner both in the Glauber and Born approximation are established. The mentioned analogies permit to simulate ion-potential scattering by potential one that is of interest from the practical viewpoint. Three-dimensional (excentral) eikonal inverse problems for the electric and magnetic fields are discussed. The results of the paper can be used in electron optics

  11. On-the-energy-shell approximation for the heavy ion couple-channels problems

    Carlson, B.V.; Hussein, M.S.

    Starting with the coupled channels equations describing multiple Coulomb excitations in heavy ion collisions an approximation scheme is developed based on replacing the channel Green's functions by their on-the-energy shell forms, which permits an exact analytic solution for the scattering matrix. The trivially equivalent Coulomb polarization potential valid for strong coupling and small energy loss in the excitation processes is constructed. This potential is seen to have a very simple r-dependence. A simple formula for the sub-barrier elastic scattering cross section is then derived both by using the WRB approximation and by summing the Born series for the T-matrix. Comparison of the two forms for the elastic cross section shows that they give almost identical numerical results in the small coupling limit only. The results are also compared with the predictions of the Alder-Winther theory. (Author) [pt

  12. Universal approximators for multi-objective direct policy search in water reservoir management problems: a comparative analysis

    Giuliani, Matteo; Mason, Emanuele; Castelletti, Andrea; Pianosi, Francesca

    2014-05-01

    The optimal operation of water resources systems is a wide and challenging problem due to non-linearities in the model and the objectives, high dimensional state-control space, and strong uncertainties in the hydroclimatic regimes. The application of classical optimization techniques (e.g., SDP, Q-learning, gradient descent-based algorithms) is strongly limited by the dimensionality of the system and by the presence of multiple, conflicting objectives. This study presents a novel approach which combines Direct Policy Search (DPS) and Multi-Objective Evolutionary Algorithms (MOEAs) to solve high-dimensional state and control space problems involving multiple objectives. DPS, also known as parameterization-simulation-optimization in the water resources literature, is a simulation-based approach where the reservoir operating policy is first parameterized within a given family of functions and, then, the parameters optimized with respect to the objectives of the management problem. The selection of a suitable class of functions to which the operating policy belong to is a key step, as it might restrict the search for the optimal policy to a subspace of the decision space that does not include the optimal solution. In the water reservoir literature, a number of classes have been proposed. However, many of these rules are based largely on empirical or experimental successes and they were designed mostly via simulation and for single-purpose reservoirs. In a multi-objective context similar rules can not easily inferred from the experience and the use of universal function approximators is generally preferred. In this work, we comparatively analyze two among the most common universal approximators: artificial neural networks (ANN) and radial basis functions (RBF) under different problem settings to estimate their scalability and flexibility in dealing with more and more complex problems. The multi-purpose HoaBinh water reservoir in Vietnam, accounting for hydropower

  13. High-Dimensional Function Approximation With Neural Networks for Large Volumes of Data.

    Andras, Peter

    2018-02-01

    Approximation of high-dimensional functions is a challenge for neural networks due to the curse of dimensionality. Often the data for which the approximated function is defined resides on a low-dimensional manifold and in principle the approximation of the function over this manifold should improve the approximation performance. It has been show that projecting the data manifold into a lower dimensional space, followed by the neural network approximation of the function over this space, provides a more precise approximation of the function than the approximation of the function with neural networks in the original data space. However, if the data volume is very large, the projection into the low-dimensional space has to be based on a limited sample of the data. Here, we investigate the nature of the approximation error of neural networks trained over the projection space. We show that such neural networks should have better approximation performance than neural networks trained on high-dimensional data even if the projection is based on a relatively sparse sample of the data manifold. We also find that it is preferable to use a uniformly distributed sparse sample of the data for the purpose of the generation of the low-dimensional projection. We illustrate these results considering the practical neural network approximation of a set of functions defined on high-dimensional data including real world data as well.

  14. Continuous Problem of Function Continuity

    Jayakody, Gaya; Zazkis, Rina

    2015-01-01

    We examine different definitions presented in textbooks and other mathematical sources for "continuity of a function at a point" and "continuous function" in the context of introductory level Calculus. We then identify problematic issues related to definitions of continuity and discontinuity: inconsistency and absence of…

  15. Approximate solution of the Saha equation - temperature as an explicit function of particle densities

    Sato, M.

    1991-01-01

    The Saha equation for a plasma in thermodynamic equilibrium (TE) is approximately solved to give the temperature as an explicit function of population densities. It is shown that the derived expressions for the Saha temperature are valid approximations to the exact solution. An application of the approximate temperature to the calculation of TE plasma parameters is also described. (orig.)

  16. On function classes related pertaining to strong approximation of double Fourier series

    Baituyakova, Zhuldyz

    2015-09-01

    The investigation of embedding of function classes began a long time ago. After Alexits [1], Leindler [2], and Gogoladze[3] investigated estimates of strong approximation by Fourier series in 1965, G. Freud[4] raised the corresponding saturation problem in 1969. The list of the authors dealing with embedding problems partly is also very long. It suffices to mention some names: V. G. Krotov, W. Lenski, S. M. Mazhar, J. Nemeth, E. M. Nikisin, K. I. Oskolkov, G. Sunouchi, J. Szabados, R. Taberski and V. Totik. Study on this topic has since been carried on over a decade, but it seems that most of the results obtained are limited to the case of one dimension. In this paper, embedding results are considered which arise in the strong approximation by double Fourier series. We prove theorem on the interrelation between the classes Wr1,r2HS,M ω and H(λ, p, r1, r2, ω(δ1, δ2)), in the one-dimensional case proved by L. Leindler.

  17. Mixed-hybrid finite element method for the transport equation and diffusion approximation of transport problems

    Cartier, J.

    2006-04-01

    This thesis focuses on mathematical analysis, numerical resolution and modelling of the transport equations. First of all, we deal with numerical approximation of the solution of the transport equations by using a mixed-hybrid scheme. We derive and study a mixed formulation of the transport equation, then we analyse the related variational problem and present the discretization and the main properties of the scheme. We particularly pay attention to the behavior of the scheme and we show its efficiency in the diffusion limit (when the mean free path is small in comparison with the characteristic length of the physical domain). We present academical benchmarks in order to compare our scheme with other methods in many physical configurations and validate our method on analytical test cases. Unstructured and very distorted meshes are used to validate our scheme. The second part of this thesis deals with two transport problems. The first one is devoted to the study of diffusion due to boundary conditions in a transport problem between two plane plates. The second one consists in modelling and simulating radiative transfer phenomenon in case of the industrial context of inertial confinement fusion. (author)

  18. Approximation by rational functions as processing method, analysis and transformation of neutron data

    Gaj, E.V.; Badikov, S.A.; Gusejnov, M.A.; Rabotnov, N.S.

    1988-01-01

    Possible applications of rational functions in the analysis of neutron cross sections, angular distributions and neutron constants generation are described. Results of investigations made in this direction, which have been obtained after the preceding conference in Kiev, are presented: the method of simultaneous treatment of several cross sections for one compound nucleus in the resonance range; the use of the Pade approximation for elastically scattered neutron angular distribution approximation; obtaining of subgroup constants on the basis of rational approximation of cross section functional dependence on dilution cross section; the first experience in function approximation by two variables

  19. Approximation and hardness results for the maximum edge q-coloring problem

    Adamaszek, Anna Maria; Popa, Alexandru

    2016-01-01

    We consider the problem of coloring edges of a graph subject to the following constraints: for every vertex v, all the edges incident with v have to be colored with at most q colors. The goal is to find a coloring satisfying the above constraints and using the maximum number of colors. Notice...... ϵ>0 and any q≥2 assuming the unique games conjecture (UGC), or 1+−ϵ for any ϵ>0 and any q≥3 (≈1.19 for q=2) assuming P≠NP. These results hold even when the considered graphs are bipartite. On the algorithmic side, we restrict to the case q=2, since this is the most important in practice and we show...... a 5/3-approximation algorithm for graphs which have a perfect matching....

  20. Criteria for the reliability of numerical approximations to the solution of fluid flow problems

    Foias, C.

    1986-01-01

    The numerical approximation of the solutions of fluid flows models is a difficult problem in many cases of energy research. In all numerical methods implementable on digital computers, a basic question is if the number N of elements (Galerkin modes, finite-difference cells, finite-elements, etc.) is sufficient to describe the long time behavior of the exact solutions. It was shown using several approaches that some of the estimates based on physical intuition of N are rigorously valid under very general conditions and follow directly from the mathematical theory of the Navier-Stokes equations. Among the mathematical approaches to these estimates, the most promising (which can be and was already applied to many other dissipative partial differential systems) consists in giving upper estimates to the fractal dimension of the attractor associated to one (or all) solution(s) of the respective partial differential equations. 56 refs

  1. Accurate gradient approximation for complex interface problems in 3D by an improved coupling interface method

    Shu, Yu-Chen, E-mail: ycshu@mail.ncku.edu.tw [Department of Mathematics, National Cheng Kung University, Tainan 701, Taiwan (China); Mathematics Division, National Center for Theoretical Sciences (South), Tainan 701, Taiwan (China); Chern, I-Liang, E-mail: chern@math.ntu.edu.tw [Department of Applied Mathematics, National Chiao Tung University, Hsin Chu 300, Taiwan (China); Department of Mathematics, National Taiwan University, Taipei 106, Taiwan (China); Mathematics Division, National Center for Theoretical Sciences (Taipei Office), Taipei 106, Taiwan (China); Chang, Chien C., E-mail: mechang@iam.ntu.edu.tw [Institute of Applied Mechanics, National Taiwan University, Taipei 106, Taiwan (China); Department of Mathematics, National Taiwan University, Taipei 106, Taiwan (China)

    2014-10-15

    Most elliptic interface solvers become complicated for complex interface problems at those “exceptional points” where there are not enough neighboring interior points for high order interpolation. Such complication increases especially in three dimensions. Usually, the solvers are thus reduced to low order accuracy. In this paper, we classify these exceptional points and propose two recipes to maintain order of accuracy there, aiming at improving the previous coupling interface method [26]. Yet the idea is also applicable to other interface solvers. The main idea is to have at least first order approximations for second order derivatives at those exceptional points. Recipe 1 is to use the finite difference approximation for the second order derivatives at a nearby interior grid point, whenever this is possible. Recipe 2 is to flip domain signatures and introduce a ghost state so that a second-order method can be applied. This ghost state is a smooth extension of the solution at the exceptional point from the other side of the interface. The original state is recovered by a post-processing using nearby states and jump conditions. The choice of recipes is determined by a classification scheme of the exceptional points. The method renders the solution and its gradient uniformly second-order accurate in the entire computed domain. Numerical examples are provided to illustrate the second order accuracy of the presently proposed method in approximating the gradients of the original states for some complex interfaces which we had tested previous in two and three dimensions, and a real molecule ( (1D63)) which is double-helix shape and composed of hundreds of atoms.

  2. Rigorous approximation of stationary measures and convergence to equilibrium for iterated function systems

    Galatolo, Stefano; Monge, Maurizio; Nisoli, Isaia

    2016-01-01

    We study the problem of the rigorous computation of the stationary measure and of the rate of convergence to equilibrium of an iterated function system described by a stochastic mixture of two or more dynamical systems that are either all uniformly expanding on the interval, either all contracting. In the expanding case, the associated transfer operators satisfy a Lasota–Yorke inequality, we show how to compute a rigorous approximations of the stationary measure in the L "1 norm and an estimate for the rate of convergence. The rigorous computation requires a computer-aided proof of the contraction of the transfer operators for the maps, and we show that this property propagates to the transfer operators of the IFS. In the contracting case we perform a rigorous approximation of the stationary measure in the Wasserstein–Kantorovich distance and rate of convergence, using the same functional analytic approach. We show that a finite computation can produce a realistic computation of all contraction rates for the whole parameter space. We conclude with a description of the implementation and numerical experiments. (paper)

  3. Approximation Of Multi-Valued Inverse Functions Using Clustering And Sugeno Fuzzy Inference

    Walden, Maria A.; Bikdash, Marwan; Homaifar, Abdollah

    1998-01-01

    Finding the inverse of a continuous function can be challenging and computationally expensive when the inverse function is multi-valued. Difficulties may be compounded when the function itself is difficult to evaluate. We show that we can use fuzzy-logic approximators such as Sugeno inference systems to compute the inverse on-line. To do so, a fuzzy clustering algorithm can be used in conjunction with a discriminating function to split the function data into branches for the different values of the forward function. These data sets are then fed into a recursive least-squares learning algorithm that finds the proper coefficients of the Sugeno approximators; each Sugeno approximator finds one value of the inverse function. Discussions about the accuracy of the approximation will be included.

  4. Efficient second order Algorithms for Function Approximation with Neural Networks. Application to Sextic Potentials

    Gougam, L.A.; Taibi, H.; Chikhi, A.; Mekideche-Chafa, F.

    2009-01-01

    The problem of determining the analytical description for a set of data arises in numerous sciences and applications and can be referred to as data modeling or system identification. Neural networks are a convenient means of representation because they are known to be universal approximates that can learn data. The desired task is usually obtained by a learning procedure which consists in adjusting the s ynaptic weights . For this purpose, many learning algorithms have been proposed to update these weights. The convergence for these learning algorithms is a crucial criterion for neural networks to be useful in different applications. The aim of the present contribution is to use a training algorithm for feed forward wavelet networks used for function approximation. The training is based on the minimization of the least-square cost function. The minimization is performed by iterative second order gradient-based methods. We make use of the Levenberg-Marquardt algorithm to train the architecture of the chosen network and, then, the training procedure starts with a simple gradient method which is followed by a BFGS (Broyden, Fletcher, Glodfarb et Shanno) algorithm. The performances of the two algorithms are then compared. Our method is then applied to determine the energy of the ground state associated to a sextic potential. In fact, the Schrodinger equation does not always admit an exact solution and one has, generally, to solve it numerically. To this end, the sextic potential is, firstly, approximated with the above outlined wavelet network and, secondly, implemented into a numerical scheme. Our results are in good agreement with the ones found in the literature.

  5. Scattering of particles with inclusions. Modeling and inverse problem solution in the Rayleigh-Gans approximation

    Otero, F A; Frontini, G L; Elicabe, G E

    2011-01-01

    An analytic model for the scattering of a spherical particle with spherical inclusions has been proposed under the RG approximation. The model can be used without limitations to describe an X-ray scattering experiment. However, for light scattering several conditions must be fulfilled. Based on this model an inverse methodology is proposed to estimate the radii of host particle and inclusions, the number of inclusions and the Distance Distribution Functions (DDF's) of the distances between inclusions and the distances between inclusions and the origin of coordinates. The methodology is numerically tested in a light scattering example in which the host particle is eliminated by matching the refractive indices of host particle and medium. The results obtained for this cluster particle are very satisfactory.

  6. Bound-state problem in the light-front Tamm-Dancoff approximation: Numerical study in 1+1 dimensions

    Harindranath, A.; Perry, R.J.; Shigemitsu, J.

    1992-01-01

    Numerical solutions to the two-fermion bound-state problem in the (1+1)-dimensional Yukawa model are presented within the lowest-order light-front Tamm-Dancoff approximation (i.e., keeping only two-fermion and two-fermion--one-boson sectors). Our motivation is twofold. First, we want to understand the dynamics of the model from the very-weak-coupling domain, where the system is governed by nonrelativistic dynamics, to moderate and strong-coupling domains where retardation and self-energy effects become important. Second, we want to develop techniques for solving coupled Tamm-Dancoff integral equations, in particular, methods that can be generalized to higher-order Tamm-Dancoff approximations. To achieve the first goal we first simplify the problem considerably (from a numerical point of view) by the explicit elimination of the higher Fock-space sector. The resulting integral equation, whose kernel depends upon the invariant mass of the state, is solved for the coupling constant, for a given set of the invariant mass and fermion and boson mass parameters. To achieve the second goal we solve the coupled set of equations using both basis functions and direct-discretization techniques. Results from these more general techniques are compared with the explicit-elimination method

  7. Application of modified analytical function for approximation and computer simulation of diffraction profile

    Marrero, S. I.; Turibus, S. N.; Assis, J. T. De; Monin, V. I.

    2011-01-01

    Data processing of the most of diffraction experiments is based on determination of diffraction line position and measurement of broadening of diffraction profile. High precision and digitalisation of these procedures can be resolved by approximation of experimental diffraction profiles by analytical functions. There are various functions for these purposes both simples, like Gauss function, but no suitable for wild range of experimental profiles and good approximating functions but complicated for practice using, like Vougt or PersonVII functions. Proposed analytical function is modified Cauchy function which uses two variable parameters allowing describing any experimental diffraction profile. In the presented paper modified function was applied for approximation of diffraction lines of steels after various physical and mechanical treatments and simulation of diffraction profiles applied for study of stress gradients and distortions of crystal structure. (Author)

  8. A new way of obtaining analytic approximations of Chandrasekhar's H function

    Vukanic, J.; Arsenovic, D.; Davidovic, D.

    2007-01-01

    Applying the mean value theorem for definite integrals in the non-linear integral equation for Chandrasekhar's H function describing conservative isotropic scattering, we have derived a new, simple analytic approximation for it, with a maximal relative error below 2.5%. With this new function as a starting-point, after a single iteration in the corresponding integral equation, we have obtained a new, highly accurate analytic approximation for the H function. As its maximal relative error is below 0.07%, it significantly surpasses the accuracy of other analytic approximations

  9. Approximate Bayesian computation for modular inference problems with many parameters: the example of migration rates.

    Aeschbacher, S; Futschik, A; Beaumont, M A

    2013-02-01

    We propose a two-step procedure for estimating multiple migration rates in an approximate Bayesian computation (ABC) framework, accounting for global nuisance parameters. The approach is not limited to migration, but generally of interest for inference problems with multiple parameters and a modular structure (e.g. independent sets of demes or loci). We condition on a known, but complex demographic model of a spatially subdivided population, motivated by the reintroduction of Alpine ibex (Capra ibex) into Switzerland. In the first step, the global parameters ancestral mutation rate and male mating skew have been estimated for the whole population in Aeschbacher et al. (Genetics 2012; 192: 1027). In the second step, we estimate in this study the migration rates independently for clusters of demes putatively connected by migration. For large clusters (many migration rates), ABC faces the problem of too many summary statistics. We therefore assess by simulation if estimation per pair of demes is a valid alternative. We find that the trade-off between reduced dimensionality for the pairwise estimation on the one hand and lower accuracy due to the assumption of pairwise independence on the other depends on the number of migration rates to be inferred: the accuracy of the pairwise approach increases with the number of parameters, relative to the joint estimation approach. To distinguish between low and zero migration, we perform ABC-type model comparison between a model with migration and one without. Applying the approach to microsatellite data from Alpine ibex, we find no evidence for substantial gene flow via migration, except for one pair of demes in one direction. © 2013 Blackwell Publishing Ltd.

  10. Characterization of the best polynomial approximation with a sign-sensitive weight to a continuous function

    Ramazanov, A.-R K

    2005-01-01

    Necessary and sufficient conditions for the best polynomial approximation with an arbitrary and, generally speaking, unbounded sign-sensitive weight to a continuous function are obtained; the components of the weight can also take infinite values, therefore the conditions obtained cover, in particular, approximation with interpolation at fixed points and one-sided approximation; in the case of the weight with components equal to 1 one arrives at Chebyshev's classical alternation theorem.

  11. On Pointwise Approximation of Conjugate Functions by Some Hump Matrix Means of Conjugate Fourier Series

    W. Łenski

    2015-01-01

    Full Text Available The results generalizing some theorems on N, pnE, γ summability are shown. The same degrees of pointwise approximation as in earlier papers by weaker assumptions on considered functions and examined summability methods are obtained. From presented pointwise results, the estimation on norm approximation is derived. Some special cases as corollaries are also formulated.

  12. Delta-function Approximation SSC Model in 3C 273 S. J. Kang1 ...

    Abstract. We obtain an approximate analytical solution using δ approximate calculation on the traditional one-zone synchrotron self-. Compton (SSC) model. In this model, we describe the electron energy distribution by a broken power-law function with a sharp cut-off, and non- thermal photons are produced by both ...

  13. Modulated Pade approximant

    Ginsburg, C.A.

    1980-01-01

    In many problems, a desired property A of a function f(x) is determined by the behaviour of f(x) approximately equal to g(x,A) as x→xsup(*). In this letter, a method for resuming the power series in x of f(x) and approximating A (modulated Pade approximant) is presented. This new approximant is an extension of a resumation method for f(x) in terms of rational functions. (author)

  14. Efficient approximation of the Struve functions Hn occurring in the calculation of sound radiation quantities.

    Aarts, Ronald M; Janssen, Augustus J E M

    2016-12-01

    The Struve functions H n (z), n=0, 1, ...  are approximated in a simple, accurate form that is valid for all z≥0. The authors previously treated the case n = 1 that arises in impedance calculations for the rigid-piston circular radiator mounted in an infinite planar baffle [Aarts and Janssen, J. Acoust. Soc. Am. 113, 2635-2637 (2003)]. The more general Struve functions occur when other acoustical quantities and/or non-rigid pistons are considered. The key step in the paper just cited is to express H 1 (z) as (2/π)-J 0 (z)+(2/π) I(z), where J 0 is the Bessel function of order zero and the first kind and I(z) is the Fourier cosine transform of [(1-t)/(1+t)] 1/2 , 0≤t≤1. The square-root function is optimally approximated by a linear function ĉt+d̂, 0≤t≤1, and the resulting approximated Fourier integral is readily computed explicitly in terms of sin z/z and (1-cos z)/z 2 . The same approach has been used by Maurel, Pagneux, Barra, and Lund [Phys. Rev. B 75, 224112 (2007)] to approximate H 0 (z) for all z≥0. In the present paper, the square-root function is optimally approximated by a piecewise linear function consisting of two linear functions supported by [0,t̂ 0 ] and [t̂ 0 ,1] with t̂ 0 the optimal take-over point. It is shown that the optimal two-piece linear function is actually continuous at the take-over point, causing a reduction of the additional complexity in the resulting approximations of H 0 and H 1 . Furthermore, this allows analytic computation of the optimal two-piece linear function. By using the two-piece instead of the one-piece linear approximation, the root mean square approximation error is reduced by roughly a factor of 3 while the maximum approximation error is reduced by a factor of 4.5 for H 0 and of 2.6 for H 1 . Recursion relations satisfied by Struve functions, initialized with the approximations of H 0 and H 1 , yield approximations for higher order Struve functions.

  15. General theory for calculating disorder-averaged Green's function correlators within the coherent potential approximation

    Zhou, Chenyi; Guo, Hong

    2017-01-01

    We report a diagrammatic method to solve the general problem of calculating configurationally averaged Green's function correlators that appear in quantum transport theory for nanostructures containing disorder. The theory treats both equilibrium and nonequilibrium quantum statistics on an equal footing. Since random impurity scattering is a problem that cannot be solved exactly in a perturbative approach, we combine our diagrammatic method with the coherent potential approximation (CPA) so that a reliable closed-form solution can be obtained. Our theory not only ensures the internal consistency of the diagrams derived at different levels of the correlators but also satisfies a set of Ward-like identities that corroborate the conserving consistency of transport calculations within the formalism. The theory is applied to calculate the quantum transport properties such as average ac conductance and transmission moments of a disordered tight-binding model, and results are numerically verified to high precision by comparing to the exact solutions obtained from enumerating all possible disorder configurations. Our formalism can be employed to predict transport properties of a wide variety of physical systems where disorder scattering is important.

  16. Leak Isolation in Pressurized Pipelines using an Interpolation Function to approximate the Fitting Losses

    Badillo-Olvera, A.; Begovich, O.; Peréz-González, A.

    2017-01-01

    The present paper is motivated by the purpose of detection and isolation of a single leak considering the Fault Model Approach (FMA) focused on pipelines with changes in their geometry. These changes generate a different pressure drop that those produced by the friction, this phenomenon is a common scenario in real pipeline systems. The problem arises, since the dynamical model of the fluid in a pipeline only considers straight geometries without fittings. In order to address this situation, several papers work with a virtual model of a pipeline that generates a equivalent straight length, thus, friction produced by the fittings is taking into account. However, when this method is applied, the leak is isolated in a virtual length, which for practical reasons does not represent a complete solution. This research proposes as a solution to the problem of leak isolation in a virtual length, the use of a polynomial interpolation function in order to approximate the conversion of the virtual position to a real-coordinates value. Experimental results in a real prototype are shown, concluding that the proposed methodology has a good performance.

  17. Approximation of functions in two variables by some linear positive operators

    Mariola Skorupka

    1995-12-01

    Full Text Available We introduce some linear positive operators of the Szasz-Mirakjan type in the weighted spaces of continuous functions in two variables. We study the degree of the approximation of functions by these operators. The similar results for functions in one variable are given in [5]. Some operators of the Szasz-Mirakjan type are examined also in [3], [4].

  18. Using Legendre Functions for Spatial Covariance Approximation and Investigation of Radial Nonisotrophy for NOGAPS Data

    Franke, Richard

    2001-01-01

    .... It was found that for all levels the approximation of the covariance data for pressure height innovations by Legendre functions led to positive coefficients for up to 25 terms except at the some low and high levels...

  19. Integration of large chemical kinetic mechanisms via exponential methods with Krylov approximations to Jacobian matrix functions

    Bisetti, Fabrizio

    2012-01-01

    with the computational cost associated with the time integration of stiff, large chemical systems, a novel approach is proposed. The approach combines an exponential integrator and Krylov subspace approximations to the exponential function of the Jacobian matrix

  20. Spin-Density Functionals from Current-Density Functional Theory and Vice Versa: A Road towards New Approximations

    Capelle, K.; Gross, E.

    1997-01-01

    It is shown that the exchange-correlation functional of spin-density functional theory is identical, on a certain set of densities, with the exchange-correlation functional of current-density functional theory. This rigorous connection is used to construct new approximations of the exchange-correlation functionals. These include a conceptually new generalized-gradient spin-density functional and a nonlocal current-density functional. copyright 1997 The American Physical Society

  1. On the Approximation of Generalized Lipschitz Function by Euler Means of Conjugate Series of Fourier Series

    Kushwaha, Jitendra Kumar

    2013-01-01

    Approximation theory is a very important field which has various applications in pure and applied mathematics. The present study deals with a new theorem on the approximation of functions of Lipschitz class by using Euler's mean of conjugate series of Fourier series. In this paper, the degree of approximation by using Euler's means of conjugate of functions belonging to Lip (ξ(t), p) class has been obtained. Lipα and Lip (α, p) classes are the particular cases of Lip (ξ(t), p) class. The main result of this paper generalizes some well-known results in this direction. PMID:24379744

  2. Correlation energy functional within the GW -RPA: Exact forms, approximate forms, and challenges

    Ismail-Beigi, Sohrab

    2010-05-01

    In principle, the Luttinger-Ward Green’s-function formalism allows one to compute simultaneously the total energy and the quasiparticle band structure of a many-body electronic system from first principles. We present approximate and exact expressions for the correlation energy within the GW -random-phase approximation that are more amenable to computation and allow for developing efficient approximations to the self-energy operator and correlation energy. The exact form is a sum over differences between plasmon and interband energies. The approximate forms are based on summing over screened interband transitions. We also demonstrate that blind extremization of such functionals leads to unphysical results: imposing physical constraints on the allowed solutions (Green’s functions) is necessary. Finally, we present some relevant numerical results for atomic systems.

  3. A functional-type a posteriori error estimate of approximate solutions for Reissner-Mindlin plates and its implementation

    Frolov, Maxim; Chistiakova, Olga

    2017-06-01

    Paper is devoted to a numerical justification of the recent a posteriori error estimate for Reissner-Mindlin plates. This majorant provides a reliable control of accuracy of any conforming approximate solution of the problem including solutions obtained with commercial software for mechanical engineering. The estimate is developed on the basis of the functional approach and is applicable to several types of boundary conditions. To verify the approach, numerical examples with mesh refinements are provided.

  4. Approximations of Fuzzy Systems

    Vinai K. Singh

    2013-03-01

    Full Text Available A fuzzy system can uniformly approximate any real continuous function on a compact domain to any degree of accuracy. Such results can be viewed as an existence of optimal fuzzy systems. Li-Xin Wang discussed a similar problem using Gaussian membership function and Stone-Weierstrass Theorem. He established that fuzzy systems, with product inference, centroid defuzzification and Gaussian functions are capable of approximating any real continuous function on a compact set to arbitrary accuracy. In this paper we study a similar approximation problem by using exponential membership functions

  5. NONSTANDARD PROBLEMS IN STUDYING THE PROPERTIES FUNCTIONS.

    V. I. Kuzmich

    2010-06-01

    Full Text Available In this paper we consider two non-standard problems that may be offered to students for independent solution in the study of fundamental properties of functions in the course of mathematical analysis. These tasks are wearing creativity and contribute to a better understanding of students to concepts such as monotonicity and continuity of the function.

  6. Many-body perturbation theory using the density-functional concept: beyond the GW approximation.

    Bruneval, Fabien; Sottile, Francesco; Olevano, Valerio; Del Sole, Rodolfo; Reining, Lucia

    2005-05-13

    We propose an alternative formulation of many-body perturbation theory that uses the density-functional concept. Instead of the usual four-point integral equation for the polarizability, we obtain a two-point one, which leads to excellent optical absorption and energy-loss spectra. The corresponding three-point vertex function and self-energy are then simply calculated via an integration, for any level of approximation. Moreover, we show the direct impact of this formulation on the time-dependent density-functional theory. Numerical results for the band gap of bulk silicon and solid argon illustrate corrections beyond the GW approximation for the self-energy.

  7. Physical Applications of a Simple Approximation of Bessel Functions of Integer Order

    Barsan, V.; Cojocaru, S.

    2007-01-01

    Applications of a simple approximation of Bessel functions of integer order, in terms of trigonometric functions, are discussed for several examples from electromagnetism and optics. The method may be applied in the intermediate regime, bridging the "small values regime" and the "asymptotic" one, and covering, in this way, an area of great…

  8. Rate-distortion functions of non-stationary Markoff chains and their block-independent approximations

    Agarwal, Mukul

    2018-01-01

    It is proved that the limit of the normalized rate-distortion functions of block independent approximations of an irreducible, aperiodic Markoff chain is independent of the initial distribution of the Markoff chain and thus, is also equal to the rate-distortion function of the Markoff chain.

  9. Local density approximation for exchange in excited-state density functional theory

    Harbola, Manoj K.; Samal, Prasanjit

    2004-01-01

    Local density approximation for the exchange energy is made for treatment of excited-states in density-functional theory. It is shown that taking care of the state-dependence of the LDA exchange energy functional leads to accurate excitation energies.

  10. The World of Combinatorial Fuzzy Problems and the Efficiency of Fuzzy Approximation Algorithms

    Yamakami, Tomoyuki

    2015-01-01

    We re-examine a practical aspect of combinatorial fuzzy problems of various types, including search, counting, optimization, and decision problems. We are focused only on those fuzzy problems that take series of fuzzy input objects and produce fuzzy values. To solve such problems efficiently, we design fast fuzzy algorithms, which are modeled by polynomial-time deterministic fuzzy Turing machines equipped with read-only auxiliary tapes and write-only output tapes and also modeled by polynomia...

  11. Numerical analysis of different neural transfer functions used for best approximation

    Gougam, L.A.; Chikhi, A.; Biskri, S.; Chafa, F.

    2006-01-01

    It is widely recognised that the choice of transfer functions in neural networks is of en importance to their performance. In this paper, different neural transfer functions usec approximation are discussed. We begin with sigmoi'dal functions used most often by diffi authors . At a second step, we use Gaussian functions as previously suggested in refere Finally, we deal with a specified wavelet family. A comparison between the three cases < above is made exhibiting therefore the advantages of each transfer function. The approa< function improves as the dimension N of the elementary task basis increases

  12. Neutron spectrometry by means of threshold detectors - Neutron spectrometry by means of activation detectors. Studies of the method of approximation by polygonal function. Application to dose determination

    Bricka, M.

    1962-03-01

    This report addresses the problem of determination of neutron spectrum by using a set of detectors. The spectrum approximation method based on a polygonal function is more particularly studied. The author shows that the coefficients of the usual mathematical model can be simply formulated and assessed. The study of spectra approximation by a polygonal function shows that dose can be expressed by a linear function of the activity of the different detectors [fr

  13. From free energy to expected energy: Improving energy-based value function approximation in reinforcement learning.

    Elfwing, Stefan; Uchibe, Eiji; Doya, Kenji

    2016-12-01

    Free-energy based reinforcement learning (FERL) was proposed for learning in high-dimensional state and action spaces. However, the FERL method does only really work well with binary, or close to binary, state input, where the number of active states is fewer than the number of non-active states. In the FERL method, the value function is approximated by the negative free energy of a restricted Boltzmann machine (RBM). In our earlier study, we demonstrated that the performance and the robustness of the FERL method can be improved by scaling the free energy by a constant that is related to the size of network. In this study, we propose that RBM function approximation can be further improved by approximating the value function by the negative expected energy (EERL), instead of the negative free energy, as well as being able to handle continuous state input. We validate our proposed method by demonstrating that EERL: (1) outperforms FERL, as well as standard neural network and linear function approximation, for three versions of a gridworld task with high-dimensional image state input; (2) achieves new state-of-the-art results in stochastic SZ-Tetris in both model-free and model-based learning settings; and (3) significantly outperforms FERL and standard neural network function approximation for a robot navigation task with raw and noisy RGB images as state input and a large number of actions. Copyright © 2016 The Author(s). Published by Elsevier Ltd.. All rights reserved.

  14. Generalized finite polynomial approximation (WINIMAX) to the reduced partition function of isotopic molecules

    Lee, M.W.; Bigeleisen, J.

    1978-01-01

    The MINIMAX finite polynomial approximation to an arbitrary function has been generalized to include a weighting function (WINIMAX). It is suggested that an exponential is a reasonable weighting function for the logarithm of the reduced partition function of a harmonic oscillator. Comparison of the error function for finite orthogonal polynomial (FOP), MINIMAX, and WINIMAX expansions of the logarithm of the reduced vibrational partition function show WINIMAX to be the best of the three approximations. A condensed table of WINIMAX coefficients is presented. The FOP, MINIMAX, and WINIMAX approximations are compared with exact calculations of the logarithm of the reduced partition function ratios for isotopic substitution in H 2 O, CH 4 , CH 2 O, C 2 H 4 , and C 2 H 6 at 300 0 K. Both deuterium and heavy atom isotope substitution are studied. Except for a third order expansion involving deuterium substitution, the WINIMAX method is superior to FOP and MINIMAX. At the level of a second order expansion WINIMAX approximations to ln(s/s')f are good to 2.5% and 6.5% for deuterium and heavy atom substitution, respectively

  15. Multiconfiguration time-dependent self-consistent field approximations in the numerical solution of quantum dynamical problems

    Kotler, Z.; Neria, E.; Nitzan, A.

    1991-01-01

    The use of the time-dependent self-consistent field approximation (TDSCF) in the numerical solution of quantum curve crossing and tunneling dynamical problems is investigated. Particular emphasis is given to multiconfiguration TDSCF (MCTDSCF) approximations, which are shown to perform considerably better with only a small increase in computational effort. We investigate a number of simple models in which a 'system' characterized by two electronic potential surfaces evolves while interacting with a 'bath' mode described by an harmonic oscillator, and compare exact numerical solutions to one- and two-configuration TDSCF approximations. We also introduce and investigate a semiclassical approximation in which the 'bath' mode is described by semiclassical wavepackets (one for each electronic state) and show that for all models investigated this scheme works very well in comparison with the fully quantum MCTDSCF approximation. This provides a potentially very useful method to simulate strongly quantum systems coupled to an essentially classical environment. (orig.)

  16. Methods and Algorithms for Approximating the Gamma Function and Related Functions. A survey. Part I: Asymptotic Series

    Cristinel Mortici

    2015-01-01

    Full Text Available In this survey we present our recent results on analysis of gamma function and related functions. The results obtained are in the theory of asymptotic analysis, approximation of gamma and polygamma functions, or in the theory of completely monotonic functions. The motivation of this first part is the work of C. Mortici [Product Approximations via Asymptotic Integration Amer. Math. Monthly 117 (2010 434-441] where a simple strategy for constructing asymptotic series is presented. The classical asymptotic series associated to Stirling, Wallis, Glaisher-Kinkelin are rediscovered. In the second section we discuss some new inequalities related to Landau constants and we establish some asymptotic formulas.

  17. Calculation of Resonance Interaction Effects Using a Rational Approximation to the Symmetric Resonance Line Shape Function

    Haeggblom, H.

    1968-08-01

    The method of calculating the resonance interaction effect by series expansions has been studied. Starting from the assumption that the neutron flux in a homogeneous mixture is inversely proportional to the total cross section, the expression for the flux can be simplified by series expansions. Two types of expansions are investigated and it is shown that only one of them is generally applicable. It is also shown that this expansion gives sufficient accuracy if the approximate resonance line shape function is reasonably representative. An investigation is made of the approximation of the resonance shape function with a Gaussian function which in some cases has been used to calculate the interaction effect. It is shown that this approximation is not sufficiently accurate in all cases which can occur in practice. Then, a rational approximation is introduced which in the first order approximation gives the same order of accuracy as a practically exact shape function. The integrations can be made analytically in the complex plane and the method is therefore very fast compared to purely numerical integrations. The method can be applied both to statistically correlated and uncorrelated resonances

  18. Calculation of Resonance Interaction Effects Using a Rational Approximation to the Symmetric Resonance Line Shape Function

    Haeggblom, H

    1968-08-15

    The method of calculating the resonance interaction effect by series expansions has been studied. Starting from the assumption that the neutron flux in a homogeneous mixture is inversely proportional to the total cross section, the expression for the flux can be simplified by series expansions. Two types of expansions are investigated and it is shown that only one of them is generally applicable. It is also shown that this expansion gives sufficient accuracy if the approximate resonance line shape function is reasonably representative. An investigation is made of the approximation of the resonance shape function with a Gaussian function which in some cases has been used to calculate the interaction effect. It is shown that this approximation is not sufficiently accurate in all cases which can occur in practice. Then, a rational approximation is introduced which in the first order approximation gives the same order of accuracy as a practically exact shape function. The integrations can be made analytically in the complex plane and the method is therefore very fast compared to purely numerical integrations. The method can be applied both to statistically correlated and uncorrelated resonances.

  19. Bridge density functional approximation for non-uniform hard core repulsive Yukawa fluid

    Zhou Shiqi

    2008-01-01

    In this work, a bridge density functional approximation (BDFA) (J. Chem. Phys. 112, 8079 (2000)) for a non-uniform hard-sphere fluid is extended to a non-uniform hard-core repulsive Yukawa (HCRY) fluid. It is found that the choice of a bulk bridge functional approximation is crucial for both a uniform HCRY fluid and a non-uniform HCRY fluid. A new bridge functional approximation is proposed, which can accurately predict the radial distribution function of the bulk HCRY fluid. With the new bridge functional approximation and its associated bulk second order direct correlation function as input, the BDFA can be used to well calculate the density profile of the HCRY fluid subjected to the influence of varying external fields, and the theoretical predictions are in good agreement with the corresponding simulation data. The calculated results indicate that the present BDFA captures quantitatively the phenomena such as the coexistence of solid-like high density phase and low density gas phase, and the adsorption properties of the HCRY fluid, which qualitatively differ from those of the fluids combining both hard-core repulsion and an attractive tail. (condensed matter: structure, thermal and mechanical properties)

  20. Balancing Exchange Mixing in Density-Functional Approximations for Iron Porphyrin.

    Berryman, Victoria E J; Boyd, Russell J; Johnson, Erin R

    2015-07-14

    Predicting the correct ground-state multiplicity for iron(II) porphyrin, a high-spin quintet, remains a significant challenge for electronic-structure methods, including commonly employed density functionals. An even greater challenge for these methods is correctly predicting favorable binding of O2 to iron(II) porphyrin, due to the open-shell singlet character of the adduct. In this work, the performance of a modest set of contemporary density-functional approximations is assessed and the results interpreted using Bader delocalization indices. It is found that inclusion of greater proportions of Hartree-Fock exchange, in hybrid or range-separated hybrid functionals, has opposing effects; it improves the ability of the functional to identify the ground state but is detrimental to predicting favorable dioxygen binding. Because of the uncomplementary nature of these properties, accurate prediction of both the relative spin-state energies and the O2 binding enthalpy eludes conventional density-functional approximations.

  1. Determination of a Two Variable Approximation Function with Application to the Fuel Combustion Charts

    Irina-Carmen ANDREI

    2017-09-01

    Full Text Available Following the demands of the design and performance analysis in case of liquid fuel propelled rocket engines, as well as the trajectory optimization, the development of efficient codes, which frequently need to call the Fuel Combustion Charts, became an important matter. This paper presents an efficient solution to the issue; the author has developed an original approach to determine the non-linear approximation function of two variables: the chamber pressure and the nozzle exit pressure ratio. The numerical algorithm based on this two variable approximation function is more efficient due to its simplicity, capability to providing numerical accuracy and prospects for an increased convergence rate of the optimization codes.

  2. Slow Growth and Optimal Approximation of Pseudoanalytic Functions on the Disk

    Devendra Kumar

    2013-07-01

    Full Text Available Pseudoanalytic functions (PAF are constructed as complex combination of real-valued analytic solutions to the Stokes-Betrami System. These solutions include the generalized biaxisymmetric potentials. McCoy [10] considered the approximation of pseudoanalytic functions on the disk. Kumar et al. [9] studied the generalized order and generalized type of PAF in terms of the Fourier coefficients occurring in its local expansion and optimal approximation errors in Bernstein sense on the disk. The aim of this paper is to improve the results of McCoy [10] and Kumar et al. [9]. Our results apply satisfactorily for slow growth.

  3. Improvement of DC Optimal Power Flow Problem Based on Nodal Approximation of Transmission Losses

    M. R. Baghayipour

    2012-03-01

    3-\tIts formulation is simple and easy to understand. Moreover, it can simply be realized in the form of Lagrange representation, makes it possible to be considered as some constraints in the body of any bi-level optimization problem, with its internal level including the OPF problem satisfaction.

  4. Comonotonic approximations for a generalized provisioning problem with application to optimal portfolio selection

    van Weert, K.; Dhaene, J.; Goovaerts, M.

    2011-01-01

    In this paper we discuss multiperiod portfolio selection problems related to a specific provisioning problem. Our results are an extension of Dhaene et al. (2005) [14], where optimal constant mix investment strategies are obtained in a provisioning and savings context, using an analytical approach

  5. A full scale approximation of covariance functions for large spatial data sets

    Sang, Huiyan

    2011-10-10

    Gaussian process models have been widely used in spatial statistics but face tremendous computational challenges for very large data sets. The model fitting and spatial prediction of such models typically require O(n 3) operations for a data set of size n. Various approximations of the covariance functions have been introduced to reduce the computational cost. However, most existing approximations cannot simultaneously capture both the large- and the small-scale spatial dependence. A new approximation scheme is developed to provide a high quality approximation to the covariance function at both the large and the small spatial scales. The new approximation is the summation of two parts: a reduced rank covariance and a compactly supported covariance obtained by tapering the covariance of the residual of the reduced rank approximation. Whereas the former part mainly captures the large-scale spatial variation, the latter part captures the small-scale, local variation that is unexplained by the former part. By combining the reduced rank representation and sparse matrix techniques, our approach allows for efficient computation for maximum likelihood estimation, spatial prediction and Bayesian inference. We illustrate the new approach with simulated and real data sets. © 2011 Royal Statistical Society.

  6. A full scale approximation of covariance functions for large spatial data sets

    Sang, Huiyan; Huang, Jianhua Z.

    2011-01-01

    Gaussian process models have been widely used in spatial statistics but face tremendous computational challenges for very large data sets. The model fitting and spatial prediction of such models typically require O(n 3) operations for a data set of size n. Various approximations of the covariance functions have been introduced to reduce the computational cost. However, most existing approximations cannot simultaneously capture both the large- and the small-scale spatial dependence. A new approximation scheme is developed to provide a high quality approximation to the covariance function at both the large and the small spatial scales. The new approximation is the summation of two parts: a reduced rank covariance and a compactly supported covariance obtained by tapering the covariance of the residual of the reduced rank approximation. Whereas the former part mainly captures the large-scale spatial variation, the latter part captures the small-scale, local variation that is unexplained by the former part. By combining the reduced rank representation and sparse matrix techniques, our approach allows for efficient computation for maximum likelihood estimation, spatial prediction and Bayesian inference. We illustrate the new approach with simulated and real data sets. © 2011 Royal Statistical Society.

  7. Mean-field approximation for spacing distribution functions in classical systems

    González, Diego Luis; Pimpinelli, Alberto; Einstein, T. L.

    2012-01-01

    We propose a mean-field method to calculate approximately the spacing distribution functions p(n)(s) in one-dimensional classical many-particle systems. We compare our method with two other commonly used methods, the independent interval approximation and the extended Wigner surmise. In our mean-field approach, p(n)(s) is calculated from a set of Langevin equations, which are decoupled by using a mean-field approximation. We find that in spite of its simplicity, the mean-field approximation provides good results in several systems. We offer many examples illustrating that the three previously mentioned methods give a reasonable description of the statistical behavior of the system. The physical interpretation of each method is also discussed.

  8. Problems in real and functional analysis

    Torchinsky, Alberto

    2015-01-01

    It is generally believed that solving problems is the most important part of the learning process in mathematics because it forces students to truly understand the definitions, comb through the theorems and proofs, and think at length about the mathematics. The purpose of this book is to complement the existing literature in introductory real and functional analysis at the graduate level with a variety of conceptual problems (1,457 in total), ranging from easily accessible to thought provoking, mixing the practical and the theoretical aspects of the subject. Problems are grouped into ten chapters covering the main topics usually taught in courses on real and functional analysis. Each of these chapters opens with a brief reader's guide stating the needed definitions and basic results in the area and closes with a short description of the problems. The Problem chapters are accompanied by Solution chapters, which include solutions to two-thirds of the problems. Students can expect the solutions to be written in ...

  9. Analytic approximations to nonlinear boundary value problems modeling beam-type nano-electromechanical systems

    Zou, Li [Dalian Univ. of Technology, Dalian City (China). State Key Lab. of Structural Analysis for Industrial Equipment; Liang, Songxin; Li, Yawei [Dalian Univ. of Technology, Dalian City (China). School of Mathematical Sciences; Jeffrey, David J. [Univ. of Western Ontario, London (Canada). Dept. of Applied Mathematics

    2017-06-01

    Nonlinear boundary value problems arise frequently in physical and mechanical sciences. An effective analytic approach with two parameters is first proposed for solving nonlinear boundary value problems. It is demonstrated that solutions given by the two-parameter method are more accurate than solutions given by the Adomian decomposition method (ADM). It is further demonstrated that solutions given by the ADM can also be recovered from the solutions given by the two-parameter method. The effectiveness of this method is demonstrated by solving some nonlinear boundary value problems modeling beam-type nano-electromechanical systems.

  10. Learning to reach by reinforcement learning using a receptive field based function approximation approach with continuous actions.

    Tamosiunaite, Minija; Asfour, Tamim; Wörgötter, Florentin

    2009-03-01

    Reinforcement learning methods can be used in robotics applications especially for specific target-oriented problems, for example the reward-based recalibration of goal directed actions. To this end still relatively large and continuous state-action spaces need to be efficiently handled. The goal of this paper is, thus, to develop a novel, rather simple method which uses reinforcement learning with function approximation in conjunction with different reward-strategies for solving such problems. For the testing of our method, we use a four degree-of-freedom reaching problem in 3D-space simulated by a two-joint robot arm system with two DOF each. Function approximation is based on 4D, overlapping kernels (receptive fields) and the state-action space contains about 10,000 of these. Different types of reward structures are being compared, for example, reward-on- touching-only against reward-on-approach. Furthermore, forbidden joint configurations are punished. A continuous action space is used. In spite of a rather large number of states and the continuous action space these reward/punishment strategies allow the system to find a good solution usually within about 20 trials. The efficiency of our method demonstrated in this test scenario suggests that it might be possible to use it on a real robot for problems where mixed rewards can be defined in situations where other types of learning might be difficult.

  11. X-ray multiaxial stress analysis by means of polynomial approximation and an application to plane stress problem

    Yoshioka, Yasuo; Sasaki, Toshihiko; Kuramoto, Makoto.

    1984-01-01

    A new polynomial approximation method was proposed for the X-ray multiaxial stress analysis, in which the effect of stress gradient along the penetration depth of X-rays was taken into account. Three basic assumptions were made; (1) the stress gradient is linear in respect to the depth from the specimen surface, (2) the ponetration depth of X-rays is a function of Sin 2 phi and (3) the strain measured by X-rays corresponds to the weighted average strain on the intensity of the diffracted X-rays. Consequently, the stress state within the thin layer near the surface was expressed by making use of three surface stresses and six stress gradients in the present method. The average strains by X-rays were approximated by the third order polynomial equations of sin 2 phi using a least square method at several phi angles on the coordinate system of specimen. Since the coefficients of these polynomials include these nine stress components mentioned above, it is possible to solve them as simultaneous equations. The calculating process of this method is simpler than that of the integral method. An X-ray plane stress problem was analyzed as an application of the present method, and the residual stress distribution on a shot-peened steel plate was actually measured by use of Cr-Kα X-rays to verify the analysis. The result showed that the compressive residual stress near the surface determined by the present method was smaller than the weighted average stress by the Sin 2 phi method because of the steep stress gradient. The present method is useful to obtain a reasonable value of stress for such a specimen with steep stress gradients near the surface. (author)

  12. Efficient Bayesian hierarchical functional data analysis with basis function approximations using Gaussian-Wishart processes.

    Yang, Jingjing; Cox, Dennis D; Lee, Jong Soo; Ren, Peng; Choi, Taeryon

    2017-12-01

    Functional data are defined as realizations of random functions (mostly smooth functions) varying over a continuum, which are usually collected on discretized grids with measurement errors. In order to accurately smooth noisy functional observations and deal with the issue of high-dimensional observation grids, we propose a novel Bayesian method based on the Bayesian hierarchical model with a Gaussian-Wishart process prior and basis function representations. We first derive an induced model for the basis-function coefficients of the functional data, and then use this model to conduct posterior inference through Markov chain Monte Carlo methods. Compared to the standard Bayesian inference that suffers serious computational burden and instability in analyzing high-dimensional functional data, our method greatly improves the computational scalability and stability, while inheriting the advantage of simultaneously smoothing raw observations and estimating the mean-covariance functions in a nonparametric way. In addition, our method can naturally handle functional data observed on random or uncommon grids. Simulation and real studies demonstrate that our method produces similar results to those obtainable by the standard Bayesian inference with low-dimensional common grids, while efficiently smoothing and estimating functional data with random and high-dimensional observation grids when the standard Bayesian inference fails. In conclusion, our method can efficiently smooth and estimate high-dimensional functional data, providing one way to resolve the curse of dimensionality for Bayesian functional data analysis with Gaussian-Wishart processes. © 2017, The International Biometric Society.

  13. FIREWORKS ALGORITHM FOR UNCONSTRAINED FUNCTION OPTIMIZATION PROBLEMS

    Evans BAIDOO

    2017-03-01

    Full Text Available Modern real world science and engineering problems can be classified as multi-objective optimisation problems which demand for expedient and efficient stochastic algorithms to respond to the optimization needs. This paper presents an object-oriented software application that implements a firework optimization algorithm for function optimization problems. The algorithm, a kind of parallel diffuse optimization algorithm is based on the explosive phenomenon of fireworks. The algorithm presented promising results when compared to other population or iterative based meta-heuristic algorithm after it was experimented on five standard benchmark problems. The software application was implemented in Java with interactive interface which allow for easy modification and extended experimentation. Additionally, this paper validates the effect of runtime on the algorithm performance.

  14. The asymptotic behaviour of the maximum likelihood function of Kriging approximations using the Gaussian correlation function

    Kok, S

    2012-07-01

    Full Text Available continuously as the correlation function hyper-parameters approach zero. Since the global minimizer of the maximum likelihood function is an asymptote in this case, it is unclear if maximum likelihood estimation (MLE) remains valid. Numerical ill...

  15. Globally COnstrained Local Function Approximation via Hierarchical Modelling, a Framework for System Modelling under Partial Information

    Øjelund, Henrik; Sadegh, Payman

    2000-01-01

    be obtained. This paper presents a new approach for system modelling under partial (global) information (or the so called Gray-box modelling) that seeks to perserve the benefits of the global as well as local methodologies sithin a unified framework. While the proposed technique relies on local approximations......Local function approximations concern fitting low order models to weighted data in neighbourhoods of the points where the approximations are desired. Despite their generality and convenience of use, local models typically suffer, among others, from difficulties arising in physical interpretation...... simultaneously with the (local estimates of) function values. The approach is applied to modelling of a linear time variant dynamic system under prior linear time invariant structure where local regression fails as a result of high dimensionality....

  16. A new formulation for the Doppler broadening function relaxing the approximations of Beth–Plackzec

    Palma, Daniel A.P.; Gonçalves, Alessandro C.; Martinez, Aquilino S.; Mesquita, Amir Z.

    2016-01-01

    Highlights: • One of the Beth–Placzek approximation were relaxed. • An additional term in the form of an integral is obtained. • A new mathematical formulation for the Doppler broadening function is proposed. - Abstract: In all nuclear reactors some neutrons can be absorbed in the resonance region and, in the design of these reactors, an accurate treatment of the resonant absorptions is essential. Apart from that, the resonant absorption varies with fuel temperature due to the Doppler broadening of the resonances. The thermal agitation movement in the reactor core is adequately represented in the microscopic cross-section of the neutron-core interaction through the Doppler broadening function. This function is calculated numerically in modern systems for the calculation of macro-group constants, necessary to determine the power distribution of a nuclear reactor. It can also be applied to the calculation of self-shielding factors to correct the measurements of the microscopic cross-sections through the activation technique and used for the approximate calculations of the resonance integrals in heterogeneous fuel cells. In these types of application we can point at the need to develop precise analytical approximations for the Doppler broadening function to be used in the calculation codes that calculate the values of this function. However, the Doppler broadening function is based on a series of approximations proposed by Beth–Plackzec. In this work a relaxation of these approximations is proposed, generating an additional term in the form of an integral. Analytical solutions of this additional term are discussed. The results obtained show that the new term is important for high temperatures.

  17. Convergence rates and finite-dimensional approximations for nonlinear ill-posed problems involving monotone operators in Banach spaces

    Nguyen Buong.

    1992-11-01

    The purpose of this paper is to investigate convergence rates for an operator version of Tikhonov regularization constructed by dual mapping for nonlinear ill-posed problems involving monotone operators in real reflective Banach spaces. The obtained results are considered in combination with finite-dimensional approximations for the space. An example is considered for illustration. (author). 15 refs

  18. An Approximation Solution to Refinery Crude Oil Scheduling Problem with Demand Uncertainty Using Joint Constrained Programming

    Duan, Qianqian; Yang, Genke; Xu, Guanglin; Pan, Changchun

    2014-01-01

    This paper is devoted to develop an approximation method for scheduling refinery crude oil operations by taking into consideration the demand uncertainty. In the stochastic model the demand uncertainty is modeled as random variables which follow a joint multivariate distribution with a specific correlation structure. Compared to deterministic models in existing works, the stochastic model can be more practical for optimizing crude oil operations. Using joint chance constraints, the demand unc...

  19. Stabilized and Block Approximate Inverse Preconditioners for Problems in Solid and Structural Mechanics

    Benzi, M.; Kouhia, R.; Tůma, Miroslav

    2001-01-01

    Roč. 190, - (2001), s. 6533-6554 ISSN 0045-7825 R&D Projects: GA AV ČR IAA2030801; GA ČR GA201/00/0080 Institutional research plan: AV0Z1030915 Keywords : preconditioning * conjugate gradient * factorized sparse approximate inverse * block algorithms * finite elements * shells Subject RIV: BA - General Mathematics Impact factor: 0.913, year: 2001

  20. Analytical expression for the nonsinglet structure functions at small x in the double logarithmic approximation

    Lublinsky, Michael

    2004-01-01

    A simple analytic expression for the nonsinglet structure function f NS is given. The expression is derived from the result of Ermolaev, Manaenkov, and Ryskin obtained by low x resummation of the quark ladder diagrams in the double logarithmic approximation of perturbative QCD

  1. Approximate Global Convergence and Quasi-Reversibility for a Coefficient Inverse Problem with Backscattering Data

    2011-04-01

    L1u. Assume that geodesic lines, generated by the eikonal equation corresponding to the function c (x) are regular, i.e. any two points in R3 can be...source x0 is located far from Ω, then similarly with (107) ∆l (x, x0) ≈ 0 in Ω. The function l (x, x0) satisfies the eikonal equation [38] |∇xl (x, x0...called “inverse kinematic problem” which aims to recover the function c (x) from the eikonal equation assuming that the function l (x, x0) is known for

  2. TWO-DIMENSIONAL APPROXIMATION OF EIGENVALUE PROBLEMS IN SHELL THEORY: FLEXURAL SHELLS

    2000-01-01

    The eigenvalue problem for a thin linearly elastic shell, of thickness 2e, clamped along its lateral surface is considered. Under the geometric assumption on the middle surface of the shell that the space of inextensional displacements is non-trivial, the authors obtain, as ε→0,the eigenvalue problem for the two-dimensional"flexural shell"model if the dimension of the space is infinite. If the space is finite dimensional, the limits of the eigenvalues could belong to the spectra of both flexural and membrane shells. The method consists of rescaling the variables and studying the problem over a fixed domain. The principal difficulty lies in obtaining suitable a priori estimates for the scaled eigenvalues.

  3. Domain decomposition method for nonconforming finite element approximations of anisotropic elliptic problems on nonmatching grids

    Maliassov, S.Y. [Texas A& M Univ., College Station, TX (United States)

    1996-12-31

    An approach to the construction of an iterative method for solving systems of linear algebraic equations arising from nonconforming finite element discretizations with nonmatching grids for second order elliptic boundary value problems with anisotropic coefficients is considered. The technique suggested is based on decomposition of the original domain into nonoverlapping subdomains. The elliptic problem is presented in the macro-hybrid form with Lagrange multipliers at the interfaces between subdomains. A block diagonal preconditioner is proposed which is spectrally equivalent to the original saddle point matrix and has the optimal order of arithmetical complexity. The preconditioner includes blocks for preconditioning subdomain and interface problems. It is shown that constants of spectral equivalence axe independent of values of coefficients and mesh step size.

  4. Quasihomogeneous function method and Fock's problem

    Smyshlyaev, V.P.

    1987-01-01

    The diffraction of a high-frequency wave by a smooth convex body near the tangency point of the limiting ray to the surface is restated as the scattering problem for the Schrodinger equation with a linear potential on a half-axis. Various prior estimates for the scattering problem are used in order to prove existence, uniqueness, and smoothness theorems. The corresponding solution satisfies the principle of limiting absorption. The formal solution of the corresponding Schrodinger equation in the form of quasihomogeneous functions is essentially used in their constructions

  5. An approximate approach for the joint problem of level of repair analysis and spare parts stocking

    Basten, R.J.I.; Heijden, van der M.C.; Schutten, J.M.J.

    2011-01-01

    For the spare parts stocking problem, generally metric type methods are used in the context of capital goods. Implicitly, a decision is assumed on which components to discard and which to repair upon failure, and where to perform repairs. In the military world, this decision is taken explicitly

  6. Analysis of the spectrum of a Cartesian Perfectly Matched Layer (PML) approximation to acoustic scattering problems

    Kim, Seungil; Pasciak, Joseph E.

    2010-01-01

    is stable for real nonzero wave numbers, we show that the essential spectrum of the higher order part only intersects the real axis at the origin. This enables us to conclude stability of the PML scattering problem from a uniqueness result given in a

  7. Analysis of a Cartesian PML approximation to acoustic scattering problems in and

    Bramble, James H.; Pasciak, Joseph E.

    2013-01-01

    to that of the original problem in the domain of interest near the scatterer. This justifies the simple computational strategy of selecting a fixed PML layer and increasing σ0 to obtain the desired accuracy. The results of numerical experiments varying M and σ0 are given

  8. An approximate approach for the joint problem of level of repair analysis and spare parts stocking.

    Basten, Robertus Johannes Ida; van der Heijden, Matthijs C.; Schutten, Johannes M.J.

    2011-01-01

    For the spare parts stocking problem, generally metric type methods are used in the context of capital goods. Implicitly, a decision is assumed on which components to discard and which to repair upon failure, and where to perform repairs. In the military world, this decision is taken explicitly

  9. Piecewise quadratic Lyapunov functions for stability verification of approximate explicit MPC

    Morten Hovd

    2010-04-01

    Full Text Available Explicit MPC of constrained linear systems is known to result in a piecewise affine controller and therefore also piecewise affine closed loop dynamics. The complexity of such analytic formulations of the control law can grow exponentially with the prediction horizon. The suboptimal solutions offer a trade-off in terms of complexity and several approaches can be found in the literature for the construction of approximate MPC laws. In the present paper a piecewise quadratic (PWQ Lyapunov function is used for the stability verification of an of approximate explicit Model Predictive Control (MPC. A novel relaxation method is proposed for the LMI criteria on the Lyapunov function design. This relaxation is applicable to the design of PWQ Lyapunov functions for discrete-time piecewise affine systems in general.

  10. Approximated calculation of the vacuum wave function and vacuum energy of the LGT with RPA method

    Hui Ping

    2004-01-01

    The coupled cluster method is improved with the random phase approximation (RPA) to calculate vacuum wave function and vacuum energy of 2 + 1 - D SU(2) lattice gauge theory. In this calculating, the trial wave function composes of single-hollow graphs. The calculated results of vacuum wave functions show very good scaling behaviors at weak coupling region l/g 2 >1.2 from the third order to the sixth order, and the vacuum energy obtained with RPA method is lower than the vacuum energy obtained without RPA method, which means that this method is a more efficient one

  11. Effects analysis fuzzy inference system in nuclear problems using approximate reasoning

    Guimaraes, Antonio C.F.; Franklin Lapa, Celso Marcelo

    2004-01-01

    In this paper a fuzzy inference system modeling technique applied on failure mode and effects analysis (FMEA) is introduced in reactor nuclear problems. This method uses the concept of a pure fuzzy logic system to treat the traditional FMEA parameters: probabilities of occurrence, severity and detection. The auxiliary feed-water system of a typical two-loop pressurized water reactor (PWR) was used as practical example in this analysis. The kernel result is the conceptual confrontation among the traditional risk priority number (RPN) and the fuzzy risk priority number (FRPN) obtained from experts opinion. The set of results demonstrated the great potential of the inference system and advantage of the gray approach in this class of problems

  12. Low rank approximation method for efficient Green's function calculation of dissipative quantum transport

    Zeng, Lang; He, Yu; Povolotskyi, Michael; Liu, XiaoYan; Klimeck, Gerhard; Kubis, Tillmann

    2013-06-01

    In this work, the low rank approximation concept is extended to the non-equilibrium Green's function (NEGF) method to achieve a very efficient approximated algorithm for coherent and incoherent electron transport. This new method is applied to inelastic transport in various semiconductor nanodevices. Detailed benchmarks with exact NEGF solutions show (1) a very good agreement between approximated and exact NEGF results, (2) a significant reduction of the required memory, and (3) a large reduction of the computational time (a factor of speed up as high as 150 times is observed). A non-recursive solution of the inelastic NEGF transport equations of a 1000 nm long resistor on standard hardware illustrates nicely the capability of this new method.

  13. An iterative algorithm for the finite element approximation to convection-diffusion problems

    Buscaglia, Gustavo; Basombrio, Fernando

    1988-01-01

    An iterative algorithm for steady convection-diffusion is presented, which avoids unsymmetric matrices by means of an equivalent mixed formulation. Upwind is introduced by adding a balancing dissipation in the flow direction, but there is no dependence of the global matrix on the velocity field. Convergence is shown in habitual test cases. Advantages of its use in coupled calculation of more complex problems are discussed. (Author)

  14. How to approximate the heat equation with Neumann boundary conditions by nonlocal diffusion problems

    Cortazar, C.; Elgueta, M.; Rossi, J. D.; Wolanski, N.

    2006-01-01

    We present a model for nonlocal diffusion with Neumann boundary conditions in a bounded smooth domain prescribing the flux through the boundary. We study the limit of this family of nonlocal diffusion operators when a rescaling parameter related to the kernel of the nonlocal operator goes to zero. We prove that the solutions of this family of problems converge to a solution of the heat equation with Neumann boundary conditions.

  15. Reduced Numerical Approximation of Reduced Fluid-Structure Interaction Problems With Applications in Hemodynamics

    Claudia M. Colciago

    2018-06-01

    Full Text Available This paper deals with fast simulations of the hemodynamics in large arteries by considering a reduced model of the associated fluid-structure interaction problem, which in turn allows an additional reduction in terms of the numerical discretisation. The resulting method is both accurate and computationally cheap. This goal is achieved by means of two levels of reduction: first, we describe the model equations with a reduced mathematical formulation which allows to write the fluid-structure interaction problem as a Navier-Stokes system with non-standard boundary conditions; second, we employ numerical reduction techniques to further and drastically lower the computational costs. The non standard boundary condition is of a generalized Robin type, with a boundary mass and boundary stiffness terms accounting for the arterial wall compliance. The numerical reduction is obtained coupling two well-known techniques: the proper orthogonal decomposition and the reduced basis method, in particular the greedy algorithm. We start by reducing the numerical dimension of the problem at hand with a proper orthogonal decomposition and we measure the system energy with specific norms; this allows to take into account the different orders of magnitude of the state variables, the velocity and the pressure. Then, we introduce a strategy based on a greedy procedure which aims at enriching the reduced discretization space with low offline computational costs. As application, we consider a realistic hemodynamics problem with a perturbation in the boundary conditions and we show the good performances of the reduction techniques presented in the paper. The results obtained with the numerical reduction algorithm are compared with the one obtained by a standard finite element method. The gains obtained in term of CPU time are of three orders of magnitude.

  16. An approximate and an analytical solution to the carousel-pendulum problem

    Vial, Alexandre [Pole Physique, Mecanique, Materiaux et Nanotechnologies, Universite de technologie de Troyes, 12, rue Marie Curie BP-2060, F-10010 Troyes Cedex (France)], E-mail: alexandre.vial@utt.fr

    2009-09-15

    We show that an improved solution to the carousel-pendulum problem can be easily obtained through a first-order Taylor expansion, and its accuracy is determined after the obtention of an unusable analytical exact solution, advantageously replaced by a numerical one. It is shown that the accuracy is unexpectedly high, even when the ratio length of the pendulum to carousel radius approaches unity. (letters and comments)

  17. Multilevel preconditioners for discontinuous, Galerkin approximations of elliptic problems, with jump coefficients

    Ayuso Dios, Blanca

    2013-10-30

    We introduce and analyze two-level and multilevel preconditioners for a family of Interior Penalty (IP) discontinuous Galerkin (DG) discretizations of second order elliptic problems with large jumps in the diffusion coefficient. Our approach to IPDG-type methods is based on a splitting of the DG space into two components that are orthogonal in the energy inner product naturally induced by the methods. As a result, the methods and their analysis depend in a crucial way on the diffusion coefficient of the problem. The analysis of the proposed preconditioners is presented for both symmetric and non-symmetric IP schemes; dealing simultaneously with the jump in the diffusion coefficient and the non-nested character of the relevant discrete spaces presents additional difficulties in the analysis, which precludes a simple extension of existing results. However, we are able to establish robustness (with respect to the diffusion coefficient) and near-optimality (up to a logarithmic term depending on the mesh size) for both two-level and BPX-type preconditioners, by using a more refined Conjugate Gradient theory. Useful by-products of the analysis are the supporting results on the construction and analysis of simple, efficient and robust two-level and multilevel preconditioners for non-conforming Crouzeix-Raviart discretizations of elliptic problems with jump coefficients. Following the analysis, we present a sequence of detailed numerical results which verify the theory and illustrate the performance of the methods. © 2013 American Mathematical Society.

  18. Multilevel preconditioners for discontinuous, Galerkin approximations of elliptic problems, with jump coefficients

    Ayuso Dios, Blanca; Holst, Michael; Zhu, Yunrong; Zikatanov, Ludmil

    2013-01-01

    We introduce and analyze two-level and multilevel preconditioners for a family of Interior Penalty (IP) discontinuous Galerkin (DG) discretizations of second order elliptic problems with large jumps in the diffusion coefficient. Our approach to IPDG-type methods is based on a splitting of the DG space into two components that are orthogonal in the energy inner product naturally induced by the methods. As a result, the methods and their analysis depend in a crucial way on the diffusion coefficient of the problem. The analysis of the proposed preconditioners is presented for both symmetric and non-symmetric IP schemes; dealing simultaneously with the jump in the diffusion coefficient and the non-nested character of the relevant discrete spaces presents additional difficulties in the analysis, which precludes a simple extension of existing results. However, we are able to establish robustness (with respect to the diffusion coefficient) and near-optimality (up to a logarithmic term depending on the mesh size) for both two-level and BPX-type preconditioners, by using a more refined Conjugate Gradient theory. Useful by-products of the analysis are the supporting results on the construction and analysis of simple, efficient and robust two-level and multilevel preconditioners for non-conforming Crouzeix-Raviart discretizations of elliptic problems with jump coefficients. Following the analysis, we present a sequence of detailed numerical results which verify the theory and illustrate the performance of the methods. © 2013 American Mathematical Society.

  19. A FEM approximation of a two-phase obstacle problem and its a posteriori error estimate

    Bozorgnia, F.; Valdman, Jan

    2017-01-01

    Roč. 73, č. 3 (2017), s. 419-432 ISSN 0898-1221 R&D Projects: GA ČR(CZ) GF16-34894L; GA MŠk(CZ) 7AMB16AT015 Institutional support: RVO:67985556 Keywords : A free boundary problem * A posteriori error analysis * Finite element method Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.531, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/valdman-0470507.pdf

  20. A Probabilistic-Numerical Approximation for an Obstacle Problem Arising in Game Theory

    Grün, Christine

    2012-01-01

    We investigate a two-player zero-sum stochastic differential game in which one of the players has more information on the game than his opponent. We show how to construct numerical schemes for the value function of this game, which is given by the solution of a quasilinear partial differential equation with obstacle.

  1. A Probabilistic-Numerical Approximation for an Obstacle Problem Arising in Game Theory

    Gruen, Christine, E-mail: christine.gruen@univ-brest.fr [Laboratoire de Mathematiques de Brest UMR 6205 (France)

    2012-12-15

    We investigate a two-player zero-sum stochastic differential game in which one of the players has more information on the game than his opponent. We show how to construct numerical schemes for the value function of this game, which is given by the solution of a quasilinear partial differential equation with obstacle.

  2. Spherical Approximation on Unit Sphere

    Eman Samir Bhaya

    2018-01-01

    Full Text Available In this paper we introduce a Jackson type theorem for functions in LP spaces on sphere And study on best approximation of  functions in  spaces defined on unit sphere. our central problem is to describe the approximation behavior of functions in    spaces for  by modulus of smoothness of functions.

  3. An A Posteriori Error Analysis of Mixed Finite Element Galerkin Approximations to Second Order Linear Parabolic Problems

    Memon, Sajid; Nataraj, Neela; Pani, Amiya Kumar

    2012-01-01

    In this article, a posteriori error estimates are derived for mixed finite element Galerkin approximations to second order linear parabolic initial and boundary value problems. Using mixed elliptic reconstructions, a posteriori error estimates in L∞(L2)- and L2(L2)-norms for the solution as well as its flux are proved for the semidiscrete scheme. Finally, based on a backward Euler method, a completely discrete scheme is analyzed and a posteriori error bounds are derived, which improves upon earlier results on a posteriori estimates of mixed finite element approximations to parabolic problems. Results of numerical experiments verifying the efficiency of the estimators have also been provided. © 2012 Society for Industrial and Applied Mathematics.

  4. Two site spin correlation function in Bethe-Peierls approximation for Ising model

    Kumar, D [Roorkee Univ. (India). Dept. of Physics

    1976-07-01

    Two site spin correlation function for an Ising model above Curie temperature has been calculated by generalising Bethe-Peierls approximation. The results derived by a graphical method due to Englert are essentially the same as those obtained earlier by Elliott and Marshall, and Oguchi and Ono. The earlier results were obtained by a direct generalisation of the cluster method of Bethe, while these results are derived by retaining that class of diagrams , which is exact on Bethe lattice.

  5. The Total Least Squares Problem in AX approximate to B: A New Classification with the Relationship to the Classical Works

    Hnětynková, I.; Plešinger, Martin; Sima, D.M.; Strakoš, Z.; Huffel van, S.

    2011-01-01

    Roč. 32, č. 3 (2011), s. 748-770 ISSN 0895-4798 R&D Projects: GA AV ČR IAA100300802 Grant - others:GA ČR(CZ) GA201/09/0917 Program:GA Institutional research plan: CEZ:AV0Z10300504 Keywords : total least squares * multiple right-hand sides * linear approximation problems * orthogonally invariant problems * orthogonal regression * errors-in-variables modeling Subject RIV: BA - General Mathematics Impact factor: 1.368, year: 2011

  6. The measurement problem in quantum mechanics: approximation to the phenomenon of decoherence by operational identities

    Usera, J.I.

    1996-01-01

    An approach based on bits and pieces of standard wisdom plus and operational quantum mechanical identity deduced by the author is presented here in order to convey arguments concerning the quantum theory of measurement and which betray a flavor against completive claims for quantum mechanics. Special emphasis is put on the phenomenon of decoherence. This phenomenon (which is experimentally verifiable) finds natural room within the formalism while the wave function collapse (which is not) is precluded. (Author)

  7. The approximation function of bridge deck vibration derived from the measured eigenmodes

    Sokol Milan

    2017-12-01

    Full Text Available This article deals with a method of how to acquire approximate displacement vibration functions. Input values are discrete, experimentally obtained mode shapes. A new improved approximation method based on the modal vibrations of the deck is derived using the least-squares method. An alternative approach to be employed in this paper is to approximate the displacement vibration function by a sum of sine functions whose periodicity is determined by spectral analysis adapted for non-uniformly sampled data and where the parameters of scale and phase are estimated as usual by the least-squares method. Moreover, this periodic component is supplemented by a cubic regression spline (fitted on its residuals that captures individual displacements between piers. The statistical evaluation of the stiffness parameter is performed using more vertical modes obtained from experimental results. The previous method (Sokol and Flesch, 2005, which was derived for near the pier areas, has been enhanced to the whole length of the bridge. The experimental data describing the mode shapes are not appropriate for direct use. Especially the higher derivatives calculated from these data are very sensitive to data precision.

  8. A smoothing spline that approximates Laplace transform functions only known on measurements on the real axis

    D’Amore, L; Campagna, R; Murli, A; Galletti, A; Marcellino, L

    2012-01-01

    The scientific and application-oriented interest in the Laplace transform and its inversion is testified by more than 1000 publications in the last century. Most of the inversion algorithms available in the literature assume that the Laplace transform function is available everywhere. Unfortunately, such an assumption is not fulfilled in the applications of the Laplace transform. Very often, one only has a finite set of data and one wants to recover an estimate of the inverse Laplace function from that. We propose a fitting model of data. More precisely, given a finite set of measurements on the real axis, arising from an unknown Laplace transform function, we construct a dth degree generalized polynomial smoothing spline, where d = 2m − 1, such that internally to the data interval it is a dth degree polynomial complete smoothing spline minimizing a regularization functional, and outside the data interval, it mimics the Laplace transform asymptotic behavior, i.e. it is a rational or an exponential function (the end behavior model), and at the boundaries of the data set it joins with regularity up to order m − 1, with the end behavior model. We analyze in detail the generalized polynomial smoothing spline of degree d = 3. This choice was motivated by the (ill)conditioning of the numerical computation which strongly depends on the degree of the complete spline. We prove existence and uniqueness of this spline. We derive the approximation error and give a priori and computable bounds of it on the whole real axis. In such a way, the generalized polynomial smoothing spline may be used in any real inversion algorithm to compute an approximation of the inverse Laplace function. Experimental results concerning Laplace transform approximation, numerical inversion of the generalized polynomial smoothing spline and comparisons with the exponential smoothing spline conclude the work. (paper)

  9. Long-range-corrected Rung 3.5 density functional approximations

    Janesko, Benjamin G.; Proynov, Emil; Scalmani, Giovanni; Frisch, Michael J.

    2018-03-01

    Rung 3.5 functionals are a new class of approximations for density functional theory. They provide a flexible intermediate between exact (Hartree-Fock, HF) exchange and semilocal approximations for exchange. Existing Rung 3.5 functionals inherit semilocal functionals' limitations in atomic cores and density tails. Here we address those limitations using range-separated admixture of HF exchange. We present three new functionals. LRC-ωΠLDA combines long-range HF exchange with short-range Rung 3.5 ΠLDA exchange. SLC-ΠLDA combines short- and long-range HF exchange with middle-range ΠLDA exchange. LRC-ωΠLDA-AC incorporates a combination of HF, semilocal, and Rung 3.5 exchange in the short range, based on an adiabatic connection. We test these in a new Rung 3.5 implementation including up to analytic fourth derivatives. LRC-ωΠLDA and SLC-ΠLDA improve atomization energies and reaction barriers by a factor of 8 compared to the full-range ΠLDA. LRC-ωΠLDA-AC brings further improvement approaching the accuracy of standard long-range corrected schemes LC-ωPBE and SLC-PBE. The new functionals yield highest occupied orbital energies closer to experimental ionization potentials and describe correctly the weak charge-transfer complex of ethylene and dichlorine and the hole-spin distribution created by an Al defect in quartz. This study provides a framework for more flexible range-separated Rung 3.5 approximations.

  10. Many-body perturbation theory using the density-functional concept: beyond the GW approximation

    Bruneval, Fabien; Sottile, Francesco; Olevano, Valerio; Del Sole, Rodolfo; Reining, Lucia

    2005-01-01

    We propose an alternative formulation of Many-Body Perturbation Theory that uses the density-functional concept. Instead of the usual four-point integral equation for the polarizability, we obtain a two-point one, that leads to excellent optical absorption and energy loss spectra. The corresponding three-point vertex function and self-energy are then simply calculated via an integration, for any level of approximation. Moreover, we show the direct impact of this formulation on the time-depend...

  11. Evaluation of quantum mechanics path integrals by the approximations exact on a class of polynomial functionals

    Lobanov, Yu.Yu.; Shidkov, E.P.

    1987-01-01

    The method for numerical evaluation of path integrals in Eucledean quantum mechanics without lattice discretization is elaborated. The method is based on the representation of these integrals in the form of functional integrals with respect to the conditional Wiener measure and on the use of the derived approximate exact on a class of polynomial functionals of a given degree. By the computations of non-perturbative characteristics, concerned the topological structure of vacuum, the advantages of this method versus lattice Monte-Carlo calculations are demonstrated

  12. Application of a nodal collocation approximation for the multidimensional PL equations to the 3D Takeda benchmark problems

    Capilla, M.; Talavera, C.F.; Ginestar, D.; Verdú, G.

    2012-01-01

    Highlights: ► The multidimensional P L approximation to the nuclear transport equation is reviewed. ► A nodal collocation method is developed for the spatial discretization of P L equations. ► Advantages of the method are lower dimension and good characterists of the associated algebraic eigenvalue problem. ► The P L nodal collocation method is implemented into the computer code SHNC. ► The SHNC code is verified with 2D and 3D benchmark eigenvalue problems from Takeda and Ikeda, giving satisfactory results. - Abstract: P L equations are classical approximations to the neutron transport equations, which are obtained expanding the angular neutron flux in terms of spherical harmonics. These approximations are useful to study the behavior of reactor cores with complex fuel assemblies, for the homogenization of nuclear cross-sections, etc., and most of these applications are in three-dimensional (3D) geometries. In this work, we review the multi-dimensional P L equations and describe a nodal collocation method for the spatial discretization of these equations for arbitrary odd order L, which is based on the expansion of the spatial dependence of the fields in terms of orthonormal Legendre polynomials. The performance of the nodal collocation method is studied by means of obtaining the k eff and the stationary power distribution of several 3D benchmark problems. The solutions are obtained are compared with a finite element method and a Monte Carlo method.

  13. Multiconfiguration time-dependent self-consistent field approximations in the numerical solution of quantum dynamical problems

    Kotler, Z.; Neria, E.; Nitzan, A. (Tel Aviv Univ. (Israel). School of Chemistry)

    1991-02-01

    The use of the time-dependent self-consistent field approximation (TDSCF) in the numerical solution of quantum curve crossing and tunneling dynamical problems is investigated. Particular emphasis is given to multiconfiguration TDSCF (MCTDSCF) approximations, which are shown to perform considerably better with only a small increase in computational effort. We investigate a number of simple models in which a 'system' characterized by two electronic potential surfaces evolves while interacting with a 'bath' mode described by an harmonic oscillator, and compare exact numerical solutions to one- and two-configuration TDSCF approximations. We also introduce and investigate a semiclassical approximation in which the 'bath' mode is described by semiclassical wavepackets (one for each electronic state) and show that for all models investigated this scheme works very well in comparison with the fully quantum MCTDSCF approximation. This provides a potentially very useful method to simulate strongly quantum systems coupled to an essentially classical environment. (orig.).

  14. Assessment of density-functional approximations: Long-range correlations and self-interaction effects

    Jung, J.; Alvarellos, J.E.; Garcia-Gonzalez, P.; Godby, R.W.

    2004-01-01

    The complex nature of electron-electron correlations is made manifest in the very simple but nontrivial problem of two electrons confined within a sphere. The description of highly nonlocal correlation and self-interaction effects by widely used local and semilocal exchange-correlation energy density functionals is shown to be unsatisfactory in most cases. Even the best such functionals exhibit significant errors in the Kohn-Sham potentials and density profiles

  15. Exact solutions for fermionic Green's functions in the Bloch-Nordsieck approximation of QED

    Kernemann, A.; Stefanis, N.G.

    1989-01-01

    A set of new closed-form solutions for fermionic Green's functions in the Bloch-Nordsieck approximation of QED is presented. A manifestly covariant phase-space path-integral method is applied for calculating the n-fermion Green's function in a classical external field. In the case of one and two fermions, explicit expressions for the full Green's functions are analytically obtained, with renormalization carried out in the modified minimal subtraction scheme. The renormalization constants and the corresponding anomalous dimensions are determined. The mass-shell behavior of the two-fermion Green's function is investigated in detail. No assumptions are made concerning the structure of asymptotic states and no IR cutoff is used in the calculations

  16. Semi-classical approximation and the problem of boundary conditions in the theory of relativistic particle radiation

    Akhiezer, A.I.; Shul'ga, N.F.

    1991-01-01

    The process of relativistic particle radiation in an external field has been studied in the semi-classical approximation rather extensively. The main problem arising in the studies is in expressing the formula of the quantum theory of radiation in terms of classical quantities, for example of the classical trajectories. However, it still remains unclear how the particle trajectory is assigned, that is which particular initial or boundary conditions determine the trajectory in semi-classical approximation quantum theory of radiation. We shall try to solve this problem. Its importance comes from the fact that in some cases one and the same boundary conditions may give rise to two or more trajectories. We demonstrate that this fact must necessarily be taken into account on deriving the classical limit for the formulae of the quantum theory of radiation, since it leads to a specific interference effect in radiation. The method we used to deal with the problem is similar to the method employed by Fock to analyze the problem of a canonical transformation in classical and quantum mechanics. (author)

  17. Eddy current imaging. Limits of the born approximation and advantages of an exact solution to the inverse problem

    Hamman, E.; Zorgati, R.

    1995-01-01

    Eddy current non-destructive testing is used by EDF to detect flaws affecting conductive objects such as steam generator tubes. With a view to obtaining ever more accurate information on equipment integrity, thereby facilitating diagnosis, studies aimed at using measurements to reconstruct an image of the flaw have been proceeding now for about ten years. In this context, our approach to eddy current imaging is based on inverse problem formalism. The direct problem, involving a mathematical model linking measurements provided by a probe with variables characterizing the defect, is dealt with elsewhere. Using the model results, we study the possibility of inverting it, i.e. of reconstructing an image of the flaw from the measurements. We first give an overview of the different inversion techniques, representative of the state of the art and all based on linearization of the inverse problem by means of the Born approximation. The model error resulting from an excessive Born approximation nevertheless severely limits the quantity of the images which can be obtained. In order to counteract this often critical error and extend the eddy current imaging application field, we have to del with the non-linear inverse problem. A method derived from recent research is proposed and implemented to ensure consistency with the exact model. Based on an 'optimization' type approach and provided with a convergence theorem, the method is highly efficient. (authors). 17 refs., 7 figs., 1 append

  18. Approximate solutions for the two-dimensional integral transport equation. Solution of complex two-dimensional transport problems

    Sanchez, Richard.

    1980-11-01

    This work is divided into two parts: the first part deals with the solution of complex two-dimensional transport problems, the second one (note CEA-N-2166) treats the critically mixed methods of resolution. A set of approximate solutions for the isotropic two-dimensional neutron transport problem has been developed using the interface current formalism. The method has been applied to regular lattices of rectangular cells containing a fuel pin, cladding, and water, or homogenized structural material. The cells are divided into zones that are homogeneous. A zone-wise flux expansion is used to formulate a direct collision probability problem within a cell. The coupling of the cells is effected by making extra assumptions on the currents entering and leaving the interfaces. Two codes have been written: CALLIOPE uses a cylindrical cell model and one or three terms for the flux expansion, and NAUSICAA uses a two-dimensional flux representation and does a truly two-dimensional calculation inside each cell. In both codes, one or three terms can be used to make a space-independent expansion of the angular fluxes entering and leaving each side of the cell. The accuracies and computing times achieved with the different approximations are illustrated by numerical studies on two benchmark problems and by calculations performed in the APOLLO multigroup code [fr

  19. Mining approximate temporal functional dependencies with pure temporal grouping in clinical databases.

    Combi, Carlo; Mantovani, Matteo; Sabaini, Alberto; Sala, Pietro; Amaddeo, Francesco; Moretti, Ugo; Pozzi, Giuseppe

    2015-07-01

    Functional dependencies (FDs) typically represent associations over facts stored by a database, such as "patients with the same symptom get the same therapy." In more recent years, some extensions have been introduced to represent both temporal constraints (temporal functional dependencies - TFDs), as "for any given month, patients with the same symptom must have the same therapy, but their therapy may change from one month to the next one," and approximate properties (approximate functional dependencies - AFDs), as "patients with the same symptomgenerallyhave the same therapy." An AFD holds most of the facts stored by the database, enabling some data to deviate from the defined property: the percentage of data which violate the given property is user-defined. According to this scenario, in this paper we introduce approximate temporal functional dependencies (ATFDs) and use them to mine clinical data. Specifically, we considered the need for deriving new knowledge from psychiatric and pharmacovigilance data. ATFDs may be defined and measured either on temporal granules (e.g.grouping data by day, week, month, year) or on sliding windows (e.g.a fixed-length time interval which moves over the time axis): in this regard, we propose and discuss some specific and efficient data mining techniques for ATFDs. We also developed two running prototypes and showed the feasibility of our proposal by mining two real-world clinical data sets. The clinical interest of the dependencies derived considering the psychiatry and pharmacovigilance domains confirms the soundness and the usefulness of the proposed techniques. Copyright © 2014 Elsevier Ltd. All rights reserved.

  20. Approximating distributions from moments

    Pawula, R. F.

    1987-11-01

    A method based upon Pearson-type approximations from statistics is developed for approximating a symmetric probability density function from its moments. The extended Fokker-Planck equation for non-Markov processes is shown to be the underlying foundation for the approximations. The approximation is shown to be exact for the beta probability density function. The applicability of the general method is illustrated by numerous pithy examples from linear and nonlinear filtering of both Markov and non-Markov dichotomous noise. New approximations are given for the probability density function in two cases in which exact solutions are unavailable, those of (i) the filter-limiter-filter problem and (ii) second-order Butterworth filtering of the random telegraph signal. The approximate results are compared with previously published Monte Carlo simulations in these two cases.

  1. Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction

    Cui, Tiangang; Marzouk, Youssef; Willcox, Karen

    2016-06-01

    Two major bottlenecks to the solution of large-scale Bayesian inverse problems are the scaling of posterior sampling algorithms to high-dimensional parameter spaces and the computational cost of forward model evaluations. Yet incomplete or noisy data, the state variation and parameter dependence of the forward model, and correlations in the prior collectively provide useful structure that can be exploited for dimension reduction in this setting-both in the parameter space of the inverse problem and in the state space of the forward model. To this end, we show how to jointly construct low-dimensional subspaces of the parameter space and the state space in order to accelerate the Bayesian solution of the inverse problem. As a byproduct of state dimension reduction, we also show how to identify low-dimensional subspaces of the data in problems with high-dimensional observations. These subspaces enable approximation of the posterior as a product of two factors: (i) a projection of the posterior onto a low-dimensional parameter subspace, wherein the original likelihood is replaced by an approximation involving a reduced model; and (ii) the marginal prior distribution on the high-dimensional complement of the parameter subspace. We present and compare several strategies for constructing these subspaces using only a limited number of forward and adjoint model simulations. The resulting posterior approximations can rapidly be characterized using standard sampling techniques, e.g., Markov chain Monte Carlo. Two numerical examples demonstrate the accuracy and efficiency of our approach: inversion of an integral equation in atmospheric remote sensing, where the data dimension is very high; and the inference of a heterogeneous transmissivity field in a groundwater system, which involves a partial differential equation forward model with high dimensional state and parameters.

  2. Eikonal Approximation in AdS/CFT From Shock Waves to Four-Point Functions

    Cornalba, L; Costa, Miguel S; Penedones, Joao; Cornalba, Lorenzo; Costa, M S; Penedones, J; Schiappa, Ricardo

    2007-01-01

    We initiate a program to generalize the standard eikonal approximation to compute amplitudes in Anti-de Sitter spacetimes. Inspired by the shock wave derivation of the eikonal amplitude in flat space, we study the two-point function E ~ _{shock} in the presence of a shock wave in Anti-de Sitter, where O_1 is a scalar primary operator in the dual conformal field theory. At tree level in the gravitational coupling, we relate the shock two-point function E to the discontinuity across a kinematical branch cut of the conformal field theory four-point function A ~ , where O_2 creates the shock geometry in Anti-de Sitter. Finally, we extend the above results by computing E in the presence of shock waves along the horizon of Schwarzschild BTZ black holes. This work gives new tools for the study of Planckian physics in Anti-de Sitter spacetimes.

  3. Spherical Bessel transform via exponential sum approximation of spherical Bessel function

    Ikeno, Hidekazu

    2018-02-01

    A new algorithm for numerical evaluation of spherical Bessel transform is proposed in this paper. In this method, the spherical Bessel function is approximately represented as an exponential sum with complex parameters. This is obtained by expressing an integral representation of spherical Bessel function in complex plane, and discretizing contour integrals along steepest descent paths and a contour path parallel to real axis using numerical quadrature rule with the double-exponential transformation. The number of terms in the expression is reduced using the modified balanced truncation method. The residual part of integrand is also expanded by exponential functions using Prony-like method. The spherical Bessel transform can be evaluated analytically on arbitrary points in half-open interval.

  4. A new approximation of the dispersion relations occurring in the sound-attenuation problem of turbofan aircraft engines

    Robert SZABO

    2011-12-01

    Full Text Available The dispersion relations, appearing in the analysis of the stability of a gas flow in a straight acoustically-lined duct with respect to perturbations produced by a time harmonic source, beside the wave number and complex frequency contain the solution of a boundary value problem of the Pridmore-Brown equation depending on the wave number and frequency. For this reason, in practice the dispersion relations are rarely simple enough for carried out the zeros. The determination of zeros of these dispersion relations is crucial for the prediction of the perturbation attenuation or amplification. In this paper an approximation of the dispersion relations is given. Our approach preserves the general character of the mean flow, the general Pridmore-Brown equation and it’s only in the shear flow that we replace the exact solution of the boundary value problem with its Taylor polynomial approximate. In this way new approximate dispersion relations are obtained which zero’s can be found by computer.

  5. Efficient approximation of the incomplete gamma function for use in cloud model applications

    U. Blahak

    2010-07-01

    Full Text Available This paper describes an approximation to the lower incomplete gamma function γl(a,x which has been obtained by nonlinear curve fitting. It comprises a fixed number of terms and yields moderate accuracy (the absolute approximation error of the corresponding normalized incomplete gamma function P is smaller than 0.02 in the range 0.9 ≤ a ≤ 45 and x≥0. Monotonicity and asymptotic behaviour of the original incomplete gamma function is preserved.

    While providing a slight to moderate performance gain on scalar machines (depending on whether a stays the same for subsequent function evaluations or not compared to established and more accurate methods based on series- or continued fraction expansions with a variable number of terms, a big advantage over these more accurate methods is the applicability on vector CPUs. Here the fixed number of terms enables proper and efficient vectorization. The fixed number of terms might be also beneficial on massively parallel machines to avoid load imbalances, caused by a possibly vastly different number of terms in series expansions to reach convergence at different grid points. For many cloud microphysical applications, the provided moderate accuracy should be enough. However, on scalar machines and if a is the same for subsequent function evaluations, the most efficient method to evaluate incomplete gamma functions is perhaps interpolation of pre-computed regular lookup tables (most simple example: equidistant tables.

  6. Genetic algorithm based input selection for a neural network function approximator with applications to SSME health monitoring

    Peck, Charles C.; Dhawan, Atam P.; Meyer, Claudia M.

    1991-01-01

    A genetic algorithm is used to select the inputs to a neural network function approximator. In the application considered, modeling critical parameters of the space shuttle main engine (SSME), the functional relationship between measured parameters is unknown and complex. Furthermore, the number of possible input parameters is quite large. Many approaches have been used for input selection, but they are either subjective or do not consider the complex multivariate relationships between parameters. Due to the optimization and space searching capabilities of genetic algorithms they were employed to systematize the input selection process. The results suggest that the genetic algorithm can generate parameter lists of high quality without the explicit use of problem domain knowledge. Suggestions for improving the performance of the input selection process are also provided.

  7. A single hidden layer feedforward network with only one neuron in the hidden layer can approximate any univariate function

    Guliyev , Namig; Ismailov , Vugar

    2016-01-01

    The possibility of approximating a continuous function on a compact subset of the real line by a feedforward single hidden layer neural network with a sigmoidal activation function has been studied in many papers. Such networks can approximate an arbitrary continuous function provided that an unlimited number of neurons in a hidden layer is permitted. In this paper, we consider constructive approximation on any finite interval of $\\mathbb{R}$ by neural networks with only one neuron in the hid...

  8. Deorbitalization strategies for meta-generalized-gradient-approximation exchange-correlation functionals

    Mejia-Rodriguez, Daniel; Trickey, S. B.

    2017-11-01

    We explore the simplification of widely used meta-generalized-gradient approximation (mGGA) exchange-correlation functionals to the Laplacian level of refinement by use of approximate kinetic-energy density functionals (KEDFs). Such deorbitalization is motivated by the prospect of reducing computational cost while recovering a strictly Kohn-Sham local potential framework (rather than the usual generalized Kohn-Sham treatment of mGGAs). A KEDF that has been rather successful in solid simulations proves to be inadequate for deorbitalization, but we produce other forms which, with parametrization to Kohn-Sham results (not experimental data) on a small training set, yield rather good results on standard molecular test sets when used to deorbitalize the meta-GGA made very simple, Tao-Perdew-Staroverov-Scuseria, and strongly constrained and appropriately normed functionals. We also study the difference between high-fidelity and best-performing deorbitalizations and discuss possible implications for use in ab initio molecular dynamics simulations of complicated condensed phase systems.

  9. Electromagnetic radiation damping of charges in external gravitational fields (weak field, slow motion approximation). [Harmonic coordinates, weak field slow-motion approximation, Green function

    Rudolph, E [Max-Planck-Institut fuer Physik und Astrophysik, Muenchen (F.R. Germany)

    1975-01-01

    As a model for gravitational radiation damping of a planet the electromagnetic radiation damping of an extended charged body moving in an external gravitational field is calculated in harmonic coordinates using a weak field, slowing-motion approximation. Special attention is paid to the case where this gravitational field is a weak Schwarzschild field. Using Green's function methods for this purpose it is shown that in a slow-motion approximation there is a strange connection between the tail part and the sharp part: radiation reaction terms of the tail part can cancel corresponding terms of the sharp part. Due to this cancelling mechanism the lowest order electromagnetic radiation damping force in an external gravitational field in harmonic coordinates remains the flat space Abraham Lorentz force. It is demonstrated in this simplified model that a naive slow-motion approximation may easily lead to divergent higher order terms. It is shown that this difficulty does not arise up to the considered order.

  10. A Method of Approximating Expectations of Functions of Sums of Independent Random Variables

    Klass, Michael J.

    1981-01-01

    Let $X_1, X_2, \\cdots$ be a sequence of independent random variables with $S_n = \\sum^n_{i = 1} X_i$. Fix $\\alpha > 0$. Let $\\Phi(\\cdot)$ be a continuous, strictly increasing function on $\\lbrack 0, \\infty)$ such that $\\Phi(0) = 0$ and $\\Phi(cx) \\leq c^\\alpha\\Phi(x)$ for all $x > 0$ and all $c \\geq 2$. Suppose $a$ is a real number and $J$ is a finite nonempty subset of the positive integers. In this paper we are interested in approximating $E \\max_{j \\in J} \\Phi(|a + S_j|)$. We construct a nu...

  11. Approximate Stream Function wavemaker theory for highly non-linear waves in wave flumes

    Zhang, H.W.; Schäffer, Hemming Andreas

    2007-01-01

    An approximate Stream Function wavemaker theory for highly non-linear regular waves in flumes is presented. This theory is based on an ad hoe unified wave-generation method that combines linear fully dispersive wavemaker theory and wave generation for non-linear shallow water waves. This is done...... by applying a dispersion correction to the paddle position obtained for non-linear long waves. The method is validated by a number of wave flume experiments while comparing with results of linear wavemaker theory, second-order wavemaker theory and Cnoidal wavemaker theory within its range of application....

  12. Hierarchical low-rank approximation for high dimensional approximation

    Nouy, Anthony

    2016-01-01

    Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

  13. Hierarchical low-rank approximation for high dimensional approximation

    Nouy, Anthony

    2016-01-07

    Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

  14. Impaired neural networks for approximate calculation in dyscalculic children: a functional MRI study

    Dosch Mengia

    2006-09-01

    Full Text Available Abstract Background Developmental dyscalculia (DD is a specific learning disability affecting the acquisition of mathematical skills in children with otherwise normal general intelligence. The goal of the present study was to examine cerebral mechanisms underlying DD. Methods Eighteen children with DD aged 11.2 ± 1.3 years and twenty age-matched typically achieving schoolchildren were investigated using functional magnetic resonance imaging (fMRI during trials testing approximate and exact mathematical calculation, as well as magnitude comparison. Results Children with DD showed greater inter-individual variability and had weaker activation in almost the entire neuronal network for approximate calculation including the intraparietal sulcus, and the middle and inferior frontal gyrus of both hemispheres. In particular, the left intraparietal sulcus, the left inferior frontal gyrus and the right middle frontal gyrus seem to play crucial roles in correct approximate calculation, since brain activation correlated with accuracy rate in these regions. In contrast, no differences between groups could be found for exact calculation and magnitude comparison. In general, fMRI revealed similar parietal and prefrontal activation patterns in DD children compared to controls for all conditions. Conclusion In conclusion, there is evidence for a deficient recruitment of neural resources in children with DD when processing analog magnitudes of numbers.

  15. Comparison of approximations in density functional theory calculations: Energetics and structure of binary oxides

    Hinuma, Yoyo; Hayashi, Hiroyuki; Kumagai, Yu; Tanaka, Isao; Oba, Fumiyasu

    2017-09-01

    High-throughput first-principles calculations based on density functional theory (DFT) are a powerful tool in data-oriented materials research. The choice of approximation to the exchange-correlation functional is crucial as it strongly affects the accuracy of DFT calculations. This study compares performance of seven approximations, six of which are based on Perdew-Burke-Ernzerhof (PBE) generalized gradient approximation (GGA) with and without Hubbard U and van der Waals corrections (PBE, PBE+U, PBED3, PBED3+U, PBEsol, and PBEsol+U), and the strongly constrained and appropriately normed (SCAN) meta-GGA on the energetics and crystal structure of elementary substances and binary oxides. For the latter, only those with closed-shell electronic structures are considered, examples of which include C u2O , A g2O , MgO, ZnO, CdO, SnO, PbO, A l2O3 , G a2O3 , I n2O3 , L a2O3 , B i2O3 , Si O2 , Sn O2 , Pb O2 , Ti O2 , Zr O2 , Hf O2 , V2O5 , N b2O5 , T a2O5 , Mo O3 , and W O3 . Prototype crystal structures are selected from the Inorganic Crystal Structure Database (ICSD) and cation substitution is used to make a set of existing and hypothetical oxides. Two indices are proposed to quantify the extent of lattice and internal coordinate relaxation during a calculation. The former is based on the second invariant and determinant of the transformation matrix of basis vectors from before relaxation to after relaxation, and the latter is derived from shifts of internal coordinates of atoms in the unit cell. PBED3, PBEsol, and SCAN reproduce experimental lattice parameters of elementary substances and oxides well with few outliers. Notably, PBEsol and SCAN predict the lattice parameters of low dimensional structures comparably well with PBED3, even though these two functionals do not explicitly treat van der Waals interactions. SCAN gives formation enthalpies and Gibbs free energies closest to experimental data, with mean errors (MEs) of 0.01 and -0.04 eV, respectively, and root

  16. Parameterized approximation of lacunarity functions derived from airborne laser scanning point clouds of forested areas

    Székely, Balázs; Kania, Adam; Varga, Katalin; Heilmeier, Hermann

    2017-04-01

    Lacunarity, a measure of the spatial distribution of the empty space is found to be a useful descriptive quantity of the forest structure. Its calculation, based on laser-scanned point clouds, results in a four-dimensional data set. The evaluation of results needs sophisticated tools and visualization techniques. To simplify the evaluation, it is straightforward to use approximation functions fitted to the results. The lacunarity function L(r), being a measure of scale-independent structural properties, has a power-law character. Previous studies showed that log(log(L(r))) transformation is suitable for analysis of spatial patterns. Accordingly, transformed lacunarity functions can be approximated by appropriate functions either in the original or in the transformed domain. As input data we have used a number of laser-scanned point clouds of various forests. The lacunarity distribution has been calculated along a regular horizontal grid at various (relative) elevations. The lacunarity data cube then has been logarithm-transformed and the resulting values became the input of parameter estimation at each point (point of interest, POI). This way at each POI a parameter set is generated that is suitable for spatial analysis. The expectation is that the horizontal variation and vertical layering of the vegetation can be characterized by this procedure. The results show that the transformed L(r) functions can be typically approximated by exponentials individually, and the residual values remain low in most cases. However, (1) in most cases the residuals may vary considerably, and (2) neighbouring POIs often give rather differing estimates both in horizontal and in vertical directions, of them the vertical variation seems to be more characteristic. In the vertical sense, the distribution of estimates shows abrupt changes at places, presumably related to the vertical structure of the forest. In low relief areas horizontal similarity is more typical, in higher relief areas

  17. Aft-body loading function for penetrators based on the spherical cavity-expansion approximation.

    Longcope, Donald B., Jr.; Warren, Thomas Lynn; Duong, Henry

    2009-12-01

    In this paper we develop an aft-body loading function for penetration simulations that is based on the spherical cavity-expansion approximation. This loading function assumes that there is a preexisting cavity of radius a{sub o} before the expansion occurs. This causes the radial stress on the cavity surface to be less than what is obtained if the cavity is opened from a zero initial radius. This in turn causes less resistance on the aft body as it penetrates the target which allows for greater rotation of the penetrator. Results from simulations are compared with experimental results for oblique penetration into a concrete target with an unconfined compressive strength of 23 MPa.

  18. Random phase approximations for the screening function in high Tc superconductors

    Lopez-Aguilar, F.; Costa-Quintana, J.; Sanchez, A.; Puig, T.; Aurell, M.T.; Martinez, L.M.; Munoz, J.S.

    1990-01-01

    This paper reports on the electronic transferences from the CuO 2 sheets toward the CuO 3 linear chain, which locate electrons in the orbitals p y /p z of O4/O1 and d z 2 -y 2 of Cu1, and holes in the orbitals d x 2 -y 2 - P z /p y of Cu2 - P2/O3. These holes states present large interatomic overlapping. In this paper, we determine the screening function within the random phase approximation applied to the high-T c superconductors. This screening function is vanishing for determined values of the frequency which correspond to renormalized plasmon frequencies. These frequencies depends on the band parameters and their knowledge is essential for determining the self energy. This self energy is deduced and it contain independent terms for each of the channels for the localization

  19. Global Approximations to Cost and Production Functions using Artificial Neural Networks

    Efthymios G. Tsionas

    2009-06-01

    Full Text Available The estimation of cost and production functions in economics relies on standard specifications which are less than satisfactory in numerous situations. However, instead of fitting the data with a pre-specified model, Artificial Neural Networks (ANNs let the data itself serve as evidence to support the modelrs estimation of the underlying process. In this context, the proposed approach combines the strengths of economics, statistics and machine learning research and the paper proposes a global approximation to arbitrary cost and production functions, respectively, given by ANNs. Suggestions on implementation are proposed and empirical application relies on standard techniques. All relevant measures such as Returns to Scale (RTS and Total Factor Productivity (TFP may be computed routinely.

  20. Piece-wise quadratic approximations of arbitrary error functions for fast and robust machine learning.

    Gorban, A N; Mirkes, E M; Zinovyev, A

    2016-12-01

    Most of machine learning approaches have stemmed from the application of minimizing the mean squared distance principle, based on the computationally efficient quadratic optimization methods. However, when faced with high-dimensional and noisy data, the quadratic error functionals demonstrated many weaknesses including high sensitivity to contaminating factors and dimensionality curse. Therefore, a lot of recent applications in machine learning exploited properties of non-quadratic error functionals based on L 1 norm or even sub-linear potentials corresponding to quasinorms L p (0application of min-plus algebra. The approach can be applied in most of existing machine learning methods, including methods of data approximation and regularized and sparse regression, leading to the improvement in the computational cost/accuracy trade-off. We demonstrate that on synthetic and real-life datasets PQSQ-based machine learning methods achieve orders of magnitude faster computational performance than the corresponding state-of-the-art methods, having similar or better approximation accuracy. Copyright © 2016 Elsevier Ltd. All rights reserved.

  1. Exact constants in approximation theory

    Korneichuk, N

    1991-01-01

    This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base

  2. Classical effective Hamiltonians, Wigner functions, and the sign problem

    Samson, J.H.

    1995-01-01

    In the functional-integral technique an auxiliary field, coupled to appropriate operators such as spins, linearizes the interaction term in a quantum many-body system. The partition function is then averaged over this time-dependent stochastic field. Quantum Monte Carlo methods evaluate this integral numerically, but suffer from the sign (or phase) problem: the integrand may not be positive definite (or not real). It is shown that, in certain cases that include the many-band Hubbard model and the Heisenberg model, the sign problem is inevitable on fundamental grounds. Here, Monte Carlo simulations generate a distribution of incompatible operators---a Wigner function---from which expectation values and correlation functions are to be calculated; in general no positive-definite distribution of this form exists. The distribution of time-averaged auxiliary fields is the convolution of this operator distribution with a Gaussian of variance proportional to temperature, and is interpreted as a Boltzmann distribution exp(-βV eff ) in classical configuration space. At high temperatures and large degeneracies this classical effective Hamiltonian V eff tends to the static approximation as a classical limit. In the low-temperature limit the field distribution becomes a Wigner function, the sign problem occurs, and V eff is complex. Interpretations of the distributions, and a criterion for their positivity, are discussed. The theory is illustrated by an exact evaluation of the Wigner function for spin s and the effective classical Hamiltonian for the spin-1/2 van der Waals model. The field distribution can be negative here, more noticeably if the number of spins is odd

  3. Approximation techniques for engineers

    Komzsik, Louis

    2006-01-01

    Presenting numerous examples, algorithms, and industrial applications, Approximation Techniques for Engineers is your complete guide to the major techniques used in modern engineering practice. Whether you need approximations for discrete data of continuous functions, or you''re looking for approximate solutions to engineering problems, everything you need is nestled between the covers of this book. Now you can benefit from Louis Komzsik''s years of industrial experience to gain a working knowledge of a vast array of approximation techniques through this complete and self-contained resource.

  4. Exact and approximate Fourier rebinning algorithms for the solution of the data truncation problem in 3-D PET.

    Bouallègue, Fayçal Ben; Crouzet, Jean-François; Comtat, Claude; Fourcade, Marjolaine; Mohammadi, Bijan; Mariano-Goulart, Denis

    2007-07-01

    This paper presents an extended 3-D exact rebinning formula in the Fourier space that leads to an iterative reprojection algorithm (iterative FOREPROJ), which enables the estimation of unmeasured oblique projection data on the basis of the whole set of measured data. In first approximation, this analytical formula also leads to an extended Fourier rebinning equation that is the basis for an approximate reprojection algorithm (extended FORE). These algorithms were evaluated on numerically simulated 3-D positron emission tomography (PET) data for the solution of the truncation problem, i.e., the estimation of the missing portions in the oblique projection data, before the application of algorithms that require complete projection data such as some rebinning methods (FOREX) or 3-D reconstruction algorithms (3DRP or direct Fourier methods). By taking advantage of all the 3-D data statistics, the iterative FOREPROJ reprojection provides a reliable alternative to the classical FOREPROJ method, which only exploits the low-statistics nonoblique data. It significantly improves the quality of the external reconstructed slices without loss of spatial resolution. As for the approximate extended FORE algorithm, it clearly exhibits limitations due to axial interpolations, but will require clinical studies with more realistic measured data in order to decide on its pertinence.

  5. The Adler D-function for N = 1 SQCD regularized by higher covariant derivatives in the three-loop approximation

    Kataev, A. L.; Kazantsev, A. E.; Stepanyantz, K. V.

    2018-01-01

    We calculate the Adler D-function for N = 1 SQCD in the three-loop approximation using the higher covariant derivative regularization and the NSVZ-like subtraction scheme. The recently formulated all-order relation between the Adler function and the anomalous dimension of the matter superfields defined in terms of the bare coupling constant is first considered and generalized to the case of an arbitrary representation for the chiral matter superfields. The correctness of this all-order relation is explicitly verified at the three-loop level. The special renormalization scheme in which this all-order relation remains valid for the D-function and the anomalous dimension defined in terms of the renormalized coupling constant is constructed in the case of using the higher derivative regularization. The analytic expression for the Adler function for N = 1 SQCD is found in this scheme to the order O (αs2). The problem of scheme-dependence of the D-function and the NSVZ-like equation is briefly discussed.

  6. The Adler D-function for N=1 SQCD regularized by higher covariant derivatives in the three-loop approximation

    A.L. Kataev

    2018-01-01

    Full Text Available We calculate the Adler D-function for N=1 SQCD in the three-loop approximation using the higher covariant derivative regularization and the NSVZ-like subtraction scheme. The recently formulated all-order relation between the Adler function and the anomalous dimension of the matter superfields defined in terms of the bare coupling constant is first considered and generalized to the case of an arbitrary representation for the chiral matter superfields. The correctness of this all-order relation is explicitly verified at the three-loop level. The special renormalization scheme in which this all-order relation remains valid for the D-function and the anomalous dimension defined in terms of the renormalized coupling constant is constructed in the case of using the higher derivative regularization. The analytic expression for the Adler function for N=1 SQCD is found in this scheme to the order O(αs2. The problem of scheme-dependence of the D-function and the NSVZ-like equation is briefly discussed.

  7. Perturbed invariant subspaces and approximate generalized functional variable separation solution for nonlinear diffusion-convection equations with weak source

    Xia, Ya-Rong; Zhang, Shun-Li; Xin, Xiang-Peng

    2018-03-01

    In this paper, we propose the concept of the perturbed invariant subspaces (PISs), and study the approximate generalized functional variable separation solution for the nonlinear diffusion-convection equation with weak source by the approximate generalized conditional symmetries (AGCSs) related to the PISs. Complete classification of the perturbed equations which admit the approximate generalized functional separable solutions (AGFSSs) is obtained. As a consequence, some AGFSSs to the resulting equations are explicitly constructed by way of examples.

  8. Self-similar factor approximants

    Gluzman, S.; Yukalov, V.I.; Sornette, D.

    2003-01-01

    The problem of reconstructing functions from their asymptotic expansions in powers of a small variable is addressed by deriving an improved type of approximants. The derivation is based on the self-similar approximation theory, which presents the passage from one approximant to another as the motion realized by a dynamical system with the property of group self-similarity. The derived approximants, because of their form, are called self-similar factor approximants. These complement the obtained earlier self-similar exponential approximants and self-similar root approximants. The specific feature of self-similar factor approximants is that their control functions, providing convergence of the computational algorithm, are completely defined from the accuracy-through-order conditions. These approximants contain the Pade approximants as a particular case, and in some limit they can be reduced to the self-similar exponential approximants previously introduced by two of us. It is proved that the self-similar factor approximants are able to reproduce exactly a wide class of functions, which include a variety of nonalgebraic functions. For other functions, not pertaining to this exactly reproducible class, the factor approximants provide very accurate approximations, whose accuracy surpasses significantly that of the most accurate Pade approximants. This is illustrated by a number of examples showing the generality and accuracy of the factor approximants even when conventional techniques meet serious difficulties

  9. Integration of large chemical kinetic mechanisms via exponential methods with Krylov approximations to Jacobian matrix functions

    Bisetti, Fabrizio

    2012-06-01

    Recent trends in hydrocarbon fuel research indicate that the number of species and reactions in chemical kinetic mechanisms is rapidly increasing in an effort to provide predictive capabilities for fuels of practical interest. In order to cope with the computational cost associated with the time integration of stiff, large chemical systems, a novel approach is proposed. The approach combines an exponential integrator and Krylov subspace approximations to the exponential function of the Jacobian matrix. The components of the approach are described in detail and applied to the ignition of stoichiometric methane-air and iso-octane-air mixtures, here described by two widely adopted chemical kinetic mechanisms. The approach is found to be robust even at relatively large time steps and the global error displays a nominal third-order convergence. The performance of the approach is improved by utilising an adaptive algorithm for the selection of the Krylov subspace size, which guarantees an approximation to the matrix exponential within user-defined error tolerance. The Krylov projection of the Jacobian matrix onto a low-dimensional space is interpreted as a local model reduction with a well-defined error control strategy. Finally, the performance of the approach is discussed with regard to the optimal selection of the parameters governing the accuracy of its individual components. © 2012 Copyright Taylor and Francis Group, LLC.

  10. Analytical approaches to the determination of spin-dependent parton distribution functions at NNLO approximation

    Salajegheh, Maral; Nejad, S. Mohammad Moosavi; Khanpour, Hamzeh; Tehrani, S. Atashbar

    2018-05-01

    In this paper, we present SMKA18 analysis, which is a first attempt to extract the set of next-to-next-leading-order (NNLO) spin-dependent parton distribution functions (spin-dependent PDFs) and their uncertainties determined through the Laplace transform technique and Jacobi polynomial approach. Using the Laplace transformations, we present an analytical solution for the spin-dependent Dokshitzer-Gribov-Lipatov-Altarelli-Parisi evolution equations at NNLO approximation. The results are extracted using a wide range of proton g1p(x ,Q2) , neutron g1n(x ,Q2) , and deuteron g1d(x ,Q2) spin-dependent structure functions data set including the most recent high-precision measurements from COMPASS16 experiments at CERN, which are playing an increasingly important role in global spin-dependent fits. The careful estimations of uncertainties have been done using the standard Hessian error propagation. We will compare our results with the available spin-dependent inclusive deep inelastic scattering data set and other results for the spin-dependent PDFs in literature. The results obtained for the spin-dependent PDFs as well as spin-dependent structure functions are clearly explained both in the small and large values of x .

  11. Light propagation in 2PN approximation in the field of one moving monopole I. Initial value problem

    Zschocke, Sven

    2018-03-01

    In this investigation the light propagation in the gravitational field of one arbitrarily moving body with monopole structure is considered in the second post-Newtonian approximation. It is found that the light trajectory depends on the acceleration of the body. Some of these acceleration terms are important in order to get well-defined logarithmic functions with dimensionless arguments, while all the other acceleration terms are negligible on the pico-second level of accuracy in time-delay measurements. The expressions of the observables total light deflection and time delay are determined.

  12. Approximation of Mixed-Type Functional Equations in Menger PN-Spaces

    M. Eshaghi Gordji

    2012-01-01

    Full Text Available Let X and Y be vector spaces. We show that a function f:X→Y with f(0=0 satisfies Δf(x1,…,xn=0 for all x1,…,xn∈X, if and only if there exist functions C:X×X×X→Y, B:X×X→Y and A:X→Y such that f(x=C(x,x,x+B(x,x+A(x for all x∈X, where the function C is symmetric for each fixed one variable and is additive for fixed two variables, B is symmetric bi-additive, A is additive and Δf(x1,…,xn=∑k=2n(∑i1=2k∑i2=i1+1k+1⋯∑in-k+1=in-k+1nf(∑i=1,i≠i1,…,in-k+1nxi-∑r=1n-k+1xir+f(∑i=1nxi-2n-2∑i=2n(f(x1+xi+f(x1-xi+2n-1(n-2f(x1 (n∈N, n≥3 for all x1,…,xn∈X. Furthermore, we solve the stability problem for a given function f satisfying Δf(x1,…,xn=0, in the Menger probabilistic normed spaces.

  13. Nonlinear oligopolistic game with isoelastic demand function: Rationality and local monopolistic approximation

    Askar, S.S.; Alnowibet, K.

    2016-01-01

    Isoelastic demand function have been used in literature to study the dynamic features of systems constructed based on economic market structure. In this paper, we adopt the so-called Cobb–Douglas production function and study its impact on the steady state of an oligopolistic game that consists of four oligopolistic competitors or firms. Briefly, the paper handles three different scenarios. The first scenario introduces four oligopolistic firms who plays rational against each other in market. The firms use the myopic mechanism (or bounded rational) to update their production in the next time unit. The steady state of the obtained system in this scenario, which is the Nash equilibrium, is unique and its characteristics are investigated. Based on a local monopolistic approximation (LMA) strategy, one competitor prefers to play against the three rational firms and this is illustrated in the second scenario. The last scenario discusses the case when three competitors use the LMA strategy against a rational one. For all scenarios discrete dynamical systems are used to describe the game introduced in all scenarios. The stability analysis of the Nash equilibrium is investigated analytically and some numerical simulations are used to confirm the obtained analytical results.

  14. A point-value enhanced finite volume method based on approximate delta functions

    Xuan, Li-Jun; Majdalani, Joseph

    2018-02-01

    We revisit the concept of an approximate delta function (ADF), introduced by Huynh (2011) [1], in the form of a finite-order polynomial that holds identical integral properties to the Dirac delta function when used in conjunction with a finite-order polynomial integrand over a finite domain. We show that the use of generic ADF polynomials can be effective at recovering and generalizing several high-order methods, including Taylor-based and nodal-based Discontinuous Galerkin methods, as well as the Correction Procedure via Reconstruction. Based on the ADF concept, we then proceed to formulate a Point-value enhanced Finite Volume (PFV) method, which stores and updates the cell-averaged values inside each element as well as the unknown quantities and, if needed, their derivatives on nodal points. The sharing of nodal information with surrounding elements saves the number of degrees of freedom compared to other compact methods at the same order. To ensure conservation, cell-averaged values are updated using an identical approach to that adopted in the finite volume method. Here, the updating of nodal values and their derivatives is achieved through an ADF concept that leverages all of the elements within the domain of integration that share the same nodal point. The resulting scheme is shown to be very stable at successively increasing orders. Both accuracy and stability of the PFV method are verified using a Fourier analysis and through applications to the linear wave and nonlinear Burgers' equations in one-dimensional space.

  15. Towards the Accuracy of Cybernetic Strategy Planning Models: Causal Proof and Function Approximation

    Christian A. Hillbrand

    2003-04-01

    Full Text Available All kind of strategic tasks within an enterprise require a deep understanding of its critical key success factors and their interrelations as well as an in-depth analysis of relevant environmental influences. Due to the openness of the underlying system, there seems to be an indefinite number of unknown variables influencing strategic goals. Cybernetic or systemic planning techniques try to overcome this intricacy by modeling the most important cause-and-effect relations within such a system. Although it seems to be obvious that there are specific influences between business variables, it is mostly impossible to identify the functional dependencies underlying such relations. Hence simulation or evaluation techniques based on such hypothetically assumed models deliver inaccurate results or fail completely. This paper addresses the need for accurate strategy planning models and proposes an approach to prove their cause-andeffect relations by empirical evidence. Based on this foundation an approach for the approximation of the underlying cause-andeffect function by the means of Artificial Neural Networks is developed.

  16. Applications of functional analysis to optimal control problems

    Mizukami, K.

    1976-01-01

    Some basic concepts in functional analysis, a general norm, the Hoelder inequality, functionals and the Hahn-Banach theorem are described; a mathematical formulation of two optimal control problems is introduced by the method of functional analysis. The problem of time-optimal control systems with both norm constraints on control inputs and on state variables at discrete intermediate times is formulated as an L-problem in the theory of moments. The simplex method is used for solving a non-linear minimizing problem inherent in the functional analysis solution to this problem. Numerical results are presented for a train operation. The second problem is that of optimal control of discrete linear systems with quadratic cost functionals. The problem is concerned with the case of unconstrained control and fixed endpoints. This problem is formulated in terms of norms of functionals on suitable Banach spaces. (author)

  17. New Exact Penalty Functions for Nonlinear Constrained Optimization Problems

    Bingzhuang Liu

    2014-01-01

    Full Text Available For two kinds of nonlinear constrained optimization problems, we propose two simple penalty functions, respectively, by augmenting the dimension of the primal problem with a variable that controls the weight of the penalty terms. Both of the penalty functions enjoy improved smoothness. Under mild conditions, it can be proved that our penalty functions are both exact in the sense that local minimizers of the associated penalty problem are precisely the local minimizers of the original constrained problem.

  18. Extension of Oppenheim's Problem to Bessel Functions

    Zhu Ling

    2007-01-01

    Full Text Available Our aim is to extend some trigonometric inequalities to Bessel functions. Moreover, we deduce the hyperbolic analogue of these trigonometric inequalities, and we extend these inequalities to modified Bessel functions.

  19. Assessment of Functional and Musculoskeletal Problems, and ...

    Jibril Mohammed

    services. The questionnaires were administered to 384 elderly consenting individuals (aged 60 years and above) ... musculoskeletal problems had good ADL performance capacity rating. ..... may be that many of them scored high on tasks that.

  20. An Algorithm Computing the Local $b$ Function by an Approximate Division Algorithm in $\\hat{\\mathcal{D}}$

    Nakayama, Hiromasa

    2006-01-01

    We give an algorithm to compute the local $b$ function. In this algorithm, we use the Mora division algorithm in the ring of differential operators and an approximate division algorithm in the ring of differential operators with power series coefficient.

  1. Study on the generalized WKB approximation for the inverse scattering problem at fixed energy for complex potentials

    Pozdnyakov, Yu.A.; Terenetskij, K.O.

    1981-01-01

    The approximate method for solution of the inverse scattering problem (ISP) at fixed energy for complex spherically symmetric potentials decreasing faster 1/r is considered. The method is based on using a generalized WKB approximation. For the designed potential V(r) a sufficiently ''close'' reference potential V(r) has been chosen. For both potentials S-matrix elements (ME) have been calculated and inversion procedure has been carried out. S-ME have been calculated for integral-valued and intermediate angular moment values. S-ME are presented in a graphical form for being restored reference, and restored potentials for proton scattering with Esub(p)=49.48 MeV energy on 12 C nuclei. The restoration is the better the ''closer'' the sought-for potential to the reference one. This allows to specify the potential by means of iterations: the restored potential can be used as a reference one, etc. The operation of a restored potential smoothing before the following iteration is introduced. Drawbacks and advantages of the ISP solution method under consideration are pointed out. The method application is strongly limited by the requirement that the energy should be higher than a certain ''critical'' one. The method is applicable in a wider region of particle energies (in the low-energies direction) than the ordinary WKB method. The method is more simple in realization conformably to complex potentials. The investigations carried out of the proposed ISP solution method at fixed energy for complex spherically-symmetric potentials allow to conclude that the method can be successFully applied to specify the central part of interaction of nucleons, α-particles and heavy ions of average and high energies with atomic nuclei [ru

  2. Solving global problem by considering multitude of local problems: Application to fluid flow in anisotropic porous media using the multipoint flux approximation

    Salama, Amgad

    2014-09-01

    In this work we apply the experimenting pressure field approach to the numerical solution of the single phase flow problem in anisotropic porous media using the multipoint flux approximation. We apply this method to the problem of flow in saturated anisotropic porous media. In anisotropic media the component flux representation requires, generally multiple pressure values in neighboring cells (e.g., six pressure values of the neighboring cells is required in two-dimensional rectangular meshes). This apparently results in the need for a nine points stencil for the discretized pressure equation (27 points stencil in three-dimensional rectangular mesh). The coefficients associated with the discretized pressure equation are complex and require longer expressions which make their implementation prone to errors. In the experimenting pressure field technique, the matrix of coefficients is generated automatically within the solver. A set of predefined pressure fields is operated on the domain through which the velocity field is obtained. Apparently such velocity fields do not satisfy the mass conservation equations entailed by the source/sink term and boundary conditions from which the residual is calculated. In this method the experimenting pressure fields are designed such that the residual reduces to the coefficients of the pressure equation matrix. © 2014 Elsevier B.V. All rights reserved.

  3. Solving global problem by considering multitude of local problems: Application to fluid flow in anisotropic porous media using the multipoint flux approximation

    Salama, Amgad; Sun, Shuyu; Wheeler, Mary Fanett

    2014-01-01

    In this work we apply the experimenting pressure field approach to the numerical solution of the single phase flow problem in anisotropic porous media using the multipoint flux approximation. We apply this method to the problem of flow in saturated anisotropic porous media. In anisotropic media the component flux representation requires, generally multiple pressure values in neighboring cells (e.g., six pressure values of the neighboring cells is required in two-dimensional rectangular meshes). This apparently results in the need for a nine points stencil for the discretized pressure equation (27 points stencil in three-dimensional rectangular mesh). The coefficients associated with the discretized pressure equation are complex and require longer expressions which make their implementation prone to errors. In the experimenting pressure field technique, the matrix of coefficients is generated automatically within the solver. A set of predefined pressure fields is operated on the domain through which the velocity field is obtained. Apparently such velocity fields do not satisfy the mass conservation equations entailed by the source/sink term and boundary conditions from which the residual is calculated. In this method the experimenting pressure fields are designed such that the residual reduces to the coefficients of the pressure equation matrix. © 2014 Elsevier B.V. All rights reserved.

  4. Promises and problems of functional foods

    Katan, MB; De Roos, NM

    2004-01-01

    "Functional" foods are branded foods, which claim, explicitly or implicitly, to improve health or well being. We review typical functional foods and their ingredients, efficacy, and safety. We also review regulations for health claims for foods worldwide. These regulations often allow manufacturers

  5. Promises and problems of functional foods

    Katan, M.B.; Roos, de N.M.

    2004-01-01

    Functional foods are branded foods, which claim, explicitly or implicitly, to improve health or well being. We review typical functional foods and their ingredients, efficacy, and safety. We also review regulations for health claims for foods worldwide. These regulations often allow manufacturers to

  6. New approximations for the Doppler broadening function applied to the calculation of resonance self-shielding factors

    Palma, Daniel A.; Goncalves, Alessandro C.; Martinez, Aquilino S.; Silva, Fernando C.

    2008-01-01

    The activation technique allows much more precise measurements of neutron intensity, relative or absolute. The technique requires the knowledge of the Doppler broadening function ψ(x,ξ) to determine the resonance self-shielding factors in the epithermal range G epi (τ,ξ). Two new analytical approximations for the Doppler broadening function ψ(x,ξ) are proposed. The approximations proposed are compared with other methods found in literature for the calculation of the ψ(x,ξ) function, that is, the 4-pole Pade method and the Frobenius method, when applied to the calculation of G epi (τ,ξ). The results obtained provided satisfactory accuracy. (authors)

  7. The neuron identity problem: form meets function.

    Fishell, Gord; Heintz, Nathaniel

    2013-10-30

    A complete understanding of nervous system function cannot be achieved without the identification of its component cell types. In this Perspective, we explore a series of related issues surrounding cell identity and how revolutionary methods for labeling and probing specific neuronal types have clarified this question. Specifically, we ask the following questions: what is the purpose of such diversity, how is it generated, how is it maintained, and, ultimately, how can one unambiguously identity one cell type from another? We suggest that each cell type can be defined by a unique and conserved molecular ground state that determines its capabilities. We believe that gaining an understanding of these molecular barcodes will advance our ability to explore brain function, enhance our understanding of the biochemical basis of CNS disorders, and aid in the development of novel therapeutic strategies. Copyright © 2013 Elsevier Inc. All rights reserved.

  8. The next-next-to-leading QCD approximation for non-singlet moments of deep inelastic structure functions

    Larin, S.A.; Ritbergen, T. van; Vermaseren, J.A.M.

    1993-12-01

    We obtain the analytic next-next-to-leading perturbative QCD corrections in the leading twist approximation for the moments N = 2, 4, 6, 8 of the non-singlet deep inelastic structure functions F{sub 2} and F{sub L}. We calculate the three-loop anomalous dimensions of the corresponding non-singlet operators and the three-loop coefficient functions of the structure function F{sub L}. (orig.).

  9. The next-next-to-leading QCD approximation for non-singlet moments of deep inelastic structure functions

    Larin, S.A.; Ritbergen, T. van; Vermaseren, J.A.M.

    1993-12-01

    We obtain the analytic next-next-to-leading perturbative QCD corrections in the leading twist approximation for the moments N = 2, 4, 6, 8 of the non-singlet deep inelastic structure functions F 2 and F L . We calculate the three-loop anomalous dimensions of the corresponding non-singlet operators and the three-loop coefficient functions of the structure function F L . (orig.)

  10. LMI-based stability analysis of fuzzy-model-based control systems using approximated polynomial membership functions.

    Narimani, Mohammand; Lam, H K; Dilmaghani, R; Wolfe, Charles

    2011-06-01

    Relaxed linear-matrix-inequality-based stability conditions for fuzzy-model-based control systems with imperfect premise matching are proposed. First, the derivative of the Lyapunov function, containing the product terms of the fuzzy model and fuzzy controller membership functions, is derived. Then, in the partitioned operating domain of the membership functions, the relations between the state variables and the mentioned product terms are represented by approximated polynomials in each subregion. Next, the stability conditions containing the information of all subsystems and the approximated polynomials are derived. In addition, the concept of the S-procedure is utilized to release the conservativeness caused by considering the whole operating region for approximated polynomials. It is shown that the well-known stability conditions can be special cases of the proposed stability conditions. Simulation examples are given to illustrate the validity of the proposed approach.

  11. Handling data redundancy in helical cone beam reconstruction with a cone-angle-based window function and its asymptotic approximation

    Tang Xiangyang; Hsieh Jiang

    2007-01-01

    A cone-angle-based window function is defined in this manuscript for image reconstruction using helical cone beam filtered backprojection (CB-FBP) algorithms. Rather than defining the window boundaries in a two-dimensional detector acquiring projection data for computed tomographic imaging, the cone-angle-based window function deals with data redundancy by selecting rays with the smallest cone angle relative to the reconstruction plane. To be computationally efficient, an asymptotic approximation of the cone-angle-based window function is also given and analyzed in this paper. The benefit of using such an asymptotic approximation also includes the avoidance of functional discontinuities that cause artifacts in reconstructed tomographic images. The cone-angle-based window function and its asymptotic approximation provide a way, equivalent to the Tam-Danielsson-window, for helical CB-FBP reconstruction algorithms to deal with data redundancy, regardless of where the helical pitch is constant or dynamically variable during a scan. By taking the cone-parallel geometry as an example, a computer simulation study is conducted to evaluate the proposed window function and its asymptotic approximation for helical CB-FBP reconstruction algorithm to handle data redundancy. The computer simulated Forbild head and thorax phantoms are utilized in the performance evaluation, showing that the proposed cone-angle-based window function and its asymptotic approximation can deal with data redundancy very well in cone beam image reconstruction from projection data acquired along helical source trajectories. Moreover, a numerical study carried out in this paper reveals that the proposed cone-angle-based window function is actually equivalent to the Tam-Danielsson-window, and rigorous mathematical proofs are being investigated

  12. Approximation of the Doppler broadening function by Frobenius method; Aproximacao da funcao de alargamento doppler atraves do metodo de Frobenius

    Palma, Daniel A.P. [Centro Federal de Educacao Tecnologica de Quimica de Nilopolis/RJ (CEFET), RJ (Brazil)]. E-mail: dpalma@cefeteq.br; Martinez, Aquilino S.; Silva, Fernando C. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mail: aquilino@lmp.ufrj.br; fernando@lmn.con.ufrj.br

    2005-07-01

    An analytical approximation of the Doppler broadening function {psi}(x,{xi}) is proposed. This approximation is based on the solution of the differential equation for {psi}(x,{xi}) using the methods of Frobenius and the parameters variation. The analytical form derived for {psi}(x,{xi}) in terms of elementary functions is very simple and precise. It can be useful for applications related to the treatment of nuclear resonances mainly for the calculations of multigroup parameters and self-protection factors of the resonances, being the last used to correct microscopic cross-sections measurements by the activation technique. (author)

  13. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    Domí nguez, Luis F.; Pistikopoulos, Efstratios N.

    2012-01-01

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear

  14. Theory for site-site pair distribution functions of molecular fluids. II. Approximations for the Percus--Yevick site-site direct correlation functions

    Johnson, E.

    1977-01-01

    A theory for site-site pair distribution functions of molecular fluids is derived from the Ornstein-Zernike equation. Atom-atom pair distribution functions of this theory which were obtained by using different approximations for the Percus-Yevick site-site direct correlation functions are compared

  15. An open-chain imaginary-time path-integral sampling approach to the calculation of approximate symmetrized quantum time correlation functions.

    Cendagorta, Joseph R; Bačić, Zlatko; Tuckerman, Mark E

    2018-03-14

    We introduce a scheme for approximating quantum time correlation functions numerically within the Feynman path integral formulation. Starting with the symmetrized version of the correlation function expressed as a discretized path integral, we introduce a change of integration variables often used in the derivation of trajectory-based semiclassical methods. In particular, we transform to sum and difference variables between forward and backward complex-time propagation paths. Once the transformation is performed, the potential energy is expanded in powers of the difference variables, which allows us to perform the integrals over these variables analytically. The manner in which this procedure is carried out results in an open-chain path integral (in the remaining sum variables) with a modified potential that is evaluated using imaginary-time path-integral sampling rather than requiring the generation of a large ensemble of trajectories. Consequently, any number of path integral sampling schemes can be employed to compute the remaining path integral, including Monte Carlo, path-integral molecular dynamics, or enhanced path-integral molecular dynamics. We believe that this approach constitutes a different perspective in semiclassical-type approximations to quantum time correlation functions. Importantly, we argue that our approximation can be systematically improved within a cumulant expansion formalism. We test this approximation on a set of one-dimensional problems that are commonly used to benchmark approximate quantum dynamical schemes. We show that the method is at least as accurate as the popular ring-polymer molecular dynamics technique and linearized semiclassical initial value representation for correlation functions of linear operators in most of these examples and improves the accuracy of correlation functions of nonlinear operators.

  16. An open-chain imaginary-time path-integral sampling approach to the calculation of approximate symmetrized quantum time correlation functions

    Cendagorta, Joseph R.; Bačić, Zlatko; Tuckerman, Mark E.

    2018-03-01

    We introduce a scheme for approximating quantum time correlation functions numerically within the Feynman path integral formulation. Starting with the symmetrized version of the correlation function expressed as a discretized path integral, we introduce a change of integration variables often used in the derivation of trajectory-based semiclassical methods. In particular, we transform to sum and difference variables between forward and backward complex-time propagation paths. Once the transformation is performed, the potential energy is expanded in powers of the difference variables, which allows us to perform the integrals over these variables analytically. The manner in which this procedure is carried out results in an open-chain path integral (in the remaining sum variables) with a modified potential that is evaluated using imaginary-time path-integral sampling rather than requiring the generation of a large ensemble of trajectories. Consequently, any number of path integral sampling schemes can be employed to compute the remaining path integral, including Monte Carlo, path-integral molecular dynamics, or enhanced path-integral molecular dynamics. We believe that this approach constitutes a different perspective in semiclassical-type approximations to quantum time correlation functions. Importantly, we argue that our approximation can be systematically improved within a cumulant expansion formalism. We test this approximation on a set of one-dimensional problems that are commonly used to benchmark approximate quantum dynamical schemes. We show that the method is at least as accurate as the popular ring-polymer molecular dynamics technique and linearized semiclassical initial value representation for correlation functions of linear operators in most of these examples and improves the accuracy of correlation functions of nonlinear operators.

  17. The use of linear fractional analogues of rheological models in the problem of approximating the experimental data on the stretch polyvinylchloride elastron

    Luiza G. Ungarova

    2016-12-01

    Full Text Available We considere and analyze the uniaxial phenomenological models of viscoelastic deformation based on fractional analogues of Scott Blair, Voigt, Maxwell, Kelvin and Zener rheological models. Analytical solutions of the corresponding differential equations are obtained with fractional Riemann–Liouville operators under constant stress with further unloading, that are written by the generalized (two-parameter fractional exponential function and contains from two to four parameters depending on the type of model. A method for identifying the model parameters based on the background information for the experimental creep curves with constant stresses was developed. Nonlinear problem of parametric identification is solved by two-step iterative method. The first stage uses the characteristic data points diagrams and features in the behavior of the models under unrestricted growth of time and the initial approximation of parameters are determined. At the second stage, the refinement of these parameters by coordinate descent (the Hooke–Jeeves's method and minimizing the functional standard deviation for calculated and experimental values is made. Method of identification is realized for all the considered models on the basis of the known experimental data uniaxial viscoelastic deformation of Polyvinylchloride Elastron at a temperature of 20∘C and five the tensile stress levels. Table-valued parameters for all models are given. The errors analysis of constructed phenomenological models is made to experimental data over the entire ensemble of curves viscoelastic deformation. It was found that the approximation errors for the Scott Blair fractional model is 14.17 %, for the Voigt fractional model is 11.13 %, for the Maxvell fractional model is 13.02 %, for the Kelvin fractional model 10.56 %, for the Zener fractional model is 11.06 %. The graphs of the calculated and experimental dependences of viscoelastic deformation of Polyvinylchloride

  18. Density functional formulation of the random-phase approximation for inhomogeneous fluids: Application to the Gaussian core and Coulomb particles.

    Frydel, Derek; Ma, Manman

    2016-06-01

    Using the adiabatic connection, we formulate the free energy in terms of the correlation function of a fictitious system, h_{λ}(r,r^{'}), in which interactions λu(r,r^{'}) are gradually switched on as λ changes from 0 to 1. The function h_{λ}(r,r^{'}) is then obtained from the inhomogeneous Ornstein-Zernike equation and the two equations constitute a general liquid-state framework for treating inhomogeneous fluids. The two equations do not yet constitute a closed set. In the present work we use the closure c_{λ}(r,r^{'})≈-λβu(r,r^{'}), known as the random-phase approximation (RPA). We demonstrate that the RPA is identical with the variational Gaussian approximation derived within the field-theoretical framework, originally derived and used for charged particles. We apply our generalized RPA approximation to the Gaussian core model and Coulomb charges.

  19. Approximate rational Jacobi elliptic function solutions of the fractional differential equations via the enhanced Adomian decomposition method

    Song Lina; Wang Weiguo

    2010-01-01

    In this Letter, an enhanced Adomian decomposition method which introduces the h-curve of the homotopy analysis method into the standard Adomian decomposition method is proposed. Some examples prove that this method can derive successfully approximate rational Jacobi elliptic function solutions of the fractional differential equations.

  20. An analytical expression for the non-singlet structure functions at small χ in the double logarithmic approximation

    Lublinsky, M.

    2004-01-01

    A simple analytic expression for the non-singlet structure function fns is given. The expression is derived from the result of B. I. Ermolaev et al. (1996) obtained by low x resummation of the quark ladder diagrams in the double logarithmic approximation of perturbative QCD. (orig.)

  1. An adaptive meshfree method for phase-field models of biomembranes. Part I: Approximation with maximum-entropy basis functions

    Rosolen, A.; Peco, C.; Arroyo, M.

    2013-01-01

    We present an adaptive meshfree method to approximate phase-field models of biomembranes. In such models, the Helfrich curvature elastic energy, the surface area, and the enclosed volume of a vesicle are written as functionals of a continuous phase-field, which describes the interface in a smeared manner. Such functionals involve up to second-order spatial derivatives of the phase-field, leading to fourth-order Euler–Lagrange partial differential equations (PDE). The solutions develop sharp i...

  2. Quasi-particle excitations and dynamical structure function of trapped Bose-condensates in the WKB approximation

    Csordás, András; Graham, Robert; Szépfalusy, Péter

    1997-01-01

    The Bogoliubov equations of the quasi-particle excitations in a weakly interacting trapped Bose-condensate are solved in the WKB approximation in an isotropic harmonic trap, determining the discrete quasi-particle energies and wave functions by torus (Bohr-Sommerfeld) quantization of the integrable classical quasi-particle dynamics. The results are used to calculate the position and strengths of the peaks in the dynamic structure function which can be observed by off-resonance inelastic light...

  3. Uniform approximations of Bernoulli and Euler polynomials in terms of hyperbolic functions

    J.L. López; N.M. Temme (Nico)

    1998-01-01

    textabstractBernoulli and Euler polynomials are considered for large values of the order. Convergent expansions are obtained for $B_n(nz+1/2)$ and $E_n(nz+1/2)$ in powers of $n^{-1$, with coefficients being rational functions of $z$ and hyperbolic functions of argument $1/2z$. These expansions are

  4. January: IBM 7094 programme for the resolution of cell problems in planar, spherical and cylindrical geometry using the double Pn approximation

    Amouyal, A.; Tariel, H.

    1966-01-01

    Code name: January 1 st SCEA 011S. 2) Computer: IBM 7094; Programme system: Fortran II, 2 nd version. 3) Nature of the problem: resolution of cell problems with one space variable (planar, spherical and cylindrical geometries) and with one energy group, with isotropic sources in the double P n approximation (DP 1 and DP 3 approximation in planar and spherical geometries, DP 1 and DP 2 in cylindrical geometry). 4) Method used: the differential equations with limiting conditions are transformed into differential system with initial conditions which are integrated by a separate-step method. 5) Restrictions: number of physical media [fr

  5. Rational approximation of vertical segments

    Salazar Celis, Oliver; Cuyt, Annie; Verdonk, Brigitte

    2007-08-01

    In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.

  6. Approximation to the distribution of fitness effects across functional categories in human segregating polymorphisms.

    Fernando Racimo

    2014-11-01

    Full Text Available Quantifying the proportion of polymorphic mutations that are deleterious or neutral is of fundamental importance to our understanding of evolution, disease genetics and the maintenance of variation genome-wide. Here, we develop an approximation to the distribution of fitness effects (DFE of segregating single-nucleotide mutations in humans. Unlike previous methods, we do not assume that synonymous mutations are neutral or not strongly selected, and we do not rely on fitting the DFE of all new nonsynonymous mutations to a single probability distribution, which is poorly motivated on a biological level. We rely on a previously developed method that utilizes a variety of published annotations (including conservation scores, protein deleteriousness estimates and regulatory data to score all mutations in the human genome based on how likely they are to be affected by negative selection, controlling for mutation rate. We map this and other conservation scores to a scale of fitness coefficients via maximum likelihood using diffusion theory and a Poisson random field model on SNP data. Our method serves to approximate the deleterious DFE of mutations that are segregating, regardless of their genomic consequence. We can then compare the proportion of mutations that are negatively selected or neutral across various categories, including different types of regulatory sites. We observe that the distribution of intergenic polymorphisms is highly peaked at neutrality, while the distribution of nonsynonymous polymorphisms has a second peak at [Formula: see text]. Other types of polymorphisms have shapes that fall roughly in between these two. We find that transcriptional start sites, strong CTCF-enriched elements and enhancers are the regulatory categories with the largest proportion of deleterious polymorphisms.

  7. A New Approach for the Approximations of Solutions to a Common Fixed Point Problem in Metric Fixed Point Theory

    Ishak Altun

    2016-01-01

    Full Text Available We provide sufficient conditions for the existence of a unique common fixed point for a pair of mappings T,S:X→X, where X is a nonempty set endowed with a certain metric. Moreover, a numerical algorithm is presented in order to approximate such solution. Our approach is different to the usual used methods in the literature.

  8. New approximations for the Doppler broadening function applied to the calculation of resonance self-shielding factors

    Palma, Daniel A. [CEFET QUIMICA de Nilopolis/RJ, Rio de Janeiro (Brazil); Goncalves, Alessandro C.; Martinez, Aquilino S.; Silva, Fernando C. [COPPE/UFRJ - Programa de Engenharia Nuclear, Rio de Janeiro (Brazil)

    2008-07-01

    The activation technique allows much more precise measurements of neutron intensity, relative or absolute. The technique requires the knowledge of the Doppler broadening function psi(x,xi) to determine the resonance self-shielding factors in the epithermal range G{sub epi} (tau,xi). Two new analytical approximations for the Doppler broadening function psi(x,xi) are proposed. The approximations proposed are compared with other methods found in literature for the calculation of the psi(x,xi) function, that is, the 4-pole Pade method and the Frobenius method, when applied to the calculation of G{sub epi} (tau,xi). The results obtained provided satisfactory accuracy. (authors)

  9. Approximate spin projected spin-unrestricted density functional theory method: Application to diradical character dependences of second hyperpolarizabilities

    Nakano, Masayoshi, E-mail: mnaka@cheng.es.osaka-u.ac.jp; Minami, Takuya, E-mail: mnaka@cheng.es.osaka-u.ac.jp; Fukui, Hitoshi, E-mail: mnaka@cheng.es.osaka-u.ac.jp; Yoneda, Kyohei, E-mail: mnaka@cheng.es.osaka-u.ac.jp; Shigeta, Yasuteru, E-mail: mnaka@cheng.es.osaka-u.ac.jp; Kishi, Ryohei, E-mail: mnaka@cheng.es.osaka-u.ac.jp [Department of Materials Engineering Science, Graduate School of Engineering Science, Osaka University, Toyonaka, Osaka 560-8531 (Japan); Champagne, Benoît; Botek, Edith [Laboratoire de Chimie Théorique, Facultés Universitaires Notre-Dame de la Paix (FUNDP), rue de Bruxelles, 61, 5000 Namur (Belgium)

    2015-01-22

    We develop a novel method for the calculation and the analysis of the one-electron reduced densities in open-shell molecular systems using the natural orbitals and approximate spin projected occupation numbers obtained from broken symmetry (BS), i.e., spin-unrestricted (U), density functional theory (DFT) calculations. The performance of this approximate spin projection (ASP) scheme is examined for the diradical character dependence of the second hyperpolarizability (γ) using several exchange-correlation functionals, i.e., hybrid and long-range corrected UDFT schemes. It is found that the ASP-LC-UBLYP method with a range separating parameter μ = 0.47 reproduces semi-quantitatively the strongly-correlated [UCCSD(T)] result for p-quinodimethane, i.e., the γ variation as a function of the diradical character.

  10. A Boundary Value Problem for Hermitian Monogenic Functions

    Ricardo Abreu Blaya

    2008-02-01

    Full Text Available We study the problem of finding a Hermitian monogenic function with a given jump on a given hypersurface in ℝm, m=2n. Necessary and sufficient conditions for the solvability of this problem are obtained.

  11. A note on the depth function of combinatorial optimization problems

    Woeginger, G.J.

    2001-01-01

    In a recent paper [Discrete Appl. Math. 43 (1993) 115–129], Kern formulates two conjectures on the relationship between the computational complexity of computing the depth function of a discrete optimization problem and the computational complexity of solving this optimization problem to optimality.

  12. Fast generation of macro basis functions for LEGO through the adaptive cross approximation

    Lancellotti, V.

    2015-01-01

    We present a method for the fast generation of macro basis functions in the context of the linear embedding via Green's operators approach (LEGO) which is a domain decomposition technique based on the combination of electromagnetic bricks in turn described by means of scattering operators. We show

  13. Solution of the chemical master equation by radial basis functions approximation with interface tracking

    Kryven, I.; Röblitz, S; Schütte, C.

    2015-01-01

    Background: The chemical master equation is the fundamental equation of stochastic chemical kinetics. This differential-difference equation describes temporal evolution of the probability density function for states of a chemical system. A state of the system, usually encoded as a vector, represents

  14. The cross section for inclusive deep inelastic scattering in the impulse approximation: scale invariance and mass problems

    Nataf, R.

    1982-06-01

    The non-perturbative calculation of inclusive D.I.S. is made in a parton model different from the ''naive'' one upon two points: 1) the struck quark is off-shell (impulse approximation), 2) kinematical correlations between partons are taken into account. At low Q 2 (4 to 20 GeV 2 ) the best target mass correction is the Nachtmann one [fr

  15. Cognitive functioning and social problem-solving skills in schizophrenia.

    Hatashita-Wong, Michi; Smith, Thomas E; Silverstein, Steven M; Hull, James W; Willson, Deborah F

    2002-05-01

    This study examined the relationships between symptoms, cognitive functioning, and social skill deficits in schizophrenia. Few studies have incorporated measures of cognitive functioning and symptoms in predictive models for social problem solving. For our study, 44 participants were recruited from consecutive outpatient admissions. Neuropsychological tests were given to assess cognitive function, and social problem solving was assessed using structured vignettes designed to evoke the participant's ability to generate, evaluate, and apply solutions to social problems. A sequential model-fitting method of analysis was used to incorporate social problem solving, symptom presentation, and cognitive impairment into linear regression models. Predictor variables were drawn from demographic, cognitive, and symptom domains. Because this method of analysis was exploratory and not intended as hierarchical modelling, no a priori hypotheses were proposed. Participants with higher scores on tests of cognitive flexibility were better able to generate accurate, appropriate, and relevant responses to the social problem-solving vignettes. The results suggest that cognitive flexibility is a potentially important mediating factor in social problem-solving competence. While other factors are related to social problem-solving skill, this study supports the importance of cognition and understanding how it relates to the complex and multifaceted nature of social functioning.

  16. VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport

    Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

    1975-10-01

    The computer code block VENTURE, designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P 1 ) in up to three-dimensional geometry is described. A variety of types of problems may be solved: the usual eigenvalue problem, a direct criticality search on the buckling, on a reciprocal velocity absorber (prompt mode), or on nuclide concentrations, or an indirect criticality search on nuclide concentrations, or on dimensions. First-order perturbation analysis capability is available at the macroscopic cross section level

  17. About solution of multipoint boundary problem of static analysis of deep beam with the use of combined application of finite element method and discrete-continual finite element method. part 1: formulation of the problem and general principles of approximation

    Lyakhovich Leonid

    2017-01-01

    Full Text Available This paper is devoted to formulation and general principles of approximation of multipoint boundary problem of static analysis of deep beam with the use of combined application of finite element method (FEM discrete-continual finite element method (DCFEM. The field of application of DCFEM comprises structures with regular physical and geometrical parameters in some dimension (“basic” dimension. DCFEM presupposes finite element approximation for non-basic dimension while in the basic dimension problem remains continual. DCFEM is based on analytical solutions of resulting multipoint boundary problems for systems of ordinary differential equations with piecewise-constant coefficients.

  18. Maternal Executive Function, Harsh Parenting, and Child Conduct Problems

    Deater-Deckard, Kirby; Wang, Zhe; Chen, Nan; Bell, Martha Ann

    2012-01-01

    Background: Maternal executive function and household regulation both are critical aspects of optimal childrearing, but their interplay is not understood. We tested the hypotheses that (a) the link between challenging child conduct problems and harsh parenting would be strongest for mothers with poorer executive function and weakest among those…

  19. Green function for three-wave coupling problems

    Molevich, N E

    2001-01-01

    The Green function is found for three-wave coupling problems. The function was used for analysis of parametric amplification in dissipative and active media. It is shown that the parametric increment in active media can become exponential. As an example, the nonstationary stimulated scattering of electromagnetic waves by sound and temperatures waves is considered. (nonlinear optical phenomena)

  20. Use Residual Correction Method and Monotone Iterative Technique to Calculate the Upper and Lower Approximate Solutions of Singularly Perturbed Non-linear Boundary Value Problems

    Chi-Chang Wang

    2013-09-01

    Full Text Available This paper seeks to use the proposed residual correction method in coordination with the monotone iterative technique to obtain upper and lower approximate solutions of singularly perturbed non-linear boundary value problems. First, the monotonicity of a non-linear differential equation is reinforced using the monotone iterative technique, then the cubic-spline method is applied to discretize and convert the differential equation into the mathematical programming problems of an inequation, and finally based on the residual correction concept, complex constraint solution problems are transformed into simpler questions of equational iteration. As verified by the four examples given in this paper, the method proposed hereof can be utilized to fast obtain the upper and lower solutions of questions of this kind, and to easily identify the error range between mean approximate solutions and exact solutions.

  1. A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem

    Goldengorin, B.; Ghosh, D.

    Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use

  2. Short-distance behavior of the Bethe--Salpeter wave function in the ladder approximation

    Guth, A.H.; Soper, D.E.

    1975-01-01

    We investigate the short-distance behavior of the (Wick-rotated) Bethe--Salpeter wave function for the two spin-1/2 quarks bound by the exchange of a massive vector meson. We use the ladder-model kernel, which has the same p -4 scaling behavior as the true kernel in a theory with a fixed point of the renormalization group at g not equal to 0. For a bound state with the quantum numbers of the pion, the leading asymptotic behavior is chi (q/sup μ/) approx. cq/sup -4 + epsilon(g)/γ 5 , where epsilon (g) =1- (1-g 2 /π 2 ) 1 / 2 . Our method also provides the full asymptotic series, although it should be noted that the nonleading terms will depend on the nonleading behavior of the ladder-model kernel. A general term has the form cq - /sup a/(lnq)/sup n/phi (q/sup μ/), where c is an unknown constant, a may be integral or nonintegral, n is an integer, and phi (q/sup μ/) is a representation function of the rotation group in four dimensions

  3. Cognitive functioning and everyday problem solving in older adults.

    Burton, Catherine L; Strauss, Esther; Hultsch, David F; Hunter, Michael A

    2006-09-01

    The relationship between cognitive functioning and a performance-based measure of everyday problem-solving, the Everyday Problems Test (EPT), thought to index instrumental activities of daily living (IADL), was examined in 291 community-dwelling non-demented older adults. Performance on the EPT was found to vary according to age, cognitive status, and education. Hierarchical regression analyses revealed that, after adjusting for demographic and health variables, measures of cognitive functioning accounted for 23.6% of the variance in EPT performance. In particular, measures of global cognitive status, cognitive decline, speed of processing, executive functioning, episodic memory, and verbal ability were significant predictors of EPT performance. These findings suggest that cognitive functioning along with demographic variables are important determinants of everyday problem-solving.

  4. Approximations for the single-product production-inventory problem with compound Poisson demand and service-level constraints

    Kok, de A.G.; Tijms, H.C.; Duyn Schouten, van der F.A.

    1984-01-01

    We consider a production-inventory problem in which the production rate can be continuously controlled in order to cope with random fluctuations in the demand. The demand process for a single product is a compound Poisson process. Excess demand is backlogged. Two production rates are available and

  5. Bulk and interface dielectric functions: New results within the tight-binding approximation

    Elvira, V.D.; Duran, J.C.

    1991-01-01

    A tight-binding approach is used to analyze the dielectric behaviour of bulk semiconductors and semiconductor interfaces. This time interactions between second nearest neighbours are taken into account and several electrostatic models are proposed for the induced charge density around the atoms. The bulk dielectric function of different semiconductors (Si, Ge, GaAs and AlAs) are obtained and compared with other theoretical and experimental results. Finally, the energy band offset for GaAs-AlAs(1,0,0) interface is obtained and related to bulk properties of both semiconductors. The results presented in this paper show how the use of very simple but more realistic electrostatic models improve the analysis of the screening properties in semiconductors, giving a new support to the consistent tight-binding method for studying characteristics related to those properties. (Author)

  6. The force law for the dynamic two-body problem in the second post-Newtonian approximation of general relativity

    Breuer, R.A.; Rudolph, E.

    1982-01-01

    The force between two well-separated bodies is calculated in a fully dynamic system of two extended bodies up to and including the second post-Newtonian approximation (PNA). The iteration procedure as formulated by Anderson and Decanio is used in a version whose divergences have been pushed to the third PNA. The following are shown: (i) The force law assumes the ''Newtonian form'' if a second approximation in 1/(separation of the bodies) is made; (ii) the mass terms appearing in the force law are the (Tolman) masses of the individual bodies expanded up the second PNA; the internal masses equal the (passive and active) gravitational masses of the bodies in order considered; they are all constants of the motion; (iii) the self-fields of the bodies vanish in the second PNA; hence there is no Nordvedt effect in the second PNA; (iv) the compactness of the bodies, i.e., (gravitational radius)/(body size), does not appear in the force law; only the relation between mass and the matter variables is changed in the PNA as compared with the corresponding Newtonian result. (author)

  7. Finite elements and approximation

    Zienkiewicz, O C

    2006-01-01

    A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o

  8. Spherical cavity-expansion forcing function in PRONTO 3D for application to penetration problems

    Warren, T.L.; Tabbara, M.R.

    1997-05-01

    In certain penetration events the primary mode of deformation of the target can be approximated by known analytical expressions. In the context of an analysis code, this approximation eliminates the need for modeling the target as well as the need for a contact algorithm. This technique substantially reduces execution time. In this spirit, a forcing function which is derived from a spherical-cavity expansion analysis has been implemented in PRONTO 3D. This implementation is capable of computing the structural and component responses of a projectile due to three dimensional penetration events. Sample problems demonstrate good agreement with experimental and analytical results.

  9. Density functional theory of electron transfer beyond the Born-Oppenheimer approximation: Case study of LiF

    Li, Chen; Requist, Ryan; Gross, E. K. U.

    2018-02-01

    We perform model calculations for a stretched LiF molecule, demonstrating that nonadiabatic charge transfer effects can be accurately and seamlessly described within a density functional framework. In alkali halides like LiF, there is an abrupt change in the ground state electronic distribution due to an electron transfer at a critical bond length R = Rc, where an avoided crossing of the lowest adiabatic potential energy surfaces calls the validity of the Born-Oppenheimer approximation into doubt. Modeling the R-dependent electronic structure of LiF within a two-site Hubbard model, we find that nonadiabatic electron-nuclear coupling produces a sizable elongation of the critical Rc by 0.5 bohr. This effect is very accurately captured by a simple and rigorously derived correction, with an M-1 prefactor, to the exchange-correlation potential in density functional theory, M = reduced nuclear mass. Since this nonadiabatic term depends on gradients of the nuclear wave function and conditional electronic density, ∇Rχ(R) and ∇Rn(r, R), it couples the Kohn-Sham equations at neighboring R points. Motivated by an observed localization of nonadiabatic effects in nuclear configuration space, we propose a local conditional density approximation—an approximation that reduces the search for nonadiabatic density functionals to the search for a single function y(n).

  10. HIGHLY PRECISE APPROXIMATION OF FREE SURFACE GREEN FUNCTION AND ITS HIGH ORDER DERIVATIVES BASED ON REFINED SUBDOMAINS

    Jiameng Wu

    2018-01-01

    Full Text Available The infinite depth free surface Green function (GF and its high order derivatives for diffraction and radiation of water waves are considered. Especially second order derivatives are essential requirements in high-order panel method. In this paper, concerning the classical representation, composed of a semi-infinite integral involving a Bessel function and a Cauchy singularity, not only the GF and its first order derivatives but also second order derivatives are derived from four kinds of analytical series expansion and refined division of whole calculation domain. The approximations of special functions, particularly the hypergeometric function and the algorithmic applicability with different subdomains are implemented. As a result, the computation accuracy can reach 10-9 in whole domain compared with conventional methods based on direct numerical integration. Furthermore, numerical efficiency is almost equivalent to that with the classical method.

  11. Functional geometric method for solving free boundary problems for harmonic functions

    Demidov, Aleksander S [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

    2010-01-01

    A survey is given of results and approaches for a broad spectrum of free boundary problems for harmonic functions of two variables. The main results are obtained by the functional geometric method. The core of these methods is an interrelated analysis of the functional and geometric characteristics of the problems under consideration and of the corresponding non-linear Riemann-Hilbert problems. An extensive list of open questions is presented. Bibliography: 124 titles.

  12. Iteration of Aitken's Δ2 Process as an alternative to Pade approximants and the problem of using rational fractions to parameterize experimental data

    McRae, G.A.

    1992-01-01

    It is shown that iterating Aitken's Δ 2 process, or equivalently Shanks' ε algorithm on the partial sums of a Taylor series can lead to a dramatic convergence of the series. This method is compared to the standard technique of accelerating the convergence of series by constructing Pade Approximants. Also, the problem of determining Taylor expansion coefficients from experimental data fitted to Pade Approximants is reviewed, and it is suggested that a method based on this iteration scheme may be better. (author). 6 refs., 1 fig

  13. Semi-supervised Learning Predicts Approximately One Third of the Alternative Splicing Isoforms as Functional Proteins

    Yanqi Hao

    2015-07-01

    Full Text Available Alternative splicing acts on transcripts from almost all human multi-exon genes. Notwithstanding its ubiquity, fundamental ramifications of splicing on protein expression remain unresolved. The number and identity of spliced transcripts that form stably folded proteins remain the sources of considerable debate, due largely to low coverage of experimental methods and the resulting absence of negative data. We circumvent this issue by developing a semi-supervised learning algorithm, positive unlabeled learning for splicing elucidation (PULSE; http://www.kimlab.org/software/pulse, which uses 48 features spanning various categories. We validated its accuracy on sets of bona fide protein isoforms and directly on mass spectrometry (MS spectra for an overall AU-ROC of 0.85. We predict that around 32% of “exon skipping” alternative splicing events produce stable proteins, suggesting that the process engenders a significant number of previously uncharacterized proteins. We also provide insights into the distribution of positive isoforms in various functional classes and into the structural effects of alternative splicing.

  14. Describing function theory as applied to thermal and neutronic problems

    Nassersharif, B.

    1983-01-01

    Describing functions have traditionally been used to obtain the solutions of systems of ordinary differential equations. In this work the describing function concept has been extended to include nonlinear, distributed parameter partial differential equations. A three-stage solution algorithm is presented which can be applied to any nonlinear partial differential equation. Two generalized integral transforms were developed as the T-transform for the time domain and the B-transform for the spatial domain. The thermal diffusion describing function (TDDF) is developed for conduction of heat in solids and a general iterative solution along with convergence criteria is presented. The proposed solution method is used to solve the problem of heat transfer in nuclear fuel rods with annular fuel pellets. As a special instance the solid cylindrical fuel pellet is examined. A computer program is written which uses the describing function concept for computing fuel pin temperatures in the radial direction during reactor transients. The second problem investigated was the neutron diffusion equation which is intrinsically different from the first case. Although, for most situations, it can be treated as a linear differential equation, the describing function method is still applicable. A describing function solution is derived for two possible cases: constant diffusion coefficient and variable diffusion coefficient. Two classes of describing functions are defined for each case which portray the leakage and absorption phenomena. For the specific case of a slab reactor criticality problem the comparison between analytical and describing function solutions revealed an excellent agreement

  15. Distributed approximating functional fit of the H3 ab initio potential-energy data of Liu and Siegbahn

    Frishman, A.; Hoffman, D.K.; Kouri, D.J.

    1997-01-01

    We report a distributed approximating functional (DAF) fit of the ab initio potential-energy data of Liu [J. Chem. Phys. 58, 1925 (1973)] and Siegbahn and Liu [ibid. 68, 2457 (1978)]. The DAF-fit procedure is based on a variational principle, and is systematic and general. Only two adjustable parameters occur in the DAF leading to a fit which is both accurate (to the level inherent in the input data; RMS error of 0.2765 kcal/mol) and smooth (open-quotes well-tempered,close quotes in DAF terminology). In addition, the LSTH surface of Truhlar and Horowitz based on this same data [J. Chem. Phys. 68, 2466 (1978)] is itself approximated using only the values of the LSTH surface on the same grid coordinate points as the ab initio data, and the same DAF parameters. The purpose of this exercise is to demonstrate that the DAF delivers a well-tempered approximation to a known function that closely mimics the true potential-energy surface. As is to be expected, since there is only roundoff error present in the LSTH input data, even more significant figures of fitting accuracy are obtained. The RMS error of the DAF fit, of the LSTH surface at the input points, is 0.0274 kcal/mol, and a smooth fit, accurate to better than 1cm -1 , can be obtained using more than 287 input data points. copyright 1997 American Institute of Physics

  16. Molecular Excitation Energies from Time-Dependent Density Functional Theory Employing Random-Phase Approximation Hessians with Exact Exchange.

    Heßelmann, Andreas

    2015-04-14

    Molecular excitation energies have been calculated with time-dependent density-functional theory (TDDFT) using random-phase approximation Hessians augmented with exact exchange contributions in various orders. It has been observed that this approach yields fairly accurate local valence excitations if combined with accurate asymptotically corrected exchange-correlation potentials used in the ground-state Kohn-Sham calculations. The inclusion of long-range particle-particle with hole-hole interactions in the kernel leads to errors of 0.14 eV only for the lowest excitations of a selection of three alkene, three carbonyl, and five azabenzene molecules, thus surpassing the accuracy of a number of common TDDFT and even some wave function correlation methods. In the case of long-range charge-transfer excitations, the method typically underestimates accurate reference excitation energies by 8% on average, which is better than with standard hybrid-GGA functionals but worse compared to range-separated functional approximations.

  17. Random functions via Dyson Brownian Motion: progress and problems

    Wang, Gaoyuan; Battefeld, Thorsten

    2016-01-01

    We develope a computationally efficient extension of the Dyson Brownian Motion (DBM) algorithm to generate random function in C"2 locally. We further explain that random functions generated via DBM show an unstable growth as the traversed distance increases. This feature restricts the use of such functions considerably if they are to be used to model globally defined ones. The latter is the case if one uses random functions to model landscapes in string theory. We provide a concrete example, based on a simple axionic potential often used in cosmology, to highlight this problem and also offer an ad hoc modification of DBM that suppresses this growth to some degree.

  18. Random functions via Dyson Brownian Motion: progress and problems

    Wang, Gaoyuan; Battefeld, Thorsten [Institute for Astrophysics, University of Goettingen,Friedrich Hund Platz 1, D-37077 Goettingen (Germany)

    2016-09-05

    We develope a computationally efficient extension of the Dyson Brownian Motion (DBM) algorithm to generate random function in C{sup 2} locally. We further explain that random functions generated via DBM show an unstable growth as the traversed distance increases. This feature restricts the use of such functions considerably if they are to be used to model globally defined ones. The latter is the case if one uses random functions to model landscapes in string theory. We provide a concrete example, based on a simple axionic potential often used in cosmology, to highlight this problem and also offer an ad hoc modification of DBM that suppresses this growth to some degree.

  19. Gauss-Arnoldi quadrature for -1φ,φ> and rational Pade-type approximation for Markov-type functions

    Knizhnerman, L A

    2008-01-01

    The efficiency of Gauss-Arnoldi quadrature for the calculation of the quantity -1 φ,φ> is studied, where A is a bounded operator in a Hilbert space and φ is a non-trivial vector in this space. A necessary and a sufficient conditions are found for the efficiency of the quadrature in the case of a normal operator. An example of a non-normal operator for which this quadrature is inefficient is presented. It is shown that Gauss-Arnoldi quadrature is related in certain cases to rational Pade-type approximation (with the poles at Ritz numbers) for functions of Markov type and, in particular, can be used for the localization of the poles of a rational perturbation. Error estimates are found, which can also be used when classical Pade approximation does not work or it may not be efficient. Theoretical results and conjectures are illustrated by numerical experiments. Bibliography: 44 titles

  20. Total-energy Assisted Tight-binding Method Based on Local Density Approximation of Density Functional Theory

    Fujiwara, Takeo; Nishino, Shinya; Yamamoto, Susumu; Suzuki, Takashi; Ikeda, Minoru; Ohtani, Yasuaki

    2018-06-01

    A novel tight-binding method is developed, based on the extended Hückel approximation and charge self-consistency, with referring the band structure and the total energy of the local density approximation of the density functional theory. The parameters are so adjusted by computer that the result reproduces the band structure and the total energy, and the algorithm for determining parameters is established. The set of determined parameters is applicable to a variety of crystalline compounds and change of lattice constants, and, in other words, it is transferable. Examples are demonstrated for Si crystals of several crystalline structures varying lattice constants. Since the set of parameters is transferable, the present tight-binding method may be applicable also to molecular dynamics simulations of large-scale systems and long-time dynamical processes.

  1. Expectation values of r sup q between Dirac and quasirelativistic wave functions in the quantum-defect approximation

    Kwato-Njock, K

    2002-01-01

    A search is conducted for the determination of expectation values of r sup q between Dirac and quasirelativistic radial wave functions in the quantum-defect approximation. The phenomenological and supersymmetry-inspired quantum-defect models which have proven so far to yield accurate results are used. The recursive structure of formulae derived on the basis of the hypervirial theorem enables us to develop explicit relations for arbitrary values of q. Detailed numerical calculations concerning alkali-metal-like ions of the Li-, Na- and Cu-iso electronic sequences confirm the superiority of supersymmetry-based quantum-defect theory over quantum-defect orbital and exact orbital quantum number approximations. It is also shown that relativistic rather than quasirelativistic treatment may be used for consistent inclusion of relativistic effects.

  2. Expectation values of $r^{q}$ between Dirac and quasirelativistic wave functions in the quantum-defect approximation

    Kwato-Njock, M G; Oumarou, B

    2002-01-01

    A search is conducted for the determination of expectation values of $r^q$ between Dirac and quasirelativistic radial wave functions in the quantum-defect approximation. The phenomenological and supersymmetry-inspired quantum-defect models which have proven so far to yield accurate results are used. The recursive structure of formulae derived on the basis of the hypervirial theorem enables us to develop explicit relations for arbitrary values of $q$. Detailed numerical calculations concerning alkali-metal-like ions of the Li-, Na- and Cu-iso electronic sequences confirm the superiority of supersymmetry-based quantum-defect theory over quantum-defect orbital and exact orbital quantum number approximations. It is also shown that relativistic rather than quasirelativistic treatment may be used for consistent inclusion of relativistic effects.

  3. Functional analysis screening for multiple topographies of problem behavior.

    Bell, Marlesha C; Fahmie, Tara A

    2018-04-23

    The current study evaluated a screening procedure for multiple topographies of problem behavior in the context of an ongoing functional analysis. Experimenters analyzed the function of a topography of primary concern while collecting data on topographies of secondary concern. We used visual analysis to predict the function of secondary topographies and a subsequent functional analysis to test those predictions. Results showed that a general function was accurately predicted for five of six (83%) secondary topographies. A specific function was predicted and supported for a subset of these topographies. The experimenters discuss the implication of these results for clinicians who have limited time for functional assessment. © 2018 Society for the Experimental Analysis of Behavior.

  4. VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport, version II

    Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

    1977-11-01

    The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P 1 ) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently

  5. VENTURE: a code block for solving multigroup neutronics problems applying the finite-difference diffusion-theory approximation to neutron transport, version II. [LMFBR

    Vondy, D.R.; Fowler, T.B.; Cunningham, G.W.

    1977-11-01

    The report documents the computer code block VENTURE designed to solve multigroup neutronics problems with application of the finite-difference diffusion-theory approximation to neutron transport (or alternatively simple P/sub 1/) in up to three-dimensional geometry. It uses and generates interface data files adopted in the cooperative effort sponsored by the Reactor Physics Branch of the Division of Reactor Research and Development of the Energy Research and Development Administration. Several different data handling procedures have been incorporated to provide considerable flexibility; it is possible to solve a wide variety of problems on a variety of computer configurations relatively efficiently.

  6. Erratum to ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009) 81-87

    Rapine , Christophe

    2013-01-01

    International audience; In Allaoui H., Artiba A, ''Johnson's algorithm : A key to solve optimally or approximately flowshop scheduling problems with unavailability periods'' [International Journal of Production Economics 121 (2009)] the authors propose optimality conditions for the Johnson sequence in presence of one unavailability period on the first machine and pretend for a performance guarantee of 2 when several unavailability periods may occur. We establish in this note that these condit...

  7. On a free-surface problem with moving contact line: From variational principles to stable numerical approximations

    Fumagalli, Ivan; Parolini, Nicola; Verani, Marco

    2018-02-01

    We analyze a free-surface problem described by time-dependent Navier-Stokes equations. Surface tension, capillary effects and wall friction are taken into account in the evolution of the system, influencing the motion of the contact line - where the free surface hits the wall - and of the dynamics of the contact angle. The differential equations governing the phenomenon are first derived from the variational principle of minimum reduced dissipation, and then discretized by means of the ALE approach. The numerical properties of the resulting scheme are investigated, drawing a parallel with the physical properties holding at the continuous level. Some instability issues are addressed in detail, in the case of an explicit treatment of the geometry, and novel additional terms are introduced in the discrete formulation in order to damp the instabilities. Numerical tests assess the suitability of the approach, the influence of the parameters, and the effectiveness of the new stabilizing terms.

  8. Study and obtention of exact, and approximation, algorithms and heuristics for a mesh partitioning problem under memory constraints

    Morais, Sebastien

    2016-01-01

    In many scientific areas, the size and the complexity of numerical simulations lead to make intensive use of massively parallel runs on High Performance Computing (HPC) architectures. Such computers consist in a set of processing units (PU) where memory is distributed. Distribution of simulation data is therefore crucial: it has to minimize the computation time of the simulation while ensuring that the data allocated to every PU can be locally stored in memory. For most of the numerical simulations, the physical and numerical data are based on a mesh. The computations are then performed at the cell level (for example within triangles and quadrilaterals in 2D, or within tetrahedrons and hexahedrons in 3D). More specifically, computing and memory cost can be associated to each cell. In our context, where the mathematical methods used are finite elements or finite volumes, the realization of the computations associated with a cell may require information carried by neighboring cells. The standard implementation relies to locally store useful data of this neighborhood on the PU, even if cells of this neighborhood are not locally computed. Such non computed but stored cells are called ghost cells, and can have a significant impact on the memory consumption of a PU. The problem to solve is thus not only to partition a mesh on several parts by affecting each cell to one and only one part while minimizing the computational load assigned to each part. It is also necessary to keep into account that the memory load of both the cells where the computations are performed and their neighbors has to fit into PU memory. This leads to partition the computations while the mesh is distributed with overlaps. Explicitly taking these data overlaps into account is the problem that we propose to study. (author) [fr

  9. Bayesian inverse problems for functions and applications to fluid mechanics

    Cotter, S L; Dashti, M; Robinson, J C; Stuart, A M

    2009-01-01

    In this paper we establish a mathematical framework for a range of inverse problems for functions, given a finite set of noisy observations. The problems are hence underdetermined and are often ill-posed. We study these problems from the viewpoint of Bayesian statistics, with the resulting posterior probability measure being defined on a space of functions. We develop an abstract framework for such problems which facilitates application of an infinite-dimensional version of Bayes theorem, leads to a well-posedness result for the posterior measure (continuity in a suitable probability metric with respect to changes in data), and also leads to a theory for the existence of maximizing the posterior probability (MAP) estimators for such Bayesian inverse problems on function space. A central idea underlying these results is that continuity properties and bounds on the forward model guide the choice of the prior measure for the inverse problem, leading to the desired results on well-posedness and MAP estimators; the PDE analysis and probability theory required are thus clearly dileneated, allowing a straightforward derivation of results. We show that the abstract theory applies to some concrete applications of interest by studying problems arising from data assimilation in fluid mechanics. The objective is to make inference about the underlying velocity field, on the basis of either Eulerian or Lagrangian observations. We study problems without model error, in which case the inference is on the initial condition, and problems with model error in which case the inference is on the initial condition and on the driving noise process or, equivalently, on the entire time-dependent velocity field. In order to undertake a relatively uncluttered mathematical analysis we consider the two-dimensional Navier–Stokes equation on a torus. The case of Eulerian observations—direct observations of the velocity field itself—is then a model for weather forecasting. The case of

  10. Design Of the Approximation Function of a Pedometer based on Artificial Neural Network for the Healthy Life Style Promotion in Diabetic Patients

    Vega Corona, Antonio; Zárate Banda, Magdalena; Barron Adame, Jose Miguel; Martínez Celorio, René Alfredo; Andina de la Fuente, Diego

    2008-01-01

    The present study describes the design of an Artificial Neural Network to synthesize the Approximation Function of a Pedometer for the Healthy Life Style Promotion. Experimentally, the approximation function is synthesized using three basic digital pedometers of low cost, these pedometers were calibrated with an advanced pedometer that calculates calories consumed and computes distance travelled with personal stride input. The synthesized approximation function by means of the designed neural...

  11. First-row diatomics: Calculation of the geometry and energetics using self-consistent gradient-functional approximations

    Kutzler, F.W.; Painter, G.S.

    1992-01-01

    A fully self-consistent series of nonlocal (gradient) density-functional calculations has been carried out using the augmented-Gaussian-orbital method to determine the magnitude of gradient corrections to the potential-energy curves of the first-row diatomics, Li 2 through F 2 . Both the Langreth-Mehl-Hu and the Perdew-Wang gradient-density functionals were used in calculations of the binding energy, bond length, and vibrational frequency for each dimer. Comparison with results obtained in the local-spin-density approximation (LSDA) using the Vosko-Wilk-Nusair functional, and with experiment, reveals that bond lengths and vibrational frequencies are rather insensitive to details of the gradient functionals, including self-consistency effects, but the gradient corrections reduce the overbinding commonly observed in the LSDA calculations of first-row diatomics (with the exception of Li 2 , the gradient-functional binding-energy error is only 50--12 % of the LSDA error). The improved binding energies result from a large differential energy lowering, which occurs in open-shell atoms relative to the diatomics. The stabilization of the atom arises from the use of nonspherical charge and spin densities in the gradient-functional calculations. This stabilization is negligibly small in LSDA calculations performed with nonspherical densities

  12. Modified Strum functions method in the nuclear three body problem

    Nasyrov, M.; Abdurakhmanov, A.; Yunusova, M.

    1997-01-01

    Fadeev-Hahn equations in the nuclear three-body problem were solved by modified Sturm functions method. Numerical calculations were carried out the square well potential. It was shown that the convergence of the method is high and the binding energy value is in agreement with experimental one (A.A.D.)

  13. Green function of a three-dimensional Wick problem

    Matveev, V.A.

    1988-01-01

    An exact solution of a three-dimensional Coulomb Wick-Cutkovsky problem has been obtained which possesses the hidden 0(4)-symmetry. Here we shell give the derivation of the corresponding Green function and consider its connection with the asymptoric behaviour of the scattering amplitude. 9 refs

  14. Multivariate Epi-splines and Evolving Function Identification Problems

    2015-04-15

    such extrinsic information as well as observed function and subgradient values often evolve in applications, we establish conditions under which the...previous study [30] dealt with compact intervals of IR. Splines are intimately tied to optimization problems through their variational theory pioneered...approxima- tion. Motivated by applications in curve fitting, regression, probability density estimation, variogram computation, financial curve construction

  15. ACTUAL AND UNSOLVED PROBLEMS OF FUNCTIONAL CONSTIPATIONS IN INFANTS

    N.I. Ursova

    2010-01-01

    Full Text Available The article presents modern point of view on the problem of functional constipations in infants. It describes peculiarities of digestion, intestinal micro biocenosis in healthy infants, the ways of its correction. Author indicates principles of choice of defined drugs effective on early stages of postnatal development. The advantages of osmotic laxative — macrogol 4,000 (Forlax in treatment of functional constipations in children are presented.Key words: infants, large intestine, functional disorders, nutrition, laxatives, macrogol, prebiotics.(Voprosy sovremennoi pediatrii — Current Pediatrics. – 2010;9(3:63-69

  16. Application of Walsh functions to neutron transport problems. I. Theory

    Seed, T.J.; Albrecht, R.W.

    1976-01-01

    An approximation to the neutron transport equation is made by representing the angular flux with an expansion of the angular dependence in the orthogonal, complete, and binary valued sets of Walsh function. The Walsh approximation is applied to the one-speed, isotropic-scattering, rectangular-geometry form of the neutron transport equation. Sets of partial differential equations for the expansion coefficients are derived along with appropriate boundary conditions for their solution. The sets of the Walsh expansion to one- and two-dimensional forms of the transport equation are also obtained. The two-dimensional expansion coefficient equations are shown to be not only hyperbolic but also transformable to a set of S/sub N/-like equations that are coupled only through the scattering term. Such transformal sets of equations are termed Walsh-derived quadrature sets

  17. Wavelet approach to accelerator problems. 3: Melnikov functions and symplectic topology

    Fedorova, A.; Zeitlin, M.; Parsa, Z.

    1997-05-01

    This is the third part of a series of talks in which the authors present applications of methods of wavelet analysis to polynomial approximations for a number of accelerator physics problems. They consider the generalization of the variational wavelet approach to nonlinear polynomial problems to the case of Hamiltonian systems for which they need to preserve underlying symplectic or Poissonian or quasicomplex structures in any type of calculations. They use the approach for the problem of explicit calculations of Arnold-Weinstein curves via Floer variational approach from symplectic topology. The loop solutions are parameterized by the solutions of reduced algebraical problem--matrix Quadratic Mirror Filters equations. Also they consider wavelet approach to the calculations of Melnikov functions in the theory of homoclinic chaos in perturbed Hamiltonian systems

  18. Dynamic and static correlation functions in the inhomogeneous Hartree-Fock-state approach with random-phase-approximation fluctuations

    Lorenzana, J.; Grynberg, M.D.; Yu, L.; Yonemitsu, K.; Bishop, A.R.

    1992-11-01

    The ground state energy, and static and dynamic correlation functions are investigated in the inhomogeneous Hartree-Fock (HF) plus random phase approximation (RPA) approach applied to a one-dimensional spinless fermion model showing self-trapped doping states at the mean field level. Results are compared with homogeneous HF and exact diagonalization. RPA fluctuations added to the generally inhomogeneous HF ground state allows the computation of dynamical correlation functions that compare well with exact diagonalization results. The RPA correction to the ground state energy agrees well with the exact results at strong and weak coupling limits. We also compare it with a related quasi-boson approach. The instability towards self-trapped behaviour is signaled by a RPA mode with frequency approaching zero. (author). 21 refs, 10 figs

  19. Ab initio quasi-particle approximation bandgaps of silicon nanowires calculated at density functional theory/local density approximation computational effort

    Ribeiro, M., E-mail: ribeiro.jr@oorbit.com.br [Office of Operational Research for Business Intelligence and Technology, Principal Office, Buffalo, Wyoming 82834 (United States)

    2015-06-21

    Ab initio calculations of hydrogen-passivated Si nanowires were performed using density functional theory within LDA-1/2, to account for the excited states properties. A range of diameters was calculated to draw conclusions about the ability of the method to correctly describe the main trends of bandgap, quantum confinement, and self-energy corrections versus the diameter of the nanowire. Bandgaps are predicted with excellent accuracy if compared with other theoretical results like GW, and with the experiment as well, but with a low computational cost.

  20. Ab initio quasi-particle approximation bandgaps of silicon nanowires calculated at density functional theory/local density approximation computational effort

    Ribeiro, M.

    2015-01-01

    Ab initio calculations of hydrogen-passivated Si nanowires were performed using density functional theory within LDA-1/2, to account for the excited states properties. A range of diameters was calculated to draw conclusions about the ability of the method to correctly describe the main trends of bandgap, quantum confinement, and self-energy corrections versus the diameter of the nanowire. Bandgaps are predicted with excellent accuracy if compared with other theoretical results like GW, and with the experiment as well, but with a low computational cost

  1. Analysis of Green's functions and stability problem in models of quantum field theory with solitons

    Raczka, R.; Roszkowski, L.

    1983-10-01

    A class of models of quantum field theory for a multiplet phi-vector=(phi 1 ,...,phisub(N)) of real scalar fields, possessing a particle-like classical solution phi-vector 0 , is considered. A new formula for generating functional for time-ordered Green's functions in terms of effective propagators is derived. The problem of classical and quantum stability is analyzed in detail. It is shown by partly non-perturbative analysis that in the considered models the excited states of mesons do exist and form the trajectories in the plane mass 2 -spin. These trajectories are linear or approximately linear like experimental trajectories. (author)

  2. Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: application to random elliptic PDEs

    Nobile, F.

    2015-10-30

    In this work we provide a convergence analysis for the quasi-optimal version of the sparse-grids stochastic collocation method we presented in a previous work: “On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods” (Beck et al., Math Models Methods Appl Sci 22(09), 2012). The construction of a sparse grid is recast into a knapsack problem: a profit is assigned to each hierarchical surplus and only the most profitable ones are added to the sparse grid. The convergence rate of the sparse grid approximation error with respect to the number of points in the grid is then shown to depend on weighted summability properties of the sequence of profits. This is a very general argument that can be applied to sparse grids built with any uni-variate family of points, both nested and non-nested. As an example, we apply such quasi-optimal sparse grids to the solution of a particular elliptic PDE with stochastic diffusion coefficients, namely the “inclusions problem”: we detail the convergence estimates obtained in this case using polynomial interpolation on either nested (Clenshaw–Curtis) or non-nested (Gauss–Legendre) abscissas, verify their sharpness numerically, and compare the performance of the resulting quasi-optimal grids with a few alternative sparse-grid construction schemes recently proposed in the literature.

  3. Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: application to random elliptic PDEs

    Nobile, F.; Tamellini, L.; Tempone, Raul

    2015-01-01

    In this work we provide a convergence analysis for the quasi-optimal version of the sparse-grids stochastic collocation method we presented in a previous work: “On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods” (Beck et al., Math Models Methods Appl Sci 22(09), 2012). The construction of a sparse grid is recast into a knapsack problem: a profit is assigned to each hierarchical surplus and only the most profitable ones are added to the sparse grid. The convergence rate of the sparse grid approximation error with respect to the number of points in the grid is then shown to depend on weighted summability properties of the sequence of profits. This is a very general argument that can be applied to sparse grids built with any uni-variate family of points, both nested and non-nested. As an example, we apply such quasi-optimal sparse grids to the solution of a particular elliptic PDE with stochastic diffusion coefficients, namely the “inclusions problem”: we detail the convergence estimates obtained in this case using polynomial interpolation on either nested (Clenshaw–Curtis) or non-nested (Gauss–Legendre) abscissas, verify their sharpness numerically, and compare the performance of the resulting quasi-optimal grids with a few alternative sparse-grid construction schemes recently proposed in the literature.

  4. Polynomial approximation on polytopes

    Totik, Vilmos

    2014-01-01

    Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.

  5. Application of Influence Function Method to the Fretting Wear Problems

    Lee, Choon Yeol; Tian, Li Si; Bae, Joon Woo; Chai, Young Suck [Yeungnam University, Gyongsan (Korea, Republic of)

    2006-07-01

    Numerical analysis by influence function method (IFM) is demonstrated in this study in order to investigate the fretting wear problems on the secondary side of the steam generator, caused by flow induced vibration. Two-dimensional numerical contact model in terms of Cauchy integral equation is developed. The distributions of normal pressures, shear stresses and displacement fields are derived between two contact bodies which have similar elastic properties. The work rate model is adopted to find the wear amounts between two materials. The results are compared with the solutions by finite element analyses, which show the utilization of the present method to the fretting wear problems.

  6. Application of Influence Function Method to the Fretting Wear Problems

    Lee, Choon Yeol; Tian, Li Si; Bae, Joon Woo; Chai, Young Suck

    2006-01-01

    Numerical analysis by influence function method (IFM) is demonstrated in this study in order to investigate the fretting wear problems on the secondary side of the steam generator, caused by flow induced vibration. Two-dimensional numerical contact model in terms of Cauchy integral equation is developed. The distributions of normal pressures, shear stresses and displacement fields are derived between two contact bodies which have similar elastic properties. The work rate model is adopted to find the wear amounts between two materials. The results are compared with the solutions by finite element analyses, which show the utilization of the present method to the fretting wear problems

  7. Approximate Dynamic Programming: Combining Regional and Local State Following Approximations.

    Deptula, Patryk; Rosenfeld, Joel A; Kamalapurkar, Rushikesh; Dixon, Warren E

    2018-06-01

    An infinite-horizon optimal regulation problem for a control-affine deterministic system is solved online using a local state following (StaF) kernel and a regional model-based reinforcement learning (R-MBRL) method to approximate the value function. Unlike traditional methods such as R-MBRL that aim to approximate the value function over a large compact set, the StaF kernel approach aims to approximate the value function in a local neighborhood of the state that travels within a compact set. In this paper, the value function is approximated using a state-dependent convex combination of the StaF-based and the R-MBRL-based approximations. As the state enters a neighborhood containing the origin, the value function transitions from being approximated by the StaF approach to the R-MBRL approach. Semiglobal uniformly ultimately bounded (SGUUB) convergence of the system states to the origin is established using a Lyapunov-based analysis. Simulation results are provided for two, three, six, and ten-state dynamical systems to demonstrate the scalability and performance of the developed method.

  8. An improved saddlepoint approximation.

    Gillespie, Colin S; Renshaw, Eric

    2007-08-01

    Given a set of third- or higher-order moments, not only is the saddlepoint approximation the only realistic 'family-free' technique available for constructing an associated probability distribution, but it is 'optimal' in the sense that it is based on the highly efficient numerical method of steepest descents. However, it suffers from the problem of not always yielding full support, and whilst [S. Wang, General saddlepoint approximations in the bootstrap, Prob. Stat. Lett. 27 (1992) 61.] neat scaling approach provides a solution to this hurdle, it leads to potentially inaccurate and aberrant results. We therefore propose several new ways of surmounting such difficulties, including: extending the inversion of the cumulant generating function to second-order; selecting an appropriate probability structure for higher-order cumulants (the standard moment closure procedure takes them to be zero); and, making subtle changes to the target cumulants and then optimising via the simplex algorithm.

  9. Combinations of coupled cluster, density functionals, and the random phase approximation for describing static and dynamic correlation, and van der Waals interactions

    Garza, Alejandro J.; Bulik, Ireneusz W.; Alencar, Ana G. Sousa; Sun, Jianwei; Perdew, John P.; Scuseria, Gustavo E.

    2016-04-01

    Contrary to standard coupled cluster doubles (CCD) and Brueckner doubles (BD), singlet-paired analogues of CCD and BD (denoted here as CCD0 and BD0) do not break down when static correlation is present, but neglect substantial amounts of dynamic correlation. In fact, CCD0 and BD0 do not account for any contributions from multielectron excitations involving only same-spin electrons at all. We exploit this feature to add - without introducing double counting, self-interaction, or increase in cost - the missing correlation to these methods via meta-GGA (generalised gradient approximation) density functionals (Tao-Perdew-Staroverov-Scuseria and strongly constrained and appropriately normed). Furthermore, we improve upon these CCD0+DFT blends by invoking range separation: the short- and long-range correlations absent in CCD0/BD0 are evaluated with density functional theory and the direct random phase approximation, respectively. This corrects the description of long-range van der Waals forces. Comprehensive benchmarking shows that the combinations presented here are very accurate for weakly correlated systems, while also providing a reasonable description of strongly correlated problems without resorting to symmetry breaking.

  10. Optimization of vehicle compartment low frequency noise based on Radial Basis Function Neuro-Network Approximation Model

    HU Qi-guo

    2017-01-01

    Full Text Available For reducing the vehicle compartment low frequency noise, the Optimal Latin hypercube sampling method was applied to perform experimental design for sampling in the factorial design space. The thickness parameters of the panels with larger acoustic contribution was considered as factors, as well as the vehicle mass, seventh rank modal frequency of body, peak sound pressure of test point and sound pressure root-mean-square value as responses. By using the RBF(radial basis function neuro-network method, an approximation model of four responses about six factors was established. Further more, error analysis of established approximation model was performed in this paper. To optimize the panel’s thickness parameter, the adaptive simulated annealing algorithm was im-plemented. Optimization results show that the peak sound pressure of driver’s head was reduced by 4.45dB and 5.47dB at frequency 158HZ and 134Hz respec-tively. The test point pressure were significantly reduced at other frequency as well. The results indicate that through the optimization the vehicle interior cavity noise was reduced effectively, and the acoustical comfort of the vehicle was im-proved significantly.

  11. The boundary value problem for discrete analytic functions

    Skopenkov, Mikhail

    2013-06-01

    This paper is on further development of discrete complex analysis introduced by R.Isaacs, J.Ferrand, R.Duffin, and C.Mercat. We consider a graph lying in the complex plane and having quadrilateral faces. A function on the vertices is called discrete analytic, if for each face the difference quotients along the two diagonals are equal.We prove that the Dirichlet boundary value problem for the real part of a discrete analytic function has a unique solution. In the case when each face has orthogonal diagonals we prove that this solution uniformly converges to a harmonic function in the scaling limit. This solves a problem of S.Smirnov from 2010. This was proved earlier by R.Courant-K.Friedrichs-H.Lewy and L.Lusternik for square lattices, by D.Chelkak-S.Smirnov and implicitly by P.G.Ciarlet-P.-A.Raviart for rhombic lattices.In particular, our result implies uniform convergence of the finite element method on Delaunay triangulations. This solves a problem of A.Bobenko from 2011. The methodology is based on energy estimates inspired by alternating-current network theory. © 2013 Elsevier Ltd.

  12. Electron energy distribution function in the positive column of a neon glow discharge using the black wall approximation

    Al-Hawat, Sh; Naddaf, M

    2005-01-01

    The electron energy distribution function (EEDF) was determined from the second derivative of the I-V Langmuir probe characteristics and, thereafter, theoretically calculated by solving the plasma kinetic equation, using the black wall (BW) approximation, in the positive column of a neon glow discharge. The pressure has been varied from 0.5 to 4 Torr and the current from 10 to 30 mA. The measured electron temperature, density and electric field strength were used as input data for solving the kinetic equation. Comparisons were made between the EEDFs obtained from experiment, the BW approach, the Maxwellian distribution and the Rutcher solution of the kinetic equation in the elastic energy range. The best conditions for the BW approach are found to be under the discharge conditions: current density j d = 4.45 mA cm -2 and normalized electric field strength E/p = 1.88 V cm -1 Torr -1

  13. Electron energy distribution function in the positive column of a neon glow discharge using the black wall approximation

    Al-Hawat, Sh; Naddaf, M.

    2005-04-01

    The electron energy distribution function (EEDF) was determined from the second derivative of the I-V Langmuir probe characteristics and, thereafter, theoretically calculated by solving the plasma kinetic equation, using the black wall (BW) approximation, in the positive column of a neon glow discharge. The pressure has been varied from 0.5 to 4 Torr and the current from 10 to 30 mA. The measured electron temperature, density and electric field strength were used as input data for solving the kinetic equation. Comparisons were made between the EEDFs obtained from experiment, the BW approach, the Maxwellian distribution and the Rutcher solution of the kinetic equation in the elastic energy range. The best conditions for the BW approach are found to be under the discharge conditions: current density jd = 4.45 mA cm-2 and normalized electric field strength E/p = 1.88 V cm-1 Torr-1.

  14. ROAM: A Radial-Basis-Function Optimization Approximation Method for Diagnosing the Three-Dimensional Coronal Magnetic Field

    Dalmasse, Kevin; Nychka, Douglas W.; Gibson, Sarah E.; Fan, Yuhong; Flyer, Natasha

    2016-01-01

    The Coronal Multichannel Polarimeter (CoMP) routinely performs coronal polarimetric measurements using the Fe XIII 10747 and 10798 lines, which are sensitive to the coronal magnetic field. However, inverting such polarimetric measurements into magnetic field data is a difficult task because the corona is optically thin at these wavelengths and the observed signal is therefore the integrated emission of all the plasma along the line of sight. To overcome this difficulty, we take on a new approach that combines a parameterized 3D magnetic field model with forward modeling of the polarization signal. For that purpose, we develop a new, fast and efficient, optimization method for model-data fitting: the Radial-basis-functions Optimization Approximation Method (ROAM). Model-data fitting is achieved by optimizing a user-specified log-likelihood function that quantifies the differences between the observed polarization signal and its synthetic/predicted analog. Speed and efficiency are obtained by combining sparse evaluation of the magnetic model with radial-basis-function (RBF) decomposition of the log-likelihood function. The RBF decomposition provides an analytical expression for the log-likelihood function that is used to inexpensively estimate the set of parameter values optimizing it. We test and validate ROAM on a synthetic test bed of a coronal magnetic flux rope and show that it performs well with a significantly sparse sample of the parameter space. We conclude that our optimization method is well-suited for fast and efficient model-data fitting and can be exploited for converting coronal polarimetric measurements, such as the ones provided by CoMP, into coronal magnetic field data.

  15. Approximate Bayesian computation.

    Mikael Sunnåker

    Full Text Available Approximate Bayesian computation (ABC constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology.

  16. A Cp-theory problem book compactness in function spaces

    Tkachuk, Vladimir V

    2015-01-01

    This third volume in Vladimir Tkachuk's series on Cp-theory problems applies all modern methods of Cp-theory to study compactness-like properties in function spaces and introduces the reader to the theory of compact spaces widely used in Functional Analysis. The text is designed to bring a dedicated reader from basic topological principles to the frontiers of modern research covering a wide variety of topics in Cp-theory and general topology at the professional level.  The first volume, Topological and Function Spaces © 2011, provided an introduction from scratch to Cp-theory and general topology, preparing the reader for a professional understanding of Cp-theory in the last section of its main text. The second volume, Special Features of Function Spaces © 2014, continued from the first, giving reasonably complete coverage of Cp-theory, systematically introducing each of the major topics and providing 500 carefully selected problems and exercises with complete solutions. This third volume is self-contained...

  17. Mittag–Leffler's function, Vekua transform and an inverse obstacle scattering problem

    Ikehata, Masaru

    2010-01-01

    This paper studies a prototype of inverse obstacle scattering problems whose governing equation is the Helmholtz equation in two dimensions. An explicit method to extract information about the location and shape of unknown obstacles from the far-field operator with a fixed wave number is given. The method is based on an explicit construction of a modification of Mittag–Leffler's function via the Vekua transform and the study of the asymptotic behaviour; an explicit density in the Herglotz wavefunction that approximates the modification of Mittag–Leffler's function in the bounded domain surrounding unknown obstacles; a system of inequalities derived from Kirsch's factorization formula of the far-field operator. Then an indicator function which can be calculated from the far-field operator acting on the density is introduced. It is shown that the asymptotic behaviour of the indicator function yields information about the visible part of the exterior of the obstacles

  18. Nonlinear electronic excitations in crystalline solids using meta-generalized gradient approximation and hybrid functional in time-dependent density functional theory

    Sato, Shunsuke A. [Graduate School of Pure and Applied Sciences, University of Tsukuba, Tsukuba 305-8571 (Japan); Taniguchi, Yasutaka [Center for Computational Science, University of Tsukuba, Tsukuba 305-8571 (Japan); Department of Medical and General Sciences, Nihon Institute of Medical Science, 1276 Shimogawara, Moroyama-Machi, Iruma-Gun, Saitama 350-0435 (Japan); Shinohara, Yasushi [Max Planck Institute of Microstructure Physics, 06120 Halle (Germany); Yabana, Kazuhiro [Graduate School of Pure and Applied Sciences, University of Tsukuba, Tsukuba 305-8571 (Japan); Center for Computational Science, University of Tsukuba, Tsukuba 305-8571 (Japan)

    2015-12-14

    We develop methods to calculate electron dynamics in crystalline solids in real-time time-dependent density functional theory employing exchange-correlation potentials which reproduce band gap energies of dielectrics; a meta-generalized gradient approximation was proposed by Tran and Blaha [Phys. Rev. Lett. 102, 226401 (2009)] (TBm-BJ) and a hybrid functional was proposed by Heyd, Scuseria, and Ernzerhof [J. Chem. Phys. 118, 8207 (2003)] (HSE). In time evolution calculations employing the TB-mBJ potential, we have found it necessary to adopt the predictor-corrector step for a stable time evolution. We have developed a method to evaluate electronic excitation energy without referring to the energy functional which is unknown for the TB-mBJ potential. For the HSE functional, we have developed a method for the operation of the Fock-like term in Fourier space to facilitate efficient use of massive parallel computers equipped with graphic processing units. We compare electronic excitations in silicon and germanium induced by femtosecond laser pulses using the TB-mBJ, HSE, and a simple local density approximation (LDA). At low laser intensities, electronic excitations are found to be sensitive to the band gap energy: they are close to each other using TB-mBJ and HSE and are much smaller in LDA. At high laser intensities close to the damage threshold, electronic excitation energies do not differ much among the three cases.

  19. Value Function Approximation or Stopping Time Approximation

    Stentoft, Lars

    2014-01-01

    In their 2001 paper, Longstaff and Schwartz suggested a method for American option pricing using simulation and regression, and since then this method has rapidly gained importance. However, the idea of using regression and simulation for American option pricing was used at least as early as 1996......, due to this difference, it is possible to provide arguments favoring the method of Longstaff and Schwartz. Finally, we compare the methods in a realistic numerical setting and show that practitioners would do well to choose the method of Longstaff and Schwartz instead of the methods of Carriere...

  20. Preimage Selective Trapdoor Function: How to Repair an Easy Problem

    Baocang Wang

    2014-01-01

    Full Text Available Public key cryptosystems are constructed by embedding a trapdoor into a one-way function. So, the one-wayness and the trapdoorness are vital to public key cryptography. In this paper, we propose a novel public key cryptographic primitive called preimage selective trapdoor function. This scenario allows to use exponentially many preimage to hide a plaintext even if the underlying function is not one-way. The compact knapsack problem is used to construct a probabilistic public key cryptosystem, the underlying encryption function of which is proven to be preimage selective trapdoor one-way functions under some linearization attack models. The constructive method can guarantee the noninjectivity of the underlying encryption function and the unique decipherability for ciphertexts simultaneously. It is heuristically argued that the security of the proposal cannot be compromised by a polynomial-time adversary even if the compact knapsack is easy to solve. We failed to provide any provable security results about the proposal; however, heuristic illustrations show that the proposal is secure against some known attacks including brute force attacks, linearization attacks, and key-recovery attacks. The proposal turns out to have acceptable key sizes and performs efficiently and hence is practical.

  1. A Cp-theory problem book functional equivalencies

    Tkachuk, Vladimir V

    2016-01-01

    This fourth volume in Vladimir Tkachuk's series on Cp-theory gives reasonably complete coverage of the theory of functional equivalencies through 500 carefully selected problems and exercises. By systematically introducing each of the major topics of Cp-theory, the book is intended to bring a dedicated reader from basic topological principles to the frontiers of modern research. The book presents complete and up-to-date information on the preservation of topological properties by homeomorphisms of function spaces.  An exhaustive theory of t-equivalent, u-equivalent and l-equivalent spaces is developed from scratch.   The reader will also find introductions to the theory of uniform spaces, the theory of locally convex spaces, as well as  the theory of inverse systems and dimension theory. Moreover, the inclusion of Kolmogorov's solution of Hilbert's Problem 13 is included as it is needed for the presentation of the theory of l-equivalent spaces. This volume contains the most important classical re...

  2. Eikonal Approximation in AdS/CFT: Conformal Partial Waves and Finite N Four-Point Functions

    Cornalba, L; Penedones, J; Schiappa, R; Cornalba, Lorenzo; Costa, Miguel S.; Penedones, Joao; Schiappa, Ricardo

    2007-01-01

    We introduce the impact-parameter representation for conformal field theory correlators of the form A ~ . This representation is appropriate in the eikonal kinematical regime, and approximates the conformal partial-wave decomposition in the limit of large spin and dimension of the exchanged primary. Using recent results on the two-point function _{shock} in the presence of a shock wave in Anti-de Sitter, and its relation to the discontinuity of the four-point amplitude A across a kinematical branch-cut, we find the high spin and dimension conformal partial- wave decomposition of all tree-level Anti-de Sitter Witten diagrams. We show that, as in flat space, the eikonal kinematical regime is dominated by the T-channel exchange of the massless particle with highest spin (graviton dominance). We also compute the anomalous dimensions of the high-spin O_1 O_2 composites. Finally, we conjecture a formula re-summing crossed-ladder Witten diagrams to all orders in the gravitational coupling.

  3. Finding the best density functional approximation to describe interaction energies and structures of ionic liquids in molecular dynamics studies

    Perlt, Eva; Ray, Promit; Hansen, Andreas; Malberg, Friedrich; Grimme, Stefan; Kirchner, Barbara

    2018-05-01

    Ionic liquids raise interesting but complicated questions for theoretical investigations due to the fact that a number of different inter-molecular interactions, e.g., hydrogen bonding, long-range Coulomb interactions, and dispersion interactions, need to be described properly. Here, we present a detailed study on the ionic liquids ethylammonium nitrate and 1-ethyl-3-methylimidazolium acetate, in which we compare different dispersion corrected density functional approximations to accurate local coupled cluster data in static calculations on ionic liquid clusters. The efficient new composite method B97-3c is tested and has been implemented in CP2K for future studies. Furthermore, tight-binding based approaches which may be used in large scale simulations are assessed. Subsequently, ab initio as well as classical molecular dynamics simulations are conducted and structural analyses are presented in order to shed light on the different short- and long-range structural patterns depending on the method and the system size considered in the simulation. Our results indicate the presence of strong hydrogen bonds in ionic liquids as well as the aggregation of alkyl side chains due to dispersion interactions.

  4. Electron energy distribution function in the positive column of a neon glow discharge using the black wall approximation

    Al-Hawat, Sh; Naddaf, M [Physics Department, Atomic Energy Commission, PO Box 6091, Damascus (Syrian Arab Republic)

    2005-04-21

    The electron energy distribution function (EEDF) was determined from the second derivative of the I-V Langmuir probe characteristics and, thereafter, theoretically calculated by solving the plasma kinetic equation, using the black wall (BW) approximation, in the positive column of a neon glow discharge. The pressure has been varied from 0.5 to 4 Torr and the current from 10 to 30 mA. The measured electron temperature, density and electric field strength were used as input data for solving the kinetic equation. Comparisons were made between the EEDFs obtained from experiment, the BW approach, the Maxwellian distribution and the Rutcher solution of the kinetic equation in the elastic energy range. The best conditions for the BW approach are found to be under the discharge conditions: current density j{sub d} = 4.45 mA cm{sup -2} and normalized electric field strength E/p = 1.88 V cm{sup -1} Torr{sup -1}.

  5. Eikonal approximation in AdS/CFT: Conformal partial waves and finite N four-point functions

    Cornalba, Lorenzo; Costa, Miguel S.; Penedones, Joao; Schiappa, Ricardo

    2007-01-01

    We introduce the impact parameter representation for conformal field theory correlators of the form A∼ 1 O 2 O 1 O 2 >. This representation is appropriate in the eikonal kinematical regime, and approximates the conformal partial wave decomposition in the limit of large spin and dimension of the exchanged primary. Using recent results on the two-point function 1 O 1 > shock in the presence of a shock wave in anti-de Sitter, and its relation to the discontinuity of the four-point amplitude A across a kinematical branch cut, we find the high spin and dimension conformal partial wave decomposition of all tree-level anti-de Sitter Witten diagrams. We show that, as in flat space, the eikonal kinematical regime is dominated by the T-channel exchange of the massless particle with highest spin (graviton dominance). We also compute the anomalous dimensions of the high spin O 1 O 2 composites. Finally, we conjecture a formula re-summing crossed-ladder Witten diagrams to all orders in the gravitational coupling

  6. On the semi-classical approximation to the wave function of the universe and its stochastic interpretation

    Pollock, M.D.

    1988-01-01

    In quantum cosmology, a wave function Ψ for a given theory can be obtained by solving the Wheeler-DeWitt equation, using the semi-classical approximation to the path integral over euclidean metrics to impose the boundary condition, as described by Hawking and his collaborators. If the universe is expanding as a quasi-de Sitter space-time, then it is possible to derive a Fokker-Planck equation for the probability distribution P, as shown by Starobinsky. Arguing by analogy with quantum mechanics in flat space-time, one would expect that P ∝ ΨΨ * . We examine this assertion by reference to the scale-invariant theory L = -1/24 βR 2 , whose wave function has been calculated in mini-superspace by Horowitz, and whose classical solutions are de Sitter space-times. It appears that deviations from the relation P ∝ ΨΨ * are attributable to long-wavelength fluctuations δΦ e ≅ H/2π in the effective inflaton field Φ c =√(βR)=√(12β) H. Their existence is taken into account in the derivation of the Fokker-Planck equation, but not in the derivation of Ψ when this is restricted to mini-superspace. In the limit β → ∞, we find that δΦ e /Φ c → 0 and that P ∝ ΨΨ * . The scale-invariant theory L = (1/2εφ 2 R-1/4λΦ 4 ) can be similarly analyzed. Inclusion of a kinetic term 1/2Φ; k Φ ;k destroys this similarity, which is restored however upon addition of a term (-1/24βR 2 ). (orig.)

  7. THE ANALYSIS OF ANALYTICAL FUNCTIONS FOR APPROXIMATIVE DO-ALL MAGNETIC CHARACTERISTIC OF DIRECT – CURRENT AND UNDULATED – CURRENT TRACTION MOTORS

    H. K. Hetman

    2011-01-01

    Full Text Available A number of functions for approximating the universal magnetic curve and its derivatives, their accuracy and conformity to the requirements put forward by the authors have been studied.

  8. Psychological problems and family functioning as risk factors in addiction.

    Agha, Sajida; Zia, Hamid; Irfan, Syed

    2008-01-01

    The purpose of the present research was to determine the role of family functioning and psychological problems of drug addicts and non addicts by assessing the difference between the two groups. After detailed literature review it was hypothesized that scores on the variable of communication, affective expression and control among family members of addicts will be higher than non addicts. Furthermore scores on the variables of anger control problems, emotional distress and positive self will also be higher of addicts. This was a cohort study. A cluster sampling method was used. Sample of present research consisted of 240 adolescents divided into two groups of 120 addicts and 120 non-addicts each from different socio-economic status. General scale of Family Assessment Measure-Version III (FAM-III) was administered in order to measure the level of communication, value and norms whereas dyadic Relationship Scale was used to measure affective expression and control among the family members of addicts and non addicts. Renold Adolescent Adjustment Screening Inventory was administered in order to assess anger control problems, emotional distress and positive self in addicts and non addicts. t-test was calculated in order to determine the difference in the level of communication, value and norms, affective expression and control among families of addicts and non addicts. Furthermore difference in anger control problems, emotional distress and positive self between the addicts and non addicts was also determined by calculating t-test. Results showed significant differences in the variables among the family members and there is also a significant difference between addicts and non addicts. Avenues for further research have been suggested.

  9. Spin-adapted open-shell random phase approximation and time-dependent density functional theory. I. Theory.

    Li, Zhendong; Liu, Wenjian

    2010-08-14

    The spin-adaptation of single-reference quantum chemical methods for excited states of open-shell systems has been nontrivial. The primary reason is that the configuration space, generated by a truncated rank of excitations from only one component of a reference multiplet, is spin-incomplete. Those "missing" configurations are of higher ranks and can, in principle, be recaptured by a particular class of excitation operators. However, the resulting formalisms are then quite involved and there are situations [e.g., time-dependent density functional theory (TD-DFT) under the adiabatic approximation] that prevent one from doing so. To solve this issue, we propose here a tensor-coupling scheme that invokes all the components of a reference multiplet (i.e., a tensor reference) rather than increases the excitation ranks. A minimal spin-adapted n-tuply excited configuration space can readily be constructed by tensor products between the n-tuple tensor excitation operators and the chosen tensor reference. Further combined with the tensor equation-of-motion formalism, very compact expressions for excitation energies can be obtained. As a first application of this general idea, a spin-adapted open-shell random phase approximation is first developed. The so-called "translation rule" is then adopted to formulate a spin-adapted, restricted open-shell Kohn-Sham (ROKS)-based TD-DFT (ROKS-TD-DFT). Here, a particular symmetry structure has to be imposed on the exchange-correlation kernel. While the standard ROKS-TD-DFT can access only excited states due to singlet-coupled single excitations, i.e., only some of the singly excited states of the same spin (S(i)) as the reference, the new scheme can capture all the excited states of spin S(i)-1, S(i), or S(i)+1 due to both singlet- and triplet-coupled single excitations. The actual implementation and computation are very much like the (spin-contaminated) unrestricted Kohn-Sham-based TD-DFT. It is also shown that spin-contaminated spin

  10. January: IBM 7094 programme for the resolution of cell problems in planar, spherical and cylindrical geometry using the double P{sub n} approximation; Janvier: programme de resolution sur IBM 7094 des problemes de cellules en geometrie plane, spherique et cylindrique dans l'approximation double P{sub n}

    Amouyal, A; Tariel, H [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

    1966-07-01

    Code name: January 1{sup st} SCEA 011S. 2) Computer: IBM 7094; Programme system: Fortran II, 2{sup nd} version. 3) Nature of the problem: resolution of cell problems with one space variable (planar, spherical and cylindrical geometries) and with one energy group, with isotropic sources in the double P{sub n} approximation (DP 1 and DP 3 approximation in planar and spherical geometries, DP 1 and DP 2 in cylindrical geometry). 4) Method used: the differential equations with limiting conditions are transformed into differential system with initial conditions which are integrated by a separate-step method. 5) Restrictions: number of physical media < 100, number of geometrical regions < 100, number of points < 1000. 6) Physical approximations: limiting conditions for reflection, black body or grey body (restrictions for spherical and cylindrical geometries). The diffusion can include an isotropy term in cylindrical geometry, 2 terms in the other geometries. Taking into account of macroscopic data. 7) Duration: calculation time for a network of 100 points: planar and spherical geometry: double P 1 1 second, D P 3 = 4 seconds; cylindrical geometry: double P 1 2 seconds, D P 2 = 4 seconds. To these times should be added the 3 seconds required for the output. 8) State of the programme under production. (authors) [French] 1) Nom du Code: Janvier 1 SCEA 011S. 2) Calculateur: IBM 7094; Systeme de programmation: Fortran II version-2. 3) Nature du probleme: resolution des problemes de cellule a une variable d'espace (geometries plane, spherique et cylindrique) et un groupe d'energie, avec sources isotropes, dans l'approxirnation double P{sub n} (Approximations DP 1 et DP 3 en geometrie plane et spherique, approximations DP 1 et DP 2 en geometrie cylindrique). Methode employee: les equations differentielles avec conditions aux limites sont transformees en systemes differentiels avec conditions initiales que l'on integre par une methode a pas separes. 5) Restrictions: nombre de

  11. CONTRIBUTIONS TO RATIONAL APPROXIMATION,

    Some of the key results of linear Chebyshev approximation theory are extended to generalized rational functions. Prominent among these is Haar’s...linear theorem which yields necessary and sufficient conditions for uniqueness. Some new results in the classic field of rational function Chebyshev...Furthermore a Weierstrass type theorem is proven for rational Chebyshev approximation. A characterization theorem for rational trigonometric Chebyshev approximation in terms of sign alternation is developed. (Author)

  12. Primary damage in tungsten using the binary collision approximation, molecular dynamic simulations and the density functional theory

    De Backer, A; Sand, A; Ortiz, C J; Domain, C; Olsson, P; Berthod, E; Becquart, C S

    2016-01-01

    The damage produced by primary knock-on atoms (PKA) in W has been investigated from the threshold displacement energy (TDE) where it produces one self interstitial atom–vacancy pair to larger energies, up to 100 keV, where a large molten volume is formed. The TDE has been determined in different crystal directions using the Born–Oppenheimer density functional molecular dynamics (DFT-MD). A significant difference has been observed without and with the semi-core electrons. Classical MD has been used with two different empirical potentials characterized as ‘soft’ and ‘hard’ to obtain statistics on TDEs. Cascades of larger energy have been calculated, with these potentials, using a model that accounts for electronic losses (Sand et al 2013 Europhys. Lett. 103 46003). Two other sets of cascades have been produced using the binary collision approximation (BCA): a Monte Carlo BCA using SDTrimSP (Eckstein et al 2011 SDTrimSP: Version 5.00. Report IPP 12/8) (similar to SRIM www.srim.org) and MARLOWE (RSICC Home Page. (https://rsicc.ornl.gov/codes/psr/psr1/psr-137.html) (accessed May, 2014)). The comparison of these sets of cascades gave a recombination distance equal to 12 Å which is significantly larger from the one we reported in Hou et al (2010 J. Nucl. Mater. 403 89) because, here, we used bulk cascades rather than surface cascades which produce more defects (Stoller 2002 J. Nucl. Mater. 307 935, Nordlund et al 1999 Nature 398 49). Investigations on the defect clustering aspect showed that the difference between BCA and MD cascades is considerably reduced after the annealing of the cascade debris at 473 K using our Object Kinetic Monte Carlo model, LAKIMOCA (Domain et al 2004 J. Nucl. Mater. 335 121). (paper)

  13. Pade approximant calculations for neutron escape probability

    El Wakil, S.A.; Saad, E.A.; Hendi, A.A.

    1984-07-01

    The neutron escape probability from a non-multiplying slab containing internal source is defined in terms of a functional relation for the scattering function for the diffuse reflection problem. The Pade approximant technique is used to get numerical results which compare with exact results. (author)

  14. Applications of Some Classes of Sequences on Approximation of Functions (Signals by Almost Generalized Nörlund Means of Their Fourier Series

    Xhevat Z. Krasniqi

    2015-11-01

    Full Text Available In this paper, using rest bounded variation sequences and head bounded variation sequences, some new results on approximation of functions (signals by almost generalized Nörlund means of their Fourier series are obtained. To our best knowledge this the first time to use such classes of sequences on approximations of the type treated in this paper. In addition, several corollaries are derived from our results as well as those obtained previously by others.

  15. Discrete-Trial Functional Analysis and Functional Communication Training with Three Adults with Intellectual Disabilities and Problem Behavior

    Chezan, Laura C.; Drasgow, Erik; Martin, Christian A.

    2014-01-01

    We conducted a sequence of two studies on the use of discrete-trial functional analysis and functional communication training. First, we used discrete-trial functional analysis (DTFA) to identify the function of problem behavior in three adults with intellectual disabilities and problem behavior. Results indicated clear patterns of problem…

  16. The problem of the universal density functional and the density matrix functional theory

    Bobrov, V. B.; Trigger, S. A.

    2013-01-01

    The analysis in this paper shows that the Hohenberg-Kohn theorem is the constellation of two statements: (i) the mathematically rigorous Hohenberg-Kohn lemma, which demonstrates that the same ground-state density cannot correspond to two different potentials of an external field, and (ii) the hypothesis of the existence of the universal density functional. Based on the obtained explicit expression for the nonrel-ativistic particle energy in a local external field, we prove that the energy of the system of more than two non-interacting electrons cannot be a functional of the inhomogeneous density. This result is generalized to the system of interacting electrons. It means that the Hohenberg-Kohn lemma cannot provide justification of the universal density functional for fermions. At the same time, statements of the density functional theory remain valid when considering any number of noninteracting ground-state bosons due to the Bose condensation effect. In the framework of the density matrix functional theory, the hypothesis of the existence of the universal density matrix functional corresponds to the cases of noninteracting particles and to interaction in the Hartree-Fock approximation.

  17. Management of functional dyspepsia: Unsolved problems and new perspectives.

    Madisch, Ahmed; Miehlke, Stephan; Labenz, Joachim

    2005-11-14

    The common characteristic criteria of all functional gastrointestinal (GI) disorders are the persistence and recurrence of variable gastrointestinal symptoms that cannot be explained by any structural or biochemical abnormalities. Functional dyspepsia (FD) represents one of the important GI disorders in Western countries because of its remarkably high prevalence in general population and its impact on quality of life. Due to its dependence on both subjective determinants and diverse country-specific circumstances, the definition and management strategies of FD are still variably stated. Clinical trials with several drug classes (e.g., proton pump inhibitors, H2-blockers, prokinetic drugs) have been performed frequently without validated disease-specific test instruments for the outcome measurements. Therefore, the interpretation of such trials remains difficult and controversial with respect to comparability and evaluation of drug efficacy, and definite conclusions can be drawn neither for diagnostic management nor for efficacious drug therapy so far. In view of these unsolved problems, guidelines both on the clinical management of FD and on the performance of clinical trials are needed. In recent years, increasing research work has been done in this area. Clinical trials conducted in adequately diagnosed patients that provided validated outcome measurements may result in better insights leading to more effective treatment strategies. Encouraging perspectives have been recently performed by methodologically well-designed treatment studies with herbal drug preparations. Herbal drugs, given their proven efficacy in clinical trials, offer a safe therapeutic alternative in the treatment of FD which is often favored by both patients and physicians. A fixed combination of peppermint oil and caraway oil in patients suffering from FD could be proven effective by well-designed clinical trials.

  18. Management of functional dyspepsia: Unsolved problems and new perspectives

    Ahmed Madisch; Stephan Miehlke; Joachim Labenz

    2005-01-01

    The common characteristic criteria of all functional gastrointestinal(GI)disorders are the persistence and recurrence of variable gastrointestinal symptoms that cannot be explained by any structural or biochemical abnormalities. Functional dyspepsia (FD) represents one of the important GI disorders in Western countries because of its remarkably high prevalence in general population and its impact on quality of life. Due to its dependence on both subjective determinants and diverse country-specific circumstances, the definition and management strategies of FD are still variably stated.Clinical trials with several drug classes (e.g., proton pump inhibitors, H2-blockers, prokinetic drugs) have been performed frequently without validated diseasespecific test instruments for the outcome measurements.Therefore, the interpretation of such trials remains difficult and controversial with respect to comparability and evaluation of drug efficacy, and definite conclusions can be drawn neither for diagnostic management nor for efficacious drug therapy so far. In view of these unsolved problems, guidelines both on the clinical management of FD and on the performance of clinical trials are needed. In recent years, increasing research work has been done in this area. Clinical trials conducted in adequately diagnosed patients that provided validated outcome measurements may result in better insights leading to more effective treatment strategies.Encouraging perspectives have been recently performed by methodologically well-designed treatment studies with herbal drug preparations. Herbal drugs, given their proven efficacy in clinical trials, offer a safe therapeutic alternative in the treatment of FD which is often favored by both patients and physicians. A fixed combination of peppermint oil and caraway oil in patients suffering from FD could be proven effective by well-designed clinical trials.

  19. Sparse approximation with bases

    2015-01-01

    This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

  20. Ordered cones and approximation

    Keimel, Klaus

    1992-01-01

    This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.

  1. Predictors of child functioning and problem behaviors for children diagnosed with posttraumatic stress disorder and externalizing problems.

    Nabors, Laura; Baker-Phibbs, Christina; Burbage, Michelle

    2016-01-01

    Posttraumatic stress disorder and behavioral disorders are related to problems in emotional functioning for young children. Factors related to child functioning are important to understand in order to develop interventions and assess their impact. This study examined clinician and parent reports of child functioning and behavior problems and factors related to each of these outcome variables. Results indicated that parental acceptance was inversely related to child behavior problems. Increased parental supervision of the child was related to high total problems scores. Parental acceptance was positively related to child functioning. Future research is needed to examine relations among interventions to improve parental supervision and interactions with the child and child functioning, in terms of both positive and negative behaviors.

  2. Mathematical analysis, approximation theory and their applications

    Gupta, Vijay

    2016-01-01

    Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.

  3. Approximate Likelihood

    CERN. Geneva

    2015-01-01

    Most physics results at the LHC end in a likelihood ratio test. This includes discovery and exclusion for searches as well as mass, cross-section, and coupling measurements. The use of Machine Learning (multivariate) algorithms in HEP is mainly restricted to searches, which can be reduced to classification between two fixed distributions: signal vs. background. I will show how we can extend the use of ML classifiers to distributions parameterized by physical quantities like masses and couplings as well as nuisance parameters associated to systematic uncertainties. This allows for one to approximate the likelihood ratio while still using a high dimensional feature vector for the data. Both the MEM and ABC approaches mentioned above aim to provide inference on model parameters (like cross-sections, masses, couplings, etc.). ABC is fundamentally tied Bayesian inference and focuses on the “likelihood free” setting where only a simulator is available and one cannot directly compute the likelihood for the dat...

  4. Diophantine approximation

    Schmidt, Wolfgang M

    1980-01-01

    "In 1970, at the U. of Colorado, the author delivered a course of lectures on his famous generalization, then just established, relating to Roth's theorem on rational approxi- mations to algebraic numbers. The present volume is an ex- panded and up-dated version of the original mimeographed notes on the course. As an introduction to the author's own remarkable achievements relating to the Thue-Siegel-Roth theory, the text can hardly be bettered and the tract can already be regarded as a classic in its field."(Bull.LMS) "Schmidt's work on approximations by algebraic numbers belongs to the deepest and most satisfactory parts of number theory. These notes give the best accessible way to learn the subject. ... this book is highly recommended." (Mededelingen van het Wiskundig Genootschap)

  5. Sexual functioning, beliefs about sexual functioning and quality of life of women with infertility problems

    Prathibha Agustus

    2017-01-01

    Full Text Available Background: The study was conducted in the background of paucity of studies examining the sexual and psychosocial functioning of women with infertility. Aims: The study explored sexual functioning in women with infertility problems, their beliefs about sexuality and their quality of life. Settings and Design: A single group exploratory design with non-probability purposive sampling was used. A total of 30 participants diagnosed with primary infertility were included in the study. Materials and Methods: The data were obtained by individual administration of the following tools: Semi-structured interview schedule, Female Sexual Functioning Inventory, Sexual Dysfunctional Beliefs Questionnaire, World Health Organization Quality of Life Scale − BREF Version and General Health Questionnaire-12. The data obtained were analyzed using descriptive statistics and non-parametric tests. Results: About half of the participants had sexual dysfunction. Pain-related problems were most commonly reported (50%. Factors contributing to dysfunction included inadequate knowledge about sex, sexual stimulation and sexual communication. Along with inadequate self-image, negative childhood experiences, financial difficulties and marital discord in parents influenced the perception of self. Majority of the women had dysfunctional beliefs about sexuality (56%, and greater beliefs were found to be in the domain of sexual conservatism. The overall quality of life was poor, and 56% of women experienced psychological distress. There was significant positive correlation between sexual conservatism and experience of pain and overall sexual functioning. Conclusion: Women with infertility bear dysfunctional beliefs and suffer from problems in sexual functioning, have low quality of life and high psychological distress.

  6. A simple low-computation-intensity model for approximating the distribution function of a sum of non-identical lognormals for financial applications

    Messica, A.

    2016-10-01

    The probability distribution function of a weighted sum of non-identical lognormal random variables is required in various fields of science and engineering and specifically in finance for portfolio management as well as exotic options valuation. Unfortunately, it has no known closed form and therefore has to be approximated. Most of the approximations presented to date are complex as well as complicated for implementation. This paper presents a simple, and easy to implement, approximation method via modified moments matching and a polynomial asymptotic series expansion correction for a central limit theorem of a finite sum. The method results in an intuitively-appealing and computation-efficient approximation for a finite sum of lognormals of at least ten summands and naturally improves as the number of summands increases. The accuracy of the method is tested against the results of Monte Carlo simulationsand also compared against the standard central limit theorem andthe commonly practiced Markowitz' portfolio equations.

  7. Discrete-Trial Functional Analysis and Functional Communication Training with Three Individuals with Autism and Severe Problem Behavior

    Schmidt, Jonathan D.; Drasgow, Erik; Halle, James W.; Martin, Christian A.; Bliss, Sacha A.

    2014-01-01

    Discrete-trial functional analysis (DTFA) is an experimental method for determining the variables maintaining problem behavior in the context of natural routines. Functional communication training (FCT) is an effective method for replacing problem behavior, once identified, with a functionally equivalent response. We implemented these procedures…

  8. The two-hole ground state of the Hubbard-Anderson model, approximated by a variational RVB-type wave function

    Traa, M.R.M.J.; Traa, M.R.M.J.; Caspers, W.J.; Caspers, W.J.; Banning, E.J.; Banning, E.J.

    1994-01-01

    In this paper the Hubbard-Anderson model on a square lattice with two holes is studied. The ground state (GS) is approximated by a variational RVB-type wave function. The holes interact by exchange of a localized spin excitation (SE), which is created or absorbed if a hole moves to a

  9. Approximate and renormgroup symmetries

    Ibragimov, Nail H. [Blekinge Institute of Technology, Karlskrona (Sweden). Dept. of Mathematics Science; Kovalev, Vladimir F. [Russian Academy of Sciences, Moscow (Russian Federation). Inst. of Mathematical Modeling

    2009-07-01

    ''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)

  10. Approximate and renormgroup symmetries

    Ibragimov, Nail H.; Kovalev, Vladimir F.

    2009-01-01

    ''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)

  11. Mixed-hybrid finite element method for the transport equation and diffusion approximation of transport problems; Resolution de l'equation du transport par une methode d'elements finis mixtes-hybrides et approximation par la diffusion de problemes de transport

    Cartier, J

    2006-04-15

    This thesis focuses on mathematical analysis, numerical resolution and modelling of the transport equations. First of all, we deal with numerical approximation of the solution of the transport equations by using a mixed-hybrid scheme. We derive and study a mixed formulation of the transport equation, then we analyse the related variational problem and present the discretization and the main properties of the scheme. We particularly pay attention to the behavior of the scheme and we show its efficiency in the diffusion limit (when the mean free path is small in comparison with the characteristic length of the physical domain). We present academical benchmarks in order to compare our scheme with other methods in many physical configurations and validate our method on analytical test cases. Unstructured and very distorted meshes are used to validate our scheme. The second part of this thesis deals with two transport problems. The first one is devoted to the study of diffusion due to boundary conditions in a transport problem between two plane plates. The second one consists in modelling and simulating radiative transfer phenomenon in case of the industrial context of inertial confinement fusion. (author)

  12. Mixed-hybrid finite element method for the transport equation and diffusion approximation of transport problems; Resolution de l'equation du transport par une methode d'elements finis mixtes-hybrides et approximation par la diffusion de problemes de transport

    Cartier, J

    2006-04-15

    This thesis focuses on mathematical analysis, numerical resolution and modelling of the transport equations. First of all, we deal with numerical approximation of the solution of the transport equations by using a mixed-hybrid scheme. We derive and study a mixed formulation of the transport equation, then we analyse the related variational problem and present the discretization and the main properties of the scheme. We particularly pay attention to the behavior of the scheme and we show its efficiency in the diffusion limit (when the mean free path is small in comparison with the characteristic length of the physical domain). We present academical benchmarks in order to compare our scheme with other methods in many physical configurations and validate our method on analytical test cases. Unstructured and very distorted meshes are used to validate our scheme. The second part of this thesis deals with two transport problems. The first one is devoted to the study of diffusion due to boundary conditions in a transport problem between two plane plates. The second one consists in modelling and simulating radiative transfer phenomenon in case of the industrial context of inertial confinement fusion. (author)

  13. Improving Rydberg Excitations within Time-Dependent Density Functional Theory with Generalized Gradient Approximations: The Exchange-Enhancement-for-Large-Gradient Scheme.

    Li, Shaohong L; Truhlar, Donald G

    2015-07-14

    Time-dependent density functional theory (TDDFT) with conventional local and hybrid functionals such as the local and hybrid generalized gradient approximations (GGA) seriously underestimates the excitation energies of Rydberg states, which limits its usefulness for applications such as spectroscopy and photochemistry. We present here a scheme that modifies the exchange-enhancement factor to improve GGA functionals for Rydberg excitations within the TDDFT framework while retaining their accuracy for valence excitations and for the thermochemical energetics calculated by ground-state density functional theory. The scheme is applied to a popular hybrid GGA functional and tested on data sets of valence and Rydberg excitations and atomization energies, and the results are encouraging. The scheme is simple and flexible. It can be used to correct existing functionals, and it can also be used as a strategy for the development of new functionals.

  14. Spline approximation, Part 1: Basic methodology

    Ezhov, Nikolaj; Neitzel, Frank; Petrovic, Svetozar

    2018-04-01

    In engineering geodesy point clouds derived from terrestrial laser scanning or from photogrammetric approaches are almost never used as final results. For further processing and analysis a curve or surface approximation with a continuous mathematical function is required. In this paper the approximation of 2D curves by means of splines is treated. Splines offer quite flexible and elegant solutions for interpolation or approximation of "irregularly" distributed data. Depending on the problem they can be expressed as a function or as a set of equations that depend on some parameter. Many different types of splines can be used for spline approximation and all of them have certain advantages and disadvantages depending on the approximation problem. In a series of three articles spline approximation is presented from a geodetic point of view. In this paper (Part 1) the basic methodology of spline approximation is demonstrated using splines constructed from ordinary polynomials and splines constructed from truncated polynomials. In the forthcoming Part 2 the notion of B-spline will be explained in a unique way, namely by using the concept of convex combinations. The numerical stability of all spline approximation approaches as well as the utilization of splines for deformation detection will be investigated on numerical examples in Part 3.

  15. Coefficient Estimate Problem for a New Subclass of Biunivalent Functions

    N. Magesh; T. Rosy; S. Varma

    2013-01-01

    We introduce a unified subclass of the function class Σ of biunivalent functions defined in the open unit disc. Furthermore, we find estimates on the coefficients |a2| and |a3| for functions in this subclass. In addition, many relevant connections with known or new results are pointed out.

  16. Gamow-Teller strength functions and neutrino problems

    Haxton, W.C.

    1982-01-01

    A quantitative understanding of spin strengths in nuclei is of vital importance in studies of nuclear double beta decay and in solar neutrino spectroscopy. The current status of these problems is outlined

  17. Unambiguous results from variational matrix Pade approximants

    Pindor, Maciej.

    1979-10-01

    Variational Matrix Pade Approximants are studied as a nonlinear variational problem. It is shown that although a stationary value of the Schwinger functional is a stationary value of VMPA, the latter has also another stationary value. It is therefore proposed that instead of looking for a stationary point of VMPA, one minimizes some non-negative functional and then one calculates VMPA at the point where the former has the absolute minimum. This approach, which we call the Method of the Variational Gradient (MVG) gives unambiguous results and is also shown to minimize a distance between the approximate and the exact stationary values of the Schwinger functional

  18. Linear interpolation method in ensemble Kohn-Sham and range-separated density-functional approximations for excited states

    Senjean, Bruno; Knecht, Stefan; Jensen, Hans Jørgen Aa

    2015-01-01

    Gross-Oliveira-Kohn density-functional theory (GOK-DFT) for ensembles is, in principle, very attractive but has been hard to use in practice. A practical model based on GOK-DFT for the calculation of electronic excitation energies is discussed. The model relies on two modifications of GOK-DFT: use...... promising results have been obtained for both single (including charge transfer) and double excitations with spin-independent short-range local and semilocal functionals. Even at the Kohn-Sham ensemble DFT level, which is recovered when the range-separation parameter is set to 0, LIM performs better than...

  19. Internal molecular dynamics of LaI3. I. Potential energy function of vibrational modes in harmonic and anharmonic approximations

    Giricheva, N.I.; Girichev, G.V.; Smorodin, S.V.

    2007-01-01

    Scanning of potential energy surface in the LaI 3 molecule along normal coordinates are realized using the B3LYP/SDD,SDD method. The most anharmonicity is shown to have a potential function of non-planar oscillation ν 2 (A 2 ''). Effect of anharmonicity on the value of mean-square oscillation amplitudes and oscillation spectrum of the molecule is established. It is noted that the account of anharmonicity of potential functions leads to decreasing mean-square oscillation amplitudes [ru

  20. On Convex Quadratic Approximation

    den Hertog, D.; de Klerk, E.; Roos, J.

    2000-01-01

    In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of