WorldWideScience

Sample records for brinkman-kramers approximation

  1. Approximation Clustering

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Approximation Clustering. Clustering within (1+ ε) of the optimum cost. ε is user defined tolerance. For metric spaces even approximating is. hard (below, say 30%). Euclidean k-median in fixed dimension can. be approximated in polynomial time.

  2. Approximate Likelihood

    CERN Multimedia

    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...

  3. Computing approximate diagnoses by using approximate entailment

    NARCIS (Netherlands)

    Teije, A. ten; Harmelen, van F.A.H.

    1996-01-01

    The most widely accepted models of diagnostic reasoning are all phrased in terms of the logical consequence relations. In work in recent years, Schaerf and Cadoli have proposed efficient approximations of the classical consequence relation. The central idea of this paper is to parameterise the

  4. Approximation of Laws

    Science.gov (United States)

    Niiniluoto, Ilkka

    2014-03-01

    Approximation of laws is an important theme in the philosophy of science. If we can make sense of the idea that two scientific laws are "close" to each other, then we can also analyze such methodological notions as approximate explanation of laws, approximate reduction of theories, approximate empirical success of theories, and approximate truth of laws. Proposals for measuring the distance between quantitative scientific laws were given in Niiniluoto (1982, 1987). In this paper, these definitions are reconsidered as a response to the interesting critical remarks by Liu (1999).

  5. Sparse approximation with bases

    CERN Document Server

    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...

  6. Approximate Loop Unrolling

    OpenAIRE

    Rodriguez-Cancio, Marcelino; Combemale, Benoit; Baudry, Benoit

    2016-01-01

    We introduce Approximate Unrolling, a loop optimization that reduces execution time and energy consumption, exploiting the existence of code regions that can endure some degree of approximation while still producing acceptable results. This work focuses on a specific kind of forgiving region: counted loops that map a given functions over the elements of an array. Approximate Unrolling transforms loops in a similar way Loop Unrolling does. However, unlike its exact counterpart, our optimizatio...

  7. Expectation Consistent Approximate Inference

    DEFF Research Database (Denmark)

    Opper, Manfred; Winther, Ole

    2005-01-01

    We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability dis...

  8. Mathematics of Approximation

    CERN Document Server

    de Villiers, Johan

    2012-01-01

    The approximation of a continuous function by either an algebraic polynomial, a trigonometric polynomial, or a spline, is an important issue in application areas like computer-aided geometric design and signal analysis. This book is an introduction to the mathematical analysis of such approximation, and, with the prerequisites of only calculus and linear algebra, the material is targeted at senior undergraduate level, with a treatment that is both rigorous and self-contained. The topics include polynomial interpolation; Bernstein polynomials and the Weierstrass theorem; best approximations in

  9. Approximate calculation of integrals

    CERN Document Server

    Krylov, V I

    2006-01-01

    A systematic introduction to the principal ideas and results of the contemporary theory of approximate integration, this volume approaches its subject from the viewpoint of functional analysis. In addition, it offers a useful reference for practical computations. Its primary focus lies in the problem of approximate integration of functions of a single variable, rather than the more difficult problem of approximate integration of functions of more than one variable.The three-part treatment begins with concepts and theorems encountered in the theory of quadrature. The second part is devoted to t

  10. Approximation Behooves Calibration

    DEFF Research Database (Denmark)

    da Silva Ribeiro, André Manuel; Poulsen, Rolf

    2013-01-01

    Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....

  11. Approximation by mediants

    Science.gov (United States)

    Bosma, Wieb

    1990-01-01

    The distribution is determined of some sequences that measure how well a number is approximated by its mediants (or intermediate continued fraction convergents). The connection with a theorem of Fatou, as well as a new proof of this, is given.

  12. Approximation and Computation

    CERN Document Server

    Gautschi, Walter; Rassias, Themistocles M

    2011-01-01

    Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg

  13. Covariant approximation averaging

    CERN Document Server

    Shintani, Eigo; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph

    2014-01-01

    We present a new class of statistical error reduction techniques for Monte-Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in $N_f=2+1$ lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte-Carlo calculations over conventional methods for the same cost.

  14. Dynamical Cluster Approximation

    Science.gov (United States)

    Fotso, H.; Yang, S.; Chen, K.; Pathak, S.; Moreno, J.; Jarrell, M.; Mikelsons, K.; Khatami, E.; Galanakis, D.

    The dynamical cluster approximation (DCA) is a method which systematically incorporates nonlocal corrections to the dynamical mean-field approximation. Here we present a pedagogical discussion of the DCA by describing it as a Φ-derivable coarse-graining approximation in k-space, which maps an infinite lattice problem onto a periodic finite-sized cluster embedded in a self-consistently determined effective medium. We demonstrate the method by applying it to the two-dimensional Hubbard model. From this application, we show evidences of the presence of a quantum critical point (QCP) at a finite doping underneath the superconducting dome. The QCP is associated with the second-order terminus of a line of first order phase separation transitions. This critical point is driven to zero temperature by varying the band parameters, generating the QCP. The effect of the proximity of the QCP to the superconducting dome is also discussed.

  15. Covariant approximation averaging

    Science.gov (United States)

    Shintani, Eigo; Arthur, Rudy; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph

    2015-06-01

    We present a new class of statistical error reduction techniques for Monte Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in Nf=2 +1 lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte Carlo calculations over conventional methods for the same cost.

  16. Introduction to Diophantine Approximation

    Directory of Open Access Journals (Sweden)

    Watase Yasushige

    2015-06-01

    Full Text Available In this article we formalize some results of Diophantine approximation, i.e. the approximation of an irrational number by rationals. A typical example is finding an integer solution (x, y of the inequality |xθ − y| ≤ 1/x, where 0 is a real number. First, we formalize some lemmas about continued fractions. Then we prove that the inequality has infinitely many solutions by continued fractions. Finally, we formalize Dirichlet’s proof (1842 of existence of the solution [12], [1].

  17. Prestack wavefield approximations

    KAUST Repository

    Alkhalifah, Tariq

    2013-09-01

    The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.

  18. Approximate and Incomplete Factorizations

    NARCIS (Netherlands)

    Chan, T.F.; Vorst, H.A. van der

    1997-01-01

    In this chapter, we give a brief overview of a particular class of preconditioners known as incomplete factorizations. They can be thought of as approximating the exact LU factorization of a given matrix A (e.g. computed via Gaussian elimination) by disallowing certain ll-ins. As opposed to other

  19. Prestack traveltime approximations

    KAUST Repository

    Alkhalifah, Tariq Ali

    2011-01-01

    Most prestack traveltime relations we tend work with are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multi-focusing or double square-root (DSR) and the common reflection stack (CRS) equations. Using the DSR equation, I analyze the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I derive expansion based solutions of this eikonal based on polynomial expansions in terms of the reflection and dip angles in a generally inhomogenous background medium. These approximate solutions are free of singularities and can be used to estimate travetimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. A Marmousi example demonstrates the usefulness of the approach. © 2011 Society of Exploration Geophysicists.

  20. Topology, calculus and approximation

    CERN Document Server

    Komornik, Vilmos

    2017-01-01

    Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejér, Stieltjes, and Turán. The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Carathéodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations. Students of both pure an...

  1. Pumping approximately integrable systems

    Science.gov (United States)

    Lange, Florian; Lenarčič, Zala; Rosch, Achim

    2017-06-01

    Weak perturbations can drive an interacting many-particle system far from its initial equilibrium state if one is able to pump into degrees of freedom approximately protected by conservation laws. This concept has for example been used to realize Bose-Einstein condensates of photons, magnons and excitons. Integrable quantum systems, like the one-dimensional Heisenberg model, are characterized by an infinite set of conservation laws. Here, we develop a theory of weakly driven integrable systems and show that pumping can induce large spin or heat currents even in the presence of integrability breaking perturbations, since it activates local and quasi-local approximate conserved quantities. The resulting steady state is qualitatively captured by a truncated generalized Gibbs ensemble with Lagrange parameters that depend on the structure but not on the overall amplitude of perturbations nor the initial state. We suggest to use spin-chain materials driven by terahertz radiation to realize integrability-based spin and heat pumps.

  2. Optimization and approximation

    CERN Document Server

    Pedregal, Pablo

    2017-01-01

    This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance of optimality conditions in each area. It also systematically presents affordable approximation methods. Exercises at various levels have been included to support the learning process.

  3. Finite elements and approximation

    CERN Document Server

    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

  4. Approximation and perturbation methods

    CERN Document Server

    Iyer, B R

    1993-01-01

    Few problems in nature are amenable to an exact solution and hence when one proceeds from elegant problems of theory to messy complicated problems of practice one is forced to recourse to methods of approximation and perturbation. The development of such techniques has been natural in attempts to extract physically verifiable consequences from either exact solutions of general relativity or from specific astrophysical systems for which an exact solution is impossible to find. However, this should not be taken to imply giving up of mathematical rigour and an appeal to only physical intuition.

  5. Approximate Bayesian Computation

    Science.gov (United States)

    Sunnåker, Mikael; Corander, Jukka; Foll, Matthieu; Dessimoz, Christophe

    2013-01-01

    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). PMID:23341757

  6. Approximation by Cylinder Surfaces

    DEFF Research Database (Denmark)

    Randrup, Thomas

    1997-01-01

    We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....

  7. Prestack traveltime approximations

    KAUST Repository

    Alkhalifah, Tariq Ali

    2012-05-01

    Many of the explicit prestack traveltime relations used in practice are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multifocusing, based on the double square-root (DSR) equation, and the common reflection stack (CRS) approaches. Using the DSR equation, I constructed the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I recasted the eikonal in terms of the reflection angle, and thus, derived expansion based solutions of this eikonal in terms of the difference between the source and receiver velocities in a generally inhomogenous background medium. The zero-order term solution, corresponding to ignoring the lateral velocity variation in estimating the prestack part, is free of singularities and can be used to estimate traveltimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. The higher-order terms include limitations for horizontally traveling waves, however, we can readily enforce stability constraints to avoid such singularities. In fact, another expansion over reflection angle can help us avoid these singularities by requiring the source and receiver velocities to be different. On the other hand, expansions in terms of reflection angles result in singularity free equations. For a homogenous background medium, as a test, the solutions are reasonably accurate to large reflection and dip angles. A Marmousi example demonstrated the usefulness and versatility of the formulation. © 2012 Society of Exploration Geophysicists.

  8. International Conference Approximation Theory XV

    CERN Document Server

    Schumaker, Larry

    2017-01-01

    These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22–25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, a...

  9. Hierarchical low-rank approximation for high dimensional approximation

    KAUST Repository

    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.

  10. INHOMOGENEOUS DIOPHANTINE APPROXIMATION WITH PRIME ...

    Indian Academy of Sciences (India)

    50

    INHOMOGENEOUS DIOPHANTINE APPROXIMATION WITH PRIME. CONSTRAINTS. STEPHAN BAIER AND ANISH GHOSH. Abstract. We study the problem of ... this area under primality constraints. Indeed, the ...... [7] A. Ghosh, Diophantine approximation on subspaces of Rn and dynamics on homogeneous spaces, to.

  11. Diophantine approximation in prescribed degree

    OpenAIRE

    Schleischitz, Johannes

    2017-01-01

    We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the intensely studied problem of approximation by algebraic numbers (and integers) of bounded degree. We establish the answer to a question of Bugeaud concerning approximation to transcendental real numbers by quadratic irrational numbers, and thereby we refine a resu...

  12. Exact constants in approximation theory

    CERN Document Server

    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

  13. International Conference Approximation Theory XIV

    CERN Document Server

    Schumaker, Larry

    2014-01-01

    This volume developed from papers presented at the international conference Approximation Theory XIV,  held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.

  14. Scaled hydrogenic approximation wavefunctions. [Hartree-Fock approximation

    Energy Technology Data Exchange (ETDEWEB)

    Shore, B.W.

    1979-09-01

    Although widespread use of computer codes for the solution of Schrodinger equations makes available numerical Hartree-Fock model radial wave functions, there remains persistant interest in simple analytic expressions for atomic wave functions. One such frequency favored approach employs hydrogenic functions, suitably scaled, as approximate wave functions. The following note displays typical inaccuracies to be expected from such approximations. 13 references.

  15. Truthful approximations to range voting

    DEFF Research Database (Denmark)

    Filos-Ratsika, Aris; Miltersen, Peter Bro

    We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as a non-truthful mechanism for exact social welfare......-unilateral has an approximation ratio between 0.610 and 0.611, the best ordinal mechanism has an approximation ratio between 0.616 and 0.641, while the best mixed-unilateral mechanism has an approximation ratio bigger than 0.660. In particular, the best mixed-unilateral non-ordinal (i.e., cardinal) mechanism...

  16. Approximate circuits for increased reliability

    Science.gov (United States)

    Hamlet, Jason R.; Mayo, Jackson R.

    2015-08-18

    Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.

  17. Approximate circuits for increased reliability

    Energy Technology Data Exchange (ETDEWEB)

    Hamlet, Jason R.; Mayo, Jackson R.

    2015-12-22

    Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.

  18. Approximate Implicitization Using Linear Algebra

    Directory of Open Access Journals (Sweden)

    Oliver J. D. Barrowclough

    2012-01-01

    Full Text Available We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design (CAGD systems. We unify the approaches under the names of commonly known polynomial basis functions and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.

  19. Rollout sampling approximate policy iteration

    NARCIS (Netherlands)

    Dimitrakakis, C.; Lagoudakis, M.G.

    2008-01-01

    Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a

  20. -commuting maps and invariant approximations

    Directory of Open Access Journals (Sweden)

    Rhoades BE

    2006-01-01

    Full Text Available We obtain common fixed point results for generalized -nonexpansive -commuting maps. As applications, various best approximation results for this class of maps are derived in the setup of certain metrizable topological vector spaces.

  1. Some results in Diophantine approximation

    DEFF Research Database (Denmark)

    Pedersen, Steffen Højris

    This thesis consists of three papers in Diophantine approximation, a subbranch of number theory. Preceding these papers is an introduction to various aspects of Diophantine approximation and formal Laurent series over Fq and a summary of each of the three papers. The introduction introduces...... the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered....... The first part is about a failed attempt of applying dynamical methods to obtain results and is not part of the paper. It explains the ideas of how the real case works and what goes wrong in the case of the formal Laurent series. The second part contains the results of the paper and sketches of the proofs....

  2. Weighted approximation with varying weight

    CERN Document Server

    Totik, Vilmos

    1994-01-01

    A new construction is given for approximating a logarithmic potential by a discrete one. This yields a new approach to approximation with weighted polynomials of the form w"n"(" "= uppercase)P"n"(" "= uppercase). The new technique settles several open problems, and it leads to a simple proof for the strong asymptotics on some L p(uppercase) extremal problems on the real line with exponential weights, which, for the case p=2, are equivalent to power- type asymptotics for the leading coefficients of the corresponding orthogonal polynomials. The method is also modified toyield (in a sense) uniformly good approximation on the whole support. This allows one to deduce strong asymptotics in some L p(uppercase) extremal problems with varying weights. Applications are given, relating to fast decreasing polynomials, asymptotic behavior of orthogonal polynomials and multipoint Pade approximation. The approach is potential-theoretic, but the text is self-contained.

  3. Shearlets and Optimally Sparse Approximations

    DEFF Research Database (Denmark)

    Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q

    2012-01-01

    Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations...... of such functions. Recently, cartoon-like images were introduced in 2D and 3D as a suitable model class, and approximation properties were measured by considering the decay rate of the $L^2$ error of the best $N$-term approximation. Shearlet systems are to date the only representation system, which provide...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...

  4. Approximate number sense theory or approximate theory of magnitude?

    Science.gov (United States)

    Content, Alain; Velde, Michael Vande; Adriano, Andrea

    2017-01-01

    Leibovich et al. argue that the evidence in favor of a perceptual mechanism devoted to the extraction of numerosity from visual collections is unsatisfactory and propose to replace it with an unspecific mechanism capturing approximate magnitudes from continuous dimensions. We argue that their representation of the evidence is incomplete and that their theoretical proposal is too vague to be useful.

  5. Approximate entropy of network parameters

    Science.gov (United States)

    West, James; Lacasa, Lucas; Severini, Simone; Teschendorff, Andrew

    2012-04-01

    We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We first define a purely structural entropy obtained by computing the approximate entropy of the so-called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erdös-Rényi networks. By using classical results of Pincus, we show that our entropy measure often converges with network size to a certain binary Shannon entropy. As a second step, with specific attention to networks generated by dynamical processes, we investigate approximate entropy of horizontal visibility graphs. Visibility graphs allow us to naturally associate with a network the notion of temporal correlations, therefore providing the measure a dynamical garment. We show that approximate entropy distinguishes visibility graphs generated by processes with different complexity. The result probes to a greater extent these networks for the study of dynamical systems. Applications to certain biological data arising in cancer genomics are finally considered in the light of both approaches.

  6. Approximation methods in probability theory

    CERN Document Server

    Čekanavičius, Vydas

    2016-01-01

    This book presents a wide range of well-known and less common methods used for estimating the accuracy of probabilistic approximations, including the Esseen type inversion formulas, the Stein method as well as the methods of convolutions and triangle function. Emphasising the correct usage of the methods presented, each step required for the proofs is examined in detail. As a result, this textbook provides valuable tools for proving approximation theorems. While Approximation Methods in Probability Theory will appeal to everyone interested in limit theorems of probability theory, the book is particularly aimed at graduate students who have completed a standard intermediate course in probability theory. Furthermore, experienced researchers wanting to enlarge their toolkit will also find this book useful.

  7. Diophantine approximation and Dirichlet series

    CERN Document Server

    Queffélec, Hervé

    2013-01-01

    This self-contained book will benefit beginners as well as researchers. It is devoted to Diophantine approximation, the analytic theory of Dirichlet series, and some connections between these two domains, which often occur through the Kronecker approximation theorem. Accordingly, the book is divided into seven chapters, the first three of which present tools from commutative harmonic analysis, including a sharp form of the uncertainty principle, ergodic theory and Diophantine approximation to be used in the sequel. A presentation of continued fraction expansions, including the mixing property of the Gauss map, is given. Chapters four and five present the general theory of Dirichlet series, with classes of examples connected to continued fractions, the famous Bohr point of view, and then the use of random Dirichlet series to produce non-trivial extremal examples, including sharp forms of the Bohnenblust-Hille theorem. Chapter six deals with Hardy-Dirichlet spaces, which are new and useful Banach spaces of anal...

  8. Best Approximation in Numerical Radius

    OpenAIRE

    Aksoy, Asuman Guven; Lewicki, Grzegorz

    2010-01-01

    Let $X$ be a reflexive Banach space. In this paper we give a necessary and sufficient condition for an operator $T\\in \\mathcal{K}(X)$ to have the best approximation in numerical radius from the convex subset $\\mathcal{U} \\subset \\mathcal{K}(X),$ where $\\mathcal{K}(X)$ denotes the set of all linear, compact operators from $X$ into $X.$ We will also present an application to minimal extensions with respect to the numerical radius. In particular some results on best approximation in norm will be...

  9. Face Recognition using Approximate Arithmetic

    DEFF Research Database (Denmark)

    Marso, Karol

    Face recognition is image processing technique which aims to identify human faces and found its use in various different fields for example in security. Throughout the years this field evolved and there are many approaches and many different algorithms which aim to make the face recognition as effective...... processing applications the results do not need to be completely precise and use of the approximate arithmetic can lead to reduction in terms of delay, space and power consumption. In this paper we examine possible use of approximate arithmetic in face recognition using Eigenfaces algorithm....

  10. Approximate Reanalysis in Topology Optimization

    DEFF Research Database (Denmark)

    Amir, Oded; Bendsøe, Martin P.; Sigmund, Ole

    2009-01-01

    In the nested approach to structural optimization, most of the computational effort is invested in the solution of the finite element analysis equations. In this study, the integration of an approximate reanalysis procedure into the framework of topology optimization of continuum structures...

  11. Ultrafast Approximation for Phylogenetic Bootstrap

    NARCIS (Netherlands)

    Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt

    Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and

  12. Approximation by Penultimate Stable Laws

    NARCIS (Netherlands)

    L.F.M. de Haan (Laurens); L. Peng (Liang); H. Iglesias Pereira

    1997-01-01

    textabstractIn certain cases partial sums of i.i.d. random variables with finite variance are better approximated by a sequence of stable distributions with indices \\\\alpha_n \\\\to 2 than by a normal distribution. We discuss when this happens and how much the convergence rate can be improved by using

  13. Approximation properties of haplotype tagging

    Directory of Open Access Journals (Sweden)

    Dreiseitl Stephan

    2006-01-01

    Full Text Available Abstract Background Single nucleotide polymorphisms (SNPs are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns, disease association studies are facilitated by identifying SNPs that allow the unique identification of such patterns. This process, known as haplotype tagging, is formulated as a combinatorial optimization problem and analyzed in terms of complexity and approximation properties. Results It is shown that the tagging problem is NP-hard but approximable within 1 + ln((n2 - n/2 for n haplotypes but not approximable within (1 - ε ln(n/2 for any ε > 0 unless NP ⊂ DTIME(nlog log n. A simple, very easily implementable algorithm that exhibits the above upper bound on solution quality is presented. This algorithm has running time O((2m - p + 1 ≤ O(m(n2 - n/2 where p ≤ min(n, m for n haplotypes of size m. As we show that the approximation bound is asymptotically tight, the algorithm presented is optimal with respect to this asymptotic bound. Conclusion The haplotype tagging problem is hard, but approachable with a fast, practical, and surprisingly simple algorithm that cannot be significantly improved upon on a single processor machine. Hence, significant improvement in computatational efforts expended can only be expected if the computational effort is distributed and done in parallel.

  14. APPROXIMATE MODELS FOR FLOOD ROUTING

    African Journals Online (AJOL)

    kinematic model and a nonlinear convection-diffusion model are extracted from a normalized form of the St. Venant equations, and applied to ... normal flow condition is moderate. Keywords: approximate models, nonlinear kinematic ... The concern here is with the movement of an abnormal amount of water along a river or ...

  15. Approximation for Bayesian Ability Estimation.

    Science.gov (United States)

    1987-02-18

    two-way contingency tables. Journal of Educational Statistics, 11, 33-56. Lindley, D.V. (1980). Approximate Bayesian methods. Trabajos Estadistica , 31...Sloan-Kettering Cancer Center 1275 York Avenue New York, NY 10021 Dr. Wallace Wulfeck, 11 Navy Personnel R&D Center San Diego, CA 92152-6800 Dr. Wendy

  16. Hydrogen Beyond the Classic Approximation

    CERN Document Server

    Scivetti, I

    2003-01-01

    The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position

  17. Good points for diophantine approximation

    Indian Academy of Sciences (India)

    Given a sequence ( x n ) n = 1 ∞ of real numbers in the interval [0,1) and a sequence ( n ) n = 1 ∞ of positive numbers tending to zero, we consider the size of the set of numbers in [0,1] which can be `well approximated' by terms of the first sequence, namely, those y ∈ [ 0 , 1 ] for which the inequality | y − x n | < n holds ...

  18. Computer Experiments for Function Approximations

    Energy Technology Data Exchange (ETDEWEB)

    Chang, A; Izmailov, I; Rizzo, S; Wynter, S; Alexandrov, O; Tong, C

    2007-10-15

    This research project falls in the domain of response surface methodology, which seeks cost-effective ways to accurately fit an approximate function to experimental data. Modeling and computer simulation are essential tools in modern science and engineering. A computer simulation can be viewed as a function that receives input from a given parameter space and produces an output. Running the simulation repeatedly amounts to an equivalent number of function evaluations, and for complex models, such function evaluations can be very time-consuming. It is then of paramount importance to intelligently choose a relatively small set of sample points in the parameter space at which to evaluate the given function, and then use this information to construct a surrogate function that is close to the original function and takes little time to evaluate. This study was divided into two parts. The first part consisted of comparing four sampling methods and two function approximation methods in terms of efficiency and accuracy for simple test functions. The sampling methods used were Monte Carlo, Quasi-Random LP{sub {tau}}, Maximin Latin Hypercubes, and Orthogonal-Array-Based Latin Hypercubes. The function approximation methods utilized were Multivariate Adaptive Regression Splines (MARS) and Support Vector Machines (SVM). The second part of the study concerned adaptive sampling methods with a focus on creating useful sets of sample points specifically for monotonic functions, functions with a single minimum and functions with a bounded first derivative.

  19. Many Faces of Boussinesq Approximations

    CERN Document Server

    Vladimirov, Vladimir A

    2016-01-01

    The \\emph{equations of Boussinesq approximation} (EBA) for an incompressible and inhomogeneous in density fluid are analyzed from a viewpoint of the asymptotic theory. A systematic scaling shows that there is an infinite number of related asymptotic models. We have divided them into three classes: `poor', `reasonable' and `good' Boussinesq approximations. Each model can be characterized by two parameters $q$ and $k$, where $q =1, 2, 3, \\dots$ and $k=0, \\pm 1, \\pm 2,\\dots$. Parameter $q$ is related to the `quality' of approximation, while $k$ gives us an infinite set of possible scales of velocity, time, viscosity, \\emph{etc.} Increasing $q$ improves the quality of a model, but narrows the limits of its applicability. Parameter $k$ allows us to vary the scales of time, velocity and viscosity and gives us the possibility to consider any initial and boundary conditions. In general, we discover and classify a rich variety of possibilities and restrictions, which are hidden behind the routine use of the Boussinesq...

  20. Approximate treatment of the continuum

    Energy Technology Data Exchange (ETDEWEB)

    Vertse, T. (Institute of Nuclear Research of the Hungarian Academy of Sciences, H-4001 Debrecen (Hungary)); Curutchet, P.; Liotta, R.J. (Research Institute of Physics, S-10405 Stockholm (Sweden))

    1990-12-01

    Pole expansions of the Green function (Berggren and Mittag-Leffler) are used to calculate single-particle and particle-hole response functions for a square well plus Coulomb potential and the results are compared with the corresponding exact ones. The approximate and exact response functions agree well with each other in the resonant energy region. The Mittag-Leffler expansion is shown to be valid even for the long-range Coulomb potential. The computation time needed for the calculation of the particle-hole response function can be reduced considerably by using the pole expansions.

  1. Convex approximations of quantum channels

    Science.gov (United States)

    Sacchi, Massimiliano F.; Sacchi, Tito

    2017-09-01

    We address the problem of optimally approximating the action of a desired and unavailable quantum channel Φ having at our disposal a single use of a given set of other channels {Ψi} . The problem is recast to look for the least distinguishable channel from Φ among the convex set ∑ipiΨi , and the corresponding optimal weights {pi} provide the optimal convex mixing of the available channels {Ψi} . For single-qubit channels we study specifically cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map is an arbitrary unitary transformation or a generalized damping channel.

  2. Approximating distributions in stochastic learning.

    Science.gov (United States)

    Leen, Todd K; Friel, Robert; Nielsen, David

    2012-08-01

    On-line machine learning algorithms, many biological spike-timing-dependent plasticity (STDP) learning rules, and stochastic neural dynamics evolve by Markov processes. A complete description of such systems gives the probability densities for the variables. The evolution and equilibrium state of these densities are given by a Chapman-Kolmogorov equation in discrete time, or a master equation in continuous time. These formulations are analytically intractable for most cases of interest, and to make progress a nonlinear Fokker-Planck equation (FPE) is often used in their place. The FPE is limited, and some argue that its application to describe jump processes (such as in these problems) is fundamentally flawed. We develop a well-grounded perturbation expansion that provides approximations for both the density and its moments. The approach is based on the system size expansion in statistical physics (which does not give approximations for the density), but our simple development makes the methods accessible and invites application to diverse problems. We apply the method to calculate the equilibrium distributions for two biologically-observed STDP learning rules and for a simple nonlinear machine-learning problem. In all three examples, we show that our perturbation series provides good agreement with Monte-Carlo simulations in regimes where the FPE breaks down. Copyright © 2012 Elsevier Ltd. All rights reserved.

  3. Approximation of Surfaces by Cylinders

    DEFF Research Database (Denmark)

    Randrup, Thomas

    1998-01-01

    We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....

  4. Approximate cohomology in Banach algebras | Pourabbas ...

    African Journals Online (AJOL)

    We introduce the notions of approximate cohomology and approximate homotopy in Banach algebras and we study the relation between them. We show that the approximate homotopically equivalent cochain complexes give the same approximate cohomologies. As a special case, approximate Hochschild cohomology is ...

  5. On martingale approximation of adapted processes

    OpenAIRE

    Queffélec, Hervé; Volný, Dalibor

    2011-01-01

    We show that the existence of a martingale approximation of a stationary process depends on the choice of the filtration. There exists a stationary linear process which has a martingale approximation with respect to the natural filtration, but no approximation with respect to a larger filtration with respect to wich it is adapted and regular. There exists a stationary process adapted, regular, and having a martingale approximation with respect to a given filtration but not (regular and having...

  6. Regression with Sparse Approximations of Data

    DEFF Research Database (Denmark)

    Noorzad, Pardis; Sturm, Bob L.

    2012-01-01

    We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected by...... on the sparse approximation process. Our experimental results show the locally constant form of SPARROW performs competitively....

  7. Approximation properties of fine hyperbolic graphs

    Indian Academy of Sciences (India)

    Abstract. In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable dis- crete metric space. Moreover, we use the techniques of Ozawa's to prove that a fine hyperbolic graph has the metric invariant translation approximation property.

  8. Approximate Nearest Neighbor Queries among Parallel Segments

    DEFF Research Database (Denmark)

    Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias

    2010-01-01

    We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...

  9. Exploiting domain knowledge for approximate diagnosis

    NARCIS (Netherlands)

    Teije, A. ten; Harmelen, van F.A.H.

    1997-01-01

    The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate entailment to define notions of approximation in diagnosis. We show how such a notion of approximate diagnosis can be

  10. Truth Approximation, Social Epistemology, and Opinion Dynamics

    NARCIS (Netherlands)

    Douven, Igor; Kelp, Christoph

    This paper highlights some connections between work on truth approximation and work in social epistemology, in particular work on peer disagreement. In some of the literature on truth approximation, questions have been addressed concerning the efficiency of research strategies for approximating the

  11. Axiomatic Characterizations of IVF Rough Approximation Operators

    OpenAIRE

    Yu, Guangji

    2014-01-01

    This paper is devoted to the study of axiomatic characterizations of IVF rough approximation operators. IVF approximation spaces are investigated. The fact that different IVF operators satisfy some axioms to guarantee the existence of different types of IVF relations which produce the same operators is proved and then IVF rough approximation operators are characterized by axioms.

  12. Axiomatic Characterizations of IVF Rough Approximation Operators

    Directory of Open Access Journals (Sweden)

    Guangji Yu

    2014-01-01

    Full Text Available This paper is devoted to the study of axiomatic characterizations of IVF rough approximation operators. IVF approximation spaces are investigated. The fact that different IVF operators satisfy some axioms to guarantee the existence of different types of IVF relations which produce the same operators is proved and then IVF rough approximation operators are characterized by axioms.

  13. Operator approximant problems arising from quantum theory

    CERN Document Server

    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.

  14. Approximation properties of fine hyperbolic graphs

    Indian Academy of Sciences (India)

    In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable discrete metric space. Moreover, we use the techniques of Ozawa's to prove that a fine hyperbolic graph has the metric invariant translation approximation property.

  15. Nonlinear approximation with dictionaries, I: Direct estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    $-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space...

  16. Mapping moveout approximations in TI media

    KAUST Repository

    Stovas, Alexey

    2013-11-21

    Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.

  17. Multilevel Monte Carlo in Approximate Bayesian Computation

    KAUST Repository

    Jasra, Ajay

    2017-02-13

    In the following article we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.

  18. Approximate Furthest Neighbor in High Dimensions

    DEFF Research Database (Denmark)

    Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen

    2015-01-01

    Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclid......Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high...

  19. Lifetime of the Nonlinear Geometric Optics Approximation

    DEFF Research Database (Denmark)

    Binzer, Knud Andreas

    The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations.......The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations....

  20. Hardness of approximation for Knapsack problems

    NARCIS (Netherlands)

    Buhrman, H.; Loff, B.; Torenvliet, L.

    2015-01-01

    We show various hardness results for knapsack and related problems; in particular we will show that unless the Exponential-Time Hypothesis is false, subset-sum cannot be approximated any better than with an FPTAS. We also provide new unconditional lower bounds for approximating knapsack in Ketan

  1. Non-Linear Approximation of Bayesian Update

    KAUST Repository

    Litvinenko, Alexander

    2016-06-23

    We develop a non-linear approximation of expensive Bayesian formula. This non-linear approximation is applied directly to Polynomial Chaos Coefficients. In this way, we avoid Monte Carlo sampling and sampling error. We can show that the famous Kalman Update formula is a particular case of this update.

  2. Approximate Solution of Rod Heating Problem

    Directory of Open Access Journals (Sweden)

    P. Lasy

    2013-01-01

    Full Text Available Contains exact and approximate analytic representations pertaining to the solution of a homogeneous mixed problem for a non-homogeneous one-dimensional equation of heat conduction using a special psi-function. The order of an approximate formula accuracy is given in the paper.

  3. Inversion and approximation of Laplace transforms

    Science.gov (United States)

    Lear, W. M.

    1980-01-01

    A method of inverting Laplace transforms by using a set of orthonormal functions is reported. As a byproduct of the inversion, approximation of complicated Laplace transforms by a transform with a series of simple poles along the left half plane real axis is shown. The inversion and approximation process is simple enough to be put on a programmable hand calculator.

  4. Polynomial approximation approach to transient heat conduction ...

    African Journals Online (AJOL)

    This work reports polynomial approximation approach to transient heat conduction in a long slab, long cylinder and sphere with linear internal heat generation. It has been shown that the polynomial approximation method is able to calculate average temperature as a function of time for higher value of Biot numbers.

  5. Nonlinear approximation with dictionaries I. Direct estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2004-01-01

    with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...

  6. On approximating multi-criteria TSP

    NARCIS (Netherlands)

    Manthey, Bodo; Albers, S.; Marion, J.-Y.

    2009-01-01

    We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP), whose performances are independent of the number $k$ of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized

  7. On approximating multi-criteria TSP

    NARCIS (Netherlands)

    Manthey, Bodo

    We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multicriteria maximum traveling salesman problems (Max-TSP). For multicriteria Max-STSP where the edge weights have to be

  8. Boundary Value Problems and Approximate Solutions ...

    African Journals Online (AJOL)

    In this paper, we discuss about some basic things of boundary value problems. Secondly, we study boundary conditions involving derivatives and obtain finite difference approximations of partial derivatives of boundary value problems. The last section is devoted to determine an approximate solution for boundary value ...

  9. Approximate error conjugation gradient minimization methods

    Science.gov (United States)

    Kallman, Jeffrey S

    2013-05-21

    In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

  10. The tendon approximator device in traumatic injuries.

    Science.gov (United States)

    Forootan, Kamal S; Karimi, Hamid; Forootan, Nazilla-Sadat S

    2015-01-01

    Precise and tension-free approximation of two tendon endings is the key predictor of outcomes following tendon lacerations and repairs. We evaluate the efficacy of a new tendon approximator device in tendon laceration repairs. In a comparative study, we used our new tendon approximator device in 99 consecutive patients with laceration of 266 tendons who attend a university hospital and evaluated the operative time to repair the tendons, surgeons' satisfaction as well as patient's outcomes in a long-term follow-up. Data were compared with the data of control patients undergoing tendon repair by conventional method. Totally 266 tendons were repaired by approximator device and 199 tendons by conventional technique. 78.7% of patients in first group were male and 21.2% were female. In approximator group 38% of patients had secondary repair of cut tendons and 62% had primary repair. Patients were followed for a mean period of 3years (14-60 months). Time required for repair of each tendon was significantly reduced with the approximator device (2 min vs. 5.5 min, ptendon repair were identical in the two groups and were not significantly different. 1% of tendons in group A and 1.2% in group B had rupture that was not significantly different. The new nerve approximator device is cheap, feasible to use and reduces the time of tendon repair with sustained outcomes comparable to the conventional methods.

  11. Approximation of the semi-infinite interval

    Directory of Open Access Journals (Sweden)

    A. McD. Mercer

    1980-01-01

    Full Text Available The approximation of a function f∈C[a,b] by Bernstein polynomials is well-known. It is based on the binomial distribution. O. Szasz has shown that there are analogous approximations on the interval [0,∞ based on the Poisson distribution. Recently R. Mohapatra has generalized Szasz' result to the case in which the approximating function is αe−ux∑k=N∞(uxkα+β−1Γ(kα+βf(kαuThe present note shows that these results are special cases of a Tauberian theorem for certain infinite series having positive coefficients.

  12. Mathematical analysis, approximation theory and their applications

    CERN Document Server

    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.

  13. Conditional Density Approximations with Mixtures of Polynomials

    DEFF Research Database (Denmark)

    Varando, Gherardo; López-Cruz, Pedro L.; Nielsen, Thomas Dyhre

    2015-01-01

    Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one- and multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce...... two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities...

  14. Fractional Mathematical Operators and Their Computational Approximation

    Directory of Open Access Journals (Sweden)

    José Crespo

    2016-01-01

    Full Text Available Usual applied mathematics employs three fundamental arithmetical operators: addition, multiplication, and exponentiation. However, for example, transcendental numbers are said not to be attainable via algebraic combination with these fundamental operators. At the same time, simulation and modelling frequently have to rely on expensive numerical approximations of the exact solution. The main purpose of this article is to analyze new fractional arithmetical operators, explore some of their properties, and devise ways of computing them. These new operators may bring new possibilities, for example, in approximation theory and in obtaining closed forms of those approximations and solutions. We show some simple demonstrative examples.

  15. Analytical Ballistic Trajectories with Approximately Linear Drag

    National Research Council Canada - National Science Library

    Giliam J. P. de Carpentier

    2014-01-01

      This paper introduces a practical analytical approximation of projectile trajectories in 2D and 3D roughly based on a linear drag model and explores a variety of different planning algorithms for these trajectories...

  16. Broadband Approximations for Doubly Curved Reflector Antenna

    Directory of Open Access Journals (Sweden)

    V. Schejbal

    2010-12-01

    Full Text Available The broadband approximations for shaped-beam doubly curved reflector antennas with primary feed (rectangular horn producing uniform amplitude and phase aperture distribution are derived and analyzed. They are very valuable for electromagnetic compatibility analyses both from electromagnetic interference and susceptibility point of view, because specialized more accurate methods such as physical optics are only used by antenna designers. To allow quick EMC analyses, typical values, beamwidth changes, sidelobe levels and aperture efficiencies are given for frequency changes approximately up to four times operating frequency. A comparison of approximated and measured patterns of doubly curved reflector antennas shows that the given approximation could be reliably used for analyses of pattern changes due to very broad frequency changes.

  17. Saddlepoint approximation methods in financial engineering

    CERN Document Server

    Kwok, Yue Kuen

    2018-01-01

    This book summarizes recent advances in applying saddlepoint approximation methods to financial engineering. It addresses pricing exotic financial derivatives and calculating risk contributions to Value-at-Risk and Expected Shortfall in credit portfolios under various default correlation models. These standard problems involve the computation of tail probabilities and tail expectations of the corresponding underlying state variables.  The text offers in a single source most of the saddlepoint approximation results in financial engineering, with different sets of ready-to-use approximation formulas. Much of this material may otherwise only be found in original research publications. The exposition and style are made rigorous by providing formal proofs of most of the results. Starting with a presentation of the derivation of a variety of saddlepoint approximation formulas in different contexts, this book will help new researchers to learn the fine technicalities of the topic. It will also be valuable to quanti...

  18. Low Rank Approximation Algorithms, Implementation, Applications

    CERN Document Server

    Markovsky, Ivan

    2012-01-01

    Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequently in many different fields. Low Rank Approximation: Algorithms, Implementation, Applications is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory. Applications described include: system and control theory: approximate realization, model reduction, output error, and errors-in-variables identification; signal processing: harmonic retrieval, sum-of-damped exponentials, finite impulse response modeling, and array processing; machine learning: multidimensional scaling and recommender system; computer vision: algebraic curve fitting and fundamental matrix estimation; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; ...

  19. Degree of Approximation and Green Potential

    Directory of Open Access Journals (Sweden)

    M. Simkani

    2009-03-01

    Full Text Available We will relate the degree of rational approximation of a meromorphic function f to the minimum value, on the natural boundary of f, of Green potential of the weak∗ limit of the normalized pole-counting measures

  20. Cq-commuting maps and invariant approximations

    Directory of Open Access Journals (Sweden)

    B. E. Rhoades

    2006-06-01

    Full Text Available We obtain common fixed point results for generalized I-nonexpansive Cq-commuting maps. As applications, various best approximation results for this class of maps are derived in the setup of certain metrizable topological vector spaces.

  1. An approximation of solutions of variational inequalities

    Directory of Open Access Journals (Sweden)

    B. E. Rhoades

    2005-10-01

    Full Text Available We use a Mann-type iteration scheme and the metric projection operator (the nearest-point projection operator to approximate the solutions of variational inequalities in uniformly convex and uniformly smooth Banach spaces.

  2. Approximate substitutions and the normal ordering problem

    Energy Technology Data Exchange (ETDEWEB)

    Cheballah, H; Duchamp, G H E [Universite Paris 13 Laboratoire d' Informatique Paris Nord, CNRS UMR 7030 99 Av. J-B. Clement, F 93430 Villetaneuse (France); Penson, K A [Laboratoire de Physique Theorique de la Matiere Condensee Universite Pierre et Marie Curie, CNRS UMR 7600 Tour 24 - 2e et., 4 pl. Jussieu, F 75252 Paris Cedex 05 (France)], E-mail: hayat.cheballah@lipn-univ.paris13.fr, E-mail: ghed@lipn-univ.paris13.fr, E-mail: penson@lptl.jussieu.fr

    2008-03-01

    In this paper, we show that the infinite generalised Stirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebraic equations.

  3. Methods of Fourier analysis and approximation theory

    CERN Document Server

    Tikhonov, Sergey

    2016-01-01

    Different facets of interplay between harmonic analysis and approximation theory are covered in this volume. The topics included are Fourier analysis, function spaces, optimization theory, partial differential equations, and their links to modern developments in the approximation theory. The articles of this collection were originated from two events. The first event took place during the 9th ISAAC Congress in Krakow, Poland, 5th-9th August 2013, at the section “Approximation Theory and Fourier Analysis”. The second event was the conference on Fourier Analysis and Approximation Theory in the Centre de Recerca Matemàtica (CRM), Barcelona, during 4th-8th November 2013, organized by the editors of this volume. All articles selected to be part of this collection were carefully reviewed.

  4. APPROXIMATE DEVELOPMENTS FOR SURFACES OF REVOLUTION

    Directory of Open Access Journals (Sweden)

    Mădălina Roxana Buneci

    2016-12-01

    Full Text Available The purpose of this paper is provide a set of Maple procedures to construct approximate developments of a general surface of revolution generalizing the well-known gore method for sphere

  5. Seismic wave extrapolation using lowrank symbol approximation

    KAUST Repository

    Fomel, Sergey

    2012-04-30

    We consider the problem of constructing a wave extrapolation operator in a variable and possibly anisotropic medium. Our construction involves Fourier transforms in space combined with the help of a lowrank approximation of the space-wavenumber wave-propagator matrix. A lowrank approximation implies selecting a small set of representative spatial locations and a small set of representative wavenumbers. We present a mathematical derivation of this method, a description of the lowrank approximation algorithm and numerical examples that confirm the validity of the proposed approach. Wave extrapolation using lowrank approximation can be applied to seismic imaging by reverse-time migration in 3D heterogeneous isotropic or anisotropic media. © 2012 European Association of Geoscientists & Engineers.

  6. An overview on Approximate Bayesian computation*

    Directory of Open Access Journals (Sweden)

    Baragatti Meïli

    2014-01-01

    Full Text Available Approximate Bayesian computation techniques, also called likelihood-free methods, are one of the most satisfactory approach to intractable likelihood problems. This overview presents recent results since its introduction about ten years ago in population genetics.

  7. An approximation of solutions of variational inequalities

    Directory of Open Access Journals (Sweden)

    Rhoades BE

    2005-01-01

    Full Text Available We use a Mann-type iteration scheme and the metric projection operator (the nearest-point projection operator to approximate the solutions of variational inequalities in uniformly convex and uniformly smooth Banach spaces.

  8. An approximate analytical approach to resampling averages

    DEFF Research Database (Denmark)

    Malzahn, Dorthe; Opper, M.

    2004-01-01

    Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach...... for approximate Bayesian inference. We demonstrate our approach on regression with Gaussian processes. A comparison with averages obtained by Monte-Carlo sampling shows that our method achieves good accuracy....

  9. The closure approximation in the hierarchy equations.

    Science.gov (United States)

    Adomian, G.

    1971-01-01

    The expectation of the solution process in a stochastic operator equation can be obtained from averaged equations only under very special circumstances. Conditions for validity are given and the significance and validity of the approximation in widely used hierarchy methods and the ?self-consistent field' approximation in nonequilibrium statistical mechanics are clarified. The error at any level of the hierarchy can be given and can be avoided by the use of the iterative method.

  10. Adaptive and Approximate Orthogonal Range Counting

    DEFF Research Database (Denmark)

    Chan, Timothy M.; Wilkinson, Bryan Thomas

    2013-01-01

    ]. •We give an O(n loglog n)-space data structure for approximate 2-D orthogonal range counting that can compute a (1+δ)-factor approximation to the count in O(loglog n) time for any fixed constant δ>0. Again, our bounds match the state of the art for the 2-D orthogonal range emptiness problem. •Lastly...

  11. Seismic modeling using the frozen Gaussian approximation

    OpenAIRE

    Yang, Xu; Lu, Jianfeng; Fomel, Sergey

    2013-01-01

    We adopt the frozen Gaussian approximation (FGA) for modeling seismic waves. The method belongs to the category of ray-based beam methods. It decomposes seismic wavefield into a set of Gaussian functions and propagates these Gaussian functions along appropriate ray paths. As opposed to the classic Gaussian-beam method, FGA keeps the Gaussians frozen (at a fixed width) during the propagation process and adjusts their amplitudes to produce an accurate approximation after summation. We perform t...

  12. Lattice quantum chromodynamics with approximately chiral fermions

    Energy Technology Data Exchange (ETDEWEB)

    Hierl, Dieter

    2008-05-15

    In this work we present Lattice QCD results obtained by approximately chiral fermions. We use the CI fermions in the quenched approximation to investigate the excited baryon spectrum and to search for the {theta}{sup +} pentaquark on the lattice. Furthermore we developed an algorithm for dynamical simulations using the FP action. Using FP fermions we calculate some LECs of chiral perturbation theory applying the epsilon expansion. (orig.)

  13. On surface approximation using developable surfaces

    DEFF Research Database (Denmark)

    Chen, H. Y.; Lee, I. K.; Leopoldseder, S.

    1998-01-01

    We introduce a method for approximating a given surface by a developable surface. It will be either a G_1 surface consisting of pieces of cones or cylinders of revolution or a G_r NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding....

  14. On surface approximation using developable surfaces

    DEFF Research Database (Denmark)

    Chen, H. Y.; Lee, I. K.; Leopoldseder, s.

    1999-01-01

    We introduce a method for approximating a given surface by a developable surface. It will be either a G(1) surface consisting of pieces of cones or cylinders of revolution or a G(r) NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding. (C) 1999 Academic Press....

  15. Nonlinear approximation with nonstationary Gabor frames

    DEFF Research Database (Denmark)

    Ottosen, Emil Solsbæk; Nielsen, Morten

    2018-01-01

    We consider sparseness properties of adaptive time-frequency representations obtained using nonstationary Gabor frames (NSGFs). NSGFs generalize classical Gabor frames by allowing for adaptivity in either time or frequency. It is known that the concept of painless nonorthogonal expansions...... resolution. Based on this characterization we prove an upper bound on the approximation error occurring when thresholding the coefficients of the corresponding frame expansions. We complement the theoretical results with numerical experiments, estimating the rate of approximation obtained from thresholding...

  16. Approximating centrality in evolving graphs: toward sublinearity

    Science.gov (United States)

    Priest, Benjamin W.; Cybenko, George

    2017-05-01

    The identification of important nodes is a ubiquitous problem in the analysis of social networks. Centrality indices (such as degree centrality, closeness centrality, betweenness centrality, PageRank, and others) are used across many domains to accomplish this task. However, the computation of such indices is expensive on large graphs. Moreover, evolving graphs are becoming increasingly important in many applications. It is therefore desirable to develop on-line algorithms that can approximate centrality measures using memory sublinear in the size of the graph. We discuss the challenges facing the semi-streaming computation of many centrality indices. In particular, we apply recent advances in the streaming and sketching literature to provide a preliminary streaming approximation algorithm for degree centrality utilizing CountSketch and a multi-pass semi-streaming approximation algorithm for closeness centrality leveraging a spanner obtained through iteratively sketching the vertex-edge adjacency matrix. We also discuss possible ways forward for approximating betweenness centrality, as well as spectral measures of centrality. We provide a preliminary result using sketched low-rank approximations to approximate the output of the HITS algorithm.

  17. Memory-optimal neural network approximation

    Science.gov (United States)

    Bölcskei, Helmut; Grohs, Philipp; Kutyniok, Gitta; Petersen, Philipp

    2017-08-01

    We summarize the main results of a recent theory-developed by the authors-establishing fundamental lower bounds on the connectivity and memory requirements of deep neural networks as a function of the complexity of the function class to be approximated by the network. These bounds are shown to be achievable. Specifically, all function classes that are optimally approximated by a general class of representation systems-so-called affine systems-can be approximated by deep neural networks with minimal connectivity and memory requirements. Affine systems encompass a wealth of representation systems from applied harmonic analysis such as wavelets, shearlets, ridgelets, α-shearlets, and more generally α-molecules. This result elucidates a remarkable universality property of deep neural networks and shows that they achieve the optimum approximation properties of all affine systems combined. Finally, we present numerical experiments demonstrating that the standard stochastic gradient descent algorithm generates deep neural networks which provide close-to-optimal approximation rates at minimal connectivity. Moreover, stochastic gradient descent is found to actually learn approximations that are sparse in the representation system optimally sparsifying the function class the network is trained on.

  18. Accuracy of Nonlinear Approximations in Spheroidal Collapse --- Why are Zel'dovich-type approximations so good?

    Science.gov (United States)

    Matsubara, T.; Yoshisato, A.; Morikawa, M.

    We investigate the reason why Zel'dovich-type approximations work accurately beyond the linear regime from the following two points of view: (1) Dimensionality of the system and (2) the Lagrangian scheme on which the Zel'dovich approximation is grounded. We introduce a model with spheroidal mass distribution and the Padé approximation in Eulerian scheme. We clarify which of these aspects supports the accuracy of the Zel'dovich-type approximations.

  19. The grammar of approximating number pairs.

    Science.gov (United States)

    Eriksson, Kimmo; Bailey, Drew H; Geary, David C

    2010-04-01

    In the present article, we studied approximating pairs of numbers (a, b) that were used to estimate quantity in a single phrase ("two, three years ago"). Pollmann and Jansen (1996) found that only a few of the many possible pairs are actually used, suggesting an interaction between the ways in which people estimate quantity and their use of quantitative phrases in colloquial speech. They proposed a set of rules that describe which approximating pairs are used in Dutch phrases. We revisited this issue in an analysis of Swedish and American language corpora and in a series of three experiments in which Swedish and American adults rated the acceptability of various approximating pairs and created approximating pairs of their own in response to various estimation tasks. We found evidence for Pollmann and Jansen's rules in both Swedish and English phrases, but we also identified additional rules and substantial individual and cross-language variation. We will discuss implications for the origin of this loose "grammar" of approximating pairs.

  20. Multilevel weighted least squares polynomial approximation

    KAUST Repository

    Haji-Ali, Abdul-Lateef

    2017-06-30

    Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.

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

    Science.gov (United States)

    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.

  2. Trajectory averaging for stochastic approximation MCMC algorithms

    KAUST Repository

    Liang, Faming

    2010-10-01

    The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.

  3. Tree-fold loop approximation of AMD

    Energy Technology Data Exchange (ETDEWEB)

    Ono, Akira [Tohoku Univ., Sendai (Japan). Faculty of Science

    1997-05-01

    AMD (antisymmetrized molecular dynamics) is a frame work for describing a wave function of nucleon multi-body system by Slater determinant of Gaussian wave flux, and a theory for integrally describing a wide range of nuclear reactions such as intermittent energy heavy ion reaction, nucleon incident reaction and so forth. The aim of this study is induction on approximation equation of expected value, {nu}, in correlation capable of calculation with time proportional A (exp 3) (or lower), and to make AMD applicable to the heavier system such as Au+Au. As it must be avoided to break characteristics of AMD, it needs not to be anxious only by approximating the {nu}-value. However, in order to give this approximation any meaning, error of this approximation will have to be sufficiently small in comparison with bond energy of atomic nucleus and smaller than 1 MeV/nucleon. As the absolute expected value in correlation may be larger than 50 MeV/nucleon, the approximation is required to have a high accuracy within 2 percent. (G.K.)

  4. Numerical approximation of partial differential equations

    CERN Document Server

    Bartels, Sören

    2016-01-01

    Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensible tool in science and technology. This textbook aims at providing a thorough introduction to the construction, analysis, and implementation of finite element methods for model problems arising in continuum mechanics. The first part of the book discusses elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods. The second part is devoted to the optimal adaptive approximation of singularities and the fast iterative solution of linear systems of equations arising from finite element discretizations. In the third part, the mathematical framework for analyzing and discretizing saddle-point problems is formulated, corresponding finte element methods are analyzed, and particular ...

  5. Fast wavelet based sparse approximate inverse preconditioner

    Energy Technology Data Exchange (ETDEWEB)

    Wan, W.L. [Univ. of California, Los Angeles, CA (United States)

    1996-12-31

    Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.

  6. Variational algorithms for approximate Bayesian inference

    Science.gov (United States)

    Beal, Matthew James

    The Bayesian framework for machine learning allows for the incorporation of prior knowledge in a coherent way, avoids overfitting problems, and provides a principled basis for selecting between alternative models. Unfortunately the computations required are usually intractable. This thesis presents a unified variational Bayesian (VB) framework which approximates these computations in models with latent variables using a lower bound on the marginal likelihood. Chapter 1 presents background material on Bayesian inference, graphical models, and propagation algorithms. Chapter 2 forms the theoretical core of the thesis, generalising the expectation- maximisation (EM) algorithm for learning maximum likelihood parameters to the VB EM algorithm which integrates over model parameters. The algorithm is then specialised to the large family of conjugate-exponential (CE) graphical models, and several theorems are presented to pave the road for automated VB derivation procedures in both directed and undirected graphs (Bayesian and Markov networks, respectively). Chapters 3--5 derive and apply the VB EM algorithm to three commonly-used and important models: mixtures of factor analysers, linear dynamical systems, and hidden Markov models. It is shown how model selection tasks such as determining the dimensionality, cardinality, or number of variables are possible using VB approximations. Also explored are methods for combining sampling procedures with variational approximations, to estimate the tightness of VB bounds and to obtain more effective sampling algorithms. Chapter 6 applies VB learning to a long-standing problem of scoring discrete-variable directed acyclic graphs, and compares the performance to annealed importance sampling amongst other methods. Throughout, the VB approximation is compared to other methods including sampling, Cheeseman-Stutz, and asymptotic approximations such as BIC. The thesis concludes with a discussion of evolving directions for model selection

  7. Exact and approximate calculation of giant resonances

    Energy Technology Data Exchange (ETDEWEB)

    Vertse, T. [Magyar Tudomanyos Akademia, Debrecen (Hungary). Atommag Kutato Intezete; Liotta, R.J. [Royal Inst. of Tech., Stockholm (Sweden); Maglione, E. [Padua Univ. (Italy). Ist. di Fisica

    1995-02-13

    Energies, sum rules and partial decay widths of giant resonances in {sup 208}Pb are calculated solving exactly the continuum RPA equations corresponding to a central Woods-Saxon potential. For comparison an approximate treatment of those quantities in terms of pole expansions of the Green function (Berggren and Mittag-Leffler) is also performed. It is found that the approximated results agree well with the exact ones. Comparison with experimental data is made and a search for physically meaningful resonances is carried out. ((orig.))

  8. Approximate Inference and Deep Generative Models

    CERN Multimedia

    CERN. Geneva

    2018-01-01

    Advances in deep generative models are at the forefront of deep learning research because of the promise they offer for allowing data-efficient learning, and for model-based reinforcement learning. In this talk I'll review a few standard methods for approximate inference and introduce modern approximations which allow for efficient large-scale training of a wide variety of generative models. Finally, I'll demonstrate several important application of these models to density estimation, missing data imputation, data compression and planning.

  9. Optimal convex approximations of quantum states

    Science.gov (United States)

    Sacchi, Massimiliano F.

    2017-10-01

    We consider the problem of optimally approximating an unavailable quantum state ρ by the convex mixing of states drawn from a set of available states {νi} . The problem is recast to look for the least distinguishable state from ρ among the convex set ∑ipiνi , and the corresponding optimal weights {pi} provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices.

  10. Approximations in the PE-method

    DEFF Research Database (Denmark)

    Arranz, Marta Galindo

    1996-01-01

    Two differenct sources of errors may occur in the implementation of the PE methods; a phase error introduced in the approximation of a pseudo-differential operator and an amplitude error generated from the starting field. First, the inherent phase errors introduced in the solution are analyzed...... for a case where the normal mode solution to the wave equation is valid, when the sound is propagated in a downward refracting atmosphere. The angular limitations for the different parabolic approximations are deduced, and calculations showing shifts in the starter as the second source of error...

  11. Approximating hidden chaotic attractors via parameter switching

    Science.gov (United States)

    Danca, Marius-F.; Kuznetsov, Nikolay V.; Chen, Guanrong

    2018-01-01

    In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The parameter switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration.

  12. An Approximate Bayesian Fundamental Frequency Estimator

    DEFF Research Database (Denmark)

    Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt

    2012-01-01

    and the model order is based on a probability model which corresponds to a minimum of prior information. From this probability model, we give the exact posterior distributions on the fundamental frequency and the model order, and we also present analytical approximations of these distributions which lower......Joint fundamental frequency and model order estimation is an important problem in several applications such as speech and music processing. In this paper, we develop an approximate estimation algorithm of these quantities using Bayesian inference. The inference about the fundamental frequency...

  13. Approximate Networking for Universal Internet Access

    Directory of Open Access Journals (Sweden)

    Junaid Qadir

    2017-12-01

    Full Text Available Despite the best efforts of networking researchers and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost-efficient ways of provisioning high-performance, global Internet. In this paper, we argue that instead of an exclusive focus on a utopian goal of universally accessible “ideal networking” (in which we have a high throughput and quality of service as well as low latency and congestion, we should consider providing “approximate networking” through the adoption of context-appropriate trade-offs. In this regard, we propose to leverage the advances in the emerging trend of “approximate computing” that rely on relaxing the bounds of precise/exact computing to provide new opportunities for improving the area, power, and performance efficiency of systems by orders of magnitude by embracing output errors in resilient applications. Furthermore, we propose to extend the dimensions of approximate computing towards various knobs available at network layers. Approximate networking can be used to provision “Global Access to the Internet for All” (GAIA in a pragmatically tiered fashion, in which different users around the world are provided a different context-appropriate (but still contextually functional Internet experience.

  14. Approximate Symbolic Model Checking Using Overlapping Projections

    Science.gov (United States)

    1999-01-01

    Abstract Symbolic Model Checking extends the scope of verification algorithms that can be handled automatically, by using symbolic representations...many of today’s large designs because of the state explosion problem. Approximate symbolic model checking is an attempt to trade off accuracy with

  15. Static correlation beyond the random phase approximation

    DEFF Research Database (Denmark)

    Olsen, Thomas; Thygesen, Kristian Sommer

    2014-01-01

    We investigate various approximations to the correlation energy of a H2 molecule in the dissociation limit, where the ground state is poorly described by a single Slater determinant. The correlation energies are derived from the density response function and it is shown that response functions de...

  16. Markov operators, positive semigroups and approximation processes

    CERN Document Server

    Altomare, Francesco; Leonessa, Vita; Rasa, Ioan

    2015-01-01

    In recent years several investigations have been devoted to the study of large classes of (mainly degenerate) initial-boundary value evolution problems in connection with the possibility to obtain a constructive approximation of the associated positive C_0-semigroups. In this research monograph we present the main lines of a theory which finds its root in the above-mentioned research field.

  17. Nonlinear approximation with dictionaries,.. II: Inverse estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for separated decomposable dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually...

  18. Approximate Equilibrium Problems and Fixed Points

    Directory of Open Access Journals (Sweden)

    H. Mazaheri

    2013-01-01

    Full Text Available We find a common element of the set of fixed points of a map and the set of solutions of an approximate equilibrium problem in a Hilbert space. Then, we show that one of the sequences weakly converges. Also we obtain some theorems about equilibrium problems and fixed points.

  19. Nonlinear approximation with dictionaries. II. Inverse Estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2006-01-01

    In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block...

  20. On the Subspace Projected Approximate Matrix method

    NARCIS (Netherlands)

    Brandts, J.H.; Reis da Silva, R.

    2015-01-01

    We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method of computing a few eigenvalues of a Hermitian matrix A. It falls in the category of inner-outer iteration methods and aims to reduce the costs of

  1. Approximability of Minimum AND-Circuits

    NARCIS (Netherlands)

    Arpe, J.; Manthey, Bodo

    Given a set of monomials, the {\\sc Minimum AND-Circuit} problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that the problem is not polynomial-time approximable within a factor of less than 1.0051 unless {\\sc P = NP}, even if the

  2. Uncertainty relations for approximation and estimation

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jaeha, E-mail: jlee@post.kek.jp [Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Tsutsui, Izumi, E-mail: izumi.tsutsui@kek.jp [Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Theory Center, Institute of Particle and Nuclear Studies, High Energy Accelerator Research Organization (KEK), 1-1 Oho, Tsukuba, Ibaraki 305-0801 (Japan)

    2016-05-27

    We present a versatile inequality of uncertainty relations which are useful when one approximates an observable and/or estimates a physical parameter based on the measurement of another observable. It is shown that the optimal choice for proxy functions used for the approximation is given by Aharonov's weak value, which also determines the classical Fisher information in parameter estimation, turning our inequality into the genuine Cramér–Rao inequality. Since the standard form of the uncertainty relation arises as a special case of our inequality, and since the parameter estimation is available as well, our inequality can treat both the position–momentum and the time–energy relations in one framework albeit handled differently. - Highlights: • Several inequalities interpreted as uncertainty relations for approximation/estimation are derived from a single ‘versatile inequality’. • The ‘versatile inequality’ sets a limit on the approximation of an observable and/or the estimation of a parameter by another observable. • The ‘versatile inequality’ turns into an elaboration of the Robertson–Kennard (Schrödinger) inequality and the Cramér–Rao inequality. • Both the position–momentum and the time–energy relation are treated in one framework. • In every case, Aharonov's weak value arises as a key geometrical ingredient, deciding the optimal choice for the proxy functions.

  3. Radiation forces in the discrete dipole approximation

    NARCIS (Netherlands)

    Hoekstra, A.G.; Frijlink, M.O.; Waters, L.B.F.M.; Sloot, P.M.A.

    2001-01-01

    The theory of the discrete-dipole approximation (DDA) for light scattering is extended to allow for the calculation of radiation forces on each dipole in the DDA model. Starting with the theory of Draine and Weingartner [Astrophys. J. 470, 551 (1996)] we derive an expression for the radiation force

  4. Hardness of approximation for strip packing

    DEFF Research Database (Denmark)

    Adamaszek, Anna Maria; Kociumaka, Tomasz; Pilipczuk, Marcin

    2017-01-01

    -dimensional knapsack. In this article, we answer this question in negative by proving that it is NP-hard to approximate strip packing within a factor better than 12/11, even when restricted to polynomially bounded input data. In particular, this shows that the strip packing problem admits no quasi-polynomial time...

  5. Error Minimization of Polynomial Approximation of Delta

    Indian Academy of Sciences (India)

    The difference between Universal time (UT) and Dynamical time (TD), known as Delta ( ) is tabulated for the first day of each year in the Astronomical Almanac. During the last four centuries it is found that there are large differences between its values for two consecutive years. Polynomial approximations have been ...

  6. On approximating the TSP with intersecting neighborhoods

    NARCIS (Netherlands)

    Elbassioni, Khaled; Fishkin, Aleksei V.; Sitters, René

    2006-01-01

    In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor

  7. Fostering Formal Commutativity Knowledge with Approximate Arithmetic.

    Directory of Open Access Journals (Sweden)

    Sonja Maria Hansen

    Full Text Available How can we enhance the understanding of abstract mathematical principles in elementary school? Different studies found out that nonsymbolic estimation could foster subsequent exact number processing and simple arithmetic. Taking the commutativity principle as a test case, we investigated if the approximate calculation of symbolic commutative quantities can also alter the access to procedural and conceptual knowledge of a more abstract arithmetic principle. Experiment 1 tested first graders who had not been instructed about commutativity in school yet. Approximate calculation with symbolic quantities positively influenced the use of commutativity-based shortcuts in formal arithmetic. We replicated this finding with older first graders (Experiment 2 and third graders (Experiment 3. Despite the positive effect of approximation on the spontaneous application of commutativity-based shortcuts in arithmetic problems, we found no comparable impact on the application of conceptual knowledge of the commutativity principle. Overall, our results show that the usage of a specific arithmetic principle can benefit from approximation. However, the findings also suggest that the correct use of certain procedures does not always imply conceptual understanding. Rather, the conceptual understanding of commutativity seems to lag behind procedural proficiency during elementary school.

  8. Approximating a nonlinear MTFDE from physiology

    Science.gov (United States)

    Teodoro, M. Filomena

    2016-12-01

    This paper describes a numerical scheme which approximates the solution of a nonlinear mixed type functional differential equation from nerve conduction theory. The solution of such equation is defined in all the entire real axis and tends to known values at ±∞. A numerical method extended from linear case is developed and applied to solve a nonlinear equation.

  9. Virial expansion coefficients in the harmonic approximation

    DEFF Research Database (Denmark)

    R. Armstrong, J.; Zinner, Nikolaj Thomas; V. Fedorov, D.

    2012-01-01

    The virial expansion method is applied within a harmonic approximation to an interacting N-body system of identical fermions. We compute the canonical partition functions for two and three particles to get the two lowest orders in the expansion. The energy spectrum is carefully interpolated...

  10. Boundary Value Problems and Approximate Solutions

    African Journals Online (AJOL)

    Tadesse

    2. METHODOLOGY. The finite difference method for the solution of a two point boundary value problem consists in replacing the derivatives present in the differential equation and the boundary conditions with the help of finite difference approximations and then solving the resulting linear system of equations by a standard ...

  11. Approximate Dynamic Programming by Practical Examples

    NARCIS (Netherlands)

    Mes, Martijn R.K.; Perez Rivera, Arturo Eduardo; Boucherie, Richard; van Dijk, Nico M.

    2017-01-01

    Computing the exact solution of an MDP model is generally difficult and possibly intractable for realistically sized problem instances. A powerful technique to solve the large scale discrete time multistage stochastic control processes is Approximate Dynamic Programming (ADP). Although ADP is used

  12. Approximability and Parameterized Complexity of Minmax Values

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Hansen, Thomas Dueholm; Miltersen, Peter Bro

    2008-01-01

    We consider approximating the minmax value of a multi player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ε log n digits (for any constant ε > 0) is NP-hard, where n is the size of the game. On the other hand......, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quasi-polynomial time. We consider the parameterized complexity of the problem, with the parameter being the number of pure strategies k of the player for which the minmax value is computed. We show...... that if there are three players, k = 2 and there are only two possible rational payoffs, the minmax value is a rational number and can be computed exactly in linear time. In the general case, we show that the value can be approximated wigh any polynomial number of digits of accuracy in time n^O(k) . On the other hand, we...

  13. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-11-30

    We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.

  14. TMB: Automatic differentiation and laplace approximation

    DEFF Research Database (Denmark)

    Kristensen, Kasper; Nielsen, Anders; Berg, Casper Willestofte

    2016-01-01

    computations. The user defines the joint likelihood for the data and the random effects as a C++ template function, while all the other operations are done in R; e.g., reading in the data. The package evaluates and maximizes the Laplace approximation of the marginal likelihood where the random effects...

  15. Approximation Algorithms for Model-Based Diagnosis

    NARCIS (Netherlands)

    Feldman, A.B.

    2010-01-01

    Model-based diagnosis is an area of abductive inference that uses a system model, together with observations about system behavior, to isolate sets of faulty components (diagnoses) that explain the observed behavior, according to some minimality criterion. This thesis presents greedy approximation

  16. Upper Bounds on Numerical Approximation Errors

    DEFF Research Database (Denmark)

    Raahauge, Peter

    2004-01-01

    This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function...

  17. Revisiting Twomey's approximation for peak supersaturation

    Directory of Open Access Journals (Sweden)

    B. J. Shipway

    2015-04-01

    Full Text Available Twomey's seminal 1959 paper provided lower and upper bound approximations to the estimation of peak supersaturation within an updraft and thus provides the first closed expression for the number of nucleated cloud droplets. The form of this approximation is simple, but provides a surprisingly good estimate and has subsequently been employed in more sophisticated treatments of nucleation parametrization. In the current paper, we revisit the lower bound approximation of Twomey and make a small adjustment that can be used to obtain a more accurate calculation of peak supersaturation under all potential aerosol loadings and thermodynamic conditions. In order to make full use of this improved approximation, the underlying integro-differential equation for supersaturation evolution and the condition for calculating peak supersaturation are examined. A simple rearrangement of the algebra allows for an expression to be written down that can then be solved with a single lookup table with only one independent variable for an underlying lognormal aerosol population. While multimodal aerosol with N different dispersion characteristics requires 2N+1 inputs to calculate the activation fraction, only N of these one-dimensional lookup tables are needed. No additional information is required in the lookup table to deal with additional chemical, physical or thermodynamic properties. The resulting implementation provides a relatively simple, yet computationally cheap, physically based parametrization of droplet nucleation for use in climate and Numerical Weather Prediction models.

  18. Approximate Model Checking of Stochastic COWS

    NARCIS (Netherlands)

    Quaglia, Paola; Schivo, Stefano

    2010-01-01

    Given the description of a model and a probabilistic formula, approximate model checking is a verification technique based on statistical reasoning that allows answering whether or not the model satisfies the formula. Only a subset of the properties that can be analyzed by exact model checking can

  19. Statistical model semiquantitatively approximates arabinoxylooligosaccharides' structural diversity

    DEFF Research Database (Denmark)

    Dotsenko, Gleb; Nielsen, Michael Krogsgaard; Lange, Lene

    2016-01-01

    (wheat flour arabinoxylan (arabinose/xylose, A/X = 0.47); grass arabinoxylan (A/X = 0.24); wheat straw arabinoxylan (A/X = 0.15); and hydrothermally pretreated wheat straw arabinoxylan (A/X = 0.05)), is semiquantitatively approximated using the proposed model. The suggested approach can be applied...

  20. Approximations and endomorphism algebras of modules

    CERN Document Server

    Göbel, Rüdiger

    2006-01-01

    This monograph provides a thorough treatment of module theory, a subfield of algebra. The authors develop an approximation theory as well as realization theorems and present some of its recent applications, notably to infinite-dimensional combinatorics and model theory. The book is devoted to graduate students interested in algebra as well as to experts in module theory.

  1. An approximate classical unimolecular reaction rate theory

    Science.gov (United States)

    Zhao, Meishan; Rice, Stuart A.

    1992-05-01

    We describe a classical theory of unimolecular reaction rate which is derived from the analysis of Davis and Gray by use of simplifying approximations. These approximations concern the calculation of the locations of, and the fluxes of phase points across, the bottlenecks to fragmentation and to intramolecular energy transfer. The bottleneck to fragment separation is represented as a vibration-rotation state dependent separatrix, which approximation is similar to but extends and improves the approximations for the separatrix introduced by Gray, Rice, and Davis and by Zhao and Rice. The novel feature in our analysis is the representation of the bottlenecks to intramolecular energy transfer as dividing surfaces in phase space; the locations of these dividing surfaces are determined by the same conditions as locate the remnants of robust tori with frequency ratios related to the golden mean (in a two degree of freedom system these are the cantori). The flux of phase points across each dividing surface is calculated with an analytic representation instead of a stroboscopic mapping. The rate of unimolecular reaction is identified with the net rate at which phase points escape from the region of quasiperiodic bounded motion to the region of free fragment motion by consecutively crossing the dividing surfaces for intramolecular energy exchange and the separatrix. This new theory generates predictions of the rates of predissociation of the van der Waals molecules HeI2, NeI2 and ArI2 which are in very good agreement with available experimental data.

  2. Padé approximations and diophantine geometry

    Science.gov (United States)

    Chudnovsky, D. V.; Chudnovsky, G. V.

    1985-01-01

    Using methods of Padé approximations we prove a converse to Eisenstein's theorem on the boundedness of denominators of coefficients in the expansion of an algebraic function, for classes of functions, parametrized by meromorphic functions. This result is applied to the Tate conjecture on the effective description of isogenies for elliptic curves. PMID:16593552

  3. Approximate dynamic programming using fluid and diffusion approximations with applications to power management

    OpenAIRE

    Chen, Wei; Huang, Dayu; Kulkarni, Ankur A.; Unnikrishnan, Jayakrishnan; Zhu, Quanyan; Mehta, Prashant; Meyn, Sean; Wierman, Adam

    2013-01-01

    Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations. In their most computationally attractive formulations, these techniques provide the approximate solution only within a prescribed finite-dimensional function class. Thus, the question that always arises is how should the function class be chosen? The goal of this paper is to propose an approach using the solutions to associated fluid and diffusion approximations. In ord...

  4. Nonlinear analysis approximation theory, optimization and applications

    CERN Document Server

    2014-01-01

    Many of our daily-life problems can be written in the form of an optimization problem. Therefore, solution methods are needed to solve such problems. Due to the complexity of the problems, it is not always easy to find the exact solution. However, approximate solutions can be found. The theory of the best approximation is applicable in a variety of problems arising in nonlinear functional analysis and optimization. This book highlights interesting aspects of nonlinear analysis and optimization together with many applications in the areas of physical and social sciences including engineering. It is immensely helpful for young graduates and researchers who are pursuing research in this field, as it provides abundant research resources for researchers and post-doctoral fellows. This will be a valuable addition to the library of anyone who works in the field of applied mathematics, economics and engineering.

  5. Traveltime approximations for inhomogeneous HTI media

    KAUST Repository

    Alkhalifah, Tariq Ali

    2011-01-01

    Traveltimes information is convenient for parameter estimation especially if the medium is described by an anisotropic set of parameters. This is especially true if we could relate traveltimes analytically to these medium parameters, which is generally hard to do in inhomogeneous media. As a result, I develop traveltimes approximations for horizontaly transversely isotropic (HTI) media as simplified and even linear functions of the anisotropic parameters. This is accomplished by perturbing the solution of the HTI eikonal equation with respect to η and the azimuthal symmetry direction (usually used to describe the fracture direction) from a generally inhomogeneous elliptically anisotropic background medium. The resulting approximations can provide accurate analytical description of the traveltime in a homogenous background compared to other published moveout equations out there. These equations will allow us to readily extend the inhomogenous background elliptical anisotropic model to an HTI with a variable, but smoothly varying, η and horizontal symmetry direction values. © 2011 Society of Exploration Geophysicists.

  6. Numerical and approximate solutions for plume rise

    Science.gov (United States)

    Krishnamurthy, Ramesh; Gordon Hall, J.

    Numerical and approximate analytical solutions are compared for turbulent plume rise in a crosswind. The numerical solutions were calculated using the plume rise model of Hoult, Fay and Forney (1969, J. Air Pollut. Control Ass.19, 585-590), over a wide range of pertinent parameters. Some wind shear and elevated inversion effects are included. The numerical solutions are seen to agree with the approximate solutions over a fairly wide range of the parameters. For the conditions considered in the study, wind shear effects are seen to be quite small. A limited study was made of the penetration of elevated inversions by plumes. The results indicate the adequacy of a simple criterion proposed by Briggs (1969, AEC Critical Review Series, USAEC Division of Technical Information extension, Oak Ridge, Tennesse).

  7. Approximate inverse preconditioners for general sparse matrices

    Energy Technology Data Exchange (ETDEWEB)

    Chow, E.; Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)

    1994-12-31

    Preconditioned Krylov subspace methods are often very efficient in solving sparse linear matrices that arise from the discretization of elliptic partial differential equations. However, for general sparse indifinite matrices, the usual ILU preconditioners fail, often because of the fact that the resulting factors L and U give rise to unstable forward and backward sweeps. In such cases, alternative preconditioners based on approximate inverses may be attractive. We are currently developing a number of such preconditioners based on iterating on each column to get the approximate inverse. For this approach to be efficient, the iteration must be done in sparse mode, i.e., we must use sparse-matrix by sparse-vector type operatoins. We will discuss a few options and compare their performance on standard problems from the Harwell-Boeing collection.

  8. Approximate gauge symemtry of composite vector bosons

    Energy Technology Data Exchange (ETDEWEB)

    Suzuki, Mahiko

    2010-06-01

    It can be shown in a solvable field theory model that the couplings of the composite vector mesons made of a fermion pair approach the gauge couplings in the limit of strong binding. Although this phenomenon may appear accidental and special to the vector bosons made of a fermion pair, we extend it to the case of bosons being constituents and find that the same phenomenon occurs in more an intriguing way. The functional formalism not only facilitates computation but also provides us with a better insight into the generating mechanism of approximate gauge symmetry, in particular, how the strong binding and global current conservation conspire to generate such an approximate symmetry. Remarks are made on its possible relevance or irrelevance to electroweak and higher symmetries.

  9. A Varifold Approach to Surface Approximation

    Science.gov (United States)

    Buet, Blanche; Leonardi, Gian Paolo; Masnou, Simon

    2017-11-01

    We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we introduce the notion of approximate mean curvature and show various convergence results that hold, in particular, for sequences of discrete varifolds associated with point clouds or pixel/voxel-type discretizations of d-surfaces in the Euclidean n-space, without restrictions on dimension and codimension. The variational nature of the approach also allows us to consider surfaces with singularities, and in that case the approximate mean curvature is consistent with the generalized mean curvature of the limit surface. A series of numerical tests are provided in order to illustrate the effectiveness and generality of the method.

  10. Approximated solutions to Born-Infeld dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Ferraro, Rafael [Instituto de Astronomía y Física del Espacio (IAFE, CONICET-UBA),Casilla de Correo 67, Sucursal 28, 1428 Buenos Aires (Argentina); Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina); Nigro, Mauro [Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina)

    2016-02-01

    The Born-Infeld equation in the plane is usefully captured in complex language. The general exact solution can be written as a combination of holomorphic and anti-holomorphic functions. However, this solution only expresses the potential in an implicit way. We rework the formulation to obtain the complex potential in an explicit way, by means of a perturbative procedure. We take care of the secular behavior common to this kind of approach, by resorting to a symmetry the equation has at the considered order of approximation. We apply the method to build approximated solutions to Born-Infeld electrodynamics. We solve for BI electromagnetic waves traveling in opposite directions. We study the propagation at interfaces, with the aim of searching for effects susceptible to experimental detection. In particular, we show that a reflected wave is produced when a wave is incident on a semi-space containing a magnetostatic field.

  11. The approximability of the String Barcoding problem

    Directory of Open Access Journals (Sweden)

    Rizzi Romeo

    2006-08-01

    Full Text Available Abstract The String Barcoding (SBC problem, introduced by Rash and Gusfield (RECOMB, 2002, consists in finding a minimum set of substrings that can be used to distinguish between all members of a set of given strings. In a computational biology context, the given strings represent a set of known viruses, while the substrings can be used as probes for an hybridization experiment via microarray. Eventually, one aims at the classification of new strings (unknown viruses through the result of the hybridization experiment. In this paper we show that SBC is as hard to approximate as Set Cover. Furthermore, we show that the constrained version of SBC (with probes of bounded length is also hard to approximate. These negative results are tight.

  12. Uniform semiclassical approximations for umbilic bifurcation catastrophes

    CERN Document Server

    Main, J

    1998-01-01

    Gutzwiller's trace formula for the semiclassical density of states diverges at the bifurcation points of periodic orbits and has to be replaced with uniform semiclassical approximations. We present a method to derive these expressions from the standard representations of the elementary catastrophes and to directly relate the uniform solutions to classical periodic orbit parameters. The method is simple even for ungeneric bifurcations with corank 2 such as the umbilic catastrophes. We demonstrate the technique on a hyperbolic umbilic in the diamagnetic Kepler problem.

  13. Best approximation to monomials on a cube

    Science.gov (United States)

    Yudin, V. A.

    2008-08-01

    The paper considers a multivariate analogue of the Chebyshev problem on the cube concerning the construction of polynomials of least deviation from zero. A classification of monomials possessing a unique polynomial of best approximation in the space of continuous functions on the unit cube in \\mathbb R^n is given. Precise solutions in some weighted spaces L_p are found.Bibliography: 11 titles.

  14. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-05

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.

  15. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-07

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design

  16. Approximation methods for stochastic petri nets

    Science.gov (United States)

    Jungnitz, Hauke Joerg

    1992-01-01

    Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay

  17. Approximation for limit cycles and their isochrons.

    Science.gov (United States)

    Demongeot, Jacques; Françoise, Jean-Pierre

    2006-12-01

    Local analysis of trajectories of dynamical systems near an attractive periodic orbit displays the notion of asymptotic phase and isochrons. These notions are quite useful in applications to biosciences. In this note, we give an expression for the first approximation of equations of isochrons in the setting of perturbations of polynomial Hamiltonian systems. This method can be generalized to perturbations of systems that have a polynomial integral factor (like the Lotka-Volterra equation).

  18. CHAMP: Changepoint Detection Using Approximate Model Parameters

    Science.gov (United States)

    2014-06-01

    CHAMP : Changepoint Detection Using Approximate Model Parameters Scott Niekum1,2 Sarah Osentoski3 Christopher G. Atkeson1 Andrew G. Barto2 Abstract We...introduce CHAMP , an algorithm for online Bayesian changepoint detection in settings where it is difficult or undesirable to integrate over the... CHAMP to another state-of-the-art online Bayesian changepoint detection method. 1 Introduction Many practical applications in statistics require

  19. Solving Math Problems Approximately: A Developmental Perspective.

    Directory of Open Access Journals (Sweden)

    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.

  20. Fast approximate convex decomposition using relative concavity

    KAUST Repository

    Ghosh, Mukulika

    2013-02-01

    Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.

  1. On approximation of functions by product operators

    Directory of Open Access Journals (Sweden)

    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.

  2. Solving Math Problems Approximately: A Developmental Perspective

    Science.gov (United States)

    Ganor-Stern, Dana

    2016-01-01

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

  3. Conference on Abstract Spaces and Approximation

    CERN Document Server

    Szökefalvi-Nagy, B; Abstrakte Räume und Approximation; Abstract spaces and approximation

    1969-01-01

    The present conference took place at Oberwolfach, July 18-27, 1968, as a direct follow-up on a meeting on Approximation Theory [1] held there from August 4-10, 1963. The emphasis was on theoretical aspects of approximation, rather than the numerical side. Particular importance was placed on the related fields of functional analysis and operator theory. Thirty-nine papers were presented at the conference and one more was subsequently submitted in writing. All of these are included in these proceedings. In addition there is areport on new and unsolved problems based upon a special problem session and later communications from the partici­ pants. A special role is played by the survey papers also presented in full. They cover a broad range of topics, including invariant subspaces, scattering theory, Wiener-Hopf equations, interpolation theorems, contraction operators, approximation in Banach spaces, etc. The papers have been classified according to subject matter into five chapters, but it needs littl...

  4. Simultaneous perturbation stochastic approximation for tidal models

    KAUST Repository

    Altaf, M.U.

    2011-05-12

    The Dutch continental shelf model (DCSM) is a shallow sea model of entire continental shelf which is used operationally in the Netherlands to forecast the storm surges in the North Sea. The forecasts are necessary to support the decision of the timely closure of the moveable storm surge barriers to protect the land. In this study, an automated model calibration method, simultaneous perturbation stochastic approximation (SPSA) is implemented for tidal calibration of the DCSM. The method uses objective function evaluations to obtain the gradient approximations. The gradient approximation for the central difference method uses only two objective function evaluation independent of the number of parameters being optimized. The calibration parameter in this study is the model bathymetry. A number of calibration experiments is performed. The effectiveness of the algorithm is evaluated in terms of the accuracy of the final results as well as the computational costs required to produce these results. In doing so, comparison is made with a traditional steepest descent method and also with a newly developed proper orthogonal decompositionbased calibration method. The main findings are: (1) The SPSA method gives comparable results to steepest descent method with little computational cost. (2) The SPSA method with little computational cost can be used to estimate large number of parameters.

  5. An Origami Approximation to the Cosmic Web

    Science.gov (United States)

    Neyrinck, Mark C.

    2016-10-01

    The powerful Lagrangian view of structure formation was essentially introduced to cosmology by Zel'dovich. In the current cosmological paradigm, a dark-matter-sheet 3D manifold, inhabiting 6D position-velocity phase space, was flat (with vanishing velocity) at the big bang. Afterward, gravity stretched and bunched the sheet together in different places, forming a cosmic web when projected to the position coordinates. Here, I explain some properties of an origami approximation, in which the sheet does not stretch or contract (an assumption that is false in general), but is allowed to fold. Even without stretching, the sheet can form an idealized cosmic web, with convex polyhedral voids separated by straight walls and filaments, joined by convex polyhedral nodes. The nodes form in `polygonal' or `polyhedral' collapse, somewhat like spherical/ellipsoidal collapse, except incorporating simultaneous filament and wall formation. The origami approximation allows phase-space geometries of nodes, filaments, and walls to be more easily understood, and may aid in understanding spin correlations between nearby galaxies. This contribution explores kinematic origami-approximation models giving velocity fields for the first time.

  6. Ranking Support Vector Machine with Kernel Approximation.

    Science.gov (United States)

    Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi

    2017-01-01

    Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

  7. Fast algorithms for approximate circular string matching.

    Science.gov (United States)

    Barton, Carl; Iliopoulos, Costas S; Pissis, Solon P

    2014-03-22

    Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate circular string matching is a rather undeveloped area. In this article, we present a suboptimal average-case algorithm for exact circular string matching requiring time O(n). Based on our solution for the exact case, we present two fast average-case algorithms for approximate circular string matching with k-mismatches, under the Hamming distance model, requiring time O(n) for moderate values of k, that is k=O(m/logm). We show how the same results can be easily obtained under the edit distance model. The presented algorithms are also implemented as library functions. Experimental results demonstrate that the functions provided in this library accelerate the computations by more than three orders of magnitude compared to a naïve approach. We present two fast average-case algorithms for approximate circular string matching with k-mismatches; and show that they also perform very well in practice. The importance of our contribution is underlined by the fact that the provided functions may be seamlessly integrated into any biological pipeline. The source code of the library is freely available at http://www.inf.kcl.ac.uk/research/projects/asmf/.

  8. Approximate number and approximate time discrimination each correlate with school math abilities in young children.

    Science.gov (United States)

    Odic, Darko; Lisboa, Juan Valle; Eisinger, Robert; Olivera, Magdalena Gonzalez; Maiche, Alejandro; Halberda, Justin

    2016-01-01

    What is the relationship between our intuitive sense of number (e.g., when estimating how many marbles are in a jar), and our intuitive sense of other quantities, including time (e.g., when estimating how long it has been since we last ate breakfast)? Recent work in cognitive, developmental, comparative psychology, and computational neuroscience has suggested that our representations of approximate number, time, and spatial extent are fundamentally linked and constitute a "generalized magnitude system". But, the shared behavioral and neural signatures between number, time, and space may alternatively be due to similar encoding and decision-making processes, rather than due to shared domain-general representations. In this study, we investigate the relationship between approximate number and time in a large sample of 6-8 year-old children in Uruguay by examining how individual differences in the precision of number and time estimation correlate with school mathematics performance. Over four testing days, each child completed an approximate number discrimination task, an approximate time discrimination task, a digit span task, and a large battery of symbolic math tests. We replicate previous reports showing that symbolic math abilities correlate with approximate number precision and extend those findings by showing that math abilities also correlate with approximate time precision. But, contrary to approximate number and time sharing common representations, we find that each of these dimensions uniquely correlates with formal math: approximate number correlates more strongly with formal math compared to time and continues to correlate with math even when precision in time and individual differences in working memory are controlled for. These results suggest that there are important differences in the mental representations of approximate number and approximate time and further clarify the relationship between quantity representations and mathematics. Copyright

  9. Photoelectron spectroscopy and the dipole approximation

    Energy Technology Data Exchange (ETDEWEB)

    Hemmers, O.; Hansen, D.L.; Wang, H. [Univ. of Nevada, Las Vegas, NV (United States)] [and others

    1997-04-01

    Photoelectron spectroscopy is a powerful technique because it directly probes, via the measurement of photoelectron kinetic energies, orbital and band structure in valence and core levels in a wide variety of samples. The technique becomes even more powerful when it is performed in an angle-resolved mode, where photoelectrons are distinguished not only by their kinetic energy, but by their direction of emission as well. Determining the probability of electron ejection as a function of angle probes the different quantum-mechanical channels available to a photoemission process, because it is sensitive to phase differences among the channels. As a result, angle-resolved photoemission has been used successfully for many years to provide stringent tests of the understanding of basic physical processes underlying gas-phase and solid-state interactions with radiation. One mainstay in the application of angle-resolved photoelectron spectroscopy is the well-known electric-dipole approximation for photon interactions. In this simplification, all higher-order terms, such as those due to electric-quadrupole and magnetic-dipole interactions, are neglected. As the photon energy increases, however, effects beyond the dipole approximation become important. To best determine the range of validity of the dipole approximation, photoemission measurements on a simple atomic system, neon, where extra-atomic effects cannot play a role, were performed at BL 8.0. The measurements show that deviations from {open_quotes}dipole{close_quotes} expectations in angle-resolved valence photoemission are observable for photon energies down to at least 0.25 keV, and are quite significant at energies around 1 keV. From these results, it is clear that non-dipole angular-distribution effects may need to be considered in any application of angle-resolved photoelectron spectroscopy that uses x-ray photons of energies as low as a few hundred eV.

  10. Spin-fluctuation theory beyond Gaussian approximation

    Energy Technology Data Exchange (ETDEWEB)

    Melnikov, N B [Moscow State University, 119992 Moscow (Russian Federation); Reser, B I; Grebennikov, V I, E-mail: melnikov@cs.msu.s, E-mail: reser@imp.uran.r, E-mail: greben@imp.uran.r [Institute of Metal Physics, Ural Branch of the Russian Academy of Sciences, 620041 Ekaterinburg (Russian Federation)

    2010-05-14

    A characteristic feature of the Gaussian approximation in the functional-integral approach to the spin-fluctuation theory is the jump phase transition to the paramagnetic state. We eliminate the jump and obtain a continuous second-order phase transition by taking into account high-order terms in the expansion of the free energy in powers of the fluctuating exchange field. The third-order term of the free energy renormalizes the mean field, and the fourth-order term, responsible for the interaction of the fluctuations, renormalizes the spin susceptibility. The extended theory is applied to the calculation of magnetic properties of Fe-Ni Invar.

  11. Turbo Equalization Using Partial Gaussian Approximation

    DEFF Research Database (Denmark)

    Zhang, Chuanzong; Wang, Zhongyong; Manchón, Carles Navarro

    2016-01-01

    This letter deals with turbo equalization for coded data transmission over intersymbol interference (ISI) channels. We propose a message-passing algorithm that uses the expectation propagation rule to convert messages passed from the demodulator and decoder to the equalizer and computes messages...... returned by the equalizer by using a partial Gaussian approximation (PGA). We exploit the specific structure of the ISI channel model to compute the latter messages from the beliefs obtained using a Kalman smoother/equalizer. Doing so leads to a significant complexity reduction compared to the initial PGA...

  12. Subset Selection by Local Convex Approximation

    DEFF Research Database (Denmark)

    Øjelund, Henrik; Sadegh, Payman; Madsen, Henrik

    1999-01-01

    least squares criterion. We propose an optimization technique for the posed probelm based on a modified version of the Newton-Raphson iterations, combined with a backward elimination type algorithm. THe Newton-Raphson modification concerns iterative approximations to the non-convex cost function......This paper concerns selection of the optimal subset of variables in a lenear regression setting. The posed problem is combinatiorial and the globally best subset can only be found in exponential time. We define a cost function for the subset selection problem by adding the penalty term to the usual...

  13. An Approximate Algorithm for Robust Adaptive Beamforming

    Science.gov (United States)

    Yoshida, Tomoaki; Iiguni, Youji

    2004-12-01

    This paper presents an adaptive weight computation algorithm for a robust array antenna based on the sample matrix inversion technique. The adaptive array minimizes the mean output power under the constraint that the mean square deviation between the desired and actual responses satisfies a certain magnitude bound. The Lagrange multiplier method is used to solve the constrained minimization problem. An efficient and accurate approximation is then used to derive the fast and recursive computation algorithm. Several simulation results are presented to support the effectiveness of the proposed adaptive computation algorithm.

  14. Approximate solution for Fokker-Planck equation

    Directory of Open Access Journals (Sweden)

    M.T. Araujo

    2015-12-01

    Full Text Available In this paper, an approximate solution to a specific class of the Fokker-Planck equation is proposed. The solution is based on the relationship between the Schrödinger type equation with a partially confining and symmetrical potential. To estimate the accuracy of the solution, a function error obtained from the original Fokker-Planck equation is suggested. Two examples, a truncated harmonic potential and non-harmonic polynomial, are analyzed using the proposed method. For the truncated harmonic potential, the system behavior as a function of temperature is also discussed.

  15. Decoupling with unitary approximate two-designs

    DEFF Research Database (Denmark)

    Szehr, Oleg; Dupont-Dupuis, Fréderic; Tomamichel, Marco

    2013-01-01

    to this question is provided by decoupling theorems, which have been developed recently in the area of quantum information theory. This paper builds on preceding work, which shows that decoupling is achieved if the evolution on A consists of a typical unitary, chosen with respect to the Haar measure, followed......-body interactions, which can be modeled as efficient circuits. Our decoupling result is independent of the dimension of the R system, which shows that approximate two-designs are appropriate for decoupling even if the dimension of this system is large....

  16. Topics in multivariate approximation and interpolation

    CERN Document Server

    Jetter, Kurt

    2005-01-01

    This book is a collection of eleven articles, written by leading experts and dealing with special topics in Multivariate Approximation and Interpolation. The material discussed here has far-reaching applications in many areas of Applied Mathematics, such as in Computer Aided Geometric Design, in Mathematical Modelling, in Signal and Image Processing and in Machine Learning, to mention a few. The book aims at giving a comprehensive information leading the reader from the fundamental notions and results of each field to the forefront of research. It is an ideal and up-to-date introduction for gr

  17. Approximate Circuits in Low-Power Image and Video Processing: The Approximate Median Filter

    Directory of Open Access Journals (Sweden)

    L. Sekanina

    2017-09-01

    Full Text Available Low power image and video processing circuits are crucial in many applications of computer vision. Traditional techniques used to reduce power consumption in these applications have recently been accompanied by circuit approximation methods which exploit the fact that these applications are highly error resilient and, hence, the quality of image processing can be traded for power consumption. On the basis of a literature survey, we identified the components whose implementations are the most frequently approximated and the methods used for obtaining these approximations. One of the components is the median image filter. We propose, evaluate and compare two approximation strategies based on Cartesian genetic programming applied to approximate various common implementations of the median filter. For filters developed using these approximation strategies, trade-offs between the quality of filtering and power consumption are investigated. Under conditions of our experiments we conclude that better trade-offs are achieved when the image filter is evolved from scratch rather than a conventional filter is approximated.

  18. Function approximation using adaptive and overlapping intervals

    Energy Technology Data Exchange (ETDEWEB)

    Patil, R.B.

    1995-05-01

    A problem common to many disciplines is to approximate a function given only the values of the function at various points in input variable space. A method is proposed for approximating a function of several to one variable. The model takes the form of weighted averaging of overlapping basis functions defined over intervals. The number of such basis functions and their parameters (widths and centers) are automatically determined using given training data and a learning algorithm. The proposed algorithm can be seen as placing a nonuniform multidimensional grid in the input domain with overlapping cells. The non-uniformity and overlap of the cells is achieved by a learning algorithm to optimize a given objective function. This approach is motivated by the fuzzy modeling approach and a learning algorithms used for clustering and classification in pattern recognition. The basics of why and how the approach works are given. Few examples of nonlinear regression and classification are modeled. The relationship between the proposed technique, radial basis neural networks, kernel regression, probabilistic neural networks, and fuzzy modeling is explained. Finally advantages and disadvantages are discussed.

  19. Nonlinear higher quasiparticle random phase approximation

    Science.gov (United States)

    Smetana, Adam; Šimkovic, Fedor; Štefánik, Dušan; Krivoruchenko, Mikhail

    2017-10-01

    We develop a new approach to describe nuclear states of multiphonon origin, motivated by the necessity for a more accurate description of matrix elements of neutrinoless double-beta decay. Our approach is an extension of the Quasiparticle Random Phase Approximation (QRPA), in which nonlinear phonon operators play an essential role. Before applying the nonlinear higher QRPA (nhQRPA) to realistic problems, we test its efficiency with exactly solvable models. The first considered model is equivalent to a harmonic oscillator. The nhQRPA solutions follow from the standard QRPA equation, but for nonlinear phonon operators defined for each individual excited state separately. The second exactly solvable model is the proton-neutron Lipkin model that describes successfully not only energy spectrum of nuclei, but also beta-decay transitions. Again, we reproduce exactly the numerical solutions in the nhQRPA framework. We show in particular that truncation of the nonlinear phonon operators leads to an approximation similar to the self-consistent second QRPA, given the phonon operators are defined with a constant term. The test results demonstrate that the proposed nhQRPA is a promising tool for a realistic calculation of energy spectra and nuclear transitions.

  20. Regularity and approximability of electronic wave functions

    CERN Document Server

    Yserentant, Harry

    2010-01-01

    The electronic Schrödinger equation describes the motion of N-electrons under Coulomb interaction forces in a field of clamped nuclei. The solutions of this equation, the electronic wave functions, depend on 3N variables, with three spatial dimensions for each electron. Approximating these solutions is thus inordinately challenging, and it is generally believed that a reduction to simplified models, such as those of the Hartree-Fock method or density functional theory, is the only tenable approach. This book seeks to show readers that this conventional wisdom need not be ironclad: the regularity of the solutions, which increases with the number of electrons, the decay behavior of their mixed derivatives, and the antisymmetry enforced by the Pauli principle contribute properties that allow these functions to be approximated with an order of complexity which comes arbitrarily close to that for a system of one or two electrons. The text is accessible to a mathematical audience at the beginning graduate level as...

  1. APPROXIMATING INNOVATION POTENTIAL WITH NEUROFUZZY ROBUST MODEL

    Directory of Open Access Journals (Sweden)

    Kasa, Richard

    2015-01-01

    Full Text Available In a remarkably short time, economic globalisation has changed the world’s economic order, bringing new challenges and opportunities to SMEs. These processes pushed the need to measure innovation capability, which has become a crucial issue for today’s economic and political decision makers. Companies cannot compete in this new environment unless they become more innovative and respond more effectively to consumers’ needs and preferences – as mentioned in the EU’s innovation strategy. Decision makers cannot make accurate and efficient decisions without knowing the capability for innovation of companies in a sector or a region. This need is forcing economists to develop an integrated, unified and complete method of measuring, approximating and even forecasting the innovation performance not only on a macro but also a micro level. In this recent article a critical analysis of the literature on innovation potential approximation and prediction is given, showing their weaknesses and a possible alternative that eliminates the limitations and disadvantages of classical measuring and predictive methods.

  2. When telegrapher's equation furnishes a better approximation to transport equation than the difussion approximation

    OpenAIRE

    Porrà i Rovira, Josep Maria; Masoliver, Jaume, 1951-; Weiss, George H. (George Herbert), 1930-

    1997-01-01

    It has been suggested that a solution to the transport equation which includes anisotropic scattering can be approximated by the solution to a telegrapher's equation [A.J. Ishimaru, Appl. Opt. 28, 2210 (1989)]. We show that in one dimension the telegrapher's equation furnishes an exact solution to the transport equation. In two dimensions, we show that, since the solution can become negative, the telegrapher's equation will not furnish a usable approximation. A comparison between simulated da...

  3. Approximating stochastic biochemical processes with Wasserstein pseudometrics.

    Science.gov (United States)

    Thorsley, D; Klavins, E

    2010-05-01

    Modelling stochastic processes inside the cell is difficult due to the size and complexity of the processes being investigated. As a result, new approaches are needed to address the problems of model reduction, parameter estimation, model comparison and model invalidation. Here, the authors propose addressing these problems by using Wasserstein pseudometrics to quantify the differences between processes. The method the authors propose is applicable to any bounded continuous-time stochastic process and pseudometrics between processes are defined only in terms of the available outputs. Algorithms for approximating Wasserstein pseudometrics are developed from experimental or simulation data and demonstrate how to optimise parameter values to minimise the pseudometrics. The approach is illustrated with studies of a stochastic toggle switch and of stochastic gene expression in E. coli.

  4. Polarized constituent quarks in NLO approximation

    Energy Technology Data Exchange (ETDEWEB)

    Khorramian, Ali N. [Physics Department, Semnan University, Semnan, Iran and Institute for Studies in Theoretical Physics and Mathematics , P.O.Box 19395-5531, Tehran (Iran, Islamic Republic of); Tehrani, S. Atashbar [Physics Department, Persian Gulf University, Boushehr, Iran and Institute for Studies in Theoretical Physics and Mathematics , P.O.Box 19395-5531, Tehran (Iran, Islamic Republic of); Mirjalili, A. [Physics Department, Persian Gulf University, Boushehr, Iran and Institute for Studies in Theoretical Physics and Mathematics , P.O.Box 19395-5531, Tehran (Iran, Islamic Republic of)

    2006-02-15

    The valon representation provides a basis between hadrons and quarks, in terms of which the bound-state and scattering properties of hadrons can be united and described. We studied polarized valon distributions which have an important role in describing the spin dependence of parton distribution in leading and next-to-leading order approximation. Convolution integral in frame work of valon model as a useful tool, was used in polarized case. To obtain polarized parton distributions in a proton we need to polarized valon distribution in a proton and polarized parton distributions inside the valon. We employed Bernstein polynomial averages to get unknown parameters of polarized valon distributions by fitting to available experimental data.

  5. Animal models and integrated nested Laplace approximations.

    Science.gov (United States)

    Holand, Anna Marie; Steinsland, Ingelin; Martino, Sara; Jensen, Henrik

    2013-08-07

    Animal models are generalized linear mixed models used in evolutionary biology and animal breeding to identify the genetic part of traits. Integrated Nested Laplace Approximation (INLA) is a methodology for making fast, nonsampling-based Bayesian inference for hierarchical Gaussian Markov models. In this article, we demonstrate that the INLA methodology can be used for many versions of Bayesian animal models. We analyze animal models for both synthetic case studies and house sparrow (Passer domesticus) population case studies with Gaussian, binomial, and Poisson likelihoods using INLA. Inference results are compared with results using Markov Chain Monte Carlo methods. For model choice we use difference in deviance information criteria (DIC). We suggest and show how to evaluate differences in DIC by comparing them with sampling results from simulation studies. We also introduce an R package, AnimalINLA, for easy and fast inference for Bayesian Animal models using INLA.

  6. Approximate Sensory Data Collection: A Survey.

    Science.gov (United States)

    Cheng, Siyao; Cai, Zhipeng; Li, Jianzhong

    2017-03-10

    With the rapid development of the Internet of Things (IoTs), wireless sensor networks (WSNs) and related techniques, the amount of sensory data manifests an explosive growth. In some applications of IoTs and WSNs, the size of sensory data has already exceeded several petabytes annually, which brings too many troubles and challenges for the data collection, which is a primary operation in IoTs and WSNs. Since the exact data collection is not affordable for many WSN and IoT systems due to the limitations on bandwidth and energy, many approximate data collection algorithms have been proposed in the last decade. This survey reviews the state of the art of approximatedatacollectionalgorithms. Weclassifythemintothreecategories: themodel-basedones, the compressive sensing based ones, and the query-driven ones. For each category of algorithms, the advantages and disadvantages are elaborated, some challenges and unsolved problems are pointed out, and the research prospects are forecasted.

  7. Lagrangian Markovianized Field Approximation for turbulence

    CERN Document Server

    Bos, Wouter

    2013-01-01

    In a previous communication (W.J.T. Bos and J.-P. Bertoglio 2006, Phys. Fluids, 18, 031706), a self-consistent Markovian triadic closure was presented. The detailed derivation of this closure is given here, relating it to the Direct Interaction Approximation and Quasi-Normal types of closure. The time-scale needed to obtain a self-consistent closure for both the energy spectrum and the scalar variance spectrum is determined by evaluating the correlation between the velocity and an advected displacement vector-field. The relation between this latter correlation and the velocity-scalar correlation is stressed, suggesting a simplified model of the latter. The resulting closed equations are numerically integrated and results for the energy spectrum, scalar fluctuation spectrum and velocity-displacement correlation spectrum are presented for low, unity and high values of the Schmidt number.

  8. Approximate Bayesian computation with functional statistics.

    Science.gov (United States)

    Soubeyrand, Samuel; Carpentier, Florence; Guiton, François; Klein, Etienne K

    2013-03-26

    Functional statistics are commonly used to characterize spatial patterns in general and spatial genetic structures in population genetics in particular. Such functional statistics also enable the estimation of parameters of spatially explicit (and genetic) models. Recently, Approximate Bayesian Computation (ABC) has been proposed to estimate model parameters from functional statistics. However, applying ABC with functional statistics may be cumbersome because of the high dimension of the set of statistics and the dependences among them. To tackle this difficulty, we propose an ABC procedure which relies on an optimized weighted distance between observed and simulated functional statistics. We applied this procedure to a simple step model, a spatial point process characterized by its pair correlation function and a pollen dispersal model characterized by genetic differentiation as a function of distance. These applications showed how the optimized weighted distance improved estimation accuracy. In the discussion, we consider the application of the proposed ABC procedure to functional statistics characterizing non-spatial processes.

  9. Adaptive Control with Approximated Policy Search Approach

    Directory of Open Access Journals (Sweden)

    Agus Naba

    2010-05-01

    Full Text Available Most of existing adaptive control schemes are designed to minimize error between plant state and goal state despite the fact that executing actions that are predicted to result in smaller errors only can mislead to non-goal states. We develop an adaptive control scheme that involves manipulating a controller of a general type to improve its performance as measured by an evaluation function. The developed method is closely related to a theory of Reinforcement Learning (RL but imposes a practical assumption made for faster learning. We assume that a value function of RL can be approximated by a function of Euclidean distance from a goal state and an action executed at the state. And, we propose to use it for the gradient search as an evaluation function. Simulation results provided through application of the proposed scheme to a pole-balancing problem using a linear state feedback controller and fuzzy controller verify the scheme’s efficacy.

  10. Intelligent comparisons II inequalities and approximations

    CERN Document Server

    Anastassiou, George A

    2017-01-01

    This compact book focuses on self-adjoint operators’ well-known named inequalities and Korovkin approximation theory, both in a Hilbert space environment. It is the first book to study these aspects, and all chapters are self-contained and can be read independently. Further, each chapter includes an extensive list of references for further reading. The book’s results are expected to find applications in many areas of pure and applied mathematics. Given its concise format, it is especially suitable for use in related graduate classes and research projects. As such, the book offers a valuable resource for researchers and graduate students alike, as well as a key addition to all science and engineering libraries.

  11. Entropy Approximation in Lossy Source Coding Problem

    Directory of Open Access Journals (Sweden)

    Marek Śmieja

    2015-05-01

    Full Text Available In this paper, we investigate a lossy source coding problem, where an upper limit on the permitted distortion is defined for every dataset element. It can be seen as an alternative approach to rate distortion theory where a bound on the allowed average error is specified. In order to find the entropy, which gives a statistical length of source code compatible with a fixed distortion bound, a corresponding optimization problem has to be solved. First, we show how to simplify this general optimization by reducing the number of coding partitions, which are irrelevant for the entropy calculation. In our main result, we present a fast and feasible for implementation greedy algorithm, which allows one to approximate the entropy within an additive error term of log2 e. The proof is based on the minimum entropy set cover problem, for which a similar bound was obtained.

  12. Capacity Approximations for a Deterministic MIMO Channel

    Directory of Open Access Journals (Sweden)

    MOSKOWITZ, I. S.

    2011-08-01

    Full Text Available In this paper, we derive closed form approximations for the capacity of a point-to-point, deterministic Gaussian MIMO communication channel. We focus on the behavior of the inverse eigenvalues of the Gram matrix associated with the gain matrix of the MIMO channel, by considering small variance and large power assumptions. We revisit the concept of deterministic MIMO capacity by pointing out that, under transmitter power constraint, the optimal transmit covariance matrix is not necessarily diagonal. We discuss the water filling algorithm for obtaining the optimal eigenvalues of the transmitter covariance matrix, and the water fill level in conjunction with the Karush-Kuhn-Tucker optimality conditions. We revise the Telatar conjecture for the capacity of a non-ergodic channel. We also provide deterministic examples and numerical simulations of the capacity, which are discussed in terms of our mathematical framework.

  13. Approximate analytical modeling of leptospirosis infection

    Science.gov (United States)

    Ismail, Nur Atikah; Azmi, Amirah; Yusof, Fauzi Mohamed; Ismail, Ahmad Izani

    2017-11-01

    Leptospirosis is an infectious disease carried by rodents which can cause death in humans. The disease spreads directly through contact with feces, urine or through bites of infected rodents and indirectly via water contaminated with urine and droppings from them. Significant increase in the number of leptospirosis cases in Malaysia caused by the recent severe floods were recorded during heavy rainfall season. Therefore, to understand the dynamics of leptospirosis infection, a mathematical model based on fractional differential equations have been developed and analyzed. In this paper an approximate analytical method, the multi-step Laplace Adomian decomposition method, has been used to conduct numerical simulations so as to gain insight on the spread of leptospirosis infection.

  14. Topology Reduction for Approximate Symbolic Analysis

    Directory of Open Access Journals (Sweden)

    Z. Kolka

    2011-04-01

    Full Text Available The paper deals with a procedure for approximate symbolic analysis of linear circuits based on simplifying the circuit model. The procedure consists of two main steps. First, network elements whose influence on the circuit function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The second step consists in modifying the voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model is ranked numerically. A fast method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one frequency point.

  15. PROX: Approximated Summarization of Data Provenance.

    Science.gov (United States)

    Ainy, Eleanor; Bourhis, Pierre; Davidson, Susan B; Deutch, Daniel; Milo, Tova

    2016-03-01

    Many modern applications involve collecting large amounts of data from multiple sources, and then aggregating and manipulating it in intricate ways. The complexity of such applications, combined with the size of the collected data, makes it difficult to understand the application logic and how information was derived. Data provenance has been proven helpful in this respect in different contexts; however, maintaining and presenting the full and exact provenance may be infeasible, due to its size and complex structure. For that reason, we introduce the notion of approximated summarized provenance, where we seek a compact representation of the provenance at the possible cost of information loss. Based on this notion, we have developed PROX, a system for the management, presentation and use of data provenance for complex applications. We propose to demonstrate PROX in the context of a movies rating crowd-sourcing system, letting participants view provenance summarization and use it to gain insights on the application and its underlying data.

  16. Cyanoacrylate adhesive technique in wound edge approximation.

    Science.gov (United States)

    Prahlow, J A; Lantz, P E

    1993-11-01

    Cyanoacrylate, the adhesive component of many commercially available strong-binding glues, has been used by the medical profession for various purposes, including tissue adhesion and repair, embolization, sclerotherapy, and hemostasis. Mortuary science professionals rely on cyanoacrylate's adhesive property to aid in body restoration techniques following embalming. Forensic applications include the use of cyanoacrylate fumes for latent fingerprint detection. An additional application for this sticky chemical is currently unrecognized by many within the forensic community. Specifically, cyanoacrylate's adhesive property makes possible the relatively simple, efficient, and rapid approximation of disrupted skin and tissue when warranted during a forensic autopsy. The final result is aesthetically pleasing and lends itself to subsequent photographic documentation especially when patterned injuries are encountered. We discuss the technique, benefits, and limitations of the cyanoacrylate adhesive method in this setting and present several cases wherein the technique has produced satisfying results.

  17. Approximation by max-product type operators

    CERN Document Server

    Bede, Barnabás; Gal, Sorin G

    2016-01-01

    This monograph presents a broad treatment of developments in an area of constructive approximation involving the so-called "max-product" type operators. The exposition highlights the max-product operators as those which allow one to obtain, in many cases, more valuable estimates than those obtained by classical approaches. The text considers a wide variety of operators which are studied for a number of interesting problems such as quantitative estimates, convergence, saturation results, localization, to name several. Additionally, the book discusses the perfect analogies between the probabilistic approaches of the classical Bernstein type operators and of the classical convolution operators (non-periodic and periodic cases), and the possibilistic approaches of the max-product variants of these operators. These approaches allow for two natural interpretations of the max-product Bernstein type operators and convolution type operators: firstly, as possibilistic expectations of some fuzzy variables, and secondly,...

  18. Configuring Airspace Sectors with Approximate Dynamic Programming

    Science.gov (United States)

    Bloem, Michael; Gupta, Pramod

    2010-01-01

    In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

  19. Planetary Ices and the Linear Mixing Approximation

    Science.gov (United States)

    Bethkenhagen, M.; Meyer, E. R.; Hamel, S.; Nettelmann, N.; French, M.; Scheibe, L.; Ticknor, C.; Collins, L. A.; Kress, J. D.; Fortney, J. J.; Redmer, R.

    2017-10-01

    The validity of the widely used linear mixing approximation (LMA) for the equations of state (EOSs) of planetary ices is investigated at pressure-temperature conditions typical for the interiors of Uranus and Neptune. The basis of this study is ab initio data ranging up to 1000 GPa and 20,000 K, calculated via density functional theory molecular dynamics simulations. In particular, we determine a new EOS for methane and EOS data for the 1:1 binary mixtures of methane, ammonia, and water, as well as their 2:1:4 ternary mixture. Additionally, the self-diffusion coefficients in the ternary mixture are calculated along three different Uranus interior profiles and compared to the values of the pure compounds. We find that deviations of the LMA from the results of the real mixture are generally small; for the thermal EOSs they amount to 4% or less. The diffusion coefficients in the mixture agree with those of the pure compounds within 20% or better. Finally, a new adiabatic model of Uranus with an inner layer of almost pure ices is developed. The model is consistent with the gravity field data and results in a rather cold interior ({T}{core}˜ 4000 K).

  20. Improved approximation of spatial light distribution.

    Directory of Open Access Journals (Sweden)

    David Kaljun

    Full Text Available The rapid worldwide evolution of LEDs as light sources has brought new challenges, which means that new methods are needed and new algorithms have to be developed. Since the majority of LED luminaries are of the multi-source type, established methods for the design of light engines cannot be used in the design of LED light engines. This is because in the latter case what is involved is not just the design of a good reflector or projector lens, but the design of several lenses which have to work together in order to achieve satisfactory results. Since lenses can also be bought off the shelf from several manufacturers, it should be possible to combine together different off the shelf lenses in order to design a good light engine. However, with so many different lenses to choose from, it is almost impossible to find an optimal combination by hand, which means that some optimization algorithms need to be applied. In order for them to work properly, it is first necessary to describe the input data (i.e. spatial light distribution in a functional form using as few as possible parameters. In this paper the focus is on the approximation of the input data, and the implementation of the well-known mathematical procedure for the separation of linear and nonlinear parameters, which can provide a substantial increase in performance.

  1. Adaptive approximation of higher order posterior statistics

    KAUST Repository

    Lee, Wonjung

    2014-02-01

    Filtering is an approach for incorporating observed data into time-evolving systems. Instead of a family of Dirac delta masses that is widely used in Monte Carlo methods, we here use the Wiener chaos expansion for the parametrization of the conditioned probability distribution to solve the nonlinear filtering problem. The Wiener chaos expansion is not the best method for uncertainty propagation without observations. Nevertheless, the projection of the system variables in a fixed polynomial basis spanning the probability space might be a competitive representation in the presence of relatively frequent observations because the Wiener chaos approach not only leads to an accurate and efficient prediction for short time uncertainty quantification, but it also allows to apply several data assimilation methods that can be used to yield a better approximate filtering solution. The aim of the present paper is to investigate this hypothesis. We answer in the affirmative for the (stochastic) Lorenz-63 system based on numerical simulations in which the uncertainty quantification method and the data assimilation method are adaptively selected by whether the dynamics is driven by Brownian motion and the near-Gaussianity of the measure to be updated, respectively. © 2013 Elsevier Inc.

  2. Multilayer Perceptrons to Approximate Quaternion Valued Functions.

    Science.gov (United States)

    Xibilia, M G.; Muscato, G; Fortuna, L; Arena, P

    1997-03-01

    In this paper a new type of multilayer feedforward neural network is introduced. Such a structure, called hypercomplex multilayer perceptron (HMLP), is developed in quaternion algebra and allows quaternionic input and output signals to be dealt with, requiring a lower number of neurons than the real MLP, thus providing a reduced computational complexity. The structure introduced represents a generalization of the multilayer perceptron in the complex space (CMLP) reported in the literature. The fundamental result reported in the paper is a new density theorem which makes HMLPs universal interpolators of quaternion valued continuous functions. Moreover the proof of the density theorem can be restricted in order to formulate a density theorem in the complex space. Due to the identity between the quaternion and the four-dimensional real space, such a structure is also useful to approximate multidimensional real valued functions with a lower number of real parameters, decreasing the probability of being trapped in local minima during the learning phase. A numerical example is also reported in order to show the efficiency of the proposed structure. Copyright 1997 Elsevier Science Ltd. All Rights Reserved.

  3. Network histograms and universality of blockmodel approximation.

    Science.gov (United States)

    Olhede, Sofia C; Wolfe, Patrick J

    2014-10-14

    In this paper we introduce the network histogram, a statistical summary of network interactions to be used as a tool for exploratory data analysis. A network histogram is obtained by fitting a stochastic blockmodel to a single observation of a network dataset. Blocks of edges play the role of histogram bins and community sizes that of histogram bandwidths or bin sizes. Just as standard histograms allow for varying bandwidths, different blockmodel estimates can all be considered valid representations of an underlying probability model, subject to bandwidth constraints. Here we provide methods for automatic bandwidth selection, by which the network histogram approximates the generating mechanism that gives rise to exchangeable random graphs. This makes the blockmodel a universal network representation for unlabeled graphs. With this insight, we discuss the interpretation of network communities in light of the fact that many different community assignments can all give an equally valid representation of such a network. To demonstrate the fidelity-versus-interpretability tradeoff inherent in considering different numbers and sizes of communities, we analyze two publicly available networks--political weblogs and student friendships--and discuss how to interpret the network histogram when additional information related to node and edge labeling is present.

  4. Rainbows: Mie computations and the Airy approximation.

    Science.gov (United States)

    Wang, R T; van de Hulst, H C

    1991-01-01

    Efficient and accurate computation of the scattered intensity pattern by the Mie formulas is now feasible for size parameters up to x = 50,000 at least, which in visual light means spherical drops with diameters up to 6 mm. We present a method for evaluating the Mie coefficients from the ratios between Riccati-Bessel and Neumann functions of successive order. We probe the applicability of the Airy approximation, which we generalize to rainbows of arbitrary p (number of internal reflections = p - 1), by comparing the Mie and Airy intensity patterns. Millimeter size water drops show a match in all details, including the position and intensity of the supernumerary maxima and the polarization. A fairly good match is still seen for drops of 0.1 mm. A small spread in sizes helps to smooth out irrelevant detail. The dark band between the rainbows is used to test more subtle features. We conclude that this band contains not only externally reflected light (p = 0) but also a sizable contribution f rom the p = 6 and p = 7 rainbows, which shift rapidly with wavelength. The higher the refractive index, the closer both theories agree on the first primary rainbow (p = 2) peak for drop diameters as small as 0.02 mm. This may be useful in supporting experimental work.

  5. Improved Discrete Approximation of Laplacian of Gaussian

    Science.gov (United States)

    Shuler, Robert L., Jr.

    2004-01-01

    An improved method of computing a discrete approximation of the Laplacian of a Gaussian convolution of an image has been devised. The primary advantage of the method is that without substantially degrading the accuracy of the end result, it reduces the amount of information that must be processed and thus reduces the amount of circuitry needed to perform the Laplacian-of- Gaussian (LOG) operation. Some background information is necessary to place the method in context. The method is intended for application to the LOG part of a process of real-time digital filtering of digitized video data that represent brightnesses in pixels in a square array. The particular filtering process of interest is one that converts pixel brightnesses to binary form, thereby reducing the amount of information that must be performed in subsequent correlation processing (e.g., correlations between images in a stereoscopic pair for determining distances or correlations between successive frames of the same image for detecting motions). The Laplacian is often included in the filtering process because it emphasizes edges and textures, while the Gaussian is often included because it smooths out noise that might not be consistent between left and right images or between successive frames of the same image.

  6. Semiclassical approximations based on complex trajectories.

    Science.gov (United States)

    Ribeiro, A D; de Aguiar, M A M; Baranger, M

    2004-06-01

    The semiclassical limit of the coherent state propagator involves complex classical trajectories of the Hamiltonian H(u,v) = satisfying u(0) = z' and v(T) = z"*. In this work we study mostly the case z' = z". The propagator is then the return probability amplitude of a wave packet. We show that a plot of the exact return probability brings out the quantal images of the classical periodic orbits. Then we compare the exact return probability with its semiclassical approximation for a soft chaotic system with two degrees of freedom. We find two situations where classical trajectories satisfying the correct boundary conditions must be excluded from the semiclassical formula. The first occurs when the contribution of the trajectory to the propagator becomes exponentially large as Planck's over 2 pi goes to zero. The second occurs when the contributing trajectories undergo bifurcations. Close to the bifurcation the semiclassical formula diverges. More interestingly, in the example studied, after the bifurcation, where more than one trajectory satisfying the boundary conditions exist, only one of them in fact contributes to the semiclassical formula, a phenomenon closely related to Stokes lines. When the contributions of these trajectories are filtered out, the semiclassical results show excellent agreement with the exact calculations.

  7. Approximate Model for Turbulent Stagnation Point Flow.

    Energy Technology Data Exchange (ETDEWEB)

    Dechant, Lawrence [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2016-01-01

    Here we derive an approximate turbulent self-similar model for a class of favorable pressure gradient wedge-like flows, focusing on the stagnation point limit. While the self-similar model provides a useful gross flow field estimate this approach must be combined with a near wall model is to determine skin friction and by Reynolds analogy the heat transfer coefficient. The combined approach is developed in detail for the stagnation point flow problem where turbulent skin friction and Nusselt number results are obtained. Comparison to the classical Van Driest (1958) result suggests overall reasonable agreement. Though the model is only valid near the stagnation region of cylinders and spheres it nonetheless provides a reasonable model for overall cylinder and sphere heat transfer. The enhancement effect of free stream turbulence upon the laminar flow is used to derive a similar expression which is valid for turbulent flow. Examination of free stream enhanced laminar flow suggests that the rather than enhancement of a laminar flow behavior free stream disturbance results in early transition to turbulent stagnation point behavior. Excellent agreement is shown between enhanced laminar flow and turbulent flow behavior for high levels, e.g. 5% of free stream turbulence. Finally the blunt body turbulent stagnation results are shown to provide realistic heat transfer results for turbulent jet impingement problems.

  8. LANGUAGE CHANGES, APPROXIMATIVE VARIETIES AND TRANSLATION

    Directory of Open Access Journals (Sweden)

    Sabine Gorovitz

    2016-12-01

    Full Text Available From the media and communicative demands in a globalized context comes the need of using loan words for interaction and entertainment purposes. Using approximative varieties makes the languages to diachronically undergo changes in their syntactic organization as well as in their lexicon and semantic value, especially by producing neologisms incorporated to the language. Thus, sociolinguistics aims to understand how languages change, through recurring and cyclic processes of mutual influence which may occur diachronically and synchronously according to the speakers’ production. Indeed, the several incidences caused by constant language contact provoke new linguistic creations, which disseminate according to the needs, sometimes substituting previous terminologies and expressions. They result in direct influence whose echo is observed in ulterior grammatical processes, which are deployments of the modifications introduced before. The speakers determine which changes will be consolidated and, over the generations, they treat neologisms as belonging to the language in a lexical expansion phenomenon. Therefore, we analyze their importance for the translation and how they are directly affected, by establishing connections among the sociolinguistic studies developed by Calvet (2002, Faraco (2004, Labov (2008 and Bortoni-Ricardo (2014 about the pidgins, the creole languages and the possible linguistic changes that may occur within a communicative context of two or more languages in contact, we will do an analysis of its importance in the communication range and about which way they are directly affected.

  9. Consistent Yokoya-Chen Approximation to Beamstrahlung(LCC-0010)

    Energy Technology Data Exchange (ETDEWEB)

    Peskin, M

    2004-04-22

    I reconsider the Yokoya-Chen approximate evolution equation for beamstrahlung and modify it slightly to generate simple, consistent analytical approximations for the electron and photon energy spectra. I compare these approximations to previous ones, and to simulation data.I reconsider the Yokoya-Chen approximate evolution equation for beamstrahlung and modify it slightly to generate simple, consistent analytical approximations for the electron and photon energy spectra. I compare these approximations to previous ones, and to simulation data.

  10. Bond selective chemistry beyond the adiabatic approximation

    Energy Technology Data Exchange (ETDEWEB)

    Butler, L.J. [Univ. of Chicago, IL (United States)

    1993-12-01

    One of the most important challenges in chemistry is to develop predictive ability for the branching between energetically allowed chemical reaction pathways. Such predictive capability, coupled with a fundamental understanding of the important molecular interactions, is essential to the development and utilization of new fuels and the design of efficient combustion processes. Existing transition state and exact quantum theories successfully predict the branching between available product channels for systems in which each reaction coordinate can be adequately described by different paths along a single adiabatic potential energy surface. In particular, unimolecular dissociation following thermal, infrared multiphoton, or overtone excitation in the ground state yields a branching between energetically allowed product channels which can be successfully predicted by the application of statistical theories, i.e. the weakest bond breaks. (The predictions are particularly good for competing reactions in which when there is no saddle point along the reaction coordinates, as in simple bond fission reactions.) The predicted lack of bond selectivity results from the assumption of rapid internal vibrational energy redistribution and the implicit use of a single adiabatic Born-Oppenheimer potential energy surface for the reaction. However, the adiabatic approximation is not valid for the reaction of a wide variety of energetic materials and organic fuels; coupling between the electronic states of the reacting species play a a key role in determining the selectivity of the chemical reactions induced. The work described below investigated the central role played by coupling between electronic states in polyatomic molecules in determining the selective branching between energetically allowed fragmentation pathways in two key systems.

  11. Approximate String Matching with Compressed Indexes

    Directory of Open Access Journals (Sweden)

    Pedro Morales

    2009-09-01

    Full Text Available A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed indexes, there has not been much progress on functionalities beyond the basic exact search. In this paper we focus on indexed approximate string matching (ASM, which is of great interest, say, in bioinformatics. We study ASM algorithms for Lempel-Ziv compressed indexes and for compressed suffix trees/arrays. Most compressed self-indexes belong to one of these classes. We start by adapting the classical method of partitioning into exact search to self-indexes, and optimize it over a representative of either class of self-index. Then, we show that a Lempel- Ziv index can be seen as an extension of the classical q-samples index. We give new insights on this type of index, which can be of independent interest, and then apply them to a Lempel- Ziv index. Finally, we improve hierarchical verification, a successful technique for sequential searching, so as to extend the matches of pattern pieces to the left or right. Most compressed suffix trees/arrays support the required bidirectionality, thus enabling the implementation of the improved technique. In turn, the improved verification largely reduces the accesses to the text, which are expensive in self-indexes. We show experimentally that our algorithms are competitive and provide useful space-time tradeoffs compared to classical indexes.

  12. Coronal Loops: Evolving Beyond the Isothermal Approximation

    Science.gov (United States)

    Schmelz, J. T.; Cirtain, J. W.; Allen, J. D.

    2002-05-01

    Are coronal loops isothermal? A controversy over this question has arisen recently because different investigators using different techniques have obtained very different answers. Analysis of SOHO-EIT and TRACE data using narrowband filter ratios to obtain temperature maps has produced several key publications that suggest that coronal loops may be isothermal. We have constructed a multi-thermal distribution for several pixels along a relatively isolated coronal loop on the southwest limb of the solar disk using spectral line data from SOHO-CDS taken on 1998 Apr 20. These distributions are clearly inconsistent with isothermal plasma along either the line of sight or the length of the loop, and suggested rather that the temperature increases from the footpoints to the loop top. We speculated originally that these differences could be attributed to pixel size -- CDS pixels are larger, and more `contaminating' material would be expected along the line of sight. To test this idea, we used CDS iron line ratios from our data set to mimic the isothermal results from the narrowband filter instruments. These ratios indicated that the temperature gradient along the loop was flat, despite the fact that a more complete analysis of the same data showed this result to be false! The CDS pixel size was not the cause of the discrepancy; rather, the problem lies with the isothermal approximation used in EIT and TRACE analysis. These results should serve as a strong warning to anyone using this simplistic method to obtain temperature. This warning is echoed on the EIT web page: ``Danger! Enter at your own risk!'' In other words, values for temperature may be found, but they may have nothing to do with physical reality. Solar physics research at the University of Memphis is supported by NASA grant NAG5-9783. This research was funded in part by the NASA/TRACE MODA grant for Montana State University.

  13. Successive approximations for charged particle motion

    Science.gov (United States)

    Hoffstaetter

    2000-04-01

    Single-particle dynamics in electron microscopes, ion or electron lithographic instruments, particle accelerators, and particle spectrographs is described by weakly nonlinear ordinary differential equations. Therefore, the linear part of the equation of motion is usually solved and the nonlinear effects are then found in successive order by iteration methods. When synchrotron radiation is not important, the equation can be derived from a Hamiltonian or a Lagrangian. The Hamiltonian nature can lead to simplified computations of particle transport through an optical device when a suitable computational method is used. H. Rose and his school have contributed to these techniques by developing and intensively using the eikonal method [1-3]. Many ingenious microscopic and lithographic devices were found by Rose and his group due to the simple structure of this method [4-6]. The particle optical eikonal method is either derived by propagating the electron wave or by the principle of Maupertuis for time-independent fields. Maybe because of the time-dependent fields which are often required, in the area of accelerator physics the eikonal method has never become popular, although Lagrange methods had been used sometimes already in early days [7]. In this area classical Hamilitonian dynamics is usually used to compute nonlinear particle motion. Here the author will therefore derive the eikonal method from a Hamiltonian quite familiar to the accelerator physics community and reformulate it in a simplifying way. With the event of high-energy polarized electron beams [8] and plans for high-energy proton beams [9], nonlinear effects in spin motion have become important in high-energy accelerators. The author introduces a successive approximation for the nonlinear effects in the coupled spin and orbit motion of charged particles which resembles some of the simplifications resulting from the eikonal method for the pure orbit motion.

  14. Dynamical cluster approximation plus semiclassical approximation study for a Mott insulator and d-wave pairing

    Science.gov (United States)

    Kim, SungKun; Lee, Hunpyo

    2017-06-01

    Via a dynamical cluster approximation with N c = 4 in combination with a semiclassical approximation (DCA+SCA), we study the doped two-dimensional Hubbard model. We obtain a plaquette antiferromagnetic (AF) Mott insulator, a plaquette AF ordered metal, a pseudogap (or d-wave superconductor) and a paramagnetic metal by tuning the doping concentration. These features are similar to the behaviors observed in copper-oxide superconductors and are in qualitative agreement with the results calculated by the cluster dynamical mean field theory with the continuous-time quantum Monte Carlo (CDMFT+CTQMC) approach. The results of our DCA+SCA differ from those of the CDMFT+CTQMC approach in that the d-wave superconducting order parameters are shown even in the high doped region, unlike the results of the CDMFT+CTQMC approach. We think that the strong plaquette AF orderings in the dynamical cluster approximation (DCA) with N c = 4 suppress superconducting states with increasing doping up to strongly doped region, because frozen dynamical fluctuations in a semiclassical approximation (SCA) approach are unable to destroy those orderings. Our calculation with short-range spatial fluctuations is initial research, because the SCA can manage long-range spatial fluctuations in feasible computational times beyond the CDMFT+CTQMC tool. We believe that our future DCA+SCA calculations should supply information on the fully momentum-resolved physical properties, which could be compared with the results measured by angle-resolved photoemission spectroscopy experiments.

  15. Approximal morphology as predictor of approximal caries in primary molar teeth

    DEFF Research Database (Denmark)

    Cortes, A; Martignon, S; Qvist, V

    2017-01-01

    OBJECTIVE: To evaluate the predictive power of the morphology of the distal surface on 1st and mesial surface on 2nd primary molar teeth on caries development in young children. SAMPLE AND METHODS: Out of 101 3-to 4-year-old children from an on-going study, 62 children, for whom parents' informed...... caries. CLINICAL RELEVANCE: The concave morphology of approximal surfaces can predict future caries lesions supporting specific home-care and in-office preventive strategies....

  16. Approximal morphology as predictor of approximal caries in primary molar teeth.

    Science.gov (United States)

    Cortes, A; Martignon, S; Qvist, V; Ekstrand, Kim Rud

    2018-03-01

    To evaluate the predictive power of the morphology of the distal surface on 1st and mesial surface on 2nd primary molar teeth on caries development in young children. Out of 101 3-to 4-year-old children from an on-going study, 62 children, for whom parents' informed consent was given, participated. Upper and lower molar teeth of one randomly selected side received a 2-day temporarily separation. Bitewing radiographs and silicone impressions of interproximal area (IPA) were obtained. One-year procedures were repeated in 52 children (84%). The morphology of the distal surfaces of the first molar teeth and the mesial surfaces on the second molar teeth (n=208) was scored from the occlusal aspect on images from the baseline resin models resulting in four IPA variants: concave-concave; concave-convex; convex-concave, and convex-convex. Approximal caries on the surface in question was radiographically assessed as absent/present. Of the 52 children examined at follow-up, 31 children (60%) had 1-4 concave surfaces. In total 53 (25%) of the 208 surfaces were concave. A total of 22 children (43%) had 1-4 approximal lesions adding up to 59 lesions. Multiple logistic regression analyses disclosed that gender, surface morphology on one of the approximal surfaces (focus-surface), and adjacent-surface morphology were significantly related to caries development (p values ≤ 0.03). The odds ratio for developing caries in the focus-surface/adjacent-surface in the four IPA variants were convex-convex, 1.0; convex-concave, 5.5 (CI 2.0-14.7); concave-convex, 12.9 (CI 4.1-40.3); and concave-concave, 15.7 (CI 5.1-48.3). Morphology of approximal surfaces in primary molar teeth, in particular both surfaces being concave, significantly influences the risk of developing caries. The concave morphology of approximal surfaces can predict future caries lesions supporting specific home-care and in-office preventive strategies.

  17. Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities

    KAUST Repository

    Cheon, Sooyoung

    2013-02-16

    Importance sampling and Markov chain Monte Carlo methods have been used in exact inference for contingency tables for a long time, however, their performances are not always very satisfactory. In this paper, we propose a stochastic approximation Monte Carlo importance sampling (SAMCIS) method for tackling this problem. SAMCIS is a combination of adaptive Markov chain Monte Carlo and importance sampling, which employs the stochastic approximation Monte Carlo algorithm (Liang et al., J. Am. Stat. Assoc., 102(477):305-320, 2007) to draw samples from an enlarged reference set with a known Markov basis. Compared to the existing importance sampling and Markov chain Monte Carlo methods, SAMCIS has a few advantages, such as fast convergence, ergodicity, and the ability to achieve a desired proportion of valid tables. The numerical results indicate that SAMCIS can outperform the existing importance sampling and Markov chain Monte Carlo methods: It can produce much more accurate estimates in much shorter CPU time than the existing methods, especially for the tables with high degrees of freedom. © 2013 Springer Science+Business Media New York.

  18. Restricted second random phase approximations and Tamm-Dancoff approximations for electronic excitation energy calculations

    Energy Technology Data Exchange (ETDEWEB)

    Peng, Degao; Yang, Yang; Zhang, Peng [Department of Chemistry, Duke University, Durham, North Carolina 27708 (United States); Yang, Weitao, E-mail: weitao.yang@duke.edu [Department of Chemistry and Department of Physics, Duke University, Durham, North Carolina 27708 (United States)

    2014-12-07

    In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N{sup 4}). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as 〈S{sup ^2}〉 are also developed and tested.

  19. Restricted second random phase approximations and Tamm-Dancoff approximations for electronic excitation energy calculations

    Science.gov (United States)

    Peng, Degao; Yang, Yang; Zhang, Peng; Yang, Weitao

    2014-12-01

    In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N4). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as < hat{S}2rangle are also developed and tested.

  20. Asymptotic approximations for non-integer order derivatives of monomials

    Science.gov (United States)

    Aşiru, Muniru A.

    2015-02-01

    In this note, we develop new, simple and very accurate asymptotic approximations for non-integer order derivatives of monomial functions by using the more accurate asymptotic approximations for large factorials that have recently appeared in the literature.

  1. The strengths and weaknesses of L2 approximable regressors

    OpenAIRE

    Mynbaev, Kairat

    2001-01-01

    The most part of the paper is about modeling (or approximating) nonstochastic regressors. Examples of regressors which are (not) L2-approximable are given. Applications to central limit theory and OLS estimator asymptotics are provided.

  2. Approximate viability for nonlinear evolution inclusions with application to controllability

    Directory of Open Access Journals (Sweden)

    Omar Benniche

    2016-12-01

    Full Text Available We investigate approximate viability for a graph with respect to fully nonlinear quasi-autonomous evolution inclusions. As application, an approximate null controllability result is given.

  3. Pawlak algebra and approximate structure on fuzzy lattice.

    Science.gov (United States)

    Zhuang, Ying; Liu, Wenqi; Wu, Chin-Chia; Li, Jinhai

    2014-01-01

    The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties.

  4. Approximate Noether gauge symmetries of the Bardeen model

    Energy Technology Data Exchange (ETDEWEB)

    Camci, U. [Akdeniz University, Department of Physics, Faculty of Science, Antalya (Turkey)

    2014-12-01

    We investigate the approximate Noether gauge symmetries of the geodesic Lagrangian for the Bardeen spacetime model. This is accommodated by a set of new approximate Noether gauge symmetry relations for the perturbed geodesic Lagrangian in the spacetime. A detailed analysis of the spacetime of the Bardeen model up to third-order approximate Noether gauge symmetries is presented. (orig.)

  5. Meta-Regression Approximations to Reduce Publication Selection Bias

    Science.gov (United States)

    Stanley, T. D.; Doucouliagos, Hristos

    2014-01-01

    Publication selection bias is a serious challenge to the integrity of all empirical sciences. We derive meta-regression approximations to reduce this bias. Our approach employs Taylor polynomial approximations to the conditional mean of a truncated distribution. A quadratic approximation without a linear term, precision-effect estimate with…

  6. On multiple-delay approximations of multiple-derivative controllers

    NARCIS (Netherlands)

    Wan, Yan; Roy, Sandip; Stoorvogel, Antonie Arij; Saberi, Ali

    We study approximation of multiple-derivative output feedback for linear time-invariant (LTI) plants using multiple-delay approximations. We obtain a condition on the plant and feedback that yields an equivalence between the closed-loop spectra for the approximate feedbacks and the desired

  7. New Approach to Fractal Approximation of Vector-Functions

    OpenAIRE

    Konstantin Igudesman; Marsel Davletbaev; Gleb Shabernev

    2014-01-01

    This paper introduces new approach to approximation of continuous vector-functions and vector sequences by fractal interpolation vector-functions which are multidimensional generalization of fractal interpolation functions. Best values of fractal interpolation vector-functions parameters are found. We give schemes of approximation of some sets of data and consider examples of approximation of smooth curves with different conditions.

  8. Circular arc approximation by quartic H-Bézier curve

    Directory of Open Access Journals (Sweden)

    Maria Hussain

    2017-06-01

    Full Text Available The quartic H-Bézier curve is used for the approximation of circular arcs. It has five control points and one positive real free parameter. The four control points are carried out by G^1-approximation constraints and the remaining control point is dividing the line segment joining the second and fourth control points in the ratio 1:2. Optimized value of free parameter α is obtained by minimizing the maximum value of absolute radius error of the recommended approximation scheme. The developed approximation scheme is found considerably better than the existing approximation schemes for these computed values of control points and optimized value of the free parameter.

  9. Methods of Approximation Theory in Complex Analysis and Mathematical Physics

    CERN Document Server

    Saff, Edward

    1993-01-01

    The book incorporates research papers and surveys written by participants ofan International Scientific Programme on Approximation Theory jointly supervised by Institute for Constructive Mathematics of University of South Florida at Tampa, USA and the Euler International Mathematical Instituteat St. Petersburg, Russia. The aim of the Programme was to present new developments in Constructive Approximation Theory. The topics of the papers are: asymptotic behaviour of orthogonal polynomials, rational approximation of classical functions, quadrature formulas, theory of n-widths, nonlinear approximation in Hardy algebras,numerical results on best polynomial approximations, wavelet analysis. FROM THE CONTENTS: E.A. Rakhmanov: Strong asymptotics for orthogonal polynomials associated with exponential weights on R.- A.L. Levin, E.B. Saff: Exact Convergence Rates for Best Lp Rational Approximation to the Signum Function and for Optimal Quadrature in Hp.- H. Stahl: Uniform Rational Approximation of x .- M. Rahman, S.K. ...

  10. Information-Theoretic Bounds and Approximations in Neural Population Coding.

    Science.gov (United States)

    Huang, Wentao; Zhang, Kechen

    2018-01-17

    While Shannon's mutual information has widespread applications in many disciplines, for practical applications it is often difficult to calculate its value accurately for high-dimensional variables because of the curse of dimensionality. This article focuses on effective approximation methods for evaluating mutual information in the context of neural population coding. For large but finite neural populations, we derive several information-theoretic asymptotic bounds and approximation formulas that remain valid in high-dimensional spaces. We prove that optimizing the population density distribution based on these approximation formulas is a convex optimization problem that allows efficient numerical solutions. Numerical simulation results confirmed that our asymptotic formulas were highly accurate for approximating mutual information for large neural populations. In special cases, the approximation formulas are exactly equal to the true mutual information. We also discuss techniques of variable transformation and dimensionality reduction to facilitate computation of the approximations.

  11. Approximate solutions for certain bidomain problems in electrocardiography

    Science.gov (United States)

    Johnston, Peter R.

    2008-10-01

    The simulation of problems in electrocardiography using the bidomain model for cardiac tissue often creates issues with satisfaction of the boundary conditions required to obtain a solution. Recent studies have proposed approximate methods for solving such problems by satisfying the boundary conditions only approximately. This paper presents an analysis of their approximations using a similar method, but one which ensures that the boundary conditions are satisfied during the whole solution process. Also considered are additional functional forms, used in the approximate solutions, which are more appropriate to specific boundary conditions. The analysis shows that the approximations introduced by Patel and Roth [Phys. Rev. E 72, 051931 (2005)] generally give accurate results. However, there are certain situations where functional forms based on the geometry of the problem under consideration can give improved approximations. It is also demonstrated that the recent methods are equivalent to different approaches to solving the same problems introduced 20years earlier.

  12. Approximate Controllability of Abstract Discrete-Time Systems

    Directory of Open Access Journals (Sweden)

    Cuevas Claudio

    2010-01-01

    Full Text Available Approximate controllability for semilinear abstract discrete-time systems is considered. Specifically, we consider the semilinear discrete-time system , , where are bounded linear operators acting on a Hilbert space , are -valued bounded linear operators defined on a Hilbert space , and is a nonlinear function. Assuming appropriate conditions, we will show that the approximate controllability of the associated linear system implies the approximate controllability of the semilinear system.

  13. Upper bounds on minimum cardinality of exact and approximate reducts

    KAUST Repository

    Chikalov, Igor

    2010-01-01

    In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.

  14. Algebraic Approximation A Guide to Past and Current Solutions

    CERN Document Server

    Bustamante, Jorge

    2012-01-01

    This book contains an exposition of several results related with direct and converse theorems in the theory of approximation by algebraic polynomials in a finite interval. In addition, some facts concerning trigonometric approximation that are necessary for motivation and comparisons are included. The selection of papers that are referenced and discussed document some trends in polynomial approximation from the 1950s to the present day.

  15. Learning graphical model parameters with approximate marginal inference.

    Science.gov (United States)

    Domke, Justin

    2013-10-01

    Likelihood-based learning of graphical models faces challenges of computational complexity and robustness to model misspecification. This paper studies methods that fit parameters directly to maximize a measure of the accuracy of predicted marginals, taking into account both model and inference approximations at training time. Experiments on imaging problems suggest marginalization-based learning performs better than likelihood-based approximations on difficult problems where the model being fit is approximate in nature.

  16. Approximation for a large-angle simple pendulum period

    Energy Technology Data Exchange (ETDEWEB)

    Belendez, A; Rodes, J J; Belendez, T; Hernandez, A [Departamento de Fisica, IngenierIa de Sistemas y TeorIa de la Senal, Universidad de Alicante, Apartado 99, E-03080 Alicante (Spain)], E-mail: a.belendez@ua.es

    2009-03-15

    An approximation scheme to obtain the period for large amplitude oscillations of a simple pendulum is analysed and discussed. The analytical approximate formula for the period is the same as that suggested by Hite (2005 Phys. Teach. 43 290), but it is now obtained analytically by means of a term-by-term comparison of the power-series expansion for the approximate period with the corresponding series for the exact period. (letters and comments)

  17. Approximations of continuous Newton's method: An extension of Cayley's problem

    Directory of Open Access Journals (Sweden)

    Jon Jacobsen

    2007-02-01

    Full Text Available Continuous Newton's Method refers to a certain dynamical system whose associated flow generically tends to the roots of a given polynomial. An Euler approximation of this system, with step size $h=1$, yields the discrete Newton's method algorithm for finding roots. In this note we contrast Euler approximations with several different approximations of the continuous ODE system and, using computer experiments, consider their impact on the associated fractal basin boundaries of the roots.

  18. Perturbative corrections for approximate inference in gaussian latent variable models

    DEFF Research Database (Denmark)

    Opper, Manfred; Paquet, Ulrich; Winther, Ole

    2013-01-01

    orders, corrections of increasing polynomial complexity can be applied to the approximation. The second order provides a correction in quadratic time, which we apply to an array of Gaussian process and Ising models. The corrections generalize to arbitrarily complex approximating families, which we...... illustrate on tree-structured Ising model approximations. Furthermore, they provide a polynomial-time assessment of the approximation error. We also provide both theoretical and practical insights on the exactness of the EP solution. © 2013 Manfred Opper, Ulrich Paquet and Ole Winther....

  19. Dynamic obstacle avoidance using Bayesian Occupancy Filter and approximate inference

    National Research Council Canada - National Science Library

    Llamazares, Angel; Ivan, Vladimir; Molinos, Eduardo; Ocaña, Manuel; Vijayakumar, Sethu

    2013-01-01

    .... While several obstacle avoidance systems have been presented in the literature addressing safety and optimality of the robot motion separately, we have applied the approximate inference framework...

  20. Orthogonal polynomial approximation in higher dimensions: Applications in astrodynamics

    Science.gov (United States)

    Bani Younes, Ahmad Hani Abd Alqader

    We propose novel methods to utilize orthogonal polynomial approximation in higher dimension spaces, which enable us to modify classical differential equation solvers to perform high precision, long-term orbit propagation. These methods have immediate application to efficient propagation of catalogs of Resident Space Objects (RSOs) and improved accounting for the uncertainty in the ephemeris of these objects. More fundamentally, the methodology promises to be of broad utility in solving initial and two point boundary value problems from a wide class of mathematical representations of problems arising in engineering, optimal control, physical sciences and applied mathematics. We unify and extend classical results from function approximation theory and consider their utility in astrodynamics. Least square approximation, using the classical Chebyshev polynomials as basis functions, is reviewed for discrete samples of the to-be-approximated function. We extend the orthogonal approximation ideas to n-dimensions in a novel way, through the use of array algebra and Kronecker operations. Approximation of test functions illustrates the resulting algorithms and provides insight into the errors of approximation, as well as the associated errors arising when the approximations are differentiated or integrated. Two sets of applications are considered that are challenges in astrodynamics. The first application addresses local approximation of high degree and order geopotential models, replacing the global spherical harmonic series by a family of locally precise orthogonal polynomial approximations for efficient computation. A method is introduced which adapts the approximation degree radially, compatible with the truth that the highest degree approximations (to ensure maximum acceleration error < 10-9 ms-2, globally) are required near the Earths surface, whereas lower degree approximations are required as radius increases. We show that a four order of magnitude speedup is

  1. Approximation of quadrilaterals by rational quadrilaterals in the plane

    Indian Academy of Sciences (India)

    Keywords. Rational triangles and quadrilaterals; rational approximability of polygons; rational points on quartic curves; elliptic curves; torsion points; rational points on varieties and their density.

  2. New Approach to Fractal Approximation of Vector-Functions

    National Research Council Canada - National Science Library

    Igudesman, Konstantin; Davletbaev, Marsel; Shabernev, Gleb

    2015-01-01

      This paper introduces new approach to approximation of continuous vector-functions and vector sequences by fractal interpolation vector-functions which are multidimensional generalization of fractal...

  3. Merging Belief Propagation and the Mean Field Approximation

    DEFF Research Database (Denmark)

    Riegler, Erwin; Kirkelund, Gunvor Elisabeth; Manchón, Carles Navarro

    2010-01-01

    We present a joint message passing approach that combines belief propagation and the mean field approximation. Our analysis is based on the region-based free energy approximation method proposed by Yedidia et al., which allows to use the same objective function (Kullback-Leibler divergence) as a ...

  4. Practical error analysis of the quasi-steady-state approximation ...

    African Journals Online (AJOL)

    The Quasi-Steady-State Approximation (QSSA) is a method of getting approximate solutions to differential equations, developed heuristically in biochemistry early this century. It can produce acceptable and important results even when formal analytic and numerical procedures fail. It has become associated with singular ...

  5. Efficient algorithms for approximate time separation of events

    Indian Academy of Sciences (India)

    Asynchronous systems; timing analysis and verification; approximate algorithms; convex approximation; time separation of events; bounded delay timing analysis. ... A complete asynchronous chip has been modelled and analysed using the proposed technique, revealing potential timing problems (already known to ...

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

    NARCIS (Netherlands)

    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

  7. Finite approximate controllability for semilinear heat equations in noncylindrical domains

    Directory of Open Access Journals (Sweden)

    Menezes Silvano B. de

    2004-01-01

    Full Text Available We investigate finite approximate controllability for semilinear heat equation in noncylindrical domains. First we study the linearized problem and then by an application of the fixed point result of Leray-Schauder we obtain the finite approximate controllability for the semilinear state equation.

  8. Dynamic and approximate pattern matching in 2D

    DEFF Research Database (Denmark)

    Clifford, Raphaël; Fontaine, Allyx; Starikovskaya, Tatiana

    2016-01-01

    distance. - Extending this work to allow approximation, we give an efficient algorithm which returns a (1+ε) approximation of the Hamming distance at a given location in O(ε−2 log2 m log log n) time. Finally, we consider a different setting inspired by previous work on locality sensitive hashing (LSH...

  9. Approximation of functions of two variables by certain linear positive ...

    Indian Academy of Sciences (India)

    We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using modulus of continuity. Moreover we define an th order generalization of these operators ...

  10. A-Statistical extension of the Korovkin type approximation theorem

    Indian Academy of Sciences (India)

    type approximation theory is a well-established area of research, which deals with the problem of approximating a function f by means of a sequence {Lnf } of positive lin- ear operators. Statistical convergence, which was introduced nearly fifty years ago, has only recently become an area of active research. Especially it has ...

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

    Indian Academy of Sciences (India)

    2016-07-29

    Jul 29, 2016 ... 34 Page 2 of 8. Pramana – J. Phys. (2016) 87: 34. 2. The method. We have employed Hermite-distributed approximating functionals (HDAF) to approximate the Hamiltonian in coordinate representation. The HDAF space discretiza- tion of the kinetic energy operator on a regular grid consists of. −. ¯h2. 2m.

  12. Space-efficient path-reporting approximate distance oracles

    DEFF Research Database (Denmark)

    Elkin, Michael; Neiman, Ofer; Wulff-Nilsen, Christian

    2016-01-01

    We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirements, for general undirected graphs. For distance oracles, we show how to break the nlog⁡n space bound of Thorup and Zwick if approximate paths rather than distances need...

  13. Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

    Science.gov (United States)

    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…

  14. Approximate first integrals of a chaotic Hamiltonian system | Unal ...

    African Journals Online (AJOL)

    Approximate first integrals (conserved quantities) of a Hamiltonian dynamical system with two-degrees of freedom which arises in the modeling of galaxy have been obtained based on the approximate Noether symmetries for the resonance ω1 = ω2. Furthermore, Kolmogorov-Arnold-Moser (KAM) curves have been ...

  15. Fifth International Conference on "Approximation and Optimization in the Caribbean"

    CERN Document Server

    Approximation, Optimization and Mathematical Economic

    2001-01-01

    The articles in this proceedings volume reflect the current trends in the theory of approximation, optimization and mathematical economics, and include numerous applications. The book will be of interest to researchers and graduate students involved in functional analysis, approximation theory, mathematical programming and optimization, game theory, mathematical finance and economics.

  16. Approximation of the inverse G-frame operator

    Indian Academy of Sciences (India)

    In this paper, we introduce the concept of (strong) projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we ...

  17. Approximations in fusion and breakup reactions induced by radioactive beams

    Energy Technology Data Exchange (ETDEWEB)

    Cardenas, W.H.Z.; Carlin Filho, N.; Hussein, M.S. [Sao Paulo Univ., SP (Brazil). Inst. de Fisica; Canto, L.F.; Donangelo, R. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Inst. de Fisica; Lubian, J. [Universidade Federal Fluminense, Niteroi, RJ (Brazil). Inst. de Fisica; Centro de Aplicaciones Tecnologicas y Desarrollo Nuclear (CEADEN), Havana (Cuba); Romanelli, A. [Facultad de Ingenieria, Montevideo (Uruguay). Inst. de Fisica

    2000-07-01

    Some commonly used approximations for complete fusion and breakup transmission coefficients in collisions of weakly bound projectiles at near barrier energies are assessed. We show that they strongly depend on the adopted classical trajectory and can be significantly improved with proper treatment of the incident and emergent currents in the WKB approximation. (author)

  18. An approximation algorithm for the wireless gathering problem

    NARCIS (Netherlands)

    Bonifaci, V.; Korteweg, P.; Marchetti Spaccamela, A.; Stougie, L.

    2008-01-01

    The Wireless Gathering Problem is to find an interference-free schedule for data gathering in a wireless network in minimum time. We present a 4-approximate polynomial-time on-line algorithm for this NP-hard problem. We show that no shortest path following algorithm can have an approximation ratio

  19. Single kick approximations for beam-beam deflections

    Directory of Open Access Journals (Sweden)

    Takahiko Koyama

    1999-02-01

    Full Text Available A six-dimensional symplectic beam-beam interaction map using finite discrete slices of a strong beam is extended to infinitesimal slices. The new map is calculated under the assumption of a longitudinal Gaussian distribution with approximations. A round Gaussian beam is simulated to demonstrate accuracies of the approximations.

  20. Perturbation approximation for orbits in axially symmetric funnels

    Science.gov (United States)

    Nauenberg, Michael

    2014-11-01

    A perturbation method that can be traced back to Isaac Newton is applied to obtain approximate analytic solutions for objects sliding in axially symmetric funnels in near circular orbits. Some experimental observations are presented for balls rolling in inverted cones with different opening angles, and in a funnel with a hyperbolic surface that approximately simulates the gravitational force.

  1. An Approximation Algorithm for the Capacitated Arc Routing Problem

    DEFF Research Database (Denmark)

    Wøhlk, Sanne

    2008-01-01

    In this paper we consider approximation of the Capacitated Arc Routing Problem, which is the problem of servicing a set of edges in a graph using a fleet of capacity constrained vehicles. We present a 7/2 - 3/W-approximation algorithm for the problem and prove that this algorithm outperforms...

  2. A linear approach to shape preserving spline approximation

    NARCIS (Netherlands)

    Kuijt, F.; van Damme, Rudolf M.J.

    2001-01-01

    This paper deals with the approximation of a given large scattered univariate or bivariate data set that possesses certain shape properties, such as convexity, monotonicity, and/or range restrictions. The data are approximated for instance by tensor-product B-splines preserving the shape

  3. Saddlepoint Approximations for Expectations and an Application to CDO Pricing

    NARCIS (Netherlands)

    Huang, X.; Oosterlee, C.W.

    2011-01-01

    We derive two types of saddlepoint approximations for expectations in the form of E[(X - K)+], where X is the sum of n independent random variables and K is a known constant. We establish error convergence rates for both types of approximations in the independently and identically distributed case.

  4. Approximate solutions of the Wei Hua oscillator using the Pekeris ...

    Indian Academy of Sciences (India)

    to the orbital centrifugal term. Solutions of the corresponding hyper-radial equation are obtained using the conventional Nikiforov–Uvarov (NU) method. Keywords. Nikiforov–Uvarov (NU) method; N-dimensional Schrödinger equation; approximate solution through Pekeris approximation. PACS No. 03.65.Ge. 1. Introduction.

  5. The second Born approximation of electron–argon elastic scattering ...

    Indian Academy of Sciences (India)

    We evaluate the S-matrix elements numerically. The dependence of differential cross-section on the relative phase between the two laser components is presented. The results obtained in the first and second Born approximations are compared and analysed. Keywords. Second Born approximation; free–free transition; ...

  6. The second Born approximation of electron–argon elastic scattering ...

    Indian Academy of Sciences (India)

    We study the elastic scattering of atomic argon by electron in the presence of a bichromatic laser field in the second Born approximation. The target atom is approximated by a simple screening potential and the continuum states of the impinging and emitting electrons are described as Volkov states. We evaluate the S-matrix ...

  7. Local Approximation Schemes for Ad Hoc and Sensor Networks

    NARCIS (Netherlands)

    Kuhn, F.; Moscibroda, T.; Nieberg, T.; Wattenhofer, R.; Banerjee, S; Ganguly, S.

    2005-01-01

    We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation to the problems at hand for any given ε > 0. The

  8. Delta-function Approximation SSC Model in 3C 273

    Indian Academy of Sciences (India)

    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 synchrotron and ...

  9. APPECT: An Approximate Backbone-Based Clustering Algorithm for Tags

    DEFF Research Database (Denmark)

    Zong, Yu; Xu, Guandong; Jin, Pin

    2011-01-01

    Agglomerative Clustering on tagging data, which possess the inherent drawbacks, such as the sensitivity of initialization. In this paper, we instead make use of the approximate backbone of tag clustering results to find out better tag clusters. In particular, we propose an APProximate backbonE-based Clustering...

  10. Breakdown of Modulational Approximations in Nonlinear Wave Interaction

    CERN Document Server

    Gerhardt, L; Barbedo-Rizzato, F; Lopes, S R

    1999-01-01

    In this work we investigate the validity limits of the modulational approximation as a method to describe the nonlinear interaction of conservative wave fields. We focus on a nonlinear Klein-Gordon equation and suggest that the breakdown of the approximation is accompanied by a transition to regimes of spatiotemporal chaos.

  11. Performance approximation of pick-to-belt orderpicking systems

    NARCIS (Netherlands)

    M.B.M. de Koster (René)

    1994-01-01

    textabstractIn this paper, an approximation method is discussed for the analysis of pick-to-belt orderpicking systems. The aim of the approximation method is to provide an instrument for obtaining rapid insight in the performance of designs of pick-to-belt orderpicking systems. It can be used to

  12. The log-linear return approximation, bubbles, and predictability

    DEFF Research Database (Denmark)

    Engsted, Tom; Pedersen, Thomas Quistgaard; Tanggaard, Carsten

    We study in detail the log-linear return approximation introduced by Campbell and Shiller (1988a). First, we derive an upper bound for the mean approximation error, given stationarity of the log dividendprice ratio. Next, we simulate various rational bubbles which have explosive conditional...... expectation, and we investigate the magnitude of the approximation error in those cases. We find that surprisingly the Campbell-Shiller approximation is very accurate even in the presence of large explosive bubbles. Only in very large samples do we find evidence that bubbles generate large approximation...... errors. Finally,we show that a bubble model in which expected returns are constant can explain the predictability of stock returns from the dividend-price ratio that many previous studies have documented....

  13. The Log-Linear Return Approximation, Bubbles, and Predictability

    DEFF Research Database (Denmark)

    Engsted, Tom; Pedersen, Thomas Quistgaard; Tanggaard, Carsten

    2012-01-01

    We study in detail the log-linear return approximation introduced by Campbell and Shiller (1988a). First, we derive an upper bound for the mean approximation error, given stationarity of the log dividend-price ratio. Next, we simulate various rational bubbles which have explosive conditional...... expectation, and we investigate the magnitude of the approximation error in those cases. We …nd that surprisingly the Campbell-Shiller approximation is very accurate even in the presence of large explosive bubbles. Only in very large samples do we …nd evidence that bubbles generate large approximation errors....... Finally, we show that a bubble model in which expected returns are constant can explain the predictability of stock returns from the dividend-price ratio that many previous studies have documented....

  14. Plasma fluid modeling of microwave streamers: Approximations and accuracy

    Science.gov (United States)

    Arcese, Emanuele; Rogier, François; Boeuf, Jean-Pierre

    2017-11-01

    Fluid models of microwave streamers at 110 GHz in atmospheric pressure air predict the formation of filamentary plasma patterns that show a good qualitative agreement with experiments. In order to perform more quantitative comparisons with experiments, in this paper, we study the consequences of different types of approximations that are generally used in the fluid models. We consider here the streamer dynamics before gas heating effects become important, i.e., the first few tens of ns after breakdown at atmospheric pressure. The influence on the results of the local effective field approximation vs. the local mean energy approximation is analyzed in detail. Other approximations that are related to the choice and method of calculation of electron transport parameters are also discussed. It is shown that the local effective field approximation is rather good for a large range of conditions of high frequency breakdown at atmospheric pressure in air while the results may be very sensitive to the choice of transport coefficients.

  15. Approximate number word knowledge before the cardinal principle.

    Science.gov (United States)

    Gunderson, Elizabeth A; Spaepen, Elizabet; Levine, Susan C

    2015-02-01

    Approximate number word knowledge-understanding the relation between the count words and the approximate magnitudes of sets-is a critical piece of knowledge that predicts later math achievement. However, researchers disagree about when children first show evidence of approximate number word knowledge-before, or only after, they have learned the cardinal principle. In two studies, children who had not yet learned the cardinal principle (subset-knowers) produced sets in response to number words (verbal comprehension task) and produced number words in response to set sizes (verbal production task). As evidence of approximate number word knowledge, we examined whether children's numerical responses increased with increasing numerosity of the stimulus. In Study 1, subset-knowers (ages 3.0-4.2 years) showed approximate number word knowledge above their knower-level on both tasks, but this effect did not extend to numbers above 4. In Study 2, we collected data from a broader age range of subset-knowers (ages 3.1-5.6 years). In this sample, children showed approximate number word knowledge on the verbal production task even when only examining set sizes above 4. Across studies, children's age predicted approximate number word knowledge (above 4) on the verbal production task when controlling for their knower-level, study (1 or 2), and parents' education, none of which predicted approximation ability. Thus, children can develop approximate knowledge of number words up to 10 before learning the cardinal principle. Furthermore, approximate number word knowledge increases with age and might not be closely related to the development of exact number word knowledge. Copyright © 2014 Elsevier Inc. All rights reserved.

  16. Mapping biological entities using the longest approximately common prefix method.

    Science.gov (United States)

    Rudniy, Alex; Song, Min; Geller, James

    2014-06-14

    The significant growth in the volume of electronic biomedical data in recent decades has pointed to the need for approximate string matching algorithms that can expedite tasks such as named entity recognition, duplicate detection, terminology integration, and spelling correction. The task of source integration in the Unified Medical Language System (UMLS) requires considerable expert effort despite the presence of various computational tools. This problem warrants the search for a new method for approximate string matching and its UMLS-based evaluation. This paper introduces the Longest Approximately Common Prefix (LACP) method as an algorithm for approximate string matching that runs in linear time. We compare the LACP method for performance, precision and speed to nine other well-known string matching algorithms. As test data, we use two multiple-source samples from the Unified Medical Language System (UMLS) and two SNOMED Clinical Terms-based samples. In addition, we present a spell checker based on the LACP method. The Longest Approximately Common Prefix method completes its string similarity evaluations in less time than all nine string similarity methods used for comparison. The Longest Approximately Common Prefix outperforms these nine approximate string matching methods in its Maximum F1 measure when evaluated on three out of the four datasets, and in its average precision on two of the four datasets.

  17. Weak Approximation of SDEs by Discrete-Time Processes

    Directory of Open Access Journals (Sweden)

    Henryk Zähle

    2008-01-01

    Full Text Available We consider the martingale problem related to the solution of an SDE on the line. It is shown that the solution of this martingale problem can be approximated by solutions of the corresponding time-discrete martingale problems under some conditions. This criterion is especially expedient for establishing the convergence of population processes to SDEs. We also show that the criterion yields a weak Euler scheme approximation of SDEs under fairly weak assumptions on the driving force of the approximating processes.

  18. Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

    Directory of Open Access Journals (Sweden)

    Li Rui

    2017-07-01

    Full Text Available It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders enhances the toolbox of quantum information protocols, paving the way for novel applications in quantum technologies.

  19. Baby Skyrme model, near-BPS approximations, and supersymmetric extensions

    Science.gov (United States)

    Bolognesi, S.; Zakrzewski, W.

    2015-02-01

    We study the baby Skyrme model as a theory that interpolates between two distinct BPS systems. For this, a near-BPS approximation can be used when there is a small deviation from each of the two BPS limits. We provide analytical explanation and numerical support for the validity of this approximation. We then study the set of all possible supersymmetric extensions of the baby Skyrme model with N =1 and the particular ones with extended N =2 supersymmetries and relate this to the above mentioned almost-BPS approximation.

  20. Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties

    DEFF Research Database (Denmark)

    Christensen, Max la Cour; Villa, Umberto; Engsig-Karup, Allan Peter

    The paper introduces a nonlinear multigrid solver for mixed finite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstructured problems is the guaranteed approximation property of the AMGe coarse...... properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on unstructured meshes has the ability to be as powerful/successful as FAS on geometrically refined meshes. For comparison, Newton’s method and Picard iterations with an inner state-of-the-art linear solver...

  1. Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals

    DEFF Research Database (Denmark)

    Rizzi, Romeo; Caprara, Alberto

    2002-01-01

    Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in computational molecular biology. At present, 3/2 is the best known approximation ratio achievable in polynomial time for SBR. A very closely related problem, called Breakpoint Graph Decomposition (BGD......! instances of SBR on permutations with n elements. Our result uses the best known approximation algorithms for Stable Set on graphs with maximum degree 4 as well as for Set Packing where the maximum size of a set is 6. Any improvement in the ratio achieved by these approximation algorithms will yield...

  2. Approximation scheme based on effective interactions for stochastic gene regulation

    CERN Document Server

    Ohkubo, Jun

    2010-01-01

    Since gene regulatory systems contain sometimes only a small number of molecules, these systems are not described well by macroscopic rate equations; a master equation approach is needed for such cases. We develop an approximation scheme for dealing with the stochasticity of the gene regulatory systems. Using an effective interaction concept, original master equations can be reduced to simpler master equations, which can be solved analytically. We apply the approximation scheme to self-regulating systems with monomer or dimer interactions, and a two-gene system with an exclusive switch. The approximation scheme can recover bistability of the exclusive switch adequately.

  3. Communication: Improved pair approximations in local coupled-cluster methods

    Energy Technology Data Exchange (ETDEWEB)

    Schwilk, Max; Werner, Hans-Joachim [Institut für Theoretische Chemie, Universität Stuttgart, Pfaffenwaldring 55, D-70569 Stuttgart (Germany); Usvyat, Denis [Institute for Physical and Theoretical Chemistry, Universität Regensburg, Universitätsstrasse 31, D-93040 Regensburg (Germany)

    2015-03-28

    In local coupled cluster treatments the electron pairs can be classified according to the magnitude of their energy contributions or distances into strong, close, weak, and distant pairs. Different approximations are introduced for the latter three classes. In this communication, an improved simplified treatment of close and weak pairs is proposed, which is based on long-range cancellations of individually slowly decaying contributions in the amplitude equations. Benchmark calculations for correlation, reaction, and activation energies demonstrate that these approximations work extremely well, while pair approximations based on local second-order Møller-Plesset theory can lead to errors that are 1-2 orders of magnitude larger.

  4. On the Beebe-Linderberg two-electron integral approximation

    Science.gov (United States)

    Røeggen, I.; Wisløff-Nilssen, E.

    1986-12-01

    The Beebe-Linderberg two-electron integral approximation, which is generated by a Cholesky decomposition of the two-electron integral matrix ([μν|λσ]), is slightly modified. On the basis of test calculations, two key questions concerning this approximation are discussed: The numerical rank of the two-electron integral matrix and the relationship between the integral threshold and electronic properties. The numerical results presented in this work suggest that the modified Beebe-Linderberg approximation might be considered as an alternative to effective core potential methods.

  5. Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

    Science.gov (United States)

    Li, Rui; Alvarez-Rodriguez, Unai; Lamata, Lucas; Solano, Enrique

    2017-07-01

    It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders enhances the toolbox of quantum information protocols, paving the way for novel applications in quantum technologies.

  6. Beyond the Euler characteristic: Approximating the genus of general graphs

    OpenAIRE

    Kawarabayashi, Ken-ichi; Sidiropoulos, Anastasios

    2014-01-01

    Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive study, the approximability of the Euler genus remains wide open. While the existence of an $O(1)$-approximation is not ruled out, the currently best-known upper bound is a trivial $O(n/g)$-approximation that follows from bounds on the Euler characteristic. I...

  7. Digital fixed points, approximate fixed points, and universal functions

    Directory of Open Access Journals (Sweden)

    Laurence Boxer

    2016-10-01

    Full Text Available A. Rosenfeld [23] introduced the notion of a digitally continuous function between digital images, and showed that although digital images need not have fixed point properties analogous to those of the Euclidean spaces modeled by the images, there often are approximate fixed point properties of such images. In the current paper, we obtain additional results concerning fixed points and approximate fixed points of digitally continuous functions. Among these are several results concerning the relationship between universal functions and the approximate fixed point property (AFPP.

  8. Evaluating approximations to the optimal exercise boundary for American options

    Directory of Open Access Journals (Sweden)

    Roland Mallier

    2002-01-01

    Full Text Available We consider series solutions for the location of the optimal exercise boundary of an American option close to expiry. By using Monte Carlo methods, we compute the expected value of an option if the holder uses the approximate location given by such a series as his exercise strategy, and compare this value to the actual value of the option. This gives an alternative method to evaluate approximations. We find the series solution for the call performs excellently under this criterion, even for large times, while the asymptotic approximation for the put is very good near to expiry but not so good further from expiry.

  9. Approximating methods for intractable probabilistic models: Applications in neuroscience

    DEFF Research Database (Denmark)

    Højen-Sørensen, Pedro

    2002-01-01

    . The approximating techniques used in this thesis originate from the field of statistical physics which for decades has been facing the same type of intractable computations when analyzing large systems of interacting variables e.g. magnetic spin systems. In general, these approximating techniques are known as mean...... with binary sources. It is shown this approach, which is computationally efficient, infers reasonable brain activation functions. Finally, we outline various ways of carrying out approximate message passing in probabilistic models for which marginalization over some of the clique variables is intractable....

  10. Technical notes. Spherical harmonics approximations of neutron transport

    Energy Technology Data Exchange (ETDEWEB)

    Demeny, A.; Dede, K.M.; Erdei, K.

    1976-12-01

    A double-range spherical harmonics approximation obtained by expanding the angular flux separately in the two regions combined with the conventional single-range spherical harmonics is found to give superior description of neutron transport.

  11. Kullback-Leibler divergence and the Pareto-Exponential approximation.

    Science.gov (United States)

    Weinberg, G V

    2016-01-01

    Recent radar research interests in the Pareto distribution as a model for X-band maritime surveillance radar clutter returns have resulted in analysis of the asymptotic behaviour of this clutter model. In particular, it is of interest to understand when the Pareto distribution is well approximated by an Exponential distribution. The justification for this is that under the latter clutter model assumption, simpler radar detection schemes can be applied. An information theory approach is introduced to investigate the Pareto-Exponential approximation. By analysing the Kullback-Leibler divergence between the two distributions it is possible to not only assess when the approximation is valid, but to determine, for a given Pareto model, the optimal Exponential approximation.

  12. Approximate equations at breaking for nearshore wave transformation coefficients

    Digital Repository Service at National Institute of Oceanography (India)

    Chandramohan, P.; Nayak, B.U.; SanilKumar, V.

    Based on small amplitude wave theory approximate equations are evaluated for determining the coefficients of shoaling, refraction, bottom friction, bottom percolation and viscous dissipation at breaking. The results obtainEd. by these equations...

  13. Gaussian approximations of fluorescence microscope point-spread function models.

    Science.gov (United States)

    Zhang, Bo; Zerubia, Josiane; Olivo-Marin, Jean-Christophe

    2007-04-01

    We comprehensively study the least-squares Gaussian approximations of the diffraction-limited 2D-3D paraxial-nonparaxial point-spread functions (PSFs) of the wide field fluorescence microscope (WFFM), the laser scanning confocal microscope (LSCM), and the disk scanning confocal microscope (DSCM). The PSFs are expressed using the Debye integral. Under an L(infinity) constraint imposing peak matching, optimal and near-optimal Gaussian parameters are derived for the PSFs. With an L1 constraint imposing energy conservation, an optimal Gaussian parameter is derived for the 2D paraxial WFFM PSF. We found that (1) the 2D approximations are all very accurate; (2) no accurate Gaussian approximation exists for 3D WFFM PSFs; and (3) with typical pinhole sizes, the 3D approximations are accurate for the DSCM and nearly perfect for the LSCM. All the Gaussian parameters derived in this study are in explicit analytical form, allowing their direct use in practical applications.

  14. Comparison of different caries detectors for approximal caries detection

    Directory of Open Access Journals (Sweden)

    Esin Bozdemir

    2016-09-01

    Conclusion: The ability of bitewing radiography to identify sound surfaces was better than that of the other methods. The LF device was the most sensitive tool for detecting approximal surfaces with caries, followed by the LED device.

  15. GPS-ABC: Gaussian Process Surrogate Approximate Bayesian Computation

    NARCIS (Netherlands)

    Meeds, E.; Welling, M.; Zhang, N.; Tian, J.

    2014-01-01

    Scientists often express their understanding of the world through a computationally demanding simulation program. Analyzing the posterior distribution of the parameters given observations (the inverse problem) can be extremely challenging. The Approximate Bayesian Computation (ABC) framework is the

  16. Interpolation function for approximating knee joint behavior in human gait

    Science.gov (United States)

    Toth-Taşcǎu, Mirela; Pater, Flavius; Stoia, Dan Ioan

    2013-10-01

    Starting from the importance of analyzing the kinematic data of the lower limb in gait movement, especially the angular variation of the knee joint, the paper propose an approximation function that can be used for processing the correlation among a multitude of knee cycles. The approximation of the raw knee data was done by Lagrange polynomial interpolation on a signal acquired using Zebris Gait Analysis System. The signal used in approximation belongs to a typical subject extracted from a lot of ten investigated subjects, but the function domain of definition belongs to the entire group. The study of the knee joint kinematics plays an important role in understanding the kinematics of the gait, this articulation having the largest range of motion in whole joints, in gait. The study does not propose to find an approximation function for the adduction-abduction movement of the knee, this being considered a residual movement comparing to the flexion-extension.

  17. Exact and approximate expressions for the period of anharmonic oscillators

    Energy Technology Data Exchange (ETDEWEB)

    Amore, Paolo [Facultad de Ciencias, Universidad de Colima, Bernal DIaz del Castillo 340, Colima (Mexico); Fernandez, Francisco M [INIFTA (Conicet, UNLP), Blvd. 113 y 64 S/N, Sucursal 4, Casilla de Correo 16, 1900 La Plata (Argentina)

    2005-07-01

    In this paper, we present a straightforward systematic method for the exact and approximate calculation of integrals that appear in formulae for the period of anharmonic oscillators and other problems of interest in classical mechanics.

  18. Real-time creased approximate subdivision surfaces with displacements.

    Science.gov (United States)

    Kovacs, Denis; Mitchell, Jason; Drone, Shanon; Zorin, Denis

    2010-01-01

    We present an extension of Loop and Schaefer's approximation of Catmull-Clark surfaces (ACC) for surfaces with creases and corners. We discuss the integration of ACC into Valve's Source game engine and analyze performance of our implementation.

  19. Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Benzi, M. [Universita di Bologna (Italy); Tuma, M. [Inst. of Computer Sciences, Prague (Czech Republic)

    1996-12-31

    A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods.

  20. The degenerate-internal-states approximation for cold collisions

    NARCIS (Netherlands)

    Maan, A.C.; Tiesinga, E.; Stoof, H.T.C.; Verhaar, B.J.

    1990-01-01

    The Degenerate-Internal-States approximation as well as its first-order correction are shown to provide a convenient method for calculating elastic and inelastic collision amplitudes for low temperature atomic scattering.

  1. Reinforcement Learning: Stochastic Approximation Algorithms for Markov Decision Processes

    OpenAIRE

    Krishnamurthy, Vikram

    2015-01-01

    This article presents a short and concise description of stochastic approximation algorithms in reinforcement learning of Markov decision processes. The algorithms can also be used as a suboptimal method for partially observed Markov decision processes.

  2. Global Stochastic Properties of Dynamic Models and their Linear Approximations

    NARCIS (Netherlands)

    A.M. Babus (Ana Maria); C.G. de Vries (Casper)

    2010-01-01

    textabstractThe dynamic properties of micro based stochastic macro models are often analyzed through a linearization around the associated deterministic steady state. Recent literature has investigated the error made by such a deterministic approximation. Complementary to this literature we

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

    Directory of Open Access Journals (Sweden)

    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$.

  4. Generalized -Bernstein-Schurer Operators and Some Approximation Theorems

    Directory of Open Access Journals (Sweden)

    M. Mursaleen

    2013-01-01

    Full Text Available We study statistical approximation properties of -Bernstein-Shurer operators and establish some direct theorems. Furthermore, we compute error estimation and show graphically the convergence for a function by operators and give its algorithm.

  5. Numerical approximation of random periodic solutions of stochastic differential equations

    Science.gov (United States)

    Feng, Chunrong; Liu, Yu; Zhao, Huaizhong

    2017-10-01

    In this paper, we discuss the numerical approximation of random periodic solutions of stochastic differential equations (SDEs) with multiplicative noise. We prove the existence of the random periodic solution as the limit of the pull-back flow when the starting time tends to -∞ along the multiple integrals of the period. As the random periodic solution is not explicitly constructible, it is useful to study the numerical approximation. We discretise the SDE using the Euler-Maruyama scheme and modified Milstein scheme. Subsequently, we obtain the existence of the random periodic solution as the limit of the pull-back of the discretised SDE. We prove that the latter is an approximated random periodic solution with an error to the exact one at the rate of √{Δ t} in the mean square sense in Euler-Maruyama method and Δ t in the Milstein method. We also obtain the weak convergence result for the approximation of the periodic measure.

  6. Reply to Steele & Ferrer: Modeling oscillation, approximately or exactly?

    NARCIS (Netherlands)

    Folmer, H.; Oud, J.H.L.

    2011-01-01

    This article addresses modeling oscillation in continuous time. It criticizes Steele and Ferrer's article "Latent Differential Equation Modeling of Self-Regulatory and Coregulatory Affective Processes" (2011), particularly the approximate estimation procedure applied. This procedure is the latent

  7. Reply to Steele & Ferrer : Modeling Oscillation, Approximately or Exactly?

    NARCIS (Netherlands)

    Oud, Johan H. L.; Folmer, Henk

    2011-01-01

    This article addresses modeling oscillation in continuous time. It criticizes Steele and Ferrer's article "Latent Differential Equation Modeling of Self-Regulatory and Coregulatory Affective Processes" (2011), particularly the approximate estimation procedure applied. This procedure is the latent

  8. Deterministic Approximation Algorithms for the Nearest Codeword Problem

    Science.gov (United States)

    Alon, Noga; Panigrahy, Rina; Yekhanin, Sergey

    The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v in mathbb{F}_2^n and a linear space Lsubseteq mathbb{F}_2^n of dimension k NCP asks to find a point l ∈ L that minimizes the (Hamming) distance from v. It is well-known that the nearest codeword problem is NP-hard. Therefore approximation algorithms are of interest. The best efficient approximation algorithms for the NCP to date are due to Berman and Karpinski. They are a deterministic algorithm that achieves an approximation ratio of O(k/c) for an arbitrary constant c, and a randomized algorithm that achieves an approximation ratio of O(k/logn).

  9. Approximation with positive linear operators and linear combinations

    CERN Document Server

    Gupta, Vijay

    2017-01-01

    This book presents a systematic overview of approximation by linear combinations of positive linear operators, a useful tool used to increase the order of approximation. Fundamental and recent results from the past decade are described with their corresponding proofs. The volume consists of eight chapters that provide detailed insight into the representation of monomials of the operators Ln , direct and inverse estimates for a broad class of positive linear operators, and case studies involving finite and unbounded intervals of real and complex functions. Strong converse inequalities of Type A in terminology of Ditzian–Ivanov for linear combinations of Bernstein and Bernstein–Kantorovich operators and various Voronovskaja-type estimates for some linear combinations are analyzed and explained. Graduate students and researchers in approximation theory will find the list of open problems in approximation of linear combinations useful. The book serves as a reference for graduate and postgraduate courses as we...

  10. bounding the error of a continuous approximation for linear systems

    African Journals Online (AJOL)

    DR S.E UWAMUSI

    The error analysis in LU factorization can be seen as follows: Assuming that d* is an approximate solution to the system of equations (1.1). We consider the problem of calculating the bounds of. ∞. -. - *. 1 d b. A where. ∞ d is the infinity norm in n. IR . We suppose that there is an approximate inverse matrix B to the interval ...

  11. Discussion of CoSA: Clustering of Sparse Approximations

    Energy Technology Data Exchange (ETDEWEB)

    Armstrong, Derek Elswick [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2017-03-07

    The purpose of this talk is to discuss the possible applications of CoSA (Clustering of Sparse Approximations) to the exploitation of HSI (HyperSpectral Imagery) data. CoSA is presented by Moody et al. in the Journal of Applied Remote Sensing (“Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries”, Vol. 8, 2014) and is based on machine learning techniques.

  12. Efficient approximation of random fields for numerical applications

    KAUST Repository

    Harbrecht, Helmut

    2015-01-07

    We consider the rapid computation of separable expansions for the approximation of random fields. We compare approaches based on techniques from the approximation of non-local operators on the one hand and based on the pivoted Cholesky decomposition on the other hand. We provide an a-posteriori error estimate for the pivoted Cholesky decomposition in terms of the trace. Numerical examples validate and quantify the considered methods.

  13. The weighted curvature approximation in scattering from sea surfaces

    OpenAIRE

    GUERIN, Charles-Antoine; Soriano, Gabriel; Chapron, Bertrand

    2010-01-01

    A family of unified models in scattering from rough surfaces is based on local corrections of the tangent plane approximation through higher-order derivatives of the surface. We revisit these methods in a common framework when the correction is limited to the curvature, that is essentially the second-order derivative. The resulting expression is formally identical to the weighted curvature approximation, with several admissible kernels, however. For sea surfaces under the Gaussian assumption,...

  14. Approximation and online algorithms in scheduling and coloring

    OpenAIRE

    Fishkin, Aleksei V.

    2003-01-01

    In the last three decades, approximation and online algorithms have become a major area of theoretical computer science and discrete mathematics. Scheduling and coloring problems are among the most popular ones for which approximation and online algorithms have been analyzed. On one hand, motivated by the well-known difficulty to obtain good lower bounds for the problems, it is particularly hard to prove results on the online and offline performance of algorithms. On the other hand, the theor...

  15. Extraction of Accurate Stomach Contour Using Approximated Stomach Region

    OpenAIRE

    小林, 富士男; 尾崎, 誠; コバヤシ, フジオ; オザキ, マコト; Fujio, KOBAYASHI; Makoto, OZAKI

    1999-01-01

    In this paper, the method of stomach extraction is proposed. The stomach contour is automatically and accurately extracted by the characteristics of X-ray image. The approximate stomach is obtained by the combination image which is constructed from binarize of the original image and its differential image. The stomach contour is extracted by the brightness of the differential image and the shape of stomach approximation. The stomach contour is accurately extracted.

  16. Approximate Subgradient Methods for Lagrangian Relaxations on Networks

    Science.gov (United States)

    Mijangos, Eugenio

    Nonlinear network flow problems with linear/nonlinear side con- straints can be solved by means of Lagrangian relaxations. The dual problem is the maximization of a dual function whose value is estimated by minimizing approximately a Lagrangian function on the set defined by the network constraints. We study alternative stepsizes in the approximate subgradient methods to solve the dual problem. Some basic convergence results are put forward. Moreover, we compare the quality of the computed solutions and the efficiency of these methods.

  17. Picard Trajectory Approximation Iteration for Efficient Orbit Propagation

    Science.gov (United States)

    2015-07-21

    AFRL-OSR-VA-TR-2015-0203 Picard Trajectory Approximation Iteration for Efficient Orbit Propagation John Junkins TEXAS ENGINEERING EXPERIMENT STATION...Junkins, J., “Terminal Convergence Approximation Modified Chebyshev Picard Iteration for Efficient Numerical Integration of Orbital Trajectories ...problem, separated by an orbital period (these differ only in sign and along a particular Keplerian u trajectory , these sign switches occur when the

  18. A simple approximation of productivity scores of fuzzy production plans

    DEFF Research Database (Denmark)

    Hougaard, Jens Leth

    2005-01-01

    This paper suggests a simple approximation procedure for the assessment of productivity scores with respect to fuzzy production plans. The procedure has a clear economic interpretation and all the necessary calculations can be performed in a spreadsheet making it highly operational......This paper suggests a simple approximation procedure for the assessment of productivity scores with respect to fuzzy production plans. The procedure has a clear economic interpretation and all the necessary calculations can be performed in a spreadsheet making it highly operational...

  19. Approximate Method for Solving the Linear Fuzzy Delay Differential Equations

    Directory of Open Access Journals (Sweden)

    S. Narayanamoorthy

    2015-01-01

    Full Text Available We propose an algorithm of the approximate method to solve linear fuzzy delay differential equations using Adomian decomposition method. The detailed algorithm of the approach is provided. The approximate solution is compared with the exact solution to confirm the validity and efficiency of the method to handle linear fuzzy delay differential equation. To show this proper features of this proposed method, numerical example is illustrated.

  20. Calculating resonance positions and widths using the Siegert approximation method

    Energy Technology Data Exchange (ETDEWEB)

    Rapedius, Kevin, E-mail: kevin.rapedius@ulb.ac.be [Center for Nonlinear Phenomena and Complex Systems, Universite Libre de Bruxelles, Code Postal 231, Campus Plaine, B-1050 Brussels (Belgium)

    2011-09-15

    Here, we present complex resonance states (or Siegert states) that describe the tunnelling decay of a trapped quantum particle from an intuitive point of view that naturally leads to the easily applicable Siegert approximation method. This can be used for analytical and numerical calculations of complex resonances of both the linear and nonlinear Schroedinger equations. This approach thus complements other treatments of the subject that mostly focus on methods based on continuation in the complex plane or on semiclassical approximations.

  1. Fast, Approximate Solutions for 1D Multicomponent Gas Injection Problems

    DEFF Research Database (Denmark)

    Jessen, Kristian; Wang, Yun; Ermakov, Pavel

    2001-01-01

    This paper presents a new approach for constructing approximate analytical solutions for ID, multicomponent gas displacement problems. The solution to mass conservation equations governing ID dispersion-free flow in which components partition between two equilibrium phases is controlled by the ge......This paper presents a new approach for constructing approximate analytical solutions for ID, multicomponent gas displacement problems. The solution to mass conservation equations governing ID dispersion-free flow in which components partition between two equilibrium phases is controlled...

  2. Approximate Compilation of Constraints into Multivalued Decision Diagrams

    DEFF Research Database (Denmark)

    Hadzic, Tarik; Hooker, John N.; O’Sullivan, Barry

    2008-01-01

    We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex splitting operation that relies on the detection of equivalent paths in the MDD. Although the algorithm is quite...... by replacing the equivalence test with a constraint-specific measure of distance. We demonstrate the value of the approach for approximate and exact MDD compilation and evaluate its benefits in one of the main MDD application domains, interactive configuration....

  3. Bounded Error Approximation Algorithms for Risk-Based Intrusion Response

    Science.gov (United States)

    2015-09-17

    AFRL-AFOSR-VA-TR-2015-0324 Bounded Error Approximation Algorithms for Risk-Based Intrusion Response K Subramani West Virginia University Research...2015. 4. TITLE AND SUBTITLE Bounded Error Approximation Algorithms for Risk-Based Intrusion Response 5a. CONTRACT NUMBER FA9550-12-1-0199. 5b. GRANT...SUPPLEMENTARY NOTES 14. ABSTRACT Our research consisted of modeling the intrusion response problem as one of finding a partial vertex cover in

  4. Approximate Solutions to Nonlinear Optimal Control Problems in Astrodynamics

    OpenAIRE

    Francesco Topputo; Franco Bernelli-Zazzera

    2013-01-01

    A method to solve nonlinear optimal control problems is proposed in this work. The method implements an approximating sequence of time-varying linear quadratic regulators that converge to the solution of the original, nonlinear problem. Each subproblem is solved by manipulating the state transition matrix of the state-costate dynamics. Hard, soft, and mixed boundary conditions are handled. The presented method is a modified version of an algorithm known as “approximating sequence of Riccati e...

  5. Convergence Rates of Finite Difference Stochastic Approximation Algorithms

    Science.gov (United States)

    2016-06-01

    Chung, On a stochastic approximation method, Annals of Mathematical Statis- tics, 25 (1954), pp. 463-483. 5. R. W. Conway, Some tactical problems in...Dynamic Systems, Kluwer Academic Publishers, Boston, 1991. 18. H. Kesten, Accelerated stochastic approximation, Annals of Mathematical Statistics, 29...1958), pp. 41-59. 19. J. Kiefer and J. Wolfowitz. Stochastic estimation of the maximum of a regression function, Annals of Mathematical Statistics, 23

  6. Convolutional Pitch Target Approximation Model for Speech Synthesis

    OpenAIRE

    Na, Xingyu; Garner, Philip N.

    2013-01-01

    In this paper, we investigate pitch contour modelling in speech synthesis based on segmental units. A convolutional pitch target approximation model is proposed. This model allows jointly stochastic modelling of framewise pitch and pitch contour of longer units, of which the intuitive relations are revealed by a convolutional target approximation filter. The pitch contour is stylized by a linear representation called pitch target. In synthesis stage, the likelihood of the framewise model and ...

  7. Computing gap free Pareto front approximations with stochastic search algorithms.

    Science.gov (United States)

    Schütze, Oliver; Laumanns, Marco; Tantar, Emilia; Coello, Carlos A Coello; Talbi, El-Ghazali

    2010-01-01

    Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The focus was on obtaining a finite approximation that captures the entire solution set in some suitable sense, which was defined by the concept of epsilon-dominance. Though bounds on the quality of the limit approximation-which are entirely determined by the archiving strategy and the value of epsilon-have been obtained, the strategies do not guarantee to obtain a gap free approximation of the Pareto front. That is, such approximations A can reveal gaps in the sense that points f in the Pareto front can exist such that the distance of f to any image point F(a), a epsilon A, is "large." Since such gap free approximations are desirable in certain applications, and the related archiving strategies can be advantageous when memetic strategies are included in the search process, we are aiming in this work for such methods. We present two novel strategies that accomplish this task in the probabilistic sense and under mild assumptions on the stochastic search algorithm. In addition to the convergence proofs, we give some numerical results to visualize the behavior of the different archiving strategies. Finally, we demonstrate the potential for a possible hybridization of a given stochastic search algorithm with a particular local search strategy-multi-objective continuation methods-by showing that the concept of epsilon-dominance can be integrated into this approach in a suitable way.

  8. Imprints of approximately 8 year oscillation in climatic time series

    Science.gov (United States)

    Mikšovský, Jiří; Paluš, Milan; Jajcay, Nikola; Donner, Reik

    2017-04-01

    Due to activity and complex interaction of various climate-determining agents, a wide range of variability patterns can be found in the meteorological records. Some of these can be attributed to external factors such as changes in solar or volcanic activity; others are linked to internally induced climate variations. Among the perhaps less prominent, yet still potentially influential variability modes is the approximately 8 year oscillation. In the past, its presence has been reported in various (particularly European) climate records, typically related to temperature or pressure data. Here, the presence of the approximately 8y cycle has been investigated in climate signals originating from a range of observational, reanalyzed and simulated datasets. Through statistical techniques based primarily on wavelet transform and regression analysis, magnitude and statistical significance of the approximately 8y oscillation were evaluated, as well as its temporal stability and geographical patterns. In addition to confirming a statistically significant presence of the approximately 8y periodicity in the mean temperature series over a large part of Europe, its existence has also been demonstrated for minimum and maximum temperature series, while only limited traces were found in precipitation data. The analysis of long European temperature records has revealed a distinct multidecadal variation of the magnitude of the approximately 8y oscillation, although the specific mechanism responsible for this behavior still remains unclear. A link of the approximately 8y component in the index of the North Atlantic Oscillation to near-ground temperatures has been detected for much of Europe as well as some areas in the North Atlantic region. Finally, the presence of the approximately 8y cycle in the general circulation model outputs has been investigated: while some indications of the 8y oscillations were found in the simulated data, they seem generally weaker than in their

  9. Finite volume approximation of two phase-fluid flows based on an approximate Roe-Type Riemann solver

    Energy Technology Data Exchange (ETDEWEB)

    Sainsaulieu, L. [C.E.R.M.I.C.S., E.N.P.C., Noisy-le-Grand (France)]|[Centre de Mathematiques Appliquees, Palaiseau (France)

    1995-10-01

    We introduce an approximate Roe type Riemann solver for the numerical simulation of two-phase fluid flows composed of liquid droplets suspended in gas. We compute a Roe linearization of some well-conditioned approximate Rankine-Hugoniot relations in nonconservation form. The computed solutions are found to be in good agreement with the exact solution in one dimension slab geometry. We extend this solver to two-dimensional geometries using a fininte volume formulation. 24 refs., 15 figs., 2 tabs.

  10. Validity of the Aluminum Equivalent Approximation in Space Radiation Shielding

    Science.gov (United States)

    Badavi, Francis F.; Adams, Daniel O.; Wilson, John W.

    2009-01-01

    The origin of the aluminum equivalent shield approximation in space radiation analysis can be traced back to its roots in the early years of the NASA space programs (Mercury, Gemini and Apollo) wherein the primary radiobiological concern was the intense sources of ionizing radiation causing short term effects which was thought to jeopardize the safety of the crew and hence the mission. Herein, it is shown that the aluminum equivalent shield approximation, although reasonably well suited for that time period and to the application for which it was developed, is of questionable usefulness to the radiobiological concerns of routine space operations of the 21 st century which will include long stays onboard the International Space Station (ISS) and perhaps the moon. This is especially true for a risk based protection system, as appears imminent for deep space exploration where the long-term effects of Galactic Cosmic Ray (GCR) exposure is of primary concern. The present analysis demonstrates that sufficiently large errors in the interior particle environment of a spacecraft result from the use of the aluminum equivalent approximation, and such approximations should be avoided in future astronaut risk estimates. In this study, the aluminum equivalent approximation is evaluated as a means for estimating the particle environment within a spacecraft structure induced by the GCR radiation field. For comparison, the two extremes of the GCR environment, the 1977 solar minimum and the 2001 solar maximum, are considered. These environments are coupled to the Langley Research Center (LaRC) deterministic ionized particle transport code High charge (Z) and Energy TRaNsport (HZETRN), which propagates the GCR spectra for elements with charges (Z) in the range I aluminum equivalent approximation for a good polymeric shield material such as genetic polyethylene (PE). The shield thickness is represented by a 25 g/cm spherical shell. Although one could imagine the progression to greater

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

    Directory of Open Access Journals (Sweden)

    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.

  12. An approximate fractional Gaussian noise model with computational cost

    KAUST Repository

    Sørbye, Sigrunn H.

    2017-09-18

    Fractional Gaussian noise (fGn) is a stationary time series model with long memory properties applied in various fields like econometrics, hydrology and climatology. The computational cost in fitting an fGn model of length $n$ using a likelihood-based approach is ${\\\\mathcal O}(n^{2})$, exploiting the Toeplitz structure of the covariance matrix. In most realistic cases, we do not observe the fGn process directly but only through indirect Gaussian observations, so the Toeplitz structure is easily lost and the computational cost increases to ${\\\\mathcal O}(n^{3})$. This paper presents an approximate fGn model of ${\\\\mathcal O}(n)$ computational cost, both with direct or indirect Gaussian observations, with or without conditioning. This is achieved by approximating fGn with a weighted sum of independent first-order autoregressive processes, fitting the parameters of the approximation to match the autocorrelation function of the fGn model. The resulting approximation is stationary despite being Markov and gives a remarkably accurate fit using only four components. The performance of the approximate fGn model is demonstrated in simulations and two real data examples.

  13. APPROXIMATION ALGORITHMS FOR CLUSTERING TO MINIMIZE THE SUM OF DIAMETERS

    Energy Technology Data Exchange (ETDEWEB)

    Kopp, S.; Mortveit, H.S.; Reidys, S.M.

    2000-02-01

    We consider the problem of partitioning the nodes of a complete edge weighted graph into {kappa} clusters so as to minimize the sum of the diameters of the clusters. Since the problem is NP-complete, our focus is on the development of good approximation algorithms. When edge weights satisfy the triangle inequality, we present the first approximation algorithm for the problem. The approximation algorithm yields a solution that has no more than 10k clusters such the total diameter of these clusters is within a factor O(log (n/{kappa})) of the optimal value fork clusters, where n is the number of nodes in the complete graph. For any fixed {kappa}, we present an approximation algorithm that produces {kappa} clusters whose total diameter is at most twice the optimal value. When the distances are not required to satisfy the triangle inequality, we show that, unless P = NP, for any {rho} {ge} 1, there is no polynomial time approximation algorithm that can provide a performance guarantee of {rho} even when the number of clusters is fixed at 3. Other results obtained include a polynomial time algorithm for the problem when the underlying graph is a tree with edge weights.

  14. NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES

    Energy Technology Data Exchange (ETDEWEB)

    Christensen, Max La Cour [Technical Univ. of Denmark, Lyngby (Denmark); Villa, Umberto E. [Univ. of Texas, Austin, TX (United States); Engsig-Karup, Allan P. [Technical Univ. of Denmark, Lyngby (Denmark); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2016-01-22

    The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.

  15. Dissociation between exact and approximate addition in developmental dyslexia.

    Science.gov (United States)

    Yang, Xiujie; Meng, Xiangzhi

    2016-09-01

    Previous research has suggested that number sense and language are involved in number representation and calculation, in which number sense supports approximate arithmetic, and language permits exact enumeration and calculation. Meanwhile, individuals with dyslexia have a core deficit in phonological processing. Based on these findings, we thus hypothesized that children with dyslexia may exhibit exact calculation impairment while doing mental arithmetic. The reaction time and accuracy while doing exact and approximate addition with symbolic Arabic digits and non-symbolic visual arrays of dots were compared between typically developing children and children with dyslexia. Reaction time analyses did not reveal any differences across two groups of children, the accuracies, interestingly, revealed a distinction of approximation and exact addition across two groups of children. Specifically, two groups of children had no differences in approximation. Children with dyslexia, however, had significantly lower accuracy in exact addition in both symbolic and non-symbolic tasks than that of typically developing children. Moreover, linguistic performances were selectively associated with exact calculation across individuals. These results suggested that children with dyslexia have a mental arithmetic deficit specifically in the realm of exact calculation, while their approximation ability is relatively intact. Copyright © 2016 Elsevier Ltd. All rights reserved.

  16. Fast Estimation of Approximate Matrix Ranks Using Spectral Densities.

    Science.gov (United States)

    Ubaru, Shashanka; Saad, Yousef; Seghouane, Abd-Krim

    2017-05-01

    Many machine learning and data-related applications require the knowledge of approximate ranks of large data matrices at hand. This letter presents two computationally inexpensive techniques to estimate the approximate ranks of such matrices. These techniques exploit approximate spectral densities, popular in physics, which are probability density distributions that measure the likelihood of finding eigenvalues of the matrix at a given point on the real line. Integrating the spectral density over an interval gives the eigenvalue count of the matrix in that interval. Therefore, the rank can be approximated by integrating the spectral density over a carefully selected interval. Two different approaches are discussed to estimate the approximate rank, one based on Chebyshev polynomials and the other based on the Lanczos algorithm. In order to obtain the appropriate interval, it is necessary to locate a gap between the eigenvalues that correspond to noise and the relevant eigenvalues that contribute to the matrix rank. A method for locating this gap and selecting the interval of integration is proposed based on the plot of the spectral density. Numerical experiments illustrate the performance of these techniques on matrices from typical applications.

  17. Analysis of 2D NMR relaxation data using Chisholm approximations

    Science.gov (United States)

    Huber, S.; Haase, A.; Gleich, B.

    2017-08-01

    To analyze 2D NMR relaxation data based on a discrete delta-like relaxation map we extended the Padé-Laplace method to two dimensions. We approximate the forward Laplace image of the time domain signal by a Chisholm approximation, i.e. a rational polynomial in two dimensions. The poles and residues of this approximation correspond to the relaxation rates and weighting factors of the underlying relaxation map. In this work we explain the principle ideas of our algorithm and demonstrate its applicability. Therefore we compare the inversion results of the Chisholm approximation and Tikhonov regularization method as a function of SNR when the investigated signal is based on a given discrete relaxation map. Our algorithm proved to be reliable for SNRs larger than 50 and is able to compete with the Tikhonov regularization method. Furthermore we show that our method is also able to detect the simulated relaxation compartments of narrow Gaussian distributions with widths less or equal than 0.05 s-1. Finally we investigate the resolution limit with experimental data. For a SNR of 750 the Chisholm approximation method was able to resolve two relaxation compartments in 8 of 10 cases when both compartments differ by a factor of 1.7.

  18. Semiclassical approximation for strong-laser-field processes

    Science.gov (United States)

    Milošević, D. B.

    2017-08-01

    The exact time-evolution operator of an atom in the presence of a strong laser field is expressed using the phase-space path integral. Presenting this result in the form of a perturbative expansion in the effective interaction of the electron with the rest of the atom enables straightforward derivation of the well-known strong-field approximation and its higher-order corrections. Alternatively, one can use this exact result to obtain a semiclassical approximation by expansion in powers of small fluctuations around the classical trajectories. We present a derivation of such a semiclassical approximation. The obtained result for the momentum-space matrix element of the total time-evolution operator can be useful for studying various processes in strong-field physics. Using the example of above-threshold ionization, it is shown how this approximation can be applied to laser-induced processes. More attention is devoted to the laser-assisted scattering. Using the example of few-cycle laser-pulse-assisted electron-atom potential scattering, we show similarities and differences between the semiclassical and the strong-field approximations. For low energies, the semiclassical scattering cross section is modified and there are trajectories along which the electron is temporarily captured by the atomic potential. Applying stationary-phase method to the integral over the scattering time, we clearly identified relevant semiclassical electron trajectories.

  19. Conserving slave boson approximations for the anderson model beyond NCA

    Science.gov (United States)

    Kroha, J.; Wölfle, P.; Costi, T. A.; Hirschfeld, P. J.; Muttalib, K. A.

    1996-04-01

    We derive a general scheme to construct conserving slave boson approximations for the single-impurity Anderson model beyond the noncrossing approximation (NCA). The pseudofermion and slave boson spectral functions are computed in a conserving T-matrix approximation which includes the maximum number of impurity spin flips in each order of the hybridization. In a perturbative evaluation, the singlet channel of the conduction electron-pseudofermion T-matrix has a pole which is renormalized by selfconsistency. As a result, the exponents of the infra-red powerlaw behavior of the pseudoparticle spectral functions are modified w.r.t NCA and depend on the impurity occupation number. We present results for the exponents in the Kondo regime which are consistent with exact values given by the x-ray emission and absorption exponents.

  20. Analytic interatomic forces in the random phase approximation

    CERN Document Server

    Ramberger, Benjamin; Kresse, Georg

    2016-01-01

    We discuss that in the random phase approximation (RPA) the first derivative of the energy with respect to the Green's function is the self-energy in the GW approximation. This relationship allows to derive compact equations for the RPA interatomic forces. We also show that position dependent overlap operators are elegantly incorporated in the present framework. The RPA force equations have been implemented in the projector augmented wave formalism, and we present illustrative applications, including ab initio molecular dynamics simulations, the calculation of phonon dispersion relations for diamond and graphite, as well as structural relaxations for water on boron nitride. The present derivation establishes a concise framework for forces within perturbative approaches and is also applicable to more involved approximations for the correlation energy.

  1. Spaces of approximating functions with Haar-like conditions

    CERN Document Server

    Kitahara, Kazuaki

    1994-01-01

    Tchebycheff (or Haar) and weak Tchebycheff spaces play a central role when considering problems of best approximation from finite dimensional spaces. The aim of this book is to introduce Haar-like spaces, which are Haar and weak Tchebycheff spaces under special conditions. It studies topics of subclasses of Haar-like spaces, that is, classes of Tchebycheff or weak Tchebycheff spaces, spaces of vector-valued monotone increasing or convex functions and spaces of step functions. The notion of Haar-like spaces provides a general point of view which includes the theories of approximation from the above spaces. The contents are largely new. Graduate students and researchers in approximation theory will be able to read this book with only basic knowledge of analysis, functional analysis and linear algebra.

  2. Bilinear reduced order approximate model of parabolic distributed solar collectors

    KAUST Repository

    Elmetennani, Shahrazed

    2015-07-01

    This paper proposes a novel, low dimensional and accurate approximate model for the distributed parabolic solar collector, by means of a modified gaussian interpolation along the spatial domain. The proposed reduced model, taking the form of a low dimensional bilinear state representation, enables the reproduction of the heat transfer dynamics along the collector tube for system analysis. Moreover, presented as a reduced order bilinear state space model, the well established control theory for this class of systems can be applied. The approximation efficiency has been proven by several simulation tests, which have been performed considering parameters of the Acurex field with real external working conditions. Model accuracy has been evaluated by comparison to the analytical solution of the hyperbolic distributed model and its semi discretized approximation highlighting the benefits of using the proposed numerical scheme. Furthermore, model sensitivity to the different parameters of the gaussian interpolation has been studied.

  3. Subquadratic medial-axis approximation in $\\mathbb{R}^3$

    Directory of Open Access Journals (Sweden)

    Christian Scheffer

    2015-09-01

    Full Text Available We present an algorithm that approximates the medial axis of a smooth manifold in $\\mathbb{R}^3$ which is given by a sufficiently dense point sample. The resulting, non-discrete approximation is shown to converge to the medial axis as the sampling density approaches infinity. While all previous algorithms guaranteeing convergence have a running time quadratic in the size $n$ of the point sample, we achieve a running time of at most $\\mathcal{O}(n\\log^3 n$. While there is no subquadratic upper bound on the output complexity of previous algorithms for non-discrete medial axis approximation, the output of our algorithm is guaranteed to be of linear size.

  4. First and second order convex approximation strategies in structural optimization

    Science.gov (United States)

    Fleury, C.

    1989-01-01

    In this paper, various methods based on convex approximation schemes are discussed that have demonstrated strong potential for efficient solution of structural optimization problems. First, the convex linearization method (Conlin) is briefly described, as well as one of its recent generalizations, the method of moving asymptotes (MMA). Both Conlin and MMA can be interpreted as first-order convex approximation methods that attempt to estimate the curvature of the problem functions on the basis of semiempirical rules. Attention is next directed toward methods that use diagonal second derivatives in order to provide a sound basis for building up high-quality explicit approximations of the behavior constraints. In particular, it is shown how second-order information can be effectively used without demanding a prohibitive computational cost. Various first-order and second-order approaches are compared by applying them to simple problems that have a closed form solution.

  5. A 4PN-exact approximation to General Relativity

    CERN Document Server

    Brizuela, David

    2010-01-01

    An approximation to General Relativity is presented which agrees with the Einstein field equations up to and including the fourth post-Newtonian (PN) order. This approximation is formulated in a fully constrained scheme: all involved equations are explicitly elliptic except the wave equation that describes the two independent degrees of freedom of the gravitational field. The formalism covers naturally the conformal-flat-condition (CFC) approach by Isenberg, Wilson, and Mathews and the improved second PN-order exact approach CFC+. For stationary configurations, like Kerr black holes, agreement with General Relativity is achieved even through 5PN order. In addition, we analyze in detail a particularly interesting 2PN-exact waveless approximation which results from imposing more restrictive conditions. The proposed scheme can be considered as a further development on the waveless approach suggested by Schaefer and Gopakumar [Phys. Rev. D {\\bf 69}, 021501 (2004)].

  6. Approximate Bisimulation-Based Reduction of Power System Dynamic Models

    Energy Technology Data Exchange (ETDEWEB)

    Stankovic, AM; Dukic, SD; Saric, AT

    2015-05-01

    In this paper we propose approximate bisimulation relations and functions for reduction of power system dynamic models in differential- algebraic (descriptor) form. The full-size dynamic model is obtained by linearization of the nonlinear transient stability model. We generalize theoretical results on approximate bisimulation relations and bisimulation functions, originally derived for a class of constrained linear systems, to linear systems in descriptor form. An algorithm for transient stability assessment is proposed and used to determine whether the power system is able to maintain the synchronism after a large disturbance. Two benchmark power systems are used to illustrate the proposed algorithm and to evaluate the applicability of approximate bisimulation relations and bisimulation functions for reduction of the power system dynamic models.

  7. Nonlinear ordinary differential equations analytical approximation and numerical methods

    CERN Document Server

    Hermann, Martin

    2016-01-01

    The book discusses the solutions to nonlinear ordinary differential equations (ODEs) using analytical and numerical approximation methods. Recently, analytical approximation methods have been largely used in solving linear and nonlinear lower-order ODEs. It also discusses using these methods to solve some strong nonlinear ODEs. There are two chapters devoted to solving nonlinear ODEs using numerical methods, as in practice high-dimensional systems of nonlinear ODEs that cannot be solved by analytical approximate methods are common. Moreover, it studies analytical and numerical techniques for the treatment of parameter-depending ODEs. The book explains various methods for solving nonlinear-oscillator and structural-system problems, including the energy balance method, harmonic balance method, amplitude frequency formulation, variational iteration method, homotopy perturbation method, iteration perturbation method, homotopy analysis method, simple and multiple shooting method, and the nonlinear stabilized march...

  8. Finitely approximable random sets and their evolution via differential equations

    Science.gov (United States)

    Ananyev, B. I.

    2016-12-01

    In this paper, random closed sets (RCS) in Euclidean space are considered along with their distributions and approximation. Distributions of RCS may be used for the calculation of expectation and other characteristics. Reachable sets on initial data and some ways of their approximate evolutionary description are investigated for stochastic differential equations (SDE) with initial state in some RCS. Markov property of random reachable sets is proved in the space of closed sets. For approximate calculus, the initial RCS is replaced by a finite set on the integer multidimensional grid and the multistage Markov chain is substituted for SDE. The Markov chain is constructed by methods of SDE numerical integration. Some examples are also given.

  9. Improved stochastic approximation methods for discretized parabolic partial differential equations

    Science.gov (United States)

    Guiaş, Flavius

    2016-12-01

    We present improvements of the stochastic direct simulation method, a known numerical scheme based on Markov jump processes which is used for approximating solutions of ordinary differential equations. This scheme is suited especially for spatial discretizations of evolution partial differential equations (PDEs). By exploiting the full path simulation of the stochastic method, we use this first approximation as a predictor and construct improved approximations by Picard iterations, Runge-Kutta steps, or a combination. This has as consequence an increased order of convergence. We illustrate the features of the improved method at a standard benchmark problem, a reaction-diffusion equation modeling a combustion process in one space dimension (1D) and two space dimensions (2D).

  10. Integral approximants for functions of higher monodromic dimension

    Energy Technology Data Exchange (ETDEWEB)

    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.

  11. Quasiadiabatic Grover search via the Wentzel-Kramers-Brillouin approximation

    Science.gov (United States)

    Muthukrishnan, Siddharth; Lidar, Daniel A.

    2017-07-01

    In various applications one is interested in quantum dynamics at intermediate evolution times, for which the adiabatic approximation is inadequate. Here we develop a quasiadiabatic approximation based on the WKB method, designed to work for such intermediate evolution times. We apply it to the problem of a single qubit in a time-varying magnetic field, and to the Hamiltonian Grover search problem, and show that already at first order the quasiadiabatic WKB captures subtle features of the dynamics that are missed by the adiabatic approximation. However, we also find that the method is sensitive to the type of interpolation schedule used in the Grover problem and can give rise to nonsensical results for the wrong schedule. Conversely, it reproduces the quadratic Grover speedup when the well-known optimal schedule is used.

  12. Manifold boundaries give "gray-box" approximations of complex models

    CERN Document Server

    Transtrum, Mark K

    2016-01-01

    We discuss a method of parameter reduction in complex models known as the Manifold Boundary Approximation Method (MBAM). This approach, based on a geometric interpretation of statistics, maps the model reduction problem to a geometric approximation problem. It operates iteratively, removing one parameter at a time, by approximating a high-dimension, but thin manifold by its boundary. Although the method makes no explicit assumption about the functional form of the model, it does require that the model manifold exhibit a hierarchy of boundaries, i.e., faces, edges, corners, hyper-corners, etc. We empirically show that a variety of model classes have this curious feature, making them amenable to MBAM. These model classes include models composed of elementary functions (e.g., rational functions, exponentials, and partition functions), a variety of dynamical system (e.g., chemical and biochemical kinetics, Linear Time Invariant (LTI) systems, and compartment models), network models (e.g., Bayesian networks, Marko...

  13. Approximation of entropy solutions to degenerate nonlinear parabolic equations

    Science.gov (United States)

    Abreu, Eduardo; Colombeau, Mathilde; Panov, Evgeny Yu

    2017-12-01

    We approximate the unique entropy solutions to general multidimensional degenerate parabolic equations with BV continuous flux and continuous nondecreasing diffusion function (including scalar conservation laws with BV continuous flux) in the periodic case. The approximation procedure reduces, by means of specific formulas, a system of PDEs to a family of systems of the same number of ODEs in the Banach space L^∞, whose solutions constitute a weak asymptotic solution of the original system of PDEs. We establish well posedness, monotonicity and L^1-stability. We prove that the sequence of approximate solutions is strongly L^1-precompact and that it converges to an entropy solution of the original equation in the sense of Carrillo. This result contributes to justify the use of this original method for the Cauchy problem to standard multidimensional systems of fluid dynamics for which a uniqueness result is lacking.

  14. Fast Gravitational Field Model Using Adaptive Orthogonal Finite Element Approximation

    Science.gov (United States)

    Younes, A.; Macomber, B.; Woollands, R.; Probe, A.; Bai, X.; Junkins, J.

    2013-09-01

    Recent research has addressed the issue that high degree and order gravity expansions involve tens of thousands of terms in a theoretically infinite order spherical harmonic expansion (some gravity models extend to degree and order 200 with over 30,000 terms) which in principle must be computed at every integration step to obtain the acceleration consistent with the gravity model. We propose to evaluate these gravity model interpolation models and use them in conjunction with the modified Picard path approximation methods. It was decided to consider analogous orthogonal approximation methods to interpolate, an FEM model, high (degree, order) gravity fields, by replacing the global spherical harmonic series by a family of locally precise orthogonal polynomial approximations for efficient computation. Our preliminary results showed that time to compute the state of the art (degree and order 200) spherical harmonic gravity is reduced by 4 to 5 orders of magnitude while maintaining > 9 digits of accuracy. Most of the gain is due to adopting the orthogonal FEM approach, but radial adaptation of the approximation degree gains an additional order of magnitude speedup. The efficient data base storage/access of the local coefficients is studied, which utilizes porting the algorithm to the NVIDIA GPU. This paper will address the accuracy and efficiency in both a C++ serial PC architecture as well as a PC/GPU architecture. The Adaptive Orthogonal Finite Element Gravity Model (AOFEGM) is expected to have broad potential for speeding the trajectory propagation algorithms; for example, used in conjunction with orthogonal Finite Element Model (FEM) gravity approximations, the Chebyshev-Picard path approximation enables truly revolutionary speedups in orbit propagation without accuracy loss.

  15. Robustness of the Approximate Likelihood of the Protracted Speciation Model.

    Science.gov (United States)

    Simonet, Camille Anna; Scherrer, Raphaël; Rego-Costa, Artur; Etienne, Rampal S

    2017-12-22

    The protracted speciation model presents a realistic and parsimonious explanation for the observed slowdown in lineage accumulation through time, by accounting for the fact that speciation takes time. A method to compute the likelihood for this model given a phylogeny is available and allows estimation of its parameters (rate of initiation of speciation, rate of completion of speciation, and extinction rate) and statistical comparison of this model to other proposed models of diversification. However this likelihood computation method makes an approximation of the protracted speciation model to be mathematically tractable: it sometimes counts fewer species than one would do from a biological perspective. This approximation may have large consequences for likelihood-based inferences: it may render any conclusions based on this method completely irrelevant. Here we study to what extent this approximation affects parameter estimations. We simulated phylogenies from which we reconstructed the tree of extant species according to the original, biologically meaningful protracted speciation model and according to the approximation. We then compared the resulting parameter estimates. We found that the differences were larger for high values of extinction rates and small values of speciation-completion rates. Indeed, a long speciation-completion time and a high extinction rate promote the appearance of cases to which the approximation applies. However, surprisingly, the deviation introduced is largely negligible over the parameter space explored, suggesting that this approximate likelihood can be applied reliably in practice to estimate biologically relevant parameters under the original protracted speciation model. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

  16. Approximate Multi-Parameter Inverse Scattering Using Pseudodifferential Scaling

    Science.gov (United States)

    Nammour, Rami

    I propose a computationally efficient method to approximate the inverse of the normal operator arising in the multi-parameter linearized inverse problem for reflection seismology in two and three spatial dimensions. Solving the inverse problem using direct matrix methods like Gaussian elimination is computationally infeasible. In fact, the application of the normal operator requires solving large scale PDE problems. However, under certain conditions, the normal operator is a matrix of pseudodifferential operators. This manuscript shows how to generalize Cramer's rule for matrices to approximate the inverse of a matrix of pseudodifferential operators. Approximating the solution to the normal equations proceeds in two steps: (1) First, a series of applications of the normal operator to specific permutations of the right hand side. This step yields a phase-space scaling of the solution. Phase space scalings are scalings in both physical space and Fourier space. Second, a correction for the phase space scaling. This step requires applying the normal operator once more. The cost of approximating the inverse is a few applications of the normal operator (one for one parameter, two for two parameters, six for three parameters). The approximate inverse is an adequately accurate solution to the linearized inverse problem when it is capable of fitting the data to a prescribed precision. Otherwise, the approximate inverse of the normal operator might be used to precondition Krylov subspace methods in order to refine the data fit. I validate the method on a linearized version of the Marmousi model for constant density acoustics for the one-parameter problem. For the two parameter problem, the inversion of a variable density acoustics layered model corroborates the success of the proposed method. Furthermore, this example details the various steps of the method. I also apply the method to a 1D section of the Marmousi model to test the behavior of the method on complex two

  17. Theory of periodically specified problems: Complexity and approximability

    Energy Technology Data Exchange (ETDEWEB)

    Marathe, M.V. [Los Alamos National Lab., NM (United States); Hunt, H.B. III; Stearns, R.E.; Rosenkrantz, D.J. [Univ. at Albany - SUNY, NY (United States). Dept. of Computer Science

    1997-12-05

    We study the complexity and the efficient approximability of graph and satisfiability problems when specified using various kinds of periodic specifications studied. The general results obtained include the following: (1) We characterize the complexities of several basic generalized CNF satisfiability problems SAT(S) [Sc78], when instances are specified using various kinds of 1- and 2-dimensional periodic specifications. We outline how this characterization can be used to prove a number of new hardness results for the complexity classes DSPACE(n), NSPACE(n), DEXPTIME, NEXPTIME, EXPSPACE etc. These results can be used to prove in a unified way the hardness of a number of combinatorial problems when instances are specified succinctly using various succient specifications considered in the literature. As one corollary, we show that a number of basic NP-hard problems because EXPSPACE-hard when inputs are represented using 1-dimensional infinite periodic wide specifications. This answers a long standing open question posed by Orlin. (2) We outline a simple yet a general technique to devise approximation algorithms with provable worst case performance guarantees for a number of combinatorial problems specified periodically. Our efficient approximation algorithms and schemes are based on extensions of the ideas and represent the first non-trivial characterization of a class of problems having an {epsilon}-approximation (or PTAS) for periodically specified NEXPTIME-hard problems. Two of properties of our results are: (i) For the first time, efficient approximation algorithms and schemes have been developed for natural NEXPTIME-complete problems. (ii) Our results are the first polynomial time approximation algorithms with good performance guarantees for hard problems specified using various kinds of periodic specifications considered in this paper.

  18. Approximate deconvolution models of turbulence analysis, phenomenology and numerical analysis

    CERN Document Server

    Layton, William J

    2012-01-01

    This volume presents a mathematical development of a recent approach to the modeling and simulation of turbulent flows based on methods for the approximate solution of inverse problems. The resulting Approximate Deconvolution Models or ADMs have some advantages over more commonly used turbulence models – as well as some disadvantages. Our goal in this book is to provide a clear and complete mathematical development of ADMs, while pointing out the difficulties that remain. In order to do so, we present the analytical theory of ADMs, along with its connections, motivations and complements in the phenomenology of and algorithms for ADMs.

  19. The restricted isometry property meets nonlinear approximation with redundant frames

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2013-01-01

    It is now well known that sparse or compressible vectors can be stably recovered from their low-dimensional projection, provided the projection matrix satisfies a Restricted Isometry Property (RIP). We establish new implications of the RIP with respect to nonlinear approximation in a Hilbert space...... with a redundant frame. The main ingredients of our approach are: a) Jackson and Bernstein inequalities, associated to the characterization of certain approximation spaces with interpolation spaces; b) a proof that for overcomplete frames which satisfy a Bernstein inequality, these interpolation spaces are nothing...

  20. Approximate Dynamic Programming Solving the Curses of Dimensionality

    CERN Document Server

    Powell, Warren B

    2011-01-01

    Praise for the First Edition "Finally, a book devoted to dynamic programming and written using the language of operations research (OR)! This beautiful book fills a gap in the libraries of OR specialists and practitioners."-Computing Reviews This new edition showcases a focus on modeling and computation for complex classes of approximate dynamic programming problems Understanding approximate dynamic programming (ADP) is vital in order to develop practical and high-quality solutions to complex industrial problems, particularly when those problems involve making decisions in the presence of unce

  1. Approximate Testing Equivalence Based on Time, Probability, and Observed Behavior

    Directory of Open Access Journals (Sweden)

    Alessandro Aldini

    2010-06-01

    Full Text Available Several application domains require formal but flexible approaches to the comparison problem. Different process models that cannot be related by behavioral equivalences should be compared via a quantitative notion of similarity, which is usually achieved through approximation of some equivalence. While in the literature the classical equivalence subject to approximation is bisimulation, in this paper we propose a novel approach based on testing equivalence. As a step towards flexibility and usability, we study different relaxations taking into account orthogonal aspects of the process observations: execution time, event probability, and observed behavior. In this unifying framework, both interpretation of the measures and decidability of the verification algorithms are discussed.

  2. Evaluation of Gaussian approximations for data assimilation in reservoir models

    KAUST Repository

    Iglesias, Marco A.

    2013-07-14

    The Bayesian framework is the standard approach for data assimilation in reservoir modeling. This framework involves characterizing the posterior distribution of geological parameters in terms of a given prior distribution and data from the reservoir dynamics, together with a forward model connecting the space of geological parameters to the data space. Since the posterior distribution quantifies the uncertainty in the geologic parameters of the reservoir, the characterization of the posterior is fundamental for the optimal management of reservoirs. Unfortunately, due to the large-scale highly nonlinear properties of standard reservoir models, characterizing the posterior is computationally prohibitive. Instead, more affordable ad hoc techniques, based on Gaussian approximations, are often used for characterizing the posterior distribution. Evaluating the performance of those Gaussian approximations is typically conducted by assessing their ability at reproducing the truth within the confidence interval provided by the ad hoc technique under consideration. This has the disadvantage of mixing up the approximation properties of the history matching algorithm employed with the information content of the particular observations used, making it hard to evaluate the effect of the ad hoc approximations alone. In this paper, we avoid this disadvantage by comparing the ad hoc techniques with a fully resolved state-of-the-art probing of the Bayesian posterior distribution. The ad hoc techniques whose performance we assess are based on (1) linearization around the maximum a posteriori estimate, (2) randomized maximum likelihood, and (3) ensemble Kalman filter-type methods. In order to fully resolve the posterior distribution, we implement a state-of-the art Markov chain Monte Carlo (MCMC) method that scales well with respect to the dimension of the parameter space, enabling us to study realistic forward models, in two space dimensions, at a high level of grid refinement. Our

  3. Approximate Solution of nth-Order Fuzzy Linear Differential Equations

    Directory of Open Access Journals (Sweden)

    Xiaobin Guo

    2013-01-01

    Full Text Available The approximate solution of nth-order fuzzy linear differential equations in which coefficient functions maintain the sign is investigated by the undetermined fuzzy coefficients method. The differential equations is converted to a crisp function system of linear equations according to the operations of fuzzy numbers. The fuzzy approximate solution of the fuzzy linear differential equation is obtained by solving the crisp linear equations. Some numerical examples are given to illustrate the proposed method. It is an extension of Allahviranloo's results.

  4. New Approximate Analytical Solutions of the Falkner-Skan Equation

    Directory of Open Access Journals (Sweden)

    Beong In Yun

    2012-01-01

    Full Text Available We propose an iterative method for solving the Falkner-Skan equation. The method provides approximate analytical solutions which consist of coefficients of the previous iterate solution. By some examples, we show that the presented method with a small number of iterations is competitive with the existing method such as Adomian decomposition method. Furthermore, to improve the accuracy of the proposed method, we suggest an efficient correction method. In practice, for some examples one can observe that the correction method results in highly improved approximate solutions.

  5. An Approximate Method for the Acoustic Attenuating VTI Eikonal Equation

    KAUST Repository

    Hao, Q.

    2017-05-26

    We present an approximate method to solve the acoustic eikonal equation for attenuating transversely isotropic media with a vertical symmetry axis (VTI). A perturbation method is used to derive the perturbation formula for complex-valued traveltimes. The application of Shanks transform further enhances the accuracy of approximation. We derive both analytical and numerical solutions to the acoustic eikonal equation. The analytic solution is valid for homogeneous VTI media with moderate anellipticity and strong attenuation and attenuation-anisotropy. The numerical solution is applicable for inhomogeneous attenuating VTI media.

  6. Fuzzy Approximate Model for Distributed Thermal Solar Collectors Control

    KAUST Repository

    Elmetennani, Shahrazed

    2014-07-01

    This paper deals with the problem of controlling concentrated solar collectors where the objective consists of making the outlet temperature of the collector tracking a desired reference. The performance of the novel approximate model based on fuzzy theory, which has been introduced by the authors in [1], is evaluated comparing to other methods in the literature. The proposed approximation is a low order state representation derived from the physical distributed model. It reproduces the temperature transfer dynamics through the collectors accurately and allows the simplification of the control design. Simulation results show interesting performance of the proposed controller.

  7. Polynomial Approximation on Unbounded Subsets and the Markov Moment Problem

    Directory of Open Access Journals (Sweden)

    Octav Olteanu

    2013-09-01

    Full Text Available We start this review paper by recalling some known and relatively recent results in polynomial approximation on unbounded subsets. These results allow approximation of nonnegative continuous functions with compact support contained in the first quadrant by sums of tensor products of positive polynomials in each separate variable, on the positive semiaxes. Consequently, we characterize the existence of solution of a two dimensional Markov moment problem in terms of products of quadratic forms. Secondly, one proves some applications of abstract results on the extension of linear operators with two constraints to the Markov moment problem. Two applications related to this last part are considered.

  8. A working-set framework for sequential convex approximation methods

    DEFF Research Database (Denmark)

    Stolpe, Mathias

    2008-01-01

    to guarantee global convergence of the method. The algorithm works directly on the nonlinear constraints in the convex sub-problems and solves a sequence of relaxations of the current sub-problem. The algorithm terminates with the optimal solution to the sub-problem after solving a finite number of relaxations.......We present an active-set algorithmic framework intended as an extension to existing implementations of sequential convex approximation methods for solving nonlinear inequality constrained programs. The framework is independent of the choice of approximations and the stabilization technique used...

  9. Multivariate statistics high-dimensional and large-sample approximations

    CERN Document Server

    Fujikoshi, Yasunori; Shimizu, Ryoichi

    2010-01-01

    A comprehensive examination of high-dimensional analysis of multivariate methods and their real-world applications Multivariate Statistics: High-Dimensional and Large-Sample Approximations is the first book of its kind to explore how classical multivariate methods can be revised and used in place of conventional statistical tools. Written by prominent researchers in the field, the book focuses on high-dimensional and large-scale approximations and details the many basic multivariate methods used to achieve high levels of accuracy. The authors begin with a fundamental presentation of the basic

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

    Energy Technology Data Exchange (ETDEWEB)

    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.

  11. Towards a characterization of constant-factor approximable Min CSPs.

    OpenAIRE

    Dalmau, Víctor; Krokhin, Andrei; Manokaran, Rajsekar

    2015-01-01

    We study the approximability of Minimum Constraint Satisfaction Problems (Min CSPs) with a fixed finite constraint language Γ on an arbitrary finite domain. The goal in such a problem is to minimize the number of unsatisfied constraints in a given instance of CSP(Γ). A recent result of Ene et al. says that, under the mild technical condition that Γ contains the equality relation, the basic LP relaxation is optimal for constant-factor approximation for Min CSP(Γ) unless the Unique Games Conjec...

  12. Approximating the exact value of an American option

    Directory of Open Access Journals (Sweden)

    Stefano Herzel

    2007-10-01

    Full Text Available An American option is a derivative security that can be exercised at any time before expiration. Under standard hypotheses it can be shown that its arbitrage-free price is the solution of an optimal stopping problem. Usually, if the underlying asset follows a diffusion, the stopping time problem does not have a closed form solution. Therefore, discrete time models have been proposed to determine an approximated solution. I formulate some conditions on the discrete process to insure convergence of the approximations to the exact value. I also show how to apply such conditions to check the correctness of some of the most popular discretization schemes.

  13. Sound propagation over ground: Analytical approximations and experimental results

    Science.gov (United States)

    Habault, D.

    1981-12-01

    Approximations of the sound field emitted by a point source in the presence of the ground have recently been developed [1]. In this paper, these analytical expressions, slightly improved for computation, are compared with an exact representation of the sound pressure and two kinds of experimental results. The approximations, easy to compute, provide a reasonable accuracy for predictions of the sound levels in the asymptotic and intermediate (preceding the asymptotic) regions. Furthermore, numerical techniques (an optimization method) are presented for obtaining the "best value" of the ground normal impedance, from data obtained in Kundt's tube and far field measurements.

  14. Interpolation and approximation by rational functions in the complex domain

    CERN Document Server

    Walsh, J L

    1935-01-01

    The present work is restricted to the representation of functions in the complex domain, particularly analytic functions, by sequences of polynomials or of more general rational functions whose poles are preassigned, the sequences being defined either by interpolation or by extremal properties (i.e. best approximation). Taylor's series plays a central role in this entire study, for it has properties of both interpolation and best approximation, and serves as a guide throughout the whole treatise. Indeed, almost every result given on the representation of functions is concerned with a generaliz

  15. Communication Complexity of Approximate Matching in Distributed Graphs

    DEFF Research Database (Denmark)

    Huang, Zengfeng; Radunović, Božidar; Vojnović, Milan

    matching in the input graph which has to be reported by one of the sites. We show a lower bound on the communication complexity ofΩ(α2kn) and show that it is tight up to poly-logarithmic factors. This lower bound also applies to other combinatorial problems on graphs in the message-passing computation......n this paper we consider the communication complexity of approximation algorithms for maximum matching in a graph in the message-passing model of distributed computation. The input graph consists of n vertices and edges partitioned over a set of k sites. The output is an α - approximate maximum...

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

    Directory of Open Access Journals (Sweden)

    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.

  17. On the approximation of crack shapes found during inservice inspection

    Energy Technology Data Exchange (ETDEWEB)

    Bhate, S.R.; Chawla, D.S.; Kushwaha, H.S. [Bhabha Atomic Research Centre, Bombay (India)] [and others

    1997-04-01

    This paper addresses the characterization of axial internal flaw found during inservice inspection of a pipe. J-integral distribution for various flaw shapes is obtained using line spring finite, element method. The peak J-value and its distribution across the crack is found to be characteristic feature of each shape. The triangular shape yields peak J-value away from the center, the point of depth. The elliptic approximation results in large overestimate of J-value for unsymmetric flaws. Triangular approximation is recommended for such flaws so that further service can be obtained from the component.

  18. Rotational and Helical Surface Approximation for Reverse Engineering

    DEFF Research Database (Denmark)

    Randrup, Thomas; Pottmann, Helmut

    1997-01-01

    to basic shapes used in computer aided design. The algorithms apply methods of line geometry to the set of surface normals in combination with techniques of numerical approximation. The presented results possess applications in reverse engineering and computer aided manufacturing.......Given a surface in 3-space or scattered points from a surface, we investigate the problem of deciding whether the data may be fitted well by a cylindrical surface, a surface of revolution or a helical surface. Furthermore, we show how to compute an approximating surface and put special emphasis...

  19. The restricted isometry property meets nonlinear approximation with redundant frames

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    It is now well known that sparse or compressible vectors can be stably recovered from their low-dimensional projection, provided the projection matrix satisfies a Restricted Isometry Property (RIP). We establish new implications of the RIP with respect to nonlinear approximation in a Hilbert spac...

  20. Matchsimile: A Flexible Approximate Matching Tool for Searching Proper Names.

    Science.gov (United States)

    Navarro, Gonzalo; Baeza-Yates, Ricardo; Arcoverde, Joao Marcelo Azevedo

    2003-01-01

    Presents the architecture and algorithms behind Matchsimile, an approximate string matching lookup tool designed for extracting person and company names from large texts. Highlights include name formation rules, defining the search problem, system architecture, recognizing pattern words, recognizing whole patterns, and performance. (Author/MES)

  1. Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.

    Science.gov (United States)

    Klarner, Hannes; Siebert, Heike

    2015-01-01

    This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks.

  2. Gluon transport equations with condensate in the small angle approximation

    Energy Technology Data Exchange (ETDEWEB)

    Blaizot, Jean-Paul [Institut de Physique Théorique (IPhT), CNRS/URA2306, CEA Saclay, F-91191 Gif-sur-Yvette (France); Liao, Jinfeng [Physics Department and Center for Exploration of Energy and Matter, Indiana University, 2401 N Milo B. Sampson Lane, Bloomington, IN 47408 (United States); RIKEN BNL Research Center, Bldg. 510A, Brookhaven National Laboratory, Upton, NY 11973 (United States)

    2016-05-15

    We derive the set of kinetic equations that control the evolution of gluons in the presence of a condensate. We show that the dominant singularities remain logarithmic when the scattering involves particles in the condensate. This allows us to define a consistent small angle approximation.

  3. Error Analysis on Plane-to-Plane Linear Approximate Coordinate ...

    Indian Academy of Sciences (India)

    c Indian Academy of Sciences. Error Analysis on Plane-to-Plane Linear Approximate Coordinate. Transformation. Q. F. Zhang1,∗, Q. Y. Peng1 & J. H. Fan2. 1Department of Computer Science, Jinan University, Guangzhou 510632, China. ... This work is partially supported by the National Natural Science Foundation.

  4. A Statistical Mechanics Approach to Approximate Analytical Bootstrap Averages

    DEFF Research Database (Denmark)

    Malzahn, Dorthe; Opper, Manfred

    2003-01-01

    We apply the replica method of Statistical Physics combined with a variational method to the approximate analytical computation of bootstrap averages for estimating the generalization error. We demonstrate our approach on regression with Gaussian processes and compare our results with averages...

  5. Exact and approximate probabilistic symbolic execution for nondeterministic programs

    DEFF Research Database (Denmark)

    Luckow, Kasper Søe; Păsăreanu, Corina S.; Dwyer, Matthew B.

    2014-01-01

    introduce approximate algorithms to search for good schedulers, speeding up established random sampling and reinforcement learning results through the quantification of path probabilities based on symbolic execution. We implemented the techniques in Symbolic PathFinder and evaluated them on nondeterministic...

  6. Runge approximation on convex sets implies the Oka property

    OpenAIRE

    Forstneric, Franc

    2004-01-01

    We prove that the classical Oka property of a complex manifold Y, concerning the existence and homotopy classification of holomorphic mappings from Stein manifolds to Y, is equivalent to a Runge approximation property for holomorphic maps from compact convex sets in Euclidean spaces to Y.

  7. Approximations for the direct correlation function in multicomponent molecular fluids

    Science.gov (United States)

    Chamoux, A.; Perera, A.

    1996-01-01

    Analytical approximations for the pair direct correlation function (DCF) of molecular fluids and their mixtures are derived within the frame of a new formalism based on weighted density functional methods which represents a generalization of Rosenfeld theory for hard spheres mixtures [J. Chem. Phys. 89, 4271 (1988)]. These approximations rest upon the geometrical properties of individual molecules such as the volume, the surface, and the mean radius. They are Percus-Yevick (PY) like in nature and reduce to the analytical PY solution for DCF in the hard sphere case. By construction the approximations incorporate several interesting features: They yield the Mayer function in the low density limit as expected, and they are anisotropic at zero separation as well as at contact. In addition they predict an orientational instability of the isotropic phase with respect to the nematic phase, a feature that is absent from the Percus-Yevick theory. Comparisons are made with the Percus-Yevick numerical results for the DCF for various convex hard bodies such as hard ellipsoids of revolutions (prolate and oblate), prolate spherocylinders, cutspheres, and generally the agreement is very good for a large range of liquid densities. Analytical expressions for the virial and compressibility routes for the pressures are also given. The results obtained for a large varieties of convex bodies are in very good agreement with corresponding numerical Percus-Yevick results. These approximations can be generalized to inhomogeneous systems in a straightforward manner.

  8. Approximate number sense correlates with math performance in gifted adolescents.

    Science.gov (United States)

    Wang, Jinjing Jenny; Halberda, Justin; Feigenson, Lisa

    2017-05-01

    Nonhuman animals, human infants, and human adults all share an Approximate Number System (ANS) that allows them to imprecisely represent number without counting. Among humans, people differ in the precision of their ANS representations, and these individual differences have been shown to correlate with symbolic mathematics performance in both children and adults. For example, children with specific math impairment (dyscalculia) have notably poor ANS precision. However, it remains unknown whether ANS precision contributes to individual differences only in populations of people with lower or average mathematical abilities, or whether this link also is present in people who excel in math. Here we tested non-symbolic numerical approximation in 13- to 16-year old gifted children enrolled in a program for talented adolescents (the Center for Talented Youth). We found that in this high achieving population, ANS precision significantly correlated with performance on the symbolic math portion of two common standardized tests (SAT and ACT) that typically are administered to much older students. This relationship was robust even when controlling for age, verbal performance, and reaction times in the approximate number task. These results suggest that the Approximate Number System is linked to symbolic math performance even at the top levels of math performance. Copyright © 2017 Elsevier B.V. All rights reserved.

  9. Approximate Range Emptiness in Constant Time and Optimal Space

    DEFF Research Database (Denmark)

    Goswami, Mayank; Jørgensen, Allan Grønlund; Larsen, Kasper Green

    2015-01-01

    that the query time can be improved greatly, to constant time, while matching our space lower bound up to a lower order additive term. This result is achieved through a succinct data structure for (non-approximate 1d) range emptiness/reporting queries, which may be of independent interest....

  10. Embedding relations connected with strong approximation of Fourier ...

    Indian Academy of Sciences (India)

    Embedding relations connected with strong approximation of Fourier series. BOGDAN SZAL. Faculty of Mathematics, Computer Science and Econometrics,. University of Zielona Góra, 65-516 Zielona Góra, ul. Szafrana 4a, Poland. E-mail: B.Szal@wmie.uz.zgora.pl. MS received 5 May 2010; revised 8 June 2010. Abstract.

  11. On the Purcell effect beyond the dipole approximation

    DEFF Research Database (Denmark)

    Kristensen, Philip Trøst; Mortensen, Jakob Egeberg; Lodahl, Peter

    2012-01-01

    We investigate spontaneous emission from excitons in quantum dots beyond the dipole approximation and show how the symmetry of the exciton wavefunction plays a crucial role. We show explicitly that for spherically symmetric excitons, the Purcell effect is independent of the exciton size and is go...... to the physics of mesoscopic emitters as well as great simplifications in practical calculations....

  12. The Zeldovich & Adhesion approximations and applications to the local universe

    NARCIS (Netherlands)

    Hidding, Johan; van de Weygaert, Rien; Shandarin, Sergei

    2016-01-01

    The Zeldovich approximation (ZA) predicts the formation of a web of singularities. While these singularities may only exist in the most formal interpretation of the ZA, they provide a powerful tool for the analysis of initial conditions. We present a novel method to find the skeleton of the

  13. Designing quantum information processing via structural physical approximation.

    Science.gov (United States)

    Bae, Joonwoo

    2017-10-01

    In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of quantum mechanics is more restrictive than classical systems, identified to a specific form of dynamics, that is, unitary transformations and, consequently, positive and completely positive maps to subsystems. This also characterizes classes of disallowed transformations on quantum systems, among which positive but not completely maps are of particular interest as they characterize entangled states, a general resource in quantum information processing. Structural physical approximation offers a systematic way of approximating those non-physical maps, positive but not completely positive maps, with quantum channels. Since it has been proposed as a method of detecting entangled states, it has stimulated fundamental problems on classifications of positive maps and the structure of Hermitian operators and quantum states, as well as on quantum measurement such as quantum design in quantum information theory. It has developed efficient and feasible methods of directly detecting entangled states in practice, for which proof-of-principle experimental demonstrations have also been performed with photonic qubit states. Here, we present a comprehensive review on quantum information processing with structural physical approximations and the related progress. The review mainly focuses on properties of structural physical approximations and their applications toward practical information applications.

  14. Protected State Transfer via an Approximate Quantum Adder.

    Science.gov (United States)

    Gatti, G; Barberena, D; Sanz, M; Solano, E

    2017-07-31

    We propose a decoherence protected protocol for sending single photon quantum states through depolarizing channels. This protocol is implemented via an approximate quantum adder engineered through spontaneous parametric down converters, and shows higher success probability than distilled quantum teleportation protocols for distances below a threshold depending on the properties of the channel.

  15. Calculating Resonance Positions and Widths Using the Siegert Approximation Method

    Science.gov (United States)

    Rapedius, Kevin

    2011-01-01

    Here, we present complex resonance states (or Siegert states) that describe the tunnelling decay of a trapped quantum particle from an intuitive point of view that naturally leads to the easily applicable Siegert approximation method. This can be used for analytical and numerical calculations of complex resonances of both the linear and nonlinear…

  16. Cost versus Precision for Approximate Typing for Python

    NARCIS (Netherlands)

    Fritz, Levin; Hage, J|info:eu-repo/dai/nl/229637221

    2014-01-01

    In this paper we describe a variation of monotone frameworks that enables us to perform approximate typing of Python, in particular for dealing with some of its more dynamic features such as first-class functions and Python’s dynamic class system. We additionally introduce a substantial number of

  17. Structure Approximation of Most Probable Explanations in Bayesian Networks

    NARCIS (Netherlands)

    Kwisthout, J.H.P.

    2013-01-01

    Typically, when one discusses approximation algorithms for (NP-hard) problems (like Traveling Salesperson, Vertex Cover, Knapsack), one refers to algorithms that return a solution whose value is (at least ideally) close to optimal; e.g., a tour with almost minimal length, a vertex cover of size just

  18. Finite Gaussian Mixture Approximations to Analytically Intractable Density Kernels

    DEFF Research Database (Denmark)

    Khorunzhina, Natalia; Richard, Jean-Francois

    The objective of the paper is that of constructing finite Gaussian mixture approximations to analytically intractable density kernels. The proposed method is adaptive in that terms are added one at the time and the mixture is fully re-optimized at each step using a distance measure that approxima...

  19. On the Metric-Based Approximate Minimization of Markov Chains

    DEFF Research Database (Denmark)

    Bacci, Giovanni; Bacci, Giorgio; Larsen, Kim Guldstrand

    2017-01-01

    We address the behavioral metric-based approximate minimization problem of Markov Chains (MCs), i.e., given a finite MC and a positive integer k, we are interested in finding a k-state MC of minimal distance to the original. By considering as metric the bisimilarity distance of Desharnais at al...

  20. Iterative linear system solvers with approximate matrix-vector products

    NARCIS (Netherlands)

    Eshof, J. van den; Sleijpen, G.L.G.; Gijzen, M.B. van

    2003-01-01

    There are classes of linear problems for which a matrix-vector product is a time consuming operation because an expensive approximation method is required to compute it to a given accuracy. One important example is simulations in lattice QCD with Neuberger fermions where a matrix multiply

  1. Analytical approximations for stick-slip vibration amplitudes

    DEFF Research Database (Denmark)

    Thomsen, Jon Juel; Fidlin, A.

    2003-01-01

    The classical "mass-on-moving-belt" model for describing friction-induced vibrations is considered, with a friction law describing friction forces that first decreases and then increases smoothly with relative interface speed. Approximate analytical expressions are derived for the conditions...

  2. Thermalization in a Hartree ensemble approximation to quantum field dynamics

    NARCIS (Netherlands)

    Sallé, M.; Smit, J.; Vink, J.C.

    2001-01-01

    For homogeneous initial conditions, Hartree (gaussian) dynamical approximations are known to have problems with thermalization, because of insufficient scattering. We attempt to improve on this by writing an arbitrary density matrix as a superposition of gaussian pure states and applying the Hartree

  3. Approximations to the time evolution of an Izhikevich neuron

    Science.gov (United States)

    Romeo, August; Supèr, Hans

    2014-04-01

    Possible ways of obtaining information about the solutions of Izhikevich's "simple model" for a spiking neuron are considered. The method of power series in time is reviewed. From a different viewpoint, in the case of constant input and weak recovery scale effects, advantage is taken of a small-parameter expansion. The obtained approximations can be expressed in terms of elementary functions.

  4. Is Approximate Number Precision a Stable Predictor of Math Ability?

    Science.gov (United States)

    Libertus, Melissa E.; Feigenson, Lisa; Halberda, Justin

    2013-01-01

    Previous research shows that children's ability to estimate numbers of items using their Approximate Number System (ANS) predicts later math ability. To more closely examine the predictive role of early ANS acuity on later abilities, we assessed the ANS acuity, math ability, and expressive vocabulary of preschoolers twice, six months apart. We…

  5. Two Efficient Techniques to Find Approximate Overlaps between Sequences

    Directory of Open Access Journals (Sweden)

    Maan Haj Rachid

    2017-01-01

    Full Text Available The next-generation sequencing (NGS technology outputs a huge number of sequences (reads that require further processing. After applying prefiltering techniques in order to eliminate redundancy and to correct erroneous reads, an overlap-based assembler typically finds the longest exact suffix-prefix match between each ordered pair of the input reads. However, another trend has been evolving for the purpose of solving an approximate version of the overlap problem. The main benefit of this direction is the ability to skip time-consuming error-detecting techniques which are applied in the prefiltering stage. In this work, we present and compare two techniques to solve the approximate overlap problem. The first adapts a compact prefix tree to efficiently solve the approximate all-pairs suffix-prefix problem, while the other utilizes a well-known principle, namely, the pigeonhole principle, to identify a potential overlap match in order to ultimately solve the same problem. Our results show that our solution using the pigeonhole principle has better space and time consumption over an FM-based solution, while our solution based on prefix tree has the best space consumption between all three solutions. The number of mismatches (hamming distance is used to define the approximate matching between strings in our work.

  6. Iterative algorithms to approximate canonieal Gabor windows: Computational aspects

    DEFF Research Database (Denmark)

    Janssen, A. J. E. M.; Søndergaard, Peter Lempel

    2007-01-01

    In this article we investigate the computational aspects of some recently proposed iterative methods for approximating the canonical tight and canonical dual window of a Gabor frame (g, a, b). The iterations start with the window g while the iteration steps comprise the window g, the k(th) iteran...

  7. On a mixed Khintchine problem in Diophantine approximation

    DEFF Research Database (Denmark)

    Harrap, Stephen George; Yusupova, Tatiana

    2013-01-01

    We establish a `mixed' version of a fundamental theorem of Khintchine within the field of simultaneous Diophantine approximation. Via the notion of ubiquity we are able to make significant progress towards the completion of the metric theory associated with mixed problems in this setting. This in...

  8. Smooth approximation of data on the sphere with splines

    NARCIS (Netherlands)

    Traas, C.R.

    1987-01-01

    A computable function, defined over the sphere, is constructed, which is of classC1 at least and which approximates a given set of data. The construction is based upon tensor product spline basisfunctions, while at the poles of the spherical system of coordinates modified basisfunctions, suggested

  9. An approximation algorithm for the Wireless Gathering Problem

    NARCIS (Netherlands)

    V. Bonifaci; P. Korteweg; A. Marchetti Spaccamela (Alberto); L. Stougie (Leen)

    2008-01-01

    htmlabstractThe Wireless Gathering Problem is to find an interference-free schedule for data gathering in a wireless network in minimum time. We present a 4-approximate polynomial-time on-line algorithm for this NP-hard problem. We show that no shortest path following algorithm can have an

  10. A new approximation algorithm for the multilevel facility location problem

    NARCIS (Netherlands)

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

    2010-01-01

    In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP-rounding. The linear program that we use has a polynomial number of variables and constraints, thus being more efficient than the one commonly

  11. A new approximate sum rule for bulk alloy properties

    Science.gov (United States)

    Bozzolo, Guillermo; Ferrante, John

    1992-01-01

    A new, approximate sum rule is introduced for determining bulk properties of multicomponent systems, in terms of the pure components properties. This expression is applied for the study of lattice parameters, cohesive energies, and bulk moduli of binary alloys. The correct experimental trends (i.e., departure from average values) are predicted in all cases.

  12. evaluation of approximate design procedures for biaxially loaded ...

    African Journals Online (AJOL)

    testing the validity of the /3-n charts and presenting tbe approximate procedure for the design of biaxially loaded columns according to the ACI. For rectangular cross-sections with equal relative cover ratios and doubly symmetric reinforcement pattern, the relative uniaxial moment capacities are equal. Thus letting muy = mu, ...

  13. Approximation by modified Szasz–Mirakjan operators on weighted ...

    Indian Academy of Sciences (India)

    R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22

    English translation in Math. Notes 20(5–6) (1976) 996–998. [3] Gadzhiev A D, Positive linear operators in weighted spaces of functions of several vari- ables, Izv. Akad. Nauk. SSR Ser. Fiz-Tekhn. Math. Nauk 4 (1980) 32–37. [4] Gadzhiev A D, Weighted approximation of continuous functions by linear operators on the whole ...

  14. Small-network approximations for geometrically frustrated Ising systems.

    Science.gov (United States)

    Zhuang, Bilin; Lannert, Courtney

    2012-03-01

    The study of frustrated spin systems often requires time-consuming numerical simulations. As the simplest approach, the classical Ising model is often used to investigate the thermodynamic behavior of such systems. Exploiting the small correlation lengths in frustrated Ising systems, we develop a method for obtaining first approximations to the energetic properties of frustrated two-dimensional Ising systems using small networks of less than 30 spins. These small networks allow much faster numerical simulations, and more importantly, analytical evaluations of their properties are numerically tractable. We choose Ising systems on the triangular lattice, the kagome lattice, and the triangular kagome lattice as prototype systems and find small systems that can serve as good approximations to these prototype systems. Through comparisons between the properties of extended models and small systems, we develop a set of criteria for constructing small networks to approximate general infinite two-dimensional frustrated Ising systems. This method of using small networks provides a different and efficient way to obtain a first approximation to the properties of frustrated spin systems.

  15. 36 CFR 254.11 - Exchanges at approximately equal value.

    Science.gov (United States)

    2010-07-01

    ... attributes; and (4) There are no significant elements of value requiring complex analysis. (b) The authorized... equal value. 254.11 Section 254.11 Parks, Forests, and Public Property FOREST SERVICE, DEPARTMENT OF AGRICULTURE LANDOWNERSHIP ADJUSTMENTS Land Exchanges § 254.11 Exchanges at approximately equal value. (a) The...

  16. Deviations from the local field approximation in negative streamer heads,

    NARCIS (Netherlands)

    C. Li (Chao); W.J.M. Brok; U. Ebert (Ute); J.J.A.M. van der Mullen

    2007-01-01

    htmlabstractNegative streamer ionization fronts in nitrogen under normal conditions are investigated both in a particle model and in a fluid model in local field approximation. The parameter functions for the fluid model are derived from swarm experiments in the particle model. The front structure

  17. Validity of PEC Approximation for On-Body Propagation

    DEFF Research Database (Denmark)

    Kammersgaard, Nikolaj Peter Iversen; Kvist, Søren Helstrup; Thaysen, Jesper

    2016-01-01

    Many articles on on-body propagation assumes that the human body can be approximated by a perfect electric conductor (PEC) instead of the actual constitutive parameters of the human body, which is that of a lossy dielectric. This assumption is investigated in this article through comparison...

  18. approximate controllability of a non-autonomous differential equation

    Indian Academy of Sciences (India)

    53

    Abstract. In this paper, we establish the approximate controllability results for a non-autonomous functional differential equation using the theory of linear evolution system, Schauder fixed point theorem, and by making use of resolvent operators. The obtained results in the paper, improve the existing ones in this direction, up ...

  19. Approximate furthest neighbor with application to annulus query

    DEFF Research Database (Denmark)

    Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen

    2016-01-01

    -dimensional Euclidean space. The method builds on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk׳s approximation factor and reducing the running time by a logarithmic factor. We also present...

  20. Approximate Solutions of Interactive Dynamic Influence Diagrams Using Model Clustering

    DEFF Research Database (Denmark)

    Zeng, Yifeng; Doshi, Prashant; Qiongyu, Cheng

    2007-01-01

    of the other agents, which increase exponentially with the number of time steps. We present a method of solving I-DIDs approximately by limiting the number of other agents' candidate models at each time step to a constant. We do this by clustering the models and selecting a representative set from the clusters...

  1. Topology optimization for free vibrations using combined approximations

    DEFF Research Database (Denmark)

    Bogomolny, Michael

    2010-01-01

    This study shows how the Combined Approximations (CA) can be used for reducing the computational effort in Topology Optimization for free vibrations. The previously developed approach is based on the integration of several concepts and methods, including matrix factorization, series expansion...

  2. On approximation of Lie groups by discrete subgroups

    Indian Academy of Sciences (India)

    voila.fr; salah.suissi@yahoo.fr. MS received 11 August 2012; revised 27 January 2013. Abstract. A locally compact group G is said to be approximated by discrete sub- groups (in the sense of Tôyama) if there is a sequence of discrete subgroups ...

  3. An approximate Fourier transform useful in quantum factoring

    OpenAIRE

    Coppersmith, D

    2002-01-01

    We define an approximate version of the Fourier transform on $2^L$ elements, which is computationally attractive in a certain setting, and which may find application to the problem of factoring integers with a quantum computer as is currently under investigation by Peter Shor. (1994 IBM Internal Report)

  4. a generalisation of an approximate method to calculate inbreeding ...

    African Journals Online (AJOL)

    Where, Ais a common ancestor of the parents of. X; n is the number of generations from the sire of X to A and n' the number of generations from the dam of X to A. Subsequently, Wright & McPhee (1925) developed a method for calculating an approximate inbreeding co- efficient from a pedigree which is completed for only.

  5. Moving boundary approximation for curved streamer ionization fronts: solvability analysis

    NARCIS (Netherlands)

    F. Brau (Fabian); B. Davidovitch; U. Ebert (Ute)

    2008-01-01

    textabstractThe minimal density model for negative streamer ionization fronts is investigated. An earlier moving boundary approximation for this model consisted of a “kinetic undercooling” type boundary condition in a Laplacian growth problem of Hele-Shaw type. Here we derive a curvature

  6. Circuit with a successive approximation analog to digital converter

    NARCIS (Netherlands)

    Louwsma, S.M.; Vertregt, Maarten

    2011-01-01

    During successive approximation analog to digital conversion a series of successive digital reference values is selected that converges towards a digital representation of an analog input signal. An analog reference signal is generated dependent on the successive digital reference values and

  7. Circuit with a successive approximation analog to digital converter

    NARCIS (Netherlands)

    Louwsma, S.M.; Vertregt, Maarten

    2010-01-01

    During successive approximation analog to digital conversion a series of successive digital reference values is selected that converges towards a digital representation of an analog input signal. An analog reference signal is generated dependent on the successive digital reference values and

  8. Approximating the average stretch factor of geometric graphs

    Directory of Open Access Journals (Sweden)

    Siu-Wing Cheng

    2012-07-01

    Full Text Available Let G be a geometric graph whose vertex set S is a set of n points in ℝd. The stretch factor of two distinct points p and q in S is the ratio of their shortest-path distance in G and their Euclidean distance. We consider the problem of approximating the average of the n choose 2 stretch factors determined by all pairs of points in S. We show that for paths, cycles, and trees, this average can be approximated, within a factor of 1+ε, in O(n polylog(n time. For plane graphs in ℝ2, we present a (2+ε-approximation algorithm with running time O(n5/3polylog(n, and a (4+ε-approximation algorithm with running time O(n3/2polylog(n. Finally, we show that, for any tree in ℝ2, the exact average of the squares of the n choose 2 stretch factors can be computed in O(n11/6 time.

  9. Efficient Approximation of Optimal Control for Markov Games

    DEFF Research Database (Denmark)

    Fearnley, John; Rabe, Markus; Schewe, Sven

    2011-01-01

    We study the time-bounded reachability problem for continuous-time Markov decision processes (CTMDPs) and games (CTMGs). Existing techniques for this problem use discretisation techniques to break time into discrete intervals, and optimal control is approximated for each interval separately...

  10. Approximate semantic matching of music classes on the internet

    NARCIS (Netherlands)

    Aleksovski, Zharko; Kate, Warner Ten; Van Harmelen, Frank

    2006-01-01

    We address the problem of semantic matching, which concerns the search for semantic agreement between heterogeneous concept hierarchies. We propose a new approximation method to discover and assess the "strength" (preciseness) of a semantic match between concepts from two such concept hierarchies.

  11. Generalizing the Boussinesq approximation to stratified compressible flow

    Science.gov (United States)

    Durran, Dale R.; Arakawa, Akio

    2007-09-01

    The simplifications required to apply the Boussinesq approximation to compressible flow are compared with those in an incompressible fluid. The larger degree of approximation required to describe mass conservation in a stratified compressible fluid using the Boussinesq continuity equation has led to the development of several different sets of 'anelastic' equations that may be regarded as generalizations of the original Boussinesq approximation. These anelastic systems filter sound waves while allowing a more accurate representation of non-acoustic perturbations in compressible flows than can be obtained using the Boussinesq system. The energy conservation properties of several anelastic systems are compared under the assumption that the perturbations of the thermodynamic variables about a hydrostatically balanced reference state are small. The 'pseudo-incompressible' system is shown to conserve total kinetic and anelastic dry static energy without requiring modification to any governing equation except the mass continuity equation. In contrast, other energy conservative anelastic systems also require additional approximations in other governing equations. The pseudo-incompressible system includes the effects of temperature changes on the density in the mass conservation equation, whereas this effect is neglected in other anelastic systems. A generalization of the pseudo-incompressible equation is presented and compared with the diagnostic continuity equation for quasi-hydrostatic flow in a transformed coordinate system in which the vertical coordinate is solely a function of pressure. To cite this article: D.R. Durran, A. Arakawa, C. R. Mecanique 335 (2007).

  12. A new approximation algorithm for the multilevel facility location problem

    NARCIS (Netherlands)

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

    2007-01-01

    In this paper we propose a new integer programming formulation for the multi-level facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear program we are using has a polynomial number of variables and constraints, being thus more efficient than the one

  13. Motion Planning for a Wheeled Robot (Kinematic Approximation)

    Science.gov (United States)

    Larin, V. B.

    2005-02-01

    The motion-planning problem for a wheeled robot is solved in kinematic approximation. The solution is given for robots with one and two steering wheels. The results of solving the problem for a specific system are compared with the results obtained by other authors

  14. Page 1 Stochastic approximation algorithms. Overview and recent ...

    Indian Academy of Sciences (India)

    Control 34:377-397. Puterman M. 1994 Markov decision processes (New York: John Wiley). Rachev S, Ruschendorf L 1995 Probability metrics and recursive algorithms. Adv. Appl. Probab. 27: 770-799. Ripley B 1987 Stochastic simulation (New York: John Wiley). Robbins H, Monro 1951 A stochastic approximation method.

  15. An improved numerical approximation for the first derivative

    Indian Academy of Sciences (India)

    The traditional numerical computation of the first derivative '() of a given function () of a single argument by central differencing is known to involve aspects of both accuracy and precision. By analysing both we arrive at an algorithm that closely approximates the most accurate answer obtainable by this method, ...

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

    Indian Academy of Sciences (India)

    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(ii) a bottom ...

  17. Designing quantum information processing via structural physical approximation

    Science.gov (United States)

    Bae, Joonwoo

    2017-10-01

    In quantum information processing it may be possible to have efficient computation and secure communication beyond the limitations of classical systems. In a fundamental point of view, however, evolution of quantum systems by the laws of quantum mechanics is more restrictive than classical systems, identified to a specific form of dynamics, that is, unitary transformations and, consequently, positive and completely positive maps to subsystems. This also characterizes classes of disallowed transformations on quantum systems, among which positive but not completely maps are of particular interest as they characterize entangled states, a general resource in quantum information processing. Structural physical approximation offers a systematic way of approximating those non-physical maps, positive but not completely positive maps, with quantum channels. Since it has been proposed as a method of detecting entangled states, it has stimulated fundamental problems on classifications of positive maps and the structure of Hermitian operators and quantum states, as well as on quantum measurement such as quantum design in quantum information theory. It has developed efficient and feasible methods of directly detecting entangled states in practice, for which proof-of-principle experimental demonstrations have also been performed with photonic qubit states. Here, we present a comprehensive review on quantum information processing with structural physical approximations and the related progress. The review mainly focuses on properties of structural physical approximations and their applications toward practical information applications.

  18. On the mathematical treatment of the Born-Oppenheimer approximation

    Energy Technology Data Exchange (ETDEWEB)

    Jecko, Thierry, E-mail: thierry.jecko@u-cergy.fr [AGM, UMR 8088 du CNRS, Université de Cergy-Pontoise, Département de mathématiques, site de Saint Martin, 2 avenue Adolphe Chauvin, F-95000 Pontoise (France)

    2014-05-15

    Motivated by the paper by Sutcliffe and Woolley [“On the quantum theory of molecules,” J. Chem. Phys. 137, 22A544 (2012)], we present the main ideas used by mathematicians to show the accuracy of the Born-Oppenheimer approximation for molecules. Based on mathematical works on this approximation for molecular bound states, in scattering theory, in resonance theory, and for short time evolution, we give an overview of some rigorous results obtained up to now. We also point out the main difficulties mathematicians are trying to overcome and speculate on further developments. The mathematical approach does not fit exactly to the common use of the approximation in Physics and Chemistry. We criticize the latter and comment on the differences, contributing in this way to the discussion on the Born-Oppenheimer approximation initiated by Sutcliffe and Woolley. The paper neither contains mathematical statements nor proofs. Instead, we try to make accessible mathematically rigourous results on the subject to researchers in Quantum Chemistry or Physics.

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

    Indian Academy of Sciences (India)

    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.

  20. Approximate counting with m counters: A probabilistic analysis

    Directory of Open Access Journals (Sweden)

    Guy Louchard

    2015-09-01

    Full Text Available Motivated by a recent paper by Cichoń and Macyna [1], who introduced m counters (instead of just one in the approximate counting scheme first analysed by Flajolet [2], we analyse the moments of the sum of the m counters, using techniques that proved to be successful already in several other contexts [11].

  1. The κ-Generalizations of Stirling Approximation and Multinominal Coefficients

    Directory of Open Access Journals (Sweden)

    Tatsuaki Wada

    2013-11-01

    Full Text Available Stirling approximation of the factorials and multinominal coefficients are generalized based on the κ-generalized functions introduced by Kaniadakis. We have related the κ-generalized multinominal coefficients to the κ-entropy by introducing a new κ-product operation, which exists only when κ ≠ 0.

  2. Fourier Series Approximations to J2-Bounded Equatorial Orbits

    Directory of Open Access Journals (Sweden)

    Wei Wang

    2014-01-01

    Full Text Available The current paper offers a comprehensive dynamical analysis and Fourier series approximations of J2-bounded equatorial orbits. The initial conditions of heterogeneous families of J2-perturbed equatorial orbits are determined first. Then the characteristics of two types of J2-bounded orbits, namely, pseudo-elliptic orbit and critical circular orbit, are studied. Due to the ambiguity of the closed-form solutions which comprise the elliptic integrals and Jacobian elliptic functions, showing little physical insight into the problem, a new scheme, termed Fourier series expansion, is adopted for approximation herein. Based on least-squares fitting to the coefficients, the solutions are expressed with arbitrary high-order Fourier series, since the radius and the flight time vary periodically as a function of the polar angle. As a consequence, the solutions can be written in terms of elementary functions such as cosines, rather than complex mathematical functions. Simulations enhance the proposed approximation method, showing bounded and negligible deviations. The approximation results show a promising prospect in preliminary orbits design, determination, and transfers for low-altitude spacecrafts.

  3. The EOF method applied to approximate the atmospheric aerosol PSD

    NARCIS (Netherlands)

    Kusmierczyk-Michulec J.T.

    2008-01-01

    Examples of the approximation of the aerosol size distributions with EOFs are given here by using data from a set of 2449 aerosol size distribution profiles measured during the Rough Evaporation Duck (RED) experiment that took place off Oahu, Hawaii, from 26 August to 15 September 2001. The

  4. Understanding operational risk capital approximations: First and second orders

    Directory of Open Access Journals (Sweden)

    Gareth W. Peters

    2013-07-01

    Full Text Available We set the context for capital approximation within the framework of the Basel II / III regulatory capital accords. This is particularly topical as the Basel III accord is shortly due to take effect. In this regard, we provide a summary of the role of capital adequacy in the new accord, highlighting along the way the significant loss events that have been attributed to the Operational Risk class that was introduced in the Basel II and III accords. Then we provide a semi-tutorial discussion on the modelling aspects of capital estimation under a Loss Distributional Approach (LDA. Our emphasis is to focuss on the important loss processes with regard to those that contribute most to capital, the so called “high consequence, low frequency" loss processes. This leads us to provide a tutorial overview of heavy tailed loss process modelling in OpRisk under Basel III, with discussion on the implications of such tail assumptions for the severity model in an LDA structure. This provides practitioners with a clear understanding of the features that they may wish to consider when developing OpRisk severity models in practice. From this discussion on heavy tailed severity models, we then develop an understanding of the impact such models have on the right tail asymptotics of the compound loss process and we provide detailed presentation of what are known as first and second order tail approximations for the resulting heavy tailed loss process. From this we develop a tutorial on three key families of risk measures and their equivalent second order asymptotic approximations: Value-at-Risk (Basel III industry standard; Expected Shortfall (ES and the Spectral Risk Measure. These then form the capital approximations. We then provide a few example case studies to illustrate the accuracy of these asymptotic captial approximations, the rate of the convergence of the assymptotic result as a function of the LDA frequency and severity model parameters, the sensitivity

  5. Quantum Calisthenics: Gaussians, The Path Integral and Guided Numerical Approximations

    Energy Technology Data Exchange (ETDEWEB)

    Weinstein, Marvin; /SLAC

    2009-02-12

    It is apparent to anyone who thinks about it that, to a large degree, the basic concepts of Newtonian physics are quite intuitive, but quantum mechanics is not. My purpose in this talk is to introduce you to a new, much more intuitive way to understand how quantum mechanics works. I begin with an incredibly easy way to derive the time evolution of a Gaussian wave-packet for the case free and harmonic motion without any need to know the eigenstates of the Hamiltonian. This discussion is completely analytic and I will later use it to relate the solution for the behavior of the Gaussian packet to the Feynman path-integral and stationary phase approximation. It will be clear that using the information about the evolution of the Gaussian in this way goes far beyond what the stationary phase approximation tells us. Next, I introduce the concept of the bucket brigade approach to dealing with problems that cannot be handled totally analytically. This approach combines the intuition obtained in the initial discussion, as well as the intuition obtained from the path-integral, with simple numerical tools. My goal is to show that, for any specific process, there is a simple Hilbert space interpretation of the stationary phase approximation. I will then argue that, from the point of view of numerical approximations, the trajectory obtained from my generalization of the stationary phase approximation specifies that subspace of the full Hilbert space that is needed to compute the time evolution of the particular state under the full Hamiltonian. The prescription I will give is totally non-perturbative and we will see, by the grace of Maple animations computed for the case of the anharmonic oscillator Hamiltonian, that this approach allows surprisingly accurate computations to be performed with very little work. I think of this approach to the path-integral as defining what I call a guided numerical approximation scheme. After the discussion of the anharmonic oscillator I will

  6. Approximate energy expression for spin-polarized Fermi liquids

    CERN Document Server

    Takano, M; Endo, T; Kimura, R

    2003-01-01

    An approximate energy expression is proposed for arbitrarily spin-polarized Fermi liquids with central two-body forces. It is explicitly expression as a functional of spin-dependent radial distribution functions and can be used conveniently in the variational method. It includes the potential energies completely and the kinetic energies up to main parts of the three-body cluster terms. This approximation is similar to that used previously for spin-unpolarized and fully polarized matter. A notable feature of this expressed is that it guarantees the necessary conditions on arbitrarily spin-polarized structure functions automatically. The Euler-Lagrange equations are derived from this energy expression and are numerically solved for arbitrarily spin-polarized liquid sup 3 He. The results for liquid sup 3 He with the HFDHE2 potential are consistent with the nearly ferromagnetic property. (author)

  7. 5th International Conference on Algorithms for Approximation

    CERN Document Server

    Levesley, Jeremy

    2007-01-01

    Approximation methods are vital in many challenging applications of computational science and engineering. This is a collection of papers from world experts in a broad variety of relevant applications, including pattern recognition, machine learning, multiscale modelling of fluid flow, metrology, geometric modelling, tomography, signal and image processing. It documents recent theoretical developments which have lead to new trends in approximation, it gives important computational aspects and multidisciplinary applications, thus making it a perfect fit for graduate students and researchers in science and engineering who wish to understand and develop numerical algorithms for the solution of their specific problems. An important feature of the book is that it brings together modern methods from statistics, mathematical modelling and numerical simulation for the solution of relevant problems, with a wide range of inherent scales. Contributions of industrial mathematicians, including representatives from Microso...

  8. On Approximate Solutions of Functional Equations in Vector Lattices

    Directory of Open Access Journals (Sweden)

    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.

  9. Introduction to methods of approximation in physics and astronomy

    CERN Document Server

    van Putten, Maurice H P M

    2017-01-01

    This textbook provides students with a solid introduction to the techniques of approximation commonly used in data analysis across physics and astronomy. The choice of methods included is based on their usefulness and educational value, their applicability to a broad range of problems and their utility in highlighting key mathematical concepts. Modern astronomy reveals an evolving universe rife with transient sources, mostly discovered - few predicted - in multi-wavelength observations. Our window of observations now includes electromagnetic radiation, gravitational waves and neutrinos. For the practicing astronomer, these are highly interdisciplinary developments that pose a novel challenge to be well-versed in astroparticle physics and data-analysis. The book is organized to be largely self-contained, starting from basic concepts and techniques in the formulation of problems and methods of approximation commonly used in computation and numerical analysis. This includes root finding, integration, signal dete...

  10. Monte Carlo Euler approximations of HJM term structure financial models

    KAUST Repository

    Björk, Tomas

    2012-11-22

    We present Monte Carlo-Euler methods for a weak approximation problem related to the Heath-Jarrow-Morton (HJM) term structure model, based on Itô stochastic differential equations in infinite dimensional spaces, and prove strong and weak error convergence estimates. The weak error estimates are based on stochastic flows and discrete dual backward problems, and they can be used to identify different error contributions arising from time and maturity discretization as well as the classical statistical error due to finite sampling. Explicit formulas for efficient computation of sharp error approximation are included. Due to the structure of the HJM models considered here, the computational effort devoted to the error estimates is low compared to the work to compute Monte Carlo solutions to the HJM model. Numerical examples with known exact solution are included in order to show the behavior of the estimates. © 2012 Springer Science+Business Media Dordrecht.

  11. Approximations of Antieigenvalue and Antieigenvalue-Type Quantities

    Directory of Open Access Journals (Sweden)

    Morteza Seddighin

    2012-01-01

    Full Text Available We will extend the definition of antieigenvalue of an operator to antieigenvalue-type quantities, in the first section of this paper, in such a way that the relations between antieigenvalue-type quantities and their corresponding Kantorovich-type inequalities are analogous to those of antieigenvalue and Kantorovich inequality. In the second section, we approximate several antieigenvalue-type quantities for arbitrary accretive operators. Each antieigenvalue-type quantity is approximated in terms of the same quantity for normal matrices. In particular, we show that for an arbitrary accretive operator, each antieigenvalue-type quantity is the limit of the same quantity for a sequence of finite-dimensional normal matrices.

  12. Analysis and approximations for crossing two nearby spin resonances

    Energy Technology Data Exchange (ETDEWEB)

    Ranjbar, V. H. [Brookhaven National Lab. (BNL), Upton, NY (United States). Collider-Accelerator Dept.

    2014-01-07

    Solutions to the T-BMT spin equation have to date been confined to the single resonance crossing. However, in reality most cases of interest concern the overlapping of several resonances. To date there has been several serious studies of this problem; however, a good analytical solution or even approximation has eluded the community. We show that the T-BMT equation can be transformed into a Hill’s like equation. In this representation it can be shown that, while the single resonance crossing represents the solution to the Parabolic Cylinder equation, the overlapping case becomes a parametric type of resonance. We present possible approximations for both the non-accelerating case and accelerating case.

  13. Radiographic display of carious lesions and cavitation in approximal surfaces

    DEFF Research Database (Denmark)

    Wenzel, Ann

    2014-01-01

    Abstract Background. Treatment strategies have changed with efforts on arresting carious lesions suspected to have an intact surface sparing operative treatment for cavitated lesions. Radiography is still the most recommended adjunct method in the diagnosis of clinically inaccessible approximal...... surfaces. Bitewing radiography. The major drawback of bitewing radiography for caries diagnosis is that the clinical state of the surface cannot be determined; i.e. if cavitation has developed or the demineralized surface is still intact. Based on studies of the relationship between radiographic lesion...... depth and clinical cavitation in approximal surfaces, a threshold for operative treatment decision has been suggested when a lesion is observed radiographically more than one-third into dentine. However, the results from previous studies are contradictory and the majority of studies are ∼25 years old...

  14. An analytic approximation of the feasible space of metabolic networks

    Science.gov (United States)

    Braunstein, Alfredo; Muntoni, Anna Paola; Pagnani, Andrea

    2017-04-01

    Assuming a steady-state condition within a cell, metabolic fluxes satisfy an underdetermined linear system of stoichiometric equations. Characterizing the space of fluxes that satisfy such equations along with given bounds (and possibly additional relevant constraints) is considered of utmost importance for the understanding of cellular metabolism. Extreme values for each individual flux can be computed with linear programming (as flux balance analysis), and their marginal distributions can be approximately computed with Monte Carlo sampling. Here we present an approximate analytic method for the latter task based on expectation propagation equations that does not involve sampling and can achieve much better predictions than other existing analytic methods. The method is iterative, and its computation time is dominated by one matrix inversion per iteration. With respect to sampling, we show through extensive simulation that it has some advantages including computation time, and the ability to efficiently fix empirically estimated distributions of fluxes.

  15. Swiss-cheese models and the Dyer-Roeder approximation

    Energy Technology Data Exchange (ETDEWEB)

    Fleury, Pierre, E-mail: fleury@iap.fr [Institut d' Astrophysique de Paris, UMR-7095 du CNRS, Université Pierre et Marie Curie, 98 bis, boulevard Arago, 75014 Paris (France)

    2014-06-01

    In view of interpreting the cosmological observations precisely, especially when they involve narrow light beams, it is crucial to understand how light propagates in our statistically homogeneous, clumpy, Universe. Among the various approaches to tackle this issue, Swiss-cheese models propose an inhomogeneous spacetime geometry which is an exact solution of Einstein's equation, while the Dyer-Roeder approximation deals with inhomogeneity in an effective way. In this article, we demonstrate that the distance-redshift relation of a certain class of Swiss-cheese models is the same as the one predicted by the Dyer-Roeder approach, at a well-controlled level of approximation. Both methods are therefore equivalent when applied to the interpretation of, e.g., supernova obervations. The proof relies on completely analytical arguments, and is illustrated by numerical results.

  16. Swiss-cheese models and the Dyer-Roeder approximation

    Science.gov (United States)

    Fleury, Pierre

    2014-06-01

    In view of interpreting the cosmological observations precisely, especially when they involve narrow light beams, it is crucial to understand how light propagates in our statistically homogeneous, clumpy, Universe. Among the various approaches to tackle this issue, Swiss-cheese models propose an inhomogeneous spacetime geometry which is an exact solution of Einstein's equation, while the Dyer-Roeder approximation deals with inhomogeneity in an effective way. In this article, we demonstrate that the distance-redshift relation of a certain class of Swiss-cheese models is the same as the one predicted by the Dyer-Roeder approach, at a well-controlled level of approximation. Both methods are therefore equivalent when applied to the interpretation of, e.g., supernova obervations. The proof relies on completely analytical arguments, and is illustrated by numerical results.

  17. Slow-roll approximation in loop quantum cosmology

    CERN Document Server

    Luc, Joanna

    2016-01-01

    The slow-roll approximation is an analytical approach to study dynamical properties of the inflationary universe. In this article, systematic construction of the slow-roll expansion for effective loop quantum cosmology is presented. The analysis is performed up to the fourth order in both slow-roll parameters and the parameter controlling the strength of deviation from the classical case. The expansion is performed for three types of the slow-roll parameters: Hubble slow-roll parameters, Hubble flow parameters and potential slow-roll parameters. An accuracy of the approximation is verified by comparison with the numerical phase space trajectories for the case with a massive potential term. The results obtained in this article may be helpful in the search for the subtle quantum gravitational effects with use of the cosmological data.

  18. Intelligent systems II complete approximation by neural network operators

    CERN Document Server

    Anastassiou, George A

    2016-01-01

    This monograph is the continuation and completion of the monograph, “Intelligent Systems: Approximation by Artificial Neural Networks” written by the same author and published 2011 by Springer. The book you hold in hand presents the complete recent and original work of the author in approximation by neural networks. Chapters are written in a self-contained style and can be read independently. Advanced courses and seminars can be taught out of this brief book. All necessary background and motivations are given per chapter. A related list of references is given also per chapter. The book’s results are expected to find applications in many areas of applied mathematics, computer science and engineering. As such this monograph is suitable for researchers, graduate students, and seminars of the above subjects, also for all science and engineering libraries.  .

  19. Likelihood Approximation With Hierarchical Matrices For Large Spatial Datasets

    KAUST Repository

    Litvinenko, Alexander

    2017-09-03

    We use available measurements to estimate the unknown parameters (variance, smoothness parameter, and covariance length) of a covariance function by maximizing the joint Gaussian log-likelihood function. To overcome cubic complexity in the linear algebra, we approximate the discretized covariance function in the hierarchical (H-) matrix format. The H-matrix format has a log-linear computational cost and storage O(kn log n), where the rank k is a small integer and n is the number of locations. The H-matrix technique allows us to work with general covariance matrices in an efficient way, since H-matrices can approximate inhomogeneous covariance functions, with a fairly general mesh that is not necessarily axes-parallel, and neither the covariance matrix itself nor its inverse have to be sparse. We demonstrate our method with Monte Carlo simulations and an application to soil moisture data. The C, C++ codes and data are freely available.

  20. Stabilized Stepwise Orthogonal Matching Pursuit for Sparse Signal Approximation

    Science.gov (United States)

    Wang, Mingjiang; Liu, Guanghong; De, Zhang; Han, Kuoye; Chen, Yanmin

    2017-10-01

    Orthogonal Matching Pursuit (OMP) algorithm is equipped with the capability to decompose any signal into a linear expansion of waveforms, which are selected from a redundant functional dictionary. Nevertheless, classical OMP algorithm suffers a heavy computational burden due to its single element selection strategy in each repetition. Recently, an accelerated implementation called stage wise orthogonal matching pursuit (StOMP) algorithm has been proposed through exploiting a multiple elements selection scheme based on an iterative threshold. However, as the defined threshold is a function of an empirical and undetermined parameter, such a reconstruction scheme is not optimal and the algorithm may get obstructed in some specific conditions. This manuscript presents an adaptive threshold selection strategy which takes signal structure into consideration and furthermore, a regularized iterative framework for sparse signal approximation is suggested. Compared with classical StOMP approach, these efforts can provide robust and more attractive approximation performance for sparse signal recoveries. Experimental results present the substantial improvements of these optimizations.

  1. Strong and weak approximation of semilinear stochastic evolution equations

    CERN Document Server

    Kruse, Raphael

    2014-01-01

    In this book we analyze the error caused by numerical schemes for the approximation of semilinear stochastic evolution equations (SEEq) in a Hilbert space-valued setting. The numerical schemes considered combine Galerkin finite element methods with Euler-type temporal approximations. Starting from a precise analysis of the spatio-temporal regularity of the mild solution to the SEEq, we derive and prove optimal error estimates of the strong error of convergence in the first part of the book. The second part deals with a new approach to the so-called weak error of convergence, which measures the distance between the law of the numerical solution and the law of the exact solution. This approach is based on Bismut’s integration by parts formula and the Malliavin calculus for infinite dimensional stochastic processes. These techniques are developed and explained in a separate chapter, before the weak convergence is proven for linear SEEq.

  2. Polygon approximation of the fringes of diffractive elements.

    Science.gov (United States)

    Kallioniemi, I; Saarinen, J; Blomstedt, K; Turunen, J

    1997-10-01

    In the electron-beam fabrication of interferogram-type diffractive elements, such as diffractive lenses, continuous fringes are often approximated by polygons to reduce the data volume. Local wave-front errors are then generated that scatter light and give rise to background noise. A roughness parameter beta is introduced to quantify local phase errors in polygon-encoded diffractive structures. An efficient numerical method is developed to compute the Fresnel diffraction pattern of a polygon aperture. Polygon-approximated diffractive axicons and lenses are then investigated to determine the dependence of the signal fidelity on beta. It is found, e.g., that the maximum local phase error must be as large as pi/6 rad before the Strehl ratio S of a paraxial diffractive lens reduces below S = 0.9. However, much smaller errors can noticeably break the circular symmetry of the diffraction pattern.

  3. Information capacity in the weak-signal approximation

    CERN Document Server

    Kostal, Lubomir

    2010-01-01

    We derive an approximate expression for mutual information in a broad class of discrete-time stationary channels with continuous input, under the constraint of vanishing input amplitude or power. The approximation describes the input by its covariance matrix, while the channel properties are described by the Fisher information matrix. This separation of input and channel properties allows us to analyze the optimality conditions in a convenient way. We show that input correlations in memoryless channels do not affect channel capacity since their effect decreases fast with vanishing input amplitude or power. On the other hand, for channels with memory, properly matching the input covariances to the dependence structure of the noise may lead to almost noiseless information transfer, even for intermediate values of the noise correlations. Since many model systems described in mathematical neuroscience and biophysics operate in the high noise regime and weak-signal conditions, we believe, that the described result...

  4. Parallel iterative solvers and preconditioners using approximate hierarchical methods

    Energy Technology Data Exchange (ETDEWEB)

    Grama, A.; Kumar, V.; Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)

    1996-12-31

    In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.

  5. Reliable Approximation of Long Relaxation Timescales in Molecular Dynamics

    Directory of Open Access Journals (Sweden)

    Wei Zhang

    2017-07-01

    Full Text Available Many interesting rare events in molecular systems, like ligand association, protein folding or conformational changes, occur on timescales that often are not accessible by direct numerical simulation. Therefore, rare event approximation approaches like interface sampling, Markov state model building, or advanced reaction coordinate-based free energy estimation have attracted huge attention recently. In this article we analyze the reliability of such approaches. How precise is an estimate of long relaxation timescales of molecular systems resulting from various forms of rare event approximation methods? Our results give a theoretical answer to this question by relating it with the transfer operator approach to molecular dynamics. By doing so we also allow for understanding deep connections between the different approaches.

  6. Logic of approximate entailment in quasimetric and in metric spaces.

    Science.gov (United States)

    Vetterlein, Thomas

    2017-01-01

    It is known that a quasimetric space can be represented by means of a metric space; the points of the former space become closed subsets of the latter one, and the role of the quasimetric is assumed by the Hausdorff quasidistance. In this paper, we show that, in a slightly more special context, a sharpened version of this representation theorem holds. Namely, we assume a quasimetric to fulfil separability in the original sense due to Wilson. Then any quasimetric space can be represented by means of a metric space such that distinct points are assigned disjoint closed subsets. This result is tailored to the solution of an open problem from the area of approximate reasoning. Following the lines of E. Ruspini's work, the Logic of Approximate Entailment ([Formula: see text]) is based on a graded version of the classical entailment relation. We present a proof calculus for [Formula: see text] and show its completeness with regard to finite theories.

  7. Quasi-Optimal Meshes for Gradient Nonconforming Approximations

    Science.gov (United States)

    Agouzal, Abdellatif; Debit, Naïma

    2010-09-01

    We consider anisotropic adaptive methods based on a metric related to the Hessian of the solution. We propose a metric targeted to the minimization of interpolation error gradient for a nonconforming linear finite element approximation of a given piecewise regular function on a polyhedral domain Ω of Rd,d≥2. We also present an algorithm generating a sequence of asymptotically quasi-optimal meshes relative to such a nonconforming discretization and give numerical asymptotic behavior of the error reduction produced by the generated mesh. Numerical experiments are performed to generate mesh minimizing interpolation error gradient of benchmark functions, and nonconforming approximation of solution of a PDE as convection diffusion equation selected for this note.

  8. Quasielastic electron-deuteron scattering in the weak binding approximation

    Energy Technology Data Exchange (ETDEWEB)

    Ethier, Jacob J. [William and Mary College, JLAB; Doshi, Nidhi P. [Carnegie Mellon University; Malace, Simona P. [JLAB; Melnitchouk, Wally [JLAB

    2014-06-01

    We perform a global analysis of all available electron-deuteron quasielastic scattering data using Q^2-dependent smearing functions that describe inclusive inelastic e-d scattering within the weak binding approximation. We study the dependence of the cross sections on the deuteron wave function and the off-shell extrapolation of the elastic electron-nucleon cross section, which show particular sensitivity at x >> 1. The excellent overall agreement with data over a large range of Q^2 and x suggest a limited need for effects beyond the impulse approximation, with the exception of the very high-x or very low-Q^2 regions, where short-distance effects in the deuteron become more relevant.

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

    KAUST Repository

    Athanassoulis, Agissilaos

    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.

  10. Approximate Series Solutions for Nonlinear Free Vibration of Suspended Cables

    Directory of Open Access Journals (Sweden)

    Yaobing Zhao

    2014-01-01

    Full Text Available This paper presents approximate series solutions for nonlinear free vibration of suspended cables via the Lindstedt-Poincare method and homotopy analysis method, respectively. Firstly, taking into account the geometric nonlinearity of the suspended cable as well as the quasi-static assumption, a mathematical model is presented. Secondly, two analytical methods are introduced to obtain the approximate series solutions in the case of nonlinear free vibration. Moreover, small and large sag-to-span ratios and initial conditions are chosen to study the nonlinear dynamic responses by these two analytical methods. The numerical results indicate that frequency amplitude relationships obtained with different analytical approaches exhibit some quantitative and qualitative differences in the cases of motions, mode shapes, and particular sag-to-span ratios. Finally, a detailed comparison of the differences in the displacement fields and cable axial total tensions is made.

  11. A new approximation for the dynamics of topographic Rossby waves

    Directory of Open Access Journals (Sweden)

    Yosef Ashkenazy

    2012-04-01

    Full Text Available A new theory of non-harmonic topographic Rossby waves over a slowly varying bottom depth of arbitrary, 1-D, profile is developed based on the linearised shallow water equations on the f-plane. The theory yields explicit approximate expressions for the phase speed and non-harmonic cross-slope structure of waves. Analytical expressions are derived in both Cartesian and Polar coordinates by letting the frequency vary in the cross-shelf direction and are verified by comparing them with the numerical results obtained by running an ocean general circulation model (the MITgcm. The proposed approximation may be suitable for studying open ocean and coastal shelf wave dynamics.

  12. Quasi-planar elemental clusters in pair interactions approximation

    Directory of Open Access Journals (Sweden)

    Chkhartishvili Levan

    2016-01-01

    Full Text Available The pair-interactions approximation, when applied to describe elemental clusters, only takes into account bonding between neighboring atoms. According to this approach, isomers of wrapped forms of 2D clusters – nanotubular and fullerene-like structures – and truly 3D clusters, are generally expected to be more stable than their quasi-planar counterparts. This is because quasi-planar clusters contain more peripheral atoms with dangling bonds and, correspondingly, fewer atoms with saturated bonds. However, the differences in coordination numbers between central and peripheral atoms lead to the polarization of bonds. The related corrections to the molar binding energy can make small, quasi-planar clusters more stable than their 2D wrapped allotropes and 3D isomers. The present work provides a general theoretical frame for studying the relative stability of small elemental clusters within the pair interactions approximation.

  13. Approximate scaling properties of RNA free energy landscapes

    Science.gov (United States)

    Baskaran, S.; Stadler, P. F.; Schuster, P.

    1996-01-01

    RNA free energy landscapes are analysed by means of "time-series" that are obtained from random walks restricted to excursion sets. The power spectra, the scaling of the jump size distribution, and the scaling of the curve length measured with different yard stick lengths are used to describe the structure of these "time series". Although they are stationary by construction, we find that their local behavior is consistent with both AR(1) and self-affine processes. Random walks confined to excursion sets (i.e., with the restriction that the fitness value exceeds a certain threshold at each step) exhibit essentially the same statistics as free random walks. We find that an AR(1) time series is in general approximately self-affine on timescales up to approximately the correlation length. We present an empirical relation between the correlation parameter rho of the AR(1) model and the exponents characterizing self-affinity.

  14. Finite-State Approximation of Phrase-Structure Grammars

    CERN Document Server

    Pereira, F C N; Pereira, Fernando C. N.; Wright, Rebecca N.

    1996-01-01

    Phrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time speech recognition. Therefore, finite-state models are used instead, even though they lack expressive power. To reconcile those two alternatives, we designed an algorithm to compute finite-state approximations of context-free grammars and context-free-equivalent augmented phrase-structure grammars. The approximation is exact for certain context-free grammars generating regular languages, including all left-linear and right-linear context-free grammars. The algorithm has been used to build finite-state language models for limited-domain speech recognition tasks.

  15. Higher-Order Approximation of Cubic-Quintic Duffing Model

    DEFF Research Database (Denmark)

    Ganji, S. S.; Barari, Amin; Babazadeh, H.

    2011-01-01

    We apply an Artificial Parameter Lindstedt-Poincaré Method (APL-PM) to find improved approximate solutions for strongly nonlinear Duffing oscillations with cubic-quintic nonlinear restoring force. This approach yields simple linear algebraic equations instead of nonlinear algebraic equations...... without analytical solution which makes it a unique solution. It is demonstrated that this method works very well for the whole range of parameters in the case of the cubic-quintic oscillator, and excellent agreement of the approximate frequencies with the exact one has been observed and discussed...... this analytical solution with the Newton-Harmonic Balancing Approach. Results indicate that this technique is very effective and convenient for solving conservative truly nonlinear oscillatory systems. Utter simplicity of the solution procedure confirms that this method can be easily extended to other kinds...

  16. Approximation methods for efficient learning of Bayesian networks

    CERN Document Server

    Riggelsen, C

    2008-01-01

    This publication offers and investigates efficient Monte Carlo simulation methods in order to realize a Bayesian approach to approximate learning of Bayesian networks from both complete and incomplete data. For large amounts of incomplete data when Monte Carlo methods are inefficient, approximations are implemented, such that learning remains feasible, albeit non-Bayesian. The topics discussed are: basic concepts about probabilities, graph theory and conditional independence; Bayesian network learning from data; Monte Carlo simulation techniques; and, the concept of incomplete data. In order to provide a coherent treatment of matters, thereby helping the reader to gain a thorough understanding of the whole concept of learning Bayesian networks from (in)complete data, this publication combines in a clarifying way all the issues presented in the papers with previously unpublished work.

  17. On stochastic approximation algorithms for classes of PAC learning problems

    Energy Technology Data Exchange (ETDEWEB)

    Rao, N.S.V.; Uppuluri, V.R.R.; Oblow, E.M.

    1994-03-01

    The classical stochastic approximation methods are shown to yield algorithms to solve several formulations of the PAC learning problem defined on the domain [o,1]{sup d}. Under some assumptions on different ability of the probability measure functions, simple algorithms to solve some PAC learning problems are proposed based on networks of non-polynomial units (e.g. artificial neural networks). Conditions on the sizes of these samples required to ensure the error bounds are derived using martingale inequalities.

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

    KAUST Repository

    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.

  19. Approximating Fixed Points of Generalized Nonexpansive Mappings in Banach Spaces

    Directory of Open Access Journals (Sweden)

    Bapurao C. Dhage

    2014-10-01

    Full Text Available In this paper, we prove a fixed point theorem for the selfmaps of a closed convex and bounded subset of the Banach space satisfying a generalized nonexpansive type condition. Some results concerning the approximations of fixed points with Krasnoselskii and Mann type iterations are also proved under suitable conditions. Our results include the well-known result of Kannan (1968 and Bose and Mukherjee (1981 as the special cases with a different and constructive method.

  20. Mathieu functions and its useful approximation for elliptical waveguides

    Science.gov (United States)

    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.