Complex energies from real perturbation series for the LoSurdo-Stark effect in hydrogen by Borel-Pade approximants

Energy Technology Data Exchange (ETDEWEB)

Franceschini, V.; Grecchi, V.; Silverstone, H.J.

1985-09-01

The resonance energies for the hydrogen atom in an electric field, both the real and imaginary parts, have been calculated together from the real Rayleigh-Schroedinger perturbation series by Borel summation. Pade approximants were used to evaluate the Borel transform. The numerical results compare well with values obtained by the complex-coordinate variational method and by sequential use of Pade approximants.

Symmmetric double-well potential with Saxon-Woods tail and Pade approximations

International Nuclear Information System (INIS)

Niculescu, V.I.R.; Catana, D.

1995-01-01

In the present work we introduce a symmetric double-well potential with Woods-Saxon tail. The Woods-Saxon parts are replaced by Pade approximation.In this way the matrix elements of this potential form can be evaluated by the theory of complex functions. This results in a shorter computational time. (author). 1 fig., 1 tab., 7 refs

Solution of the point kinetics equations in the presence of Newtonian temperature feedback by Pade approximations via the analytical inversion method

International Nuclear Information System (INIS)

Aboanber, A E; Nahla, A A

2002-01-01

A method based on the Pade approximations is applied to the solution of the point kinetics equations with a time varying reactivity. The technique consists of treating explicitly the roots of the inhour formula. A significant improvement has been observed by treating explicitly the most dominant roots of the inhour equation, which usually would make the Pade approximation inaccurate. Also the analytical inversion method which permits a fast inversion of polynomials of the point kinetics matrix is applied to the Pade approximations. Results are presented for several cases of Pade approximations using various options of the method with different types of reactivity. The formalism is applicable equally well to non-linear problems, where the reactivity depends on the neutron density through temperature feedback. It was evident that the presented method is particularly good for cases in which the reactivity can be represented by a series of steps and performed quite well for more general cases

Hermite-Pade approximation approach to hydromagnetic flows in convergent-divergent channels

International Nuclear Information System (INIS)

Makinde, O.D.

2005-10-01

The problem of two-dimensional, steady, nonlinear flow of an incompressible conducting viscous fluid in convergent-divergent channels under the influence of an externally applied homogeneous magnetic field is studied using a special type of Hermite-Pade approximation approach. This semi-numerical scheme offers some advantages over solutions obtained by using traditional methods such as finite differences, spectral method, shooting method, etc. It reveals the analytical structure of the solution function and the important properties of overall flow structure including velocity field, flow reversal control and bifurcations are discussed. (author)

A hybrid Pade-Galerkin technique for differential equations

Science.gov (United States)

Geer, James F.; Andersen, Carl M.

1993-01-01

A three-step hybrid analysis technique, which successively uses the regular perturbation expansion method, the Pade expansion method, and then a Galerkin approximation, is presented and applied to some model boundary value problems. In the first step of the method, the regular perturbation method is used to construct an approximation to the solution in the form of a finite power series in a small parameter epsilon associated with the problem. In the second step of the method, the series approximation obtained in step one is used to construct a Pade approximation in the form of a rational function in the parameter epsilon. In the third step, the various powers of epsilon which appear in the Pade approximation are replaced by new (unknown) parameters (delta(sub j)). These new parameters are determined by requiring that the residual formed by substituting the new approximation into the governing differential equation is orthogonal to each of the perturbation coordinate functions used in step one. The technique is applied to model problems involving ordinary or partial differential equations. In general, the technique appears to provide good approximations to the solution even when the perturbation and Pade approximations fail to do so. The method is discussed and topics for future investigations are indicated.

Gauss-Arnoldi quadrature for -1φ,φ> and rational Pade-type approximation for Markov-type functions

International Nuclear Information System (INIS)

Knizhnerman, L A

2008-01-01

The efficiency of Gauss-Arnoldi quadrature for the calculation of the quantity -1 φ,φ> is studied, where A is a bounded operator in a Hilbert space and φ is a non-trivial vector in this space. A necessary and a sufficient conditions are found for the efficiency of the quadrature in the case of a normal operator. An example of a non-normal operator for which this quadrature is inefficient is presented. It is shown that Gauss-Arnoldi quadrature is related in certain cases to rational Pade-type approximation (with the poles at Ritz numbers) for functions of Markov type and, in particular, can be used for the localization of the poles of a rational perturbation. Error estimates are found, which can also be used when classical Pade approximation does not work or it may not be efficient. Theoretical results and conjectures are illustrated by numerical experiments. Bibliography: 44 titles

Hydrogen atom with a Yukawa potential: Perturbation theory and continued-fractions--Pade approximants at large order

International Nuclear Information System (INIS)

Vrscay, E.R.

1986-01-01

A simple power-series method is developed to calculate to large order the Rayleigh-Schroedinger perturbation expansions for energy levels of a hydrogen atom with a Yukawa-type screened Coulomb potential. Perturbation series for the 1s, 2s, and 2p levels, shown not to be of the Stieltjes type, are calculated to 100th order. Nevertheless, the poles of the Pade approximants to these series generally avoid the region of the positive real axis 0 < lambda < lambda(, where lambda( represents the coupling constant threshold. As a result, the Pade sums afford accurate approximations to E(lambda) in this domain. The continued-fraction representations to these perturbation series have been accurately calculated to large (100th) order and demonstrate a curious ''quasioscillatory,'' but non-Stieltjes, behavior. Accurate values of E(lambda) as well as lambda( for the 1s, 2s, and 2p levels are reported

The solution of linear and nonlinear systems of Volterra functional equations using Adomian-Pade technique

International Nuclear Information System (INIS)

Dehghan, Mehdi; Shakourifar, Mohammad; Hamidi, Asgar

2009-01-01

The purpose of this study is to implement Adomian-Pade (Modified Adomian-Pade) technique, which is a combination of Adomian decomposition method (Modified Adomian decomposition method) and Pade approximation, for solving linear and nonlinear systems of Volterra functional equations. The results obtained by using Adomian-Pade (Modified Adomian-Pade) technique, are compared to those obtained by using Adomian decomposition method (Modified Adomian decomposition method) alone. The numerical results, demonstrate that ADM-PADE (MADM-PADE) technique, gives the approximate solution with faster convergence rate and higher accuracy than using the standard ADM (MADM).

Iteration of Aitken's Δ2 Process as an alternative to Pade approximants and the problem of using rational fractions to parameterize experimental data

International Nuclear Information System (INIS)

McRae, G.A.

1992-01-01

It is shown that iterating Aitken's Δ 2 process, or equivalently Shanks' ε algorithm on the partial sums of a Taylor series can lead to a dramatic convergence of the series. This method is compared to the standard technique of accelerating the convergence of series by constructing Pade Approximants. Also, the problem of determining Taylor expansion coefficients from experimental data fitted to Pade Approximants is reviewed, and it is suggested that a method based on this iteration scheme may be better. (author). 6 refs., 1 fig

Acoustical topology optimization of Zwicker's loudness with Padé approximation

DEFF Research Database (Denmark)

Kook, Junghwan; Jensen, Jakob Søndergaard; Wang, Semyung

2013-01-01

Zwicker's loudness is a conventional standard index for measuring human hearing annoyance and has been widely considered in many industrial fields for noise evaluations. The calculation of Zwicker's loudness, which is needed for a wide range of frequency responses with a fine frequency resolution......, this approach imposes prohibitively high computational costs. In this research, we propose a computationally-efficient approach to resolve the computational issue in the computation and optimization of Zwicker's loudness. We present an efficient approach which combines the finite element method (FEM......) with the Padé approximation (PA) procedure for obtaining Zwicker's loudness and for applying it in a gradient-based acoustical topology optimization procedure applied to the design of acoustic devices to minimize Zwicker's loudness. In this respect, the calculation of Zwicker's loudness is represented by the PA...

Exact Solution of Gas Dynamics Equations Through Reduced Differential Transform and Sumudu Transform Linked with Pades Approximants

Science.gov (United States)

Rao, T. R. Ramesh

2018-04-01

In this paper, we study the analytical method based on reduced differential transform method coupled with sumudu transform through Pades approximants. The proposed method may be considered as alternative approach for finding exact solution of Gas dynamics equation in an effective manner. This method does not require any discretization, linearization and perturbation.

Punctual Pade approximants as a regularization procedure for divergent and oscillatory partial wave expansions of the scattering amplitude

International Nuclear Information System (INIS)

Garibotti, C.R.; Grinstein, F.F.

1978-01-01

Previous theorems on the convergence of the [n,n+m] punctual Pade approximants to the scattering amplitude are extended. The new proofs include the cases of nonforward and backward scattering corresponding to potentials having 1/r and 1/r 2 long-range behaviors, for which the partial wave expansions are divergent and oscillatory, respectively. In this way, the ability of the approximation scheme as a summation method is established for all of the long-range potentials of interest in potential scattering

Punctual Pade Approximants as a regularization procedure for divergent and oscillatory partial wave expansions of the scattering amplitude

International Nuclear Information System (INIS)

Garibotti, C.R.; Grinstein, F.F.

1978-01-01

Previous theorems on the convergence of the [n, n+m] Punctual Pade Approximants to the scattering amplitude are extended. The new proofs include the cases of non-forward and backward scattering corresponding to potentials having 1/r and 1/r 2 long range behaviours, for which the partial wave expansions are divergent and oscillatory, respectively. In this way, the ability of the approximation scheme as a summation method is established for all of the long range potentials of interest in potential scattering [pt

A Pade-Aided Analysis of Nonperturbative NN Scattering in 1S0 Channel

International Nuclear Information System (INIS)

Yang Jifeng; Huang Jianhua

2007-01-01

We carried out a Pade approximant analysis on a compact factor of the T-matrix for NN scattering to explore the nonperturbative renormalization prescription in a universal manner. The utilities and virtues for this Pade analysis are discussed.

An analytic Pade-motivated QCD coupling

International Nuclear Information System (INIS)

Martinez, H. E.; Cvetic, G.

2010-01-01

We consider a modification of the Minimal Analytic (MA) coupling of Shirkov and Solovtsov. This modified MA (mMA) coupling reflects the desired analytic properties of the space-like observables. We show that an approximation by Dirac deltas of its discontinuity function ρ is equivalent to a Pade(rational) approximation of the mMA coupling that keeps its analytic structure. We propose a modification to mMA that, as preliminary results indicate, could be an improvement in the evaluation of low-energy observables compared with other analytic couplings.

Analytical approximation of neutron physics data

International Nuclear Information System (INIS)

Badikov, S.A.; Vinogradov, V.A.; Gaj, E.V.; Rabotnov, N.S.

1984-01-01

The method for experimental neutron-physical data analytical approximation by rational functions based on the Pade approximation is suggested. It is shown that the existence of the Pade approximation specific properties in polar zones is an extremely favourable analytical property essentially extending the convergence range and increasing its rate as compared with polynomial approximation. The Pade approximation is the particularly natural instrument for resonance curve processing as the resonances conform to the complex poles of the approximant. But even in a general case analytical representation of the data in this form is convenient and compact. Thus representation of the data on the neutron threshold reaction cross sections (BOSPOR constant library) in the form of rational functions lead to approximately twenty fold reduction of the storaged numerical information as compared with the by-point calculation at the same accWracy

The PADE dosimetry system at the Brokdorf nuclear power station

International Nuclear Information System (INIS)

Poetter, Karl-Friedrich; Eckelmann, Joerg; Kuegow, Mario; Spahn, Werner; Franz, Manfred

2002-01-01

The PADE program system is used in nuclear power plants for personnel and workplace dosimetry and for managing access to the controlled area. On-line interfaces with existing dose determination systems allow collection, surveillance and evaluation functions to be achieved for person-related and workplace-related dose data. This is managed by means of open, non-proprietary communication of PADE with the computer system coupled via interfaces. In systems communication, PADE is limited to main interventions into outside systems, thus ensuring flexible adaptation to existing systems. As a client-server solution, PADE has been developed on the basis of an ORACLE-8 database; the version presented here runs on a Windows NT server. The system described has been used at the Brokdorf Nuclear Power Station since early 2000 and has so far reliably managed more than one million individual access movements of more than 6 000 persons. It is currently being integrated into a comprehensive plant operations management system. Among other things, PADE offers a considerable development potential for a tentatively planned future standardization of parts of the dosimetry systems in German nuclear power plants and for the joint management of in-plant and official dose data. (orig.) [de

Design method for low order two-degree-of-freedom controller based on Pade approximation of the denominator series expansion

International Nuclear Information System (INIS)

Ishikawa, Nobuyuki; Suzuki, Katsuo

1999-01-01

Having advantages of setting independently feedback characteristics such as disturbance rejection specification and reference response characteristics, two-degree-of-freedom (2DOF) control is widely utilized to improve the control performance. The ordinary design method such as model matching usually derives high-ordered feedforward element of 2DOF controller. In this paper, we propose a new design method for low order feedforward element which is based on Pade approximation of the denominator series expansion. The features of the proposed method are as follows: (1) it is suited to realize reference response characteristics in low frequency region, (2) the order of the feedforward element can be selected apart from the feedback element. These are essential to the 2DOF controller design. With this method, 2DOF reactor power controller is designed and its control performance is evaluated by numerical simulation with reactor dynamics model. For this evaluation, it is confirmed that the controller designed by the proposed method possesses equivalent control characteristics to the controller by the ordinary model matching method. (author)

Self-similar factor approximants

International Nuclear Information System (INIS)

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

2003-01-01

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

Pade expansion and the renormalization of nucleon-nucleon scattering

International Nuclear Information System (INIS)

Yang Jifeng; Huang Jianhua; Liu Dan

2006-01-01

The importance of imposing physical boundary conditions on the T-matrix to remove to nonperturbative renormalization prescription dependence is stressed and demonstrated in two diagonal channels 1 P 1 and 1 D 2 , with the help of Pade expansion. (authors)

Nuclear data processing, analysis, transformation and storage with Pade-approximants

International Nuclear Information System (INIS)

Badikov, S.A.; Gay, E.V.; Guseynov, M.A.; Rabotnov, N.S.

1992-01-01

A method is described to generate rational approximants of high order with applications to neutron data handling. The problems considered are: The approximations of neutron cross-sections in resonance region producing the parameters for Adler-Adler type formulae; calculations of resulting rational approximants' errors given in analytical form allowing to compute the error at any energy point inside the interval of approximation; calculations of the correlation coefficient of error values in two arbitrary points provided that experimental errors are independent and normally distributed; a method of simultaneous generation of a few rational approximants with identical set of poles; functionals other than LSM; two-dimensional approximation. (orig.)

Pade approximants and the calculation of effective interactions

International Nuclear Information System (INIS)

Schucan, T.H.

1975-01-01

The analytic properties of the effective interaction in nuclei have become increasingly well understood in the last few years. It has been found that the corresponding series expansion diverges in most practical applications due to the occurrence of low lying collective states. It is the purpose of this paper to review and discuss an approximation scheme that has been used to rearrange this series with the aim to overcome the difficulties connected with its divergence. (orig./WL) [de

A New Iteration Multivariate Pad e´ Approximation Technique for ...

African Journals Online (AJOL)

In this paper, the Laplace transform, the New iteration method and the Multivariate Pade´ approximation technique are employed to solve nonlinear fractional partial differential equations whose fractional derivatives are described in the sense of Caputo. The Laplace transform is used to ”fully” determine the initial iteration ...

Analytical continuation by numerical means in spectral analysis using the Fast Pade Transform (FPT)

International Nuclear Information System (INIS)

Belkic, Dzevad

2004-01-01

A numerical method is used to assess the practical usefulness of the Cauchy concept of analytical continuation of a formal power series T(z -1 )=Σ n c n z -n for a frequency spectrum, which is originally divergent i.e. undefined for vertical bar z vertical bar -1 ) in the expansion variable z -1 , we introduce a rational polynomial A + (z)/B + (z), not in the original, but rather in the reciprocal variable z. Nevertheless, the ansatz A + (z)/B + (z) is still recognised as a variant of the Pade approximant defined in the complementary convergence or stability region inside the unit circle (vertical bar z vertical bar 0, the rational polynomial A + (z)/B + (z) is equivalent to the causal z-transform whose inverse Fourier integral contains only the exponentially decaying components as the building blocks of generic time signals. Therefore, the response function A + (z)/B + (z) is very well suited for adequate physical representations of both Lorentzian and non-Lorentzian spectra. For the purpose of illustration, we presently perform parametric estimations by generating magnitude spectra |A + (z)/B + (z)| using experimentally measured in vivo time signals from Magnetic Resonance Spectroscopy. An equivalent parametric analysis is also done in the time domain. Many experimentally measured data stem from mechanisms that intrinsically describe the time evolution of the studied system. Such physical time functions have their customary meaning as probability amplitudes and, therefore, are expected to decay exponentially with the passage of time. The most prominent examples are auto-correlation functions in signal and image processing or activity curves in decays of radionuclides encountered in e.g. Positron Emission Tomography (PET), etc. For the given experimental data, the task is to retrieve the exact number of the constituent components of the measured time functions as well as the individual parameters of each exponential, i.e. the amplitudes and the time decaying

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.

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

International Nuclear Information System (INIS)

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

1988-01-01

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

Critical region of a type II superconducting film near Hsub(c2): rational approximants

International Nuclear Information System (INIS)

Ruggeri, G.J.

1979-01-01

The high-temperature perturbative expansions for the thermal quantities of a type II superconducting film are extrapolated to the critical region near Hsub(c2) by means of new rational approximants of the Pade type. The new approximants are forced to reproduce the leading correction to the flux lattice contribution on the low-temperature side of the transition. Compared to those previously considered in the literature: (i) the mutual consistency of the approximants is improved; and (ii) they are nearer to the exact solution of the zero-dimensional Landau-Ginsburg model. (author)

Rational approximations of f(R) cosmography through Pad'e polynomials

Science.gov (United States)

Capozziello, Salvatore; D'Agostino, Rocco; Luongo, Orlando

2018-05-01

We consider high-redshift f(R) cosmography adopting the technique of polynomial reconstruction. In lieu of considering Taylor treatments, which turn out to be non-predictive as soon as z>1, we take into account the Pad&apose rational approximations which consist in performing expansions converging at high redshift domains. Particularly, our strategy is to reconstruct f(z) functions first, assuming the Ricci scalar to be invertible with respect to the redshift z. Having the so-obtained f(z) functions, we invert them and we easily obtain the corresponding f(R) terms. We minimize error propagation, assuming no errors upon redshift data. The treatment we follow naturally leads to evaluating curvature pressure, density and equation of state, characterizing the universe evolution at redshift much higher than standard cosmographic approaches. We therefore match these outcomes with small redshift constraints got by framing the f(R) cosmology through Taylor series around 0zsimeq . This gives rise to a calibration procedure with small redshift that enables the definitions of polynomial approximations up to zsimeq 10. Last but not least, we show discrepancies with the standard cosmological model which go towards an extension of the ΛCDM paradigm, indicating an effective dark energy term evolving in time. We finally describe the evolution of our effective dark energy term by means of basic techniques of data mining.

Rational function approximation method for discrete ordinates problems in slab geometry

International Nuclear Information System (INIS)

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

2009-01-01

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

On a Convergence of Rational Approximations by the Modified Fourier Basis

Directory of Open Access Journals (Sweden)

Tigran Bakaryan

2017-12-01

Full Text Available We continue investigations of the modified-trigonometric-rational approximations that arise while accelerating the convergence of the modified Fourier expansions by means of rational corrections. Previously, we investigated the pointwise convergence of the rational approximations away from the endpoints and the $L_2$-convergence on the entire interval. Here, we study the convergence at the endpoints and derive the exact constants for the main terms of asymptotic errors. We show that the Fourier-Pade approximations are much more accurate in all frameworks than the modified expansions for sufficiently smooth functions. Moreover, we consider a simplified version of the rational approximations and explore the optimal values of parameters that lead to better accuracy in the framework of the $L_2$-error. Numerical experiments perform comparisons of the rational approximations with the modified Fourier expansions.

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.

Structure of the optimized effective Kohn-Sham exchange potential and its gradient approximations

International Nuclear Information System (INIS)

Gritsenko, O.; Van Leeuwen, R.; Baerends, E.J.

1996-01-01

An analysis of the structure of the optimized effective Kohn-Sham exchange potential v, and its gradient approximations is presented. The potential is decomposed into the Slater potential v s and the response of v s to density variations, v resp . The latter exhibits peaks that reflect the atomic shell structure. Kohn-Sham exchange potentials derived from current gradient approaches for the exchange energy are shown to be quite reasonable for the Slater potential, but they fail to approximate the response part, which leads to poor overall potentials. Improved potentials are constructed by a direct fit of v x with a gradient-dependent Pade approximant form. The potentials obtained possess proper asymptotic and scaling properties and reproduce the shell structure of the exact v x . 44 refs., 7 figs., 4 tabs

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

International Nuclear Information System (INIS)

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

2008-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

Palma, Daniel A. [CEFET QUIMICA de Nilopolis/RJ, Rio de Janeiro (Brazil); Goncalves, Alessandro C.; Martinez, Aquilino S.; Silva, Fernando C. [COPPE/UFRJ - Programa de Engenharia Nuclear, Rio de Janeiro (Brazil)

2008-07-01

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

Fractional approximations for linear first order differential equation with polynomial coefficients-application to E1(x) and Z(s)

International Nuclear Information System (INIS)

Martin, P.; Zamudio-Cristi, J.

1982-01-01

A method is described to obtain fractional approximations for linear first order differential equations with polynomial coefficients. This approximation can give good accuracy in a large region of the complex variable plane that may include all the real axis. The parameters of the approximation are solutions of algebraic equations obtained through the coefficients of the highest and lowest power of the variable after the sustitution of the fractional approximation in the differential equation. The method is more general than the asymptotical Pade method, and it is not required to determine the power series or asymptotical expansion. A simple approximation for the exponential integral is found, which give three exact digits for most of the real values of the variable. Approximations of higher accuracy and of the same degree than other authors are also obtained. (Author) [pt

Perturbative expansion and the initial value problem of the K.d.V. equations

International Nuclear Information System (INIS)

Turchetti, G.

1980-01-01

For the potential K.d.V. equation is considered a perturbation expansion in which the initial condition is imposed on the zeroth order term. The N soliton solutions turn out to be rational functions in the expansion parameter so that the perturbation series can be exactly summed by the [N-1/N] Pade approximants; moreover the [n-1/n] and [n/n] Pade approximants for n [pt

A rational approach to resonance saturation in large-Nc QCD

International Nuclear Information System (INIS)

Masjuan, Pere; Peris, Santiago

2007-01-01

We point out that resonance saturation in QCD can be understood in the large-N c limit from the mathematical theory of Pade Approximants to meromorphic functions. These approximants are rational functions which encompass any saturation with a finite number of resonances as a particular example, explaining several results which have appeared in the literature. We review the main properties of Pade Approximants with the help of a toy model for the (VV-AA) two-point correlator, paying particular attention to the relationship among the Chiral Expansion, the Operator Product Expansion and the resonance spectrum. In passing, we also comment on an old proposal made by Migdal in 1977 which has recently attracted much attention in the context of AdS/QCD models. Finally, we apply the simplest Pade Approximant to the (VV-AA) correlator in the real case of QCD. The general conclusion is that a rational approximant may reliably describe a Green's function in the Euclidean, but the same is not true in the Minkowski regime due to the appearance of unphysical poles and/or residues

Energies and bounds from perturbative approximations to the Bloch-Horowitz effective Hamiltonian

International Nuclear Information System (INIS)

Darema-Rogers, F.; Vincent, C.M.

1978-01-01

Bloch-Horowitz perturbation theory is applied to the calculation of approximate energies and model-space eigenvectors, for the solvable large-matrix Hamiltonian H used by Pittel, Vincent, and Vergados. Two types of upper and lower bounds to the energies are discussed: moment-theory bounds, obtained by applying moment theory to the terms of perturbation theory, and norm bounds, derived from the expectation E-bar and variance sigma 2 of H with respect to an eigenvector approximated by nth order perturbation theory (n < or = 6). It is shown that lower bounds cannot be constructed unless some fourth-order quantity is known. The upper bounds are generally stricter than the lower bounds. All of the bounds apply even when back-door intruder states cause perturbation theory to diverge; but they lose their rigor and become ''quasibounds'' when there are physical intruders. The moment-theory and norm lower quasibounds always require estimation of a parameter. For the solvable Hamiltonians, it is shown that this can be done quite reliably, and that the resulting quasibounds are tight enough to have some practical utility. The energy-independent effective interaction V is constructed and its errors are displayed and discussed. Finally, a certain [1/2] pseudo-Pade approximant is empirically shown to give energies with a mean absolute error of less than 0.3 MeV in all cases

Cyclic graphs and Apery's theorem

International Nuclear Information System (INIS)

Sorokin, V N

2002-01-01

This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found

Traveltime approximations for transversely isotropic media with an inhomogeneous background

KAUST Repository

Alkhalifah, Tariq

2011-05-01

A transversely isotropic (TI) model with a tilted symmetry axis is regarded as one of the most effective approximations to the Earth subsurface, especially for imaging purposes. However, we commonly utilize this model by setting the axis of symmetry normal to the reflector. This assumption may be accurate in many places, but deviations from this assumption will cause errors in the wavefield description. Using perturbation theory and Taylor\\'s series, I expand the solutions of the eikonal equation for 2D TI media with respect to the independent parameter θ, the angle the tilt of the axis of symmetry makes with the vertical, in a generally inhomogeneous TI background with a vertical axis of symmetry. I do an additional expansion in terms of the independent (anellipticity) parameter in a generally inhomogeneous elliptically anisotropic background medium. These new TI traveltime solutions are given by expansions in and θ with coefficients extracted from solving linear first-order partial differential equations. Pade approximations are used to enhance the accuracy of the representation by predicting the behavior of the higher-order terms of the expansion. A simplification of the expansion for homogenous media provides nonhyperbolic moveout descriptions of the traveltime for TI models that are more accurate than other recently derived approximations. In addition, for 3D media, I develop traveltime approximations using Taylor\\'s series type of expansions in the azimuth of the axis of symmetry. The coefficients of all these expansions can also provide us with the medium sensitivity gradients (Jacobian) for nonlinear tomographic-based inversion for the tilt in the symmetry axis. © 2011 Society of Exploration Geophysicists.

Traveltime approximations for transversely isotropic media with an inhomogeneous background

KAUST Repository

Alkhalifah, Tariq

2011-01-01

A transversely isotropic (TI) model with a tilted symmetry axis is regarded as one of the most effective approximations to the Earth subsurface, especially for imaging purposes. However, we commonly utilize this model by setting the axis of symmetry normal to the reflector. This assumption may be accurate in many places, but deviations from this assumption will cause errors in the wavefield description. Using perturbation theory and Taylor's series, I expand the solutions of the eikonal equation for 2D TI media with respect to the independent parameter θ, the angle the tilt of the axis of symmetry makes with the vertical, in a generally inhomogeneous TI background with a vertical axis of symmetry. I do an additional expansion in terms of the independent (anellipticity) parameter in a generally inhomogeneous elliptically anisotropic background medium. These new TI traveltime solutions are given by expansions in and θ with coefficients extracted from solving linear first-order partial differential equations. Pade approximations are used to enhance the accuracy of the representation by predicting the behavior of the higher-order terms of the expansion. A simplification of the expansion for homogenous media provides nonhyperbolic moveout descriptions of the traveltime for TI models that are more accurate than other recently derived approximations. In addition, for 3D media, I develop traveltime approximations using Taylor's series type of expansions in the azimuth of the axis of symmetry. The coefficients of all these expansions can also provide us with the medium sensitivity gradients (Jacobian) for nonlinear tomographic-based inversion for the tilt in the symmetry axis. © 2011 Society of Exploration Geophysicists.

Data on the electromagnetic pion form factor and p-wave

International Nuclear Information System (INIS)

Dubnicka, S.; Meshcheryakov, V.A.; Milko, J.

1980-01-01

The pion form factor absolute value data (free of the omega meson contribution) are unified with the P-wave isovector ππ phase shift. The resultant real and imaginary parts of the pion form factor are described by means of the Pade approximation. All the data, which involve the pion form factor experimental points from the range of momenta - 0.8432 GeV 2 2 , the pion charge radius, and the P-wave isovector ππ phase shift in the elastic region (including also the generally accepted value of the scattering length) are mutually consistent. The data themselves through the Pade approximation reveal that the aforementioned consistency can be achieved only if the pion form factor left-hand cut from the second Riemann sheet is taken into account. Almost in all of the considered Pade approximations one stable pion form factor zero is found in the space-like region, which might indicate the existence of a diffraction minimum in the differential cross section for elastic e - π scattering as a consequence of the constituent structure of the pion like in the case of the electron elastic scattering on nuclei

Present status on numerical algorithms and benchmark tests for point kinetics and quasi-static approximate kinetics

International Nuclear Information System (INIS)

Ise, Takeharu

1976-12-01

Review studies have been made on algorithms of numerical analysis and benchmark tests on point kinetics and quasistatic approximate kinetics computer codes to perform efficiently benchmark tests on space-dependent neutron kinetics codes. Point kinetics methods have now been improved since they can be directly applied to the factorization procedures. Methods based on Pade rational function give numerically stable solutions and methods on matrix-splitting are interested in the fact that they are applicable to the direct integration methods. An improved quasistatic (IQ) approximation is the best and the most practical method; it is numerically shown that the IQ method has a high stability and precision and the computation time which is about one tenth of that of the direct method. IQ method is applicable to thermal reactors as well as fast reactors and especially fitted for fast reactors to which many time steps are necessary. Two-dimensional diffusion kinetics codes are most practicable though there exist also three-dimensional diffusion kinetics code as well as two-dimensional transport kinetics code. On developing a space-dependent kinetics code, in any case, it is desirable to improve the method so as to have a high computing speed for solving static diffusion and transport equations. (auth.)

Comparison of matrix exponential methods for fuel burnup calculations

International Nuclear Information System (INIS)

Oh, Hyung Suk; Yang, Won Sik

1999-01-01

Series expansion methods to compute the exponential of a matrix have been compared by applying them to fuel depletion calculations. Specifically, Taylor, Pade, Chebyshev, and rational Chebyshev approximations have been investigated by approximating the exponentials of bum matrices by truncated series of each method with the scaling and squaring algorithm. The accuracy and efficiency of these methods have been tested by performing various numerical tests using one thermal reactor and two fast reactor depletion problems. The results indicate that all the four series methods are accurate enough to be used for fuel depletion calculations although the rational Chebyshev approximation is relatively less accurate. They also show that the rational approximations are more efficient than the polynomial approximations. Considering the computational accuracy and efficiency, the Pade approximation appears to be better than the other methods. Its accuracy is better than the rational Chebyshev approximation, while being comparable to the polynomial approximations. On the other hand, its efficiency is better than the polynomial approximations and is similar to the rational Chebyshev approximation. In particular, for fast reactor depletion calculations, it is faster than the polynomial approximations by a factor of ∼ 1.7. (author). 11 refs., 4 figs., 2 tabs

Use of the SO(4,2) dynamical group for the study of the ground state of a hydrogen atom in a homogeneous magnetic field

International Nuclear Information System (INIS)

Cizek, J.; Vrscay, E.R.

1977-01-01

A perturbation procedure based on the use of the SO(4,2) dynamical group, which includes as its most important feature the nonunitary tilting transformation, is applied to the hydrogen atom system in a strong magnetic field and the terms ΔΣ/sub n/ were calculated to 40th order. The difficulty in using this approach is that the series has zero radius of convergence. Nevertheless, the Pade approximant technique may be used for the summation of the series. Surprising accuracy is found for the Pade estimate of the ionization energy. 5 references

Gaussian shaping filter for nuclear spectrometry

International Nuclear Information System (INIS)

Menezes, A.S.C. de.

1980-01-01

A theorical study of a gaussian shaping filter, using Pade approximation, for using in gamma spectroscopy is presented. This approximation has proved superior to the classical cascade RC integrators approximation in therms of signal-to-noise ratio and pulse simmetry. An experimental filter was designed, simulated in computer, constructed, and tested in the laboratory. (author) [pt

On the analytic continuation of functions defined by Legendre series

International Nuclear Information System (INIS)

Grinstein, F.F.

1981-07-01

An infinite diagonal sequence of Punctual Pade Approximants is considered for the approximate analytical continuation of a function defined by a formal Legendre series. The technique is tested in the case of two series with exactly known analytical sum: the generating function for Legendre polynomials and the Coulombian scattering amplitude. (author)

Probability tables and gauss quadrature: application to neutron cross-sections in the unresolved energy range

International Nuclear Information System (INIS)

Ribon, P.; Maillard, J.M.

1986-09-01

The idea of describing neutron cross-section fluctuations by sets of discrete values, called ''probability tables'', was formulated some 15 years ago. We propose to define the probability tables from moments by equating the moments of the actual cross-section distribution in a given energy range to the moments of the table. This definition introduces PADE approximants, orthogonal polynomials and GAUSS quadrature. This mathematical basis applies very well to the total cross-section. Some difficulties appear when partial cross-sections are taken into account, linked to the ambiguity of the definition of multivariate PADE approximants. Nevertheless we propose solutions and choices which appear to be satisfactory. Comparisons are made with other definitions of probability tables and an example of the calculation of a mixture of nuclei is given. 18 refs

Probability tables and gauss quadrature: application to neutron cross-sections in the unresolved energy range

International Nuclear Information System (INIS)

Ribon, P.; Maillard, J.M.

1986-01-01

The idea of describing neutron cross-section fluctuations by sets of discrete values, called probability tables, was formulated some 15 years ago. The authors propose to define the probability tables from moments by equating the moments of the actual cross-section distribution in a given energy range to the moments of the table. This definition introduces PADE approximants, orthogonal polynomials and GAUSS quadrature. This mathematical basis applies very well to the total cross-section. Some difficulties appear when partial cross-sections are taken into account, linked to the ambiguity of the definition of multivariate PADE approximants. Nevertheless the authors propose solutions and choices which appear to be satisfactory. Comparisons are made with other definition of probability tables and an example of the calculation of a mixture of nuclei is given

Exponential-fitted methods for integrating stiff systems of ordinary differential equations: Applications to homogeneous gas-phase chemical kinetics

Science.gov (United States)

Pratt, D. T.

1984-01-01

Conventional algorithms for the numerical integration of ordinary differential equations (ODEs) are based on the use of polynomial functions as interpolants. However, the exact solutions of stiff ODEs behave like decaying exponential functions, which are poorly approximated by polynomials. An obvious choice of interpolant are the exponential functions themselves, or their low-order diagonal Pade (rational function) approximants. A number of explicit, A-stable, integration algorithms were derived from the use of a three-parameter exponential function as interpolant, and their relationship to low-order, polynomial-based and rational-function-based implicit and explicit methods were shown by examining their low-order diagonal Pade approximants. A robust implicit formula was derived by exponential fitting the trapezoidal rule. Application of these algorithms to integration of the ODEs governing homogenous, gas-phase chemical kinetics was demonstrated in a developmental code CREK1D, which compares favorably with the Gear-Hindmarsh code LSODE in spite of the use of a primitive stepsize control strategy.

Radioactivity computation of steady-state and pulsed fusion reactors operation

International Nuclear Information System (INIS)

Attaya, H.

1994-06-01

Different mathematical methods are used to calculate the nuclear transmutation in steady-state and pulsed neutron irradiation. These methods are the Schuer decomposition, the eigenvector decomposition, and the Pade approximation of the matrix exponential function. In the case of the linear decay chain approximation, a simple algorithm is used to evaluate the transition matrices

WHAMP - waves in homogeneous, anisotropic, multicomponent plasmas

International Nuclear Information System (INIS)

Roennmark, K.

1982-06-01

In this report, a computer program which solves the dispersion relation of waves in a magnetized plasma is described. The dielectric tensor is derived using the kinetic theory of homogeneous plasmas with Maxwellian velocity distribution. Up to six different plasma components can be included in this version of the program, and each component is specified by its density, temperature, particle mass, anisotropy and drift velocity along the magnetic field. The program is thus applicable to a very wide class of plasmas, and the method should in general be useful whenever a homogeneous magnetized plasma can be approximated by a linear combination of Maxwellian components. The general theory underlying the program is outlined. It is shown that by introducing a Pade approximant for the plasma dispersion function Z, the infinite sums of modified Bessel functions which appear in the dielectric tensor may be reduced to a summable form. The Pade approximant is derived and the accuracy of the approximation is also discussed. The subroutines making up the program are described. (Author)

Some comments on the hydrogen atom in a spherical enclosure

International Nuclear Information System (INIS)

Aguilera-Navarro, V.C.; Koo, E.L.; Zimerman, A.H.

1980-01-01

Some properties of the ground state energy solutions for the hydrogen atom in a spherical enclosure are discussed. The application of the many-point Pade approximants to this kind of systems inside a box is consider also. (Author) [pt

$\\pi$ $\\pi$ theories

CERN Document Server

Basdevant, J L

1972-01-01

Reviews the structure of pion pion theories, in particular Roskies' sum rules, Martin's inequalities, Roy's relations, Roy's equations, Atkinsons Program, the Chew-Mandelstam equations, the Bootstrap phenomenological analyses, current algebra input, FESR bootstrap Lovelace Veneziano model and the Pade approximation. (63 refs).

A convergent reformulation of perturbative QCD

International Nuclear Information System (INIS)

Alves, R.J.G.

2000-10-01

We present and explore a new formulation of perturbative QCD based not on the renormalised coupling but on the dimensional transmutation parameter of the theory and the property of asymptotic scaling. The approach yields a continued function, the iterated function being that involved in the solution of the two-loop β-function equation. In the so-called large-b limit the continued function reduces to a continued fraction and the successive approximants are diagonal Pade approximants. We investigate numerically the convergence of successive approximants using the leading-b approximation, motivated by renormalons, to model the all-orders result. We consider the Adler D-function of vacuum polarisation, the Polarised Bjorken and Gross-LIewellyn Smith sum rules, the (unpolarised) Bjorken sum rule, and the Minkowskian quantities R τ and the R-ratio of e + e - annihilation. In contrast to diagonal Pade approximants the truncated continued function method gives remarkably stable large-order approximants in cases where infrared renormalon effects are important. We also use the new approach to determine the QCD fundamental parameters from the R τ and the R-ratio measurements, where we find Λ-tilde (3)/MS = 516 ± 48 MeV (which yields α s (μ = m τ ) = 0.360 -0.020 +0.021 ), and Λ-tilde (5)/MS = 299 -7 +6 MeV (which yields α s (μ = m z 0 ) = 0.1218 ± 0.0004), respectively. The evolution of the former value to the m z 0 energy results in α s (μ = m z 0 ) = 0.123 ± 0.002. These values are in line with other determinations available in the literature. We implement the Complete Renormalisation Group Improvement (CORGI) scheme throughout all the calculations. We report on how the mathematical concept of Stieltjes series can be used to assess the convergence of Pade approximants of perturbative series. We find that the combinations of UV renormalons which occur in perturbative QCD may or may not be Stieltjes series depending on the renormalisation scheme used. (author)

Dynamical fit to low-energy π-N phase shifts and determination of the threshold parameters

International Nuclear Information System (INIS)

Brunet, R.C.

1977-01-01

For the description of low-energy πN scattering, [1/1] Pade approximants have had limited success starting from Lagrangian-induced power series. We have shown elsewhere that, from a formal power series whose generating kernel can in principle be approximated by a kernel of finite rank N, we can construct a democratic approximant A/sup N/ with N perturbative terms which provides as good an approximation to the true solution as a Pade approximant [N/N] with 2N perturbative terms. Here we use the two available orders of perturbative terms g 2 and g 4 of the Lagrangian gpsi-tildeγ 5 psiphi to construct a democratic approximant A/sup N/ 2 . We apply it to the low-energy πN phase-shift analysis of Carter, Bugg, and Carter and show empirically that a reasonably good fit can be obtained in the low-energy region with the two available orders of perturbative terms. Extrapolating this fit to threshold we determine scattering lengths and effective ranges for S and P waves which are in reasonably good agreement with more conventional dispersion-relation determinations. The method indicates how the concept of Lagrangian can be made dynamically relevant in a strong-interaction context

The Baecklund transformation for isomonodromy deformation Schlesinger equations

International Nuclear Information System (INIS)

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

1980-01-01

We define the transformation of linear differential equations with rational function coefficients that fix monodromy data and change local multiplicities by any sequence of integers. This transformation that gives rise to Pade approximations, at the same time defines the Baecklund transformation of Schlesinger equations. (orig.)

Coupled-channel analysis for heavy-ion scattering

International Nuclear Information System (INIS)

Kim, Byung-Taik.

1978-01-01

A method is given to carry out much faster coupled-channel (CC) calculations including the Coulomb excitation. For this purpose, two approximation techniques were used, namely, the WKB approximation of Alder and Pauli, in handling the effects of Coulomb excitation, and the Pade approximation for handling the large partial wave contribution. The formulation of CC calculations based on these two approximations is briefly discussed and some results of numerical calculations are shown for 16 O scattering with 152 Sm at 72 MeV

Pramana – Journal of Physics | Indian Academy of Sciences

Indian Academy of Sciences (India)

Pseudopotential plane-wave method (PP–PW) based on density functional theory (DFT) and density functional perturbation theory (DFPT) within the Teter and Pade exchangecorrelation functional form of the local spin density approximation (LSDA) is applied to study the effect of pressure on the elastic and piezoelectric ...

The coupled-channel T-matrix: its lowest-order Born + Lanczos approximants

International Nuclear Information System (INIS)

Znojil, M.

1995-01-01

Three iterative methods of solution of the Lippmann-Schwinger equations (viz., the method of continued fractions by J.Horacek and T.Sasakawa), its Born-remainder modification and a coupled-channel matrix-continued-fraction generalization are all interpreted as special cases of a common iterative matrix prescription. Firstly, in terms of certain asymmetric projectors P≠P + , we re-derive the three particular older methods as different realizations of the well-known Lanczos inversion. Then, a generalized iteration method is proposed as a Born-like re-arrangement of any intermediate Lanczos iteration step. A maximal flexibility is achieved in the formalism which might compete with the standard Pade re-summations in practice. Its first few truncations are listed, therefore. 26 refs., 1 tab

Simulation of Simple Controlled Processes with Dead-Time.

Science.gov (United States)

Watson, Keith R.; And Others

1985-01-01

The determination of closed-loop response of processes containing dead-time is typically not covered in undergraduate process control, possibly because the solution by Laplace transforms requires the use of Pade approximation for dead-time, which makes the procedure lengthy and tedious. A computer-aided method is described which simplifies the…

Extrapolation of lattice gauge theories to the continuum limit

International Nuclear Information System (INIS)

Duncan, A.; Vaidya, H.

1978-01-01

The problem of extrapolating lattice gauge theories from the strong-coupling phase to the continuum critical point is studied for the Abelian (U(1)) and non-Abelian (SU(2)) theories in three (space--time) dimensions. A method is described for obtaining the asymptotic behavior, for large β, of such thermodynamic quantities and correlation functions as the free energy and Wilson loop function. Certain general analyticity and positivity properties (in the complex β-plane) are shown to lead, after appropriate analytic remappings, to a Stieltjes property of these functions. Rigorous theorems then guarantee uniform and monotone convergence of the Pade approximants, with exact pointwise upper and lower bounds. The first three Pade's are computed for both the free energy and the Wilson function. For the free energy, satisfactory agreement is with the asymptotic behavior computed by an explicit lattice calculation. The strong-coupling series for the Wilson function is found to be considerably more unstable in the lower order terms - correspondingly, convergence of the Pade's is found to be slower than in the free-energy case. It is suggested that higher-order calculations may allow a reasonably accurate determination of the string constant for the SU(2) theory. 14 references

Leptogenesis from heavy right-handed neutrinos in CPT violating backgrounds

Energy Technology Data Exchange (ETDEWEB)

Bossingham, Thomas; Sarkar, Sarben [King' s College London, Theoretical Particle Physics and Cosmology Group, Department of Physics, London (United Kingdom); Mavromatos, Nick E. [King' s College London, Theoretical Particle Physics and Cosmology Group, Department of Physics, London (United Kingdom); Universitat de Valencia-CSIC, Departament de Fisica Teorica y IFIC, Valencia (Spain)

2018-02-15

We discuss leptogenesis in a model with heavy right-handed Majorana neutrinos propagating in a constant but otherwise generic CPT-violating axial time-like background (motivated by string theory). At temperatures much higher than the temperature of the electroweak phase transition, we solve approximately, but analytically (using Pade approximants), the corresponding Boltzmann equations, which describe the generation of lepton asymmetry from the tree-level decays of heavy neutrinos into Standard Model leptons. At such temperatures these leptons are effectively massless. The current work completes in a rigorous way a preliminary treatment of the same system, by some of the present authors. In this earlier work, lepton asymmetry was crudely estimated considering the decay of a right-handed neutrino at rest. Our present analysis includes thermal momentum modes for the heavy neutrino and this leads to a total lepton asymmetry which is bigger by a factor of two as compared to the previous estimate. Nevertheless, our current and preliminary results for the freezeout are found to be in agreement (within a ∝ 12.5% uncertainty). Our analysis depends on a novel use of Pade approximants to solve the Boltzmann equations and may be more widely useful in cosmology. (orig.)

Analysis of the dynamics of a boiling water nuclear reactor

International Nuclear Information System (INIS)

Castillo D, R.

1996-01-01

The March-Leuba lineal reduced model is represented mathematically by a differential equations system, which corresponds to the direct transfer function, punctual kinetics approximation, neutron field dynamics, heat transfer in fuels, and channel dynamics approximation that relates the fuel temperature changes to the reactivity changes by vacuums. The model presents significant differences in one of the equation coefficients. The Pade order approximation used for the equation deduction for the channel has a different behavior to the exponential one for long periods of bubble residence. (Author)

The loop expansion as a divergent-power-series expansion

International Nuclear Information System (INIS)

Murai, N.

1981-01-01

The loop expansion should be divergent, possibly an asymptotic one, in the Euclidean path integral formulation. This consideration is important in applications of the symmetric and mass-independent renormalization. The [1,1] Pade approximant is calculated in a PHI 4 model. Its classical vacua may be not truely stable for nonzero coupling constant. (author)

Evaluation of the excitation function of the 238U(n,2n)237U reaction for neutron energies from threshold to 19 MeV

International Nuclear Information System (INIS)

Kornilov, N.V.; Vinogradov, V.N.; Gay, E.V.; Rabotnov, N.S.; Salnikov, O.A.; Raics, P.; Daroczy, S.; Nagy, S.; Csikai, J.

1983-01-01

Experimental results for the 238 U(n,2n) reaction were collected from the literature and evaluated. The normalisation of the measured cross sections was carried out using recent values for the cross sections of standard monitor reactions as well as new nuclear decay data. The evaluated excitation function was then obtained by the Pade-approximation. (Auth.)

Physical properties of the chiral quantum baryon

International Nuclear Information System (INIS)

Mignaco, A.J.; Wulck, S.

1989-01-01

It is presented an account to understand the quantum chiral baryon, which a stable chiral soliton with baryon number one obtained after first quantization by collective coordinates. Starting from the exact series solution to the non-linear sigma model with the hedge-hog configuration, the values of several physical quantities (mass, axial weak coupling, gyromagnetic ratios and radii) as a function of the order of Pade approximants used as approximanted representations of the solution, are calculated. It turns out that consistent results may be obtained, but a better approximation should be developed. (author) [pt

Collection of scientific papers in collaboration with Joint Institute for Nuclear Research, Dubna, USSR and Central Research Institute for Physics, Budapest, Hungary Vol. 6

International Nuclear Information System (INIS)

Zhidkov, E.P.; Lobanov, Yu.Yu.; Nemeth, G.

1989-11-01

Papers of collaboration of JINR, Dubna and CRIP, Budapest, are presented in the field of algorithms and computer programs for solution of physical problems. The topics include computer evaluation and calculation of functional integrals and Pade approximants, occurring in theoretical particle physics, field theory and statistical physics, error estimations for approximate solutions of quasilinear integrodifferential evolution equations, overview of protocol testing, improved random number generation methods and computer simulation methods in molecule physics. Computer codes are also presented. (D.G.)

Connection between strong and weak coupling in the mean spherical model in 1 + 1 dimensions

International Nuclear Information System (INIS)

Banks, J.L.

1980-01-01

I extend the strong-coupling expansion obtained by Srednicki, for the β-function of the mean spherical model in 1 + 1 dimensions, in the hamiltonian formulation. I use ordinary and two-point Pade approximants to extrapolate this result to weak coupling. I find a reasonably smooth connection between strong and weak coupling, and good numerical agreement with the exact solution. (orig.)

High temperature series expansions with a multiple-exchange Hamiltonian for the bcc and hcp phases of solid 3He

International Nuclear Information System (INIS)

Roger, M.; Suaudeau, E.; Bernier, M.E.R.

1987-08-01

High temperature series expansions with a multiple-exchange Hamiltonian are performed to fourth order in arbitrary magnetic field for both phases of solid 3 He. The susceptibility series are analysed with Pade approximants and compared with recent experimental results. For the hcp phase we estimate the ferromagnetic ordering temperature from susceptibility series and discuss the influence of four-particle exchange in lowering the transition

On the pressure field of nonlinear standing water waves

Science.gov (United States)

Schwartz, L. W.

1980-01-01

The pressure field produced by two dimensional nonlinear time and space periodic standing waves was calculated as a series expansion in the wave height. The high order series was summed by the use of Pade approximants. Calculations included the pressure variation at great depth, which was considered to be a likely cause of microseismic activity, and the pressure distribution on a vertical barrier or breakwater.

Kinetic-energy functionals studied by surface calculations

DEFF Research Database (Denmark)

Vitos, Levente; Skriver, Hans Lomholt; Kollár, J.

1998-01-01

The self-consistent jellium model of metal surfaces is used to study the accuracy of a number of semilocal kinetic-energy functionals for independent particles. It is shown that the poor accuracy exhibited by the gradient expansion approximation and most of the semiempirical functionals in the lo...... density, high gradient limit may be subtantially improved by including locally a von Weizsacker term. Based on this, we propose a simple one-parameter Pade's approximation, which reproduces the exact Kohn-Sham surface kinetic energy over the entire range of metallic densities....

Diophantine approximation and badly approximable sets

DEFF Research Database (Denmark)

Kristensen, S.; Thorn, R.; Velani, S.

2006-01-01

. The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...

Exponential convergence rate (the spectral convergence) of the fast Pade transform for exact quantification in magnetic resonance spectroscopy

International Nuclear Information System (INIS)

Belkic, Dzevad

2006-01-01

This study deals with the most challenging numerical aspect for solving the quantification problem in magnetic resonance spectroscopy (MRS). The primary goal is to investigate whether it could be feasible to carry out a rigorous computation within finite arithmetics to reconstruct exactly all the machine accurate input spectral parameters of every resonance from a synthesized noiseless time signal. We also consider simulated time signals embedded in random Gaussian distributed noise of the level comparable to the weakest resonances in the corresponding spectrum. The present choice for this high-resolution task in MRS is the fast Pade transform (FPT). All the sought spectral parameters (complex frequencies and amplitudes) can unequivocally be reconstructed from a given input time signal by using the FPT. Moreover, the present computations demonstrate that the FPT can achieve the spectral convergence, which represents the exponential convergence rate as a function of the signal length for a fixed bandwidth. Such an extraordinary feature equips the FPT with the exemplary high-resolution capabilities that are, in fact, theoretically unlimited. This is illustrated in the present study by the exact reconstruction (within machine accuracy) of all the spectral parameters from an input time signal comprised of 25 harmonics, i.e. complex damped exponentials, including those for tightly overlapped and nearly degenerate resonances whose chemical shifts differ by an exceedingly small fraction of only 10 -11 ppm. Moreover, without exhausting even a quarter of the full signal length, the FPT is shown to retrieve exactly all the input spectral parameters defined with 12 digits of accuracy. Specifically, we demonstrate that when the FPT is close to the convergence region, an unprecedented phase transition occurs, since literally a few additional signal points are sufficient to reach the full 12 digit accuracy with the exponentially fast rate of convergence. This is the critical

The effect of scattering interference term on the practical width

International Nuclear Information System (INIS)

Martins do Amaral, C.; Martinez, A.S.

2001-01-01

The practical width Γ p has an important application in the characterization of the resonance type for the calculation of neutron average cross sections. Previous treatments ignore the interference term χζ,x for the Doppler broadening function in the practical width calculation. In the present paper, a rational approximation for the χζ,x function is derived, using a modified asymptotic Pade method. A new approximation for Γ p is obtained. The results which are presented here provide evidence that the practical width as a function of temperature varies considerably with the inclusion of the interference term χζ,x

FPSPH DFPSPF, Line Shape Function for Doppler Broadened Resonance Cross-Sections Calculation

International Nuclear Information System (INIS)

Ribon, P.

1982-01-01

1 - Description of problem or function: In the computation of Doppler- broadened resonance cross sections, use is made of the symmetric and anti-symmetric line shape functions. These functions usually denoted as Psi and Phi (Psi and Chi in Anglo-Saxon formalism) are defined in terms of the real and imaginary parts of the error function for complex arguments. They are the product of the convolution of a Gaussian function with the symmetric and anti-symmetric Breit-Wigner functions, respectively. FPSPH and DFPSPH compute these functions. 2 - Method of solution: For (1+x 2 ) > 20 Beta 2 , the calculation is based upon the asymptotic expansion: Psi+(i*Phi) = 1/(1-ix)*(1-t+3t 2 -3.5t 3 +3.5+7t 4 ---), with: t = 1/(2z 2 ); z = (1-ix)/Beta. The half-plane (Beta,x) is split in several parts, and use is made of PADE approximants. For 1 + x 2 2 , the calculation is based upon the relation with the erf function: Psi + i*Phi = SQRT(Pi)/Beta*(e (z 2 ) )*(1-erf(z)) (z = (1-ix)/Beta, and erf(z) being calculated from its analytic expansion: erf(z) = 2/SQRT(Pi)*z*e (-z 2 ) *(1+z 2 /3+z 4 /(3*5) + z 6 /(3*5*7)+---). PADE approximants are used to compute the expansion and e z 2

The n-loop expansion of the Reggeon calculus

International Nuclear Information System (INIS)

Dash, J.W.; Harrington, S.J.

1975-01-01

The technique known in solid state physics as the n-loop expansion is applied to calculate the critical indices of the phi 3 Gribov Reggeon calculus directly in two transverse dimensions. Infrared pathologies of the massless theory require the calculation to be done in the infinite momentum limit of the massive theory. For n = 1 the results are close to those of the epsilon-expansion in O(epsilon). For n = 2 the β function has no zero, analogously to the case in solid state physics. Use of a Pade approximant for β yields sigmasub(tot) approximately (ln s)sup(0.27) at infinity, close to the O(epsilon 2 ) result. (Auth.)

N-loop expansion of the Reggeon calculus

International Nuclear Information System (INIS)

Dash, J.W.; Harrington, S.J.

1975-08-01

The technique known in solid state physics as the n-loop expansion is applied to calculate the critical indices of the phi 3 Gribov Reggeon calculus directly in two transverse dimensions. Infrared pathologies of the massless theory require the calculation to be done in the infinite momentum limit of the massive theory. For n = 1 the results are close to those of the epsilon-expansion in O(epsilon). For n = 2 the β function has no zero, analogously to the case in solid state physics. Use of a Pade approximant for β → sigma/sub tot/ approximately equals(ln s) 0 . 27 at infinity, close to the O(epsilon 2 ) result

Rational fraction representations of the energy: a generalised Rayleigh-Schroedinger perturbation theory

International Nuclear Information System (INIS)

Cohen, M.; Feldmann, T.

1981-01-01

The energy function of a perturbed quantum system is derived directly as a quotient of the form N(lambda)/D(lambda). The Taylor series coefficients of N(lambda) and D(lambda) are found to satisfy certain relations, but there remain many unspecified degrees of freedom which may be freely exploited. Certain choices of coefficients lead to well known Pade and lesser known Levin approximants, but the general formalism includes many other rational function forms. In particular, the present procedure allows information other than the Taylor series coefficients to be included naturally, and is shown to lead to low-order approximants of high accuracy. (author)

Medication errors : the impact of prescribing and transcribing errors on preventable harm in hospitalised patients

NARCIS (Netherlands)

van Doormaal, J.E.; van der Bemt, P.M.L.A.; Mol, P.G.M.; Egberts, A.C.G.; Haaijer-Ruskamp, F.M.; Kosterink, J.G.W.; Zaal, Rianne J.

Background: Medication errors (MEs) affect patient safety to a significant extent. Because these errors can lead to preventable adverse drug events (pADEs), it is important to know what type of ME is the most prevalent cause of these pADEs. This study determined the impact of the various types of

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.

Hierarchical low-rank approximation for high dimensional approximation

KAUST Repository

Nouy, Anthony

2016-01-01

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

Complex singularities of the critical potential in the large-N limit

International Nuclear Information System (INIS)

Meurice, Y.

2003-01-01

We show with two numerical examples that the conventional expansion in powers of the field for the critical potential of 3-dimensional O(N) models in the large-N limit does not converge for values of φ 2 larger than some critical value. This can be explained by the existence of conjugated branch points in the complex φ 2 plane. Pade approximants [L+3/L] for the critical potential apparently converge at large φ 2 . This allows high-precision calculation of the fixed point in a more suitable set of coordinates. We argue that the singularities are generic and not an artifact of the large-N limit. We show that ignoring these singularities may lead to inaccurate approximations

Applications of Laplace transform methods to airfoil motion and stability calculations

Science.gov (United States)

Edwards, J. W.

1979-01-01

This paper reviews the development of generalized unsteady aerodynamic theory and presents a derivation of the generalized Possio integral equation. Numerical calculations resolve questions concerning subsonic indicial lift functions and demonstrate the generation of Kutta waves at high values of reduced frequency, subsonic Mach number, or both. The use of rational function approximations of unsteady aerodynamic loads in aeroelastic stability calculations is reviewed, and a reformulation of the matrix Pade approximation technique is given. Numerical examples of flutter boundary calculations for a wing which is to be flight tested are given. Finally, a simplified aerodynamic model of transonic flow is used to study the stability of an airfoil exposed to supersonic and subsonic flow regions.

Development code for group constant processing

International Nuclear Information System (INIS)

Su'ud, Z.

1997-01-01

In this paper methods, formalism and algorithm related to group constant processing problem from basic library such as ENDF/B VI will be described. Basically the problems can be grouped as follows; the treatment of resolved resonance using NR approximation, the treatment of unresolved resonance using statistical method, the treatment of low lying resonance using intermediate resonance approximation, the treatment of thermal energy regions, and the treatment group transfer matrices cross sections. it is necessary to treat interference between resonance properly especially in the unresolved region. in this paper the resonance problems are treated based on Breit-wigner method, and doppler function is treated using Pade approximation for calculation efficiency. finally, some samples of calculational result for some nuclei, mainly for comparison between many methods are discussed in this paper

Derivation of reduced model for control system design using Chebyshev techniques

International Nuclear Information System (INIS)

Bistritz, Y.

1978-07-01

New methods are developed for reduced-order modelling of high-order, linear, time-invariant systems characterized by a transfer function. The first method is based on manipulating two Chebyshev polynomial series, one representing the frequency characteristics of the high-order system and the other representing the approximating low-order model. The proposed method can be viewed as generalizing the classical Pade approximation problem, with Chebyshev polynomial series being over a desired frequency interval instead of a power series about a single frequency point. The second method is based on approximating the high-order transfer function in terms of best Chebyshev approximation on a desired domain in the complex plane. An algorithm to find for a complex function best Chebyshev rational approximations in the complex plane is suggested and its theoretical basis confirmed. The algorithm is based on a complex version of Lawson algorithm that is applied to a complex version of a rational least square approximation program. (author)

A fitting program for potential energy surfaces of bent triatomic molecules

International Nuclear Information System (INIS)

Searles, D.J.; Nagy-Felsobuki, E.I. von

1992-01-01

A program has been developed in order to fit analytical power series expansions (Dunham, Simon-Parr-Finlan, Ogilvie and their exponential variants) and Pade approximants to discrete ab initio potential energy surfaces of non-linear triatomic molecules. The program employs standard least-squares fitting techniques using the singular decomposition method in order to dampen the higher-order coefficients (if deemed necessary) without significantly degrading the fit. The program makes full use of the symmetry of a triatomic molecule and so addresses the D 3h , C 2v and C S cases. (orig.)

Effective lagrangian for Kaon-nucleon scattering

International Nuclear Information System (INIS)

Andrade, S.C.B. de; Ferreira, E.M.

1980-11-01

A model for the Kaon-nucleon interaction is investigated, based on a lagrangian which includes the Yukawa interactions of hyperons, kaons and nucleons plus contact terms representing short range interactions in each isospin state. All diagrams up to fourth order are evaluated and the partial wave S matrix elements are unitarized through diagonal Pade approximants. The results of the calculations with this model give a good description of all experimental data on both I = O and I = 1 states of the KN system at low and intermediate energies. (Author) [pt

Two linearization methods for atmospheric remote sensing

International Nuclear Information System (INIS)

Doicu, A.; Trautmann, T.

2009-01-01

We present two linearization methods for a pseudo-spherical atmosphere and general viewing geometries. The first approach is based on an analytical linearization of the discrete ordinate method with matrix exponential and incorporates two models for matrix exponential calculation: the matrix eigenvalue method and the Pade approximation. The second method referred to as the forward-adjoint approach is based on the adjoint radiative transfer for a pseudo-spherical atmosphere. We provide a compact description of the proposed methods as well as a numerical analysis of their accuracy and efficiency.

Regularization of the Fourier series of discontinuous functions by various summation methods

Energy Technology Data Exchange (ETDEWEB)

Ahmad, S.S.; Beghi, L. (Padua Univ. (Italy). Seminario Matematico)

1983-07-01

In this paper the regularization by various summation methods of the Fourier series of functions containing discontinuities of the first and second kind are studied and the results of the numerical analyses referring to some typical periodic functions are presented. In addition to the Cesaro and Lanczos weightings, a new (i.e. cosine) weighting for accelerating the convergence rate is proposed. A comparison with the results obtained by Garibotti and Massaro with the punctual Pade approximants (PPA) technique in case of a periodic step function is also carried out.

Approximate Dynamic Programming: Combining Regional and Local State Following Approximations.

Science.gov (United States)

Deptula, Patryk; Rosenfeld, Joel A; Kamalapurkar, Rushikesh; Dixon, Warren E

2018-06-01

An infinite-horizon optimal regulation problem for a control-affine deterministic system is solved online using a local state following (StaF) kernel and a regional model-based reinforcement learning (R-MBRL) method to approximate the value function. Unlike traditional methods such as R-MBRL that aim to approximate the value function over a large compact set, the StaF kernel approach aims to approximate the value function in a local neighborhood of the state that travels within a compact set. In this paper, the value function is approximated using a state-dependent convex combination of the StaF-based and the R-MBRL-based approximations. As the state enters a neighborhood containing the origin, the value function transitions from being approximated by the StaF approach to the R-MBRL approach. Semiglobal uniformly ultimately bounded (SGUUB) convergence of the system states to the origin is established using a Lyapunov-based analysis. Simulation results are provided for two, three, six, and ten-state dynamical systems to demonstrate the scalability and performance of the developed method.

Efficiency of template banks for binary black-hole detection

International Nuclear Information System (INIS)

Cokelaer, Thomas; Babak, Stas; Sathyaprakash, B S

2004-01-01

In the framework of matched filtering theory, which is the most promising method for the detection of gravitational waves emitted by coalescing binaries, we report on the ability of a template bank to catch a simulated binary black-hole gravitational wave signal. If we suppose that the incoming signal waveform is known a priori, then both the (simulated) signal and the templates can be based on the same physical model and therefore the template bank can be optimal in the sense of Wiener filtering. This turns out to be true for the case of neutron star binaries but not necessarily for the black-hole case. When the templates and the signal are based on different physical models the detection bank may still remain efficient. Nonetheless, it might be a judicious choice to use a phenomenological template family such as the so-called BCV templates to catch all the different physical models. In the first part of that report, we illustrate in a non-exhaustive study, by using Monte Carlo simulations, the efficiency of a template bank based on the stationary phase approximation and show how it catches simulated signals based on the same physical model but fails to catch signals built using other models (Pade, EOB, ...) especially in the case of high mass binaries. In the second part, we construct a BCV-template bank and test its validity by injecting simulated signals based on different physical models such as the PN-approximants, Pade-approximant and the effective one-body method. We show that it is suitable for a search pipeline since it gives a match higher than 95% for all the different physical models. The range of individual mass which has been used is [3-20]M o-dot

Low energy phenomenology

CERN Document Server

Schmid, C

1972-01-01

The following topics are discussed: theoretical tools; models; Pade approximants; theoretical predictions of pi pi S-waves; pi pi phase shifts from K/sub e4/; Chew Low extrapolation in pi p to pi /sup -/ pi /sup +/n; the KK cusp in pi pi to pi pi ; K pi phase shifts. (25 refs) . For pt. I see ibid., 265. The following topics are discussed: patterns of resonance couplings from exchange degeneracy; Reggeon couplings; clash of t and s channel structure in pole model; B/sub 4/ phenomenology; Odorico zeros; Barrelet zeros and phase shift ambiguities. (29 refs).

Critical behaviour of magnetic thin film with Heisenberg spin-S model

International Nuclear Information System (INIS)

Masrour, R.; Hamedoun, M.; Bouslykhane, K.; Hourmatallah, A.; Benzakour, N.; Benyoussef, A.

2009-01-01

The magnetic properties of a ferromagnetic thin film of face centered cubic (FCC) lattice with Heisenberg spin-S are examined using the high-temperature series expansions technique extrapolated with Pade approximations method. The critical reduced temperature of the system τ c is studied as function of thickness of the film and the exchange interactions in the bulk, and within the surfaces J b , J s and J perpendicular respectively. A critical value of surface exchange interaction above which surface magnetism appears is obtained. The dependence of the reduced critical temperature on the film thickness L has been investigated.

The magnetic state of diamagnetically diluted antiferromagnetic cobalt and nickel monoxide

International Nuclear Information System (INIS)

Masrour, R.; Hamedoun, M.; Benyoussef, A.

2009-01-01

The nearest neighbour J 1 (x) and the next-neighbour super-exchange J 2 (x) interactions are evaluated by using the mean field theory for Mg 1-x B x O (B=Co and Ni) systems. The magnetic energy E(x) is obtained. A magnetic phase diagram of the Mg 1-x B x O (B=Co and Ni) solid solutions with 0≤x≤1 is drawn by high-temperature series expansions (HTSE) combined with the Pade approximants method (PA). The critical exponents associated with the magnetic susceptibility (γ) and with the correlation length (ν) are deduced in order phase.

A simplified fixed-point perturbation theory and its application to the coulomb + short-range potential

International Nuclear Information System (INIS)

Znojil, M.

1986-01-01

The radial Schroedinger equation and its bound-state solutions for the interaction V(r)=Vsub(coulomb)+Vsub(Pade), where Vsub(Pade)(r)=(b+cr)/(1+drsup(2)) are considered. In order to construct exactly the Feshbach effective Hamiltonian Hsup(eff), the fixed-point-substraction technique is employed and its simplification is proposed. The first two terms in the resulting asymptotic expansions of PSIsub(n) and Hsup(eff) are calculated and interpreted as a new type of perturbation theory

Systematic review of the incidence and characteristics of preventable adverse drug events in ambulatory care

DEFF Research Database (Denmark)

Thomsen, Linda Aagaard; Winterstein, Almut G; Søndergaard, Birthe

2007-01-01

studies, health services research, and follow-up studies. Additional articles were found in the reference sections of retrieved articles. STUDY SELECTION AND DATA EXTRACTION: Peer-reviewed articles assessing pADEs in ambulatory care, with detailed descriptions/frequency distributions of (1) ADE....../pADE incidence, (2) clinical outcomes, (3) associated drug groups, and/or (4) underlying medication errors were included. Study country, year and design, sample size, follow-up time, ADE/pADE identification method, proportion of ADEs/pADEs and ADEs/pADEs requiring hospital admission, and frequency distribution......-months, and the pADE incidence was 5.6 per 1000 person-months (1.1-10.1). The median ADE preventability rate was 21% (11-38%). The median incidence of ADEs requiring hospital admission was 0.45 (0.10-13.1) per 1000 person-months, and the median incidence of pADEs requiring hospital admission was 4.5 per 1000 person...

Approximate symmetries of Hamiltonians

Science.gov (United States)

Chubb, Christopher T.; Flammia, Steven T.

2017-08-01

We explore the relationship between approximate symmetries of a gapped Hamiltonian and the structure of its ground space. We start by considering approximate symmetry operators, defined as unitary operators whose commutators with the Hamiltonian have norms that are sufficiently small. We show that when approximate symmetry operators can be restricted to the ground space while approximately preserving certain mutual commutation relations. We generalize the Stone-von Neumann theorem to matrices that approximately satisfy the canonical (Heisenberg-Weyl-type) commutation relations and use this to show that approximate symmetry operators can certify the degeneracy of the ground space even though they only approximately form a group. Importantly, the notions of "approximate" and "small" are all independent of the dimension of the ambient Hilbert space and depend only on the degeneracy in the ground space. Our analysis additionally holds for any gapped band of sufficiently small width in the excited spectrum of the Hamiltonian, and we discuss applications of these ideas to topological quantum phases of matter and topological quantum error correcting codes. Finally, in our analysis, we also provide an exponential improvement upon bounds concerning the existence of shared approximate eigenvectors of approximately commuting operators under an added normality constraint, which may be of independent interest.

Computation of a long-time evolution in a Schroedinger system

International Nuclear Information System (INIS)

Girard, R.; Kroeger, H.; Labelle, P.; Bajzer, Z.

1988-01-01

We compare different techniques for the computation of a long-time evolution and the S matrix in a Schroedinger system. As an application we consider a two-nucleon system interacting via the Yamaguchi potential. We suggest computation of the time evolution for a very short time using Pade approximants, the long-time evolution being obtained by iterative squaring. Within the technique of strong approximation of Moller wave operators (SAM) we compare our calculation with computation of the time evolution in the eigenrepresentation of the Hamiltonian and with the standard Lippmann-Schwinger solution for the S matrix. We find numerical agreement between these alternative methods for time-evolution computation up to half the number of digits of internal machine precision, and fairly rapid convergence of both techniques towards the Lippmann-Schwinger solution

Geometric approximation algorithms

CERN Document Server

Har-Peled, Sariel

2011-01-01

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.

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

Approximating distributions from moments

Science.gov (United States)

Pawula, R. F.

1987-11-01

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

General Rytov approximation.

Science.gov (United States)

Potvin, Guy

2015-10-01

We examine how the Rytov approximation describing log-amplitude and phase fluctuations of a wave propagating through weak uniform turbulence can be generalized to the case of turbulence with a large-scale nonuniform component. We show how the large-scale refractive index field creates Fermat rays using the path integral formulation for paraxial propagation. We then show how the second-order derivatives of the Fermat ray action affect the Rytov approximation, and we discuss how a numerical algorithm would model the general Rytov approximation.

How to discretize differential systems in a systematic way

International Nuclear Information System (INIS)

Murata, M; Satsuma, J; Ramani, A; Grammaticos, B

2010-01-01

We present a systematic approach to the construction of discrete analogues for differential systems. Our method is tailored to first-order differential equations and relies on a formal linearization, followed by a Pade-like rational approximation of an exponential evolution operator. We apply our method to a host of systems for which there exist discretization results obtained by what we call the 'intuitive' method and compare the discretizations obtained. A discussion of our method as compared to one of the Mickens is also presented. Finally we apply our method to a system of coupled Riccati equations with emphasis on the preservation of the integrable character of the differential system.

Discrete-ordinate method with matrix exponential for a pseudo-spherical atmosphere: Scalar case

International Nuclear Information System (INIS)

Doicu, A.; Trautmann, T.

2009-01-01

We present a discrete-ordinate algorithm using the matrix-exponential solution for pseudo-spherical radiative transfer. Following the finite-element technique we introduce the concept of layer equation and formulate the discrete radiative transfer problem in terms of the level values of the radiance. The layer quantities are expressed by means of matrix exponentials, which are computed by using the matrix eigenvalue method and the Pade approximation. These solution methods lead to a compact and versatile formulation of the radiative transfer. Simulated nadir and limb radiances for an aerosol-loaded atmosphere and a cloudy atmosphere are presented along with a discussion of the model intercomparisons and timings

Approximation techniques for engineers

CERN Document Server

Komzsik, Louis

2006-01-01

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

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

Ordered cones and approximation

CERN Document Server

Keimel, Klaus

1992-01-01

This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.

CONTRIBUTIONS TO RATIONAL APPROXIMATION,

Science.gov (United States)

Some of the key results of linear Chebyshev approximation theory are extended to generalized rational functions. Prominent among these is Haar’s...linear theorem which yields necessary and sufficient conditions for uniqueness. Some new results in the classic field of rational function Chebyshev...Furthermore a Weierstrass type theorem is proven for rational Chebyshev approximation. A characterization theorem for rational trigonometric Chebyshev approximation in terms of sign alternation is developed. (Author)

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

Optimal random perturbations for stochastic approximation using a simultaneous perturbation gradient approximation

DEFF Research Database (Denmark)

Sadegh, Payman; Spall, J. C.

1998-01-01

simultaneous perturbation approximation to the gradient based on loss function measurements. SPSA is based on picking a simultaneous perturbation (random) vector in a Monte Carlo fashion as part of generating the approximation to the gradient. This paper derives the optimal distribution for the Monte Carlo...

Approximate kernel competitive learning.

Science.gov (United States)

Wu, Jian-Sheng; Zheng, Wei-Shi; Lai, Jian-Huang

2015-03-01

Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches. Copyright © 2014 Elsevier Ltd. All rights reserved.

High-temperature expansion along the self-dual line of three-dimensional Z(2) spin-gauge theory

International Nuclear Information System (INIS)

Bhanot, G.

1981-01-01

We exploit the self-duality of the three-dimensional Ising spin-gauge theory to develop an eighth-order high-temperature expansion for the partition function along the self-dual line. This generates a high-temperature series for the gauge-invariant, nearest-neighbor spin-spin correlation function. A Pade analysis of this series reveals a pole along the self-dual line. Recent Monte Carlo simulations indicate that this theory has a first-order self-dual line emerging from a triple point. We interpret the Pade pole as a theoretical estimate of the end point of this self-dual line

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

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.

Non-perturbative chiral corrections for lattice QCD

International Nuclear Information System (INIS)

Thomas, A.W.; Leinweber, D.B.; Lu, D.H.

2002-01-01

We explore the chiral aspects of extrapolation of observables calculated within lattice QCD, using the nucleon magnetic moments as an example. Our analysis shows that the biggest effects of chiral dynamics occur for quark masses corresponding to a pion mass below 600 MeV. In this limited range chiral perturbation theory is not rapidly convergent, but we can develop some understanding of the behaviour through chiral quark models. This model dependent analysis leads us to a simple Pade approximant which builds in both the limits m π → 0 and m π → ∞ correctly and permits a consistent, model independent extrapolation to the physical pion mass which should be extremely reliable. (author)

Discrete-ordinate method with matrix exponential for a pseudo-spherical atmosphere: Vector case

International Nuclear Information System (INIS)

Doicu, A.; Trautmann, T.

2009-01-01

The paper is devoted to the extension of the matrix-exponential formalism for the scalar radiative transfer to the vector case. Using basic results of the theory of matrix-exponential functions we provide a compact and versatile formulation of the vector radiative transfer. As in the scalar case, we operate with the concept of the layer equation incorporating the level values of the Stokes vector. The matrix exponentials which enter in the expression of the layer equation are computed by using the matrix eigenvalue method and the Pade approximation. A discussion of the computational efficiency of the proposed method for both an aerosol-loaded atmosphere as well as a cloudy atmosphere is also provided

Magnetic properties of a ferromagnet spin-S, Ising, XY and Heisenberg models semi-infinites systems

International Nuclear Information System (INIS)

Masrour, R.; Hamedoun, M.; Hourmatallah, A.; Bouslykhane, K.; Benzakour, N.

2008-01-01

The magnetic properties of a ferromagnet spin-S a disordered semi-infinite system with a face-centered cubic lattice are investigated using the high-temperature series expansions technique extrapolated with Pade approximants method for Heisenberg, XY and Ising models. The reduced critical temperature of the system τ c =(k B T c )/(2S(S+1)J b ) is studied as function of the thickness of the film and the exchange interactions in the bulk, and within the surfaces J b ,J s and J perpendicular , respectively. It is found that τ c increases with the exchange interactions of surface. The magnetic phase diagrams (τ c versus the dilution x) and the percolation threshold are obtained

Magnetic properties of magnetic Co1-xMgxFe2O4 spinel by HTSE method

International Nuclear Information System (INIS)

Hamedoun, M.; Benyoussef, A.; Bousmina, M.

2011-01-01

Magnetic properties and exchange-coupling interactions of diluted magnetic spinels A 1-x A' x B 2 X 4 , where A and B are magnetic ions, namely Co 1-x Mg x Fe 2 O 4 , were investigated using the high-temperature series expansion method (HTSE) and the distribution method of magnetic cations in the range 0≤x≤1. The magnetic phase diagram and transition temperature versus dilution x were determined using the Pade approximants method along with HTSE. The critical exponent associated with the magnetic susceptibility γ was then deduced. The obtained results are in good agreement with experimental results and critical exponent values are consistent with those suggested by the universality hypothesis.

Forms of Approximate Radiation Transport

CERN Document Server

Brunner, G

2002-01-01

Photon radiation transport is described by the Boltzmann equation. Because this equation is difficult to solve, many different approximate forms have been implemented in computer codes. Several of the most common approximations are reviewed, and test problems illustrate the characteristics of each of the approximations. This document is designed as a tutorial so that code users can make an educated choice about which form of approximate radiation transport to use for their particular simulation.

Approximate and renormgroup symmetries

International Nuclear Information System (INIS)

Ibragimov, Nail H.; Kovalev, Vladimir F.

2009-01-01

''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)

Solution of the pulse width modulation problem using orthogonal polynomials and Korteweg-de Vries equations.

Science.gov (United States)

Chudnovsky, D V; Chudnovsky, G V

1999-10-26

The mathematical underpinning of the pulse width modulation (PWM) technique lies in the attempt to represent "accurately" harmonic waveforms using only square forms of a fixed height. The accuracy can be measured using many norms, but the quality of the approximation of the analog signal (a harmonic form) by a digital one (simple pulses of a fixed high voltage level) requires the elimination of high order harmonics in the error term. The most important practical problem is in "accurate" reproduction of sine-wave using the same number of pulses as the number of high harmonics eliminated. We describe in this paper a complete solution of the PWM problem using Pade approximations, orthogonal polynomials, and solitons. The main result of the paper is the characterization of discrete pulses answering the general PWM problem in terms of the manifold of all rational solutions to Korteweg-de Vries equations.

Exchange integrals and magnetic short range order in the system CdCr2-xGaxSe4 (0=

International Nuclear Information System (INIS)

Bakrim, H.; Bouslykhane, K.; Hamedoun, M.; Hourmatallah, A.; Benzakour, N.

2005-01-01

High-temperature series expansions are derived for the magnetic susceptibility and two-spin correlation functions for a Heisenberg ferromagnetic model on the B-spinel lattice. The calculations are developed in the framework of the random phase approximation and are given for both nearest and next-nearest neighbour exchange integrals J1 and J2, respectively. Our results are given up to order 6 in β=(kBT)-1 and are used to study the paramagnetic region of the ferromagnetic spinel CdCr 2-x Ga x Se 4 . The critical temperature Tc and the critical exponents γ and ν associated with the magnetic susceptibility χ(T) and the correlation length ξ(T), respectively are deduced by applying the Pade approximate methods. The results as a function of the dilution x obtained by the present approach are found to be in agreement with the experimental ones

Revisiting the Landau fluid closure.

Science.gov (United States)

Hunana, P.; Zank, G. P.; Webb, G. M.; Adhikari, L.

2017-12-01

Advanced fluid models that are much closer to the full kinetic description than the usual magnetohydrodynamic description are a very useful tool for studying astrophysical plasmas and for interpreting solar wind observational data. The development of advanced fluid models that contain certain kinetic effects is complicated and has attracted much attention over the past years. Here we focus on fluid models that incorporate the simplest possible forms of Landau damping, derived from linear kinetic theory expanded about a leading-order (gyrotropic) bi-Maxwellian distribution function f_0, under the approximation that the perturbed distribution function f_1 is gyrotropic as well. Specifically, we focus on various Pade approximants to the usual plasma response function (and to the plasma dispersion function) and examine possibilities that lead to a closure of the linear kinetic hierarchy of fluid moments. We present re-examination of the simplest Landau fluid closures.

Approximations of Fuzzy Systems

Directory of Open Access Journals (Sweden)

Vinai K. Singh

2013-03-01

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

Approximate and renormgroup symmetries

Energy Technology Data Exchange (ETDEWEB)

Ibragimov, Nail H. [Blekinge Institute of Technology, Karlskrona (Sweden). Dept. of Mathematics Science; Kovalev, Vladimir F. [Russian Academy of Sciences, Moscow (Russian Federation). Inst. of Mathematical Modeling

2009-07-01

''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)

Cosmological applications of Padé approximant

International Nuclear Information System (INIS)

Wei, Hao; Yan, Xiao-Peng; Zhou, Ya-Nan

2014-01-01

As is well known, in mathematics, any function could be approximated by the Padé approximant. The Padé approximant is the best approximation of a function by a rational function of given order. In fact, the Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. In the present work, we consider the Padé approximant in two issues. First, we obtain the analytical approximation of the luminosity distance for the flat XCDM model, and find that the relative error is fairly small. Second, we propose several parameterizations for the equation-of-state parameter (EoS) of dark energy based on the Padé approximant. They are well motivated from the mathematical and physical points of view. We confront these EoS parameterizations with the latest observational data, and find that they can work well. In these practices, we show that the Padé approximant could be an useful tool in cosmology, and it deserves further investigation

Cosmological applications of Padé approximant

Science.gov (United States)

Wei, Hao; Yan, Xiao-Peng; Zhou, Ya-Nan

2014-01-01

As is well known, in mathematics, any function could be approximated by the Padé approximant. The Padé approximant is the best approximation of a function by a rational function of given order. In fact, the Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. In the present work, we consider the Padé approximant in two issues. First, we obtain the analytical approximation of the luminosity distance for the flat XCDM model, and find that the relative error is fairly small. Second, we propose several parameterizations for the equation-of-state parameter (EoS) of dark energy based on the Padé approximant. They are well motivated from the mathematical and physical points of view. We confront these EoS parameterizations with the latest observational data, and find that they can work well. In these practices, we show that the Padé approximant could be an useful tool in cosmology, and it deserves further investigation.

Prestack wavefield approximations

KAUST Repository

Alkhalifah, Tariq

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

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.

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

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 �

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

Dimensional perturbation theory for the two-electron atom

International Nuclear Information System (INIS)

Goodson, D.Z.

1987-01-01

Perturbation theory in δ = 1/D, where D is the dimensionality of space, is applied to the two-electron atom. In Chapter 1 an efficient procedure for calculating the coefficients of the perturbation series for the ground-state energy is developed using recursion relations between the moments of the coordinate operators. Results through tenth order are presented. The series is divergent, but Pade summation gives results comparable in accuracy to the best configuration-interaction calculations. The singularity structure of the Pade approximants confirms the hypothesis that the energy as a function of δ has an infinite sequence of poles on the negative real axis that approaches an essential singularity at δ = O. The essential singularity causes the divergence of the perturbation series. There are also two poles at δ = 1 that slow the asymptotic convergence of the low-order terms. In Chapter 2, various techniques are demonstrated for removing the effect of these poles, and accurate results are thereby obtained, even at very low order. In Chapter 3, the large D limit of the correlation energy (CE) is investigated. In the limit D → infinity it is only 35% smaller than at D = 3. It can be made to vanish in the limit by modifying the Hartree-Fock (HF) wavefunction. In Chapter 4, perturbation theory is applied to the Hooke's-law model of the atom. Prospects for treating more-complicated systems are briefly discussed

Constrained Optimization via Stochastic approximation with a simultaneous perturbation gradient approximation

DEFF Research Database (Denmark)

Sadegh, Payman

1997-01-01

This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...... of the optimization parameters. It is shown that, under application of the projection algorithm, the parameter iterate converges almost surely to a Kuhn-Tucker point, The procedure is illustrated by a numerical example, (C) 1997 Elsevier Science Ltd....

Some results in Diophantine approximation

DEFF Research Database (Denmark)

Pedersen, Steffen Højris

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

Bounded-Degree Approximations of Stochastic Networks

Energy Technology Data Exchange (ETDEWEB)

Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar

2017-06-01

We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.

Approximation by planar elastic curves

DEFF Research Database (Denmark)

Brander, David; Gravesen, Jens; Nørbjerg, Toke Bjerge

2016-01-01

We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good initial guess for the approximating curve. A gradient......-driven optimization is then used to find the approximating elastic curve....

Limitations of shallow nets approximation.

Science.gov (United States)

Lin, Shao-Bo

2017-10-01

In this paper, we aim at analyzing the approximation abilities of shallow networks in reproducing kernel Hilbert spaces (RKHSs). We prove that there is a probability measure such that the achievable lower bound for approximating by shallow nets can be realized for all functions in balls of reproducing kernel Hilbert space with high probability, which is different with the classical minimax approximation error estimates. This result together with the existing approximation results for deep nets shows the limitations for shallow nets and provides a theoretical explanation on why deep nets perform better than shallow nets. Copyright © 2017 Elsevier Ltd. All rights reserved.

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.

Mapping moveout approximations in TI media

KAUST Repository

Stovas, Alexey; Alkhalifah, Tariq Ali

2013-01-01

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.

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.

Nuclear Hartree-Fock approximation testing and other related approximations

International Nuclear Information System (INIS)

Cohenca, J.M.

1970-01-01

Hartree-Fock, and Tamm-Dancoff approximations are tested for angular momentum of even-even nuclei. Wave functions, energy levels and momenta are comparatively evaluated. Quadripole interactions are studied following the Elliott model. Results are applied to Ne 20 [pt

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.

Risk approximation in decision making: approximative numeric abilities predict advantageous decisions under objective risk.

Science.gov (United States)

Mueller, Silke M; Schiebener, Johannes; Delazer, Margarete; Brand, Matthias

2018-01-22

Many decision situations in everyday life involve mathematical considerations. In decisions under objective risk, i.e., when explicit numeric information is available, executive functions and abilities to handle exact numbers and ratios are predictors of objectively advantageous choices. Although still debated, exact numeric abilities, e.g., normative calculation skills, are assumed to be related to approximate number processing skills. The current study investigates the effects of approximative numeric abilities on decision making under objective risk. Participants (N = 153) performed a paradigm measuring number-comparison, quantity-estimation, risk-estimation, and decision-making skills on the basis of rapid dot comparisons. Additionally, a risky decision-making task with exact numeric information was administered, as well as tasks measuring executive functions and exact numeric abilities, e.g., mental calculation and ratio processing skills, were conducted. Approximative numeric abilities significantly predicted advantageous decision making, even beyond the effects of executive functions and exact numeric skills. Especially being able to make accurate risk estimations seemed to contribute to superior choices. We recommend approximation skills and approximate number processing to be subject of future investigations on decision making under risk.

Gyro-Landau fluid model of tokamak core fluctuations

International Nuclear Information System (INIS)

Leboeuf, J.N.; Carreras, B.A.; Dominguez, N.; Hedrick, C.L.; Sidikman, K.L.; Lynch, V.E.; Drake, J.B.; Walker, D.W.

1992-01-01

Dissipative trapped electron modes (DTEM) may be one of the causes of deterioration of confinement in tokamak and stellatator plasmas. We have implemented a fluid model to study DTEM turbulence in slab geometry. The electron dynamics include in addition to the adiabatic part, a non-adiabatic piece modeled with an i-delta-type response. The ion dynamics include Landau damping and FLR corrections through Landau fluid approximate techniques and Pade approximants for Γ 0 (b)=I 0 (b)e -b . The model follows from the gyrokinetic equation. Evolution equations, which closely resemble those used in standard reduced MHD, are presented since these are better suited to non-linear calculations. The numerical results of radially resolved calculations will be discussed. A recently developed hybrid model, which consists of a gyrokinetic implementation for the ions using particles and the same description for the electron dynamics as in the fluid model, will also be presented

Nonlinear approximation with dictionaries I. Direct estimates

DEFF Research Database (Denmark)

Gribonval, Rémi; Nielsen, Morten

2004-01-01

We study various approximation classes associated with m-term approximation by elements from a (possibly) redundant dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-term approximation w...

Treatment of divergent expansions in scattering theory

International Nuclear Information System (INIS)

Gersten, A.; Malin, S.

1978-01-01

One of the biggest obstacles in applying quantum field theory to realistic scattering problems are the divergencies of pertubation expansions for large coupling constants and the divergencies of partial wave expansions for massless particles exchanges. There exist, however, methods of summation of the divergent expansions which can lead to significant application in physics. In this paper we treat the problem of summing such expansions using three methods: (i) a generalization of the Pade approximation to the multivariable case. The suggested definition is unique and preserves unitarity. (ii) The summation of divergent partial waves for arbitrary spins. (iii) A successful application of a series inversion to the 3 P 1 nucleon-nucleon phase shift up to 200 MeV. (orig./WL) [de

A systematic iterative approach to the equations of low type

International Nuclear Information System (INIS)

Znojil, M.

1987-01-01

Nonlinear singular integral equations of the Low type appear in the description of π-N scattering amplitude at relativistic energies. The standard iteration solution differs and does not give sufficiently exact results even using the Pade approximation. A new approach is proposed. Its essence lies in a repeated formal simplification of the equation accompanied by a representation of the simplified amplitude in a generalized continued-fractional form. A simple example demonstrate that the new method improves the convergence of previous approach and essentially expands the region of its convergence. From the other side, its nonequivalence to a more complicate Newton-Kantorovich method is shown. In the future more realistic applications of the method one can expect increasing of result reliability

Stable reduced-order models of generalized dynamical systems using coordinate-transformed Arnoldi algorithms

Energy Technology Data Exchange (ETDEWEB)

Silveira, L.M.; Kamon, M.; Elfadel, I.; White, J. [Massachusetts Inst. of Technology, Cambridge, MA (United States)

1996-12-31

Model order reduction based on Krylov subspace iterative methods has recently emerged as a major tool for compressing the number of states in linear models used for simulating very large physical systems (VLSI circuits, electromagnetic interactions). There are currently two main methods for accomplishing such a compression: one is based on the nonsymmetric look-ahead Lanczos algorithm that gives a numerically stable procedure for finding Pade approximations, while the other is based on a less well characterized Arnoldi algorithm. In this paper, we show that for certain classes of generalized state-space systems, the reduced-order models produced by a coordinate-transformed Arnoldi algorithm inherit the stability of the original system. Complete Proofs of our results will be given in the final paper.

Spline approximation, Part 1: Basic methodology

Science.gov (United States)

Ezhov, Nikolaj; Neitzel, Frank; Petrovic, Svetozar

2018-04-01

In engineering geodesy point clouds derived from terrestrial laser scanning or from photogrammetric approaches are almost never used as final results. For further processing and analysis a curve or surface approximation with a continuous mathematical function is required. In this paper the approximation of 2D curves by means of splines is treated. Splines offer quite flexible and elegant solutions for interpolation or approximation of "irregularly" distributed data. Depending on the problem they can be expressed as a function or as a set of equations that depend on some parameter. Many different types of splines can be used for spline approximation and all of them have certain advantages and disadvantages depending on the approximation problem. In a series of three articles spline approximation is presented from a geodetic point of view. In this paper (Part 1) the basic methodology of spline approximation is demonstrated using splines constructed from ordinary polynomials and splines constructed from truncated polynomials. In the forthcoming Part 2 the notion of B-spline will be explained in a unique way, namely by using the concept of convex combinations. The numerical stability of all spline approximation approaches as well as the utilization of splines for deformation detection will be investigated on numerical examples in Part 3.

The efficiency of Flory approximation

International Nuclear Information System (INIS)

Obukhov, S.P.

1984-01-01

The Flory approximation for the self-avoiding chain problem is compared with a conventional perturbation theory expansion. While in perturbation theory each term is averaged over the unperturbed set of configurations, the Flory approximation is equivalent to the perturbation theory with the averaging over the stretched set of configurations. This imposes restrictions on the integration domain in higher order terms and they can be treated self-consistently. The accuracy δν/ν of Flory approximation for self-avoiding chain problems is estimated to be 2-5% for 1 < d < 4. (orig.)

Bent approximations to synchrotron radiation optics

International Nuclear Information System (INIS)

Heald, S.

1981-01-01

Ideal optical elements can be approximated by bending flats or cylinders. This paper considers the applications of these approximate optics to synchrotron radiation. Analytic and raytracing studies are used to compare their optical performance with the corresponding ideal elements. It is found that for many applications the performance is adequate, with the additional advantages of lower cost and greater flexibility. Particular emphasis is placed on obtaining the practical limitations on the use of the approximate elements in typical beamline configurations. Also considered are the possibilities for approximating very long length mirrors using segmented mirrors

INTOR cost approximation

International Nuclear Information System (INIS)

Knobloch, A.F.

1980-01-01

A simplified cost approximation for INTOR parameter sets in a narrow parameter range is shown. Plausible constraints permit the evaluation of the consequences of parameter variations on overall cost. (orig.) [de

A unified approach to the Darwin approximation

International Nuclear Information System (INIS)

Krause, Todd B.; Apte, A.; Morrison, P. J.

2007-01-01

There are two basic approaches to the Darwin approximation. The first involves solving the Maxwell equations in Coulomb gauge and then approximating the vector potential to remove retardation effects. The second approach approximates the Coulomb gauge equations themselves, then solves these exactly for the vector potential. There is no a priori reason that these should result in the same approximation. Here, the equivalence of these two approaches is investigated and a unified framework is provided in which to view the Darwin approximation. Darwin's original treatment is variational in nature, but subsequent applications of his ideas in the context of Vlasov's theory are not. We present here action principles for the Darwin approximation in the Vlasov context, and this serves as a consistency check on the use of the approximation in this setting

An Approximate Approach to Automatic Kernel Selection.

Science.gov (United States)

Ding, Lizhong; Liao, Shizhong

2016-02-02

Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.

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.

Self-similar continued root approximants

International Nuclear Information System (INIS)

Gluzman, S.; Yukalov, V.I.

2012-01-01

A novel method of summing asymptotic series is advanced. Such series repeatedly arise when employing perturbation theory in powers of a small parameter for complicated problems of condensed matter physics, statistical physics, and various applied problems. The method is based on the self-similar approximation theory involving self-similar root approximants. The constructed self-similar continued roots extrapolate asymptotic series to finite values of the expansion parameter. The self-similar continued roots contain, as a particular case, continued fractions and Padé approximants. A theorem on the convergence of the self-similar continued roots is proved. The method is illustrated by several examples from condensed-matter physics.

 Higher Order Improvements for Approximate Estimators

DEFF Research Database (Denmark)

Kristensen, Dennis; Salanié, Bernard

Many modern estimation methods in econometrics approximate an objective function, through simulation or discretization for instance. The resulting "approximate" estimator is often biased; and it always incurs an efficiency loss. We here propose three methods to improve the properties of such appr......Many modern estimation methods in econometrics approximate an objective function, through simulation or discretization for instance. The resulting "approximate" estimator is often biased; and it always incurs an efficiency loss. We here propose three methods to improve the properties...... of such approximate estimators at a low computational cost. The first two methods correct the objective function so as to remove the leading term of the bias due to the approximation. One variant provides an analytical bias adjustment, but it only works for estimators based on stochastic approximators......, such as simulation-based estimators. Our second bias correction is based on ideas from the resampling literature; it eliminates the leading bias term for non-stochastic as well as stochastic approximators. Finally, we propose an iterative procedure where we use Newton-Raphson (NR) iterations based on a much finer...

Exact and approximate multiple diffraction calculations

International Nuclear Information System (INIS)

Alexander, Y.; Wallace, S.J.; Sparrow, D.A.

1976-08-01

A three-body potential scattering problem is solved in the fixed scatterer model exactly and approximately to test the validity of commonly used assumptions of multiple scattering calculations. The model problem involves two-body amplitudes that show diffraction-like differential scattering similar to high energy hadron-nucleon amplitudes. The exact fixed scatterer calculations are compared to Glauber approximation, eikonal-expansion results and a noneikonal approximation

On Covering Approximation Subspaces

Directory of Open Access Journals (Sweden)

Xun Ge

2009-06-01

Full Text Available Let (U';C' be a subspace of a covering approximation space (U;C and X⊂U'. In this paper, we show that and B'(X⊂B(X∩U'. Also, iff (U;C has Property Multiplication. Furthermore, some connections between outer (resp. inner definable subsets in (U;C and outer (resp. inner definable subsets in (U';C' are established. These results answer a question on covering approximation subspace posed by J. Li, and are helpful to obtain further applications of Pawlak rough set theory in pattern recognition and artificial intelligence.

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.

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.

Spherical Approximation on Unit Sphere

Directory of Open Access Journals (Sweden)

Eman Samir Bhaya

2018-01-01

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

Analysis of corrections to the eikonal approximation

Science.gov (United States)

Hebborn, C.; Capel, P.

2017-11-01

Various corrections to the eikonal approximations are studied for two- and three-body nuclear collisions with the goal to extend the range of validity of this approximation to beam energies of 10 MeV/nucleon. Wallace's correction does not improve much the elastic-scattering cross sections obtained at the usual eikonal approximation. On the contrary, a semiclassical approximation that substitutes the impact parameter by a complex distance of closest approach computed with the projectile-target optical potential efficiently corrects the eikonal approximation. This opens the possibility to analyze data measured down to 10 MeV/nucleon within eikonal-like reaction models.

Critical exponents for the Reggeon quantum spin model

International Nuclear Information System (INIS)

Brower, R.C.; Furman, M.A.

1978-01-01

The Reggeon quantum spin (RQS) model on the transverse lattice in D dimensional impact parameter space has been conjectured to have the same critical behaviour as the Reggeon field theory (RFT). Thus from a high 'temperature' series of ten (D=2) and twenty (D=1) terms for the RQS model the authors extrapolate to the critical temperature T=Tsub(c) by Pade approximants to obtain the exponents eta=0.238 +- 0.008, z=1.16 +- 0.01, γ=1.271 +- 0.007 for D=2 and eta=0.317 +- 0.002, z=1.272 +- 0.007, γ=1.736 +- 0.001, lambda=0.57 +- 0.03 for D=1. These exponents naturally interpolate between the D=0 and D=4-epsilon results for RFT as expected on the basis of the universality conjecture. (Auth.)

Towards understanding Regge trajectories in holographic QCD

International Nuclear Information System (INIS)

Cata, Oscar

2007-01-01

We reassess a work done by Migdal on the spectrum of low-energy vector mesons in QCD in the light of the anti-de Sitter (AdS)-QCD correspondence. Recently, a tantalizing parallelism was suggested between Migdal's work and a family of holographic duals of QCD. Despite the intriguing similarities, both approaches face a major drawback: the spectrum is in conflict with well-tested Regge scaling. However, it has recently been shown that holographic duals can be modified to accommodate Regge behavior. Therefore, it is interesting to understand whether Regge behavior can also be achieved in Migdal's approach. In this paper we investigate this issue. We find that Migdal's approach, which is based on a modified Pade approximant, is closely related to the issue of quark-hadron duality breakdown in QCD

Ancilla-approximable quantum state transformations

International Nuclear Information System (INIS)

Blass, Andreas; Gurevich, Yuri

2015-01-01

We consider the transformations of quantum states obtainable by a process of the following sort. Combine the given input state with a specially prepared initial state of an auxiliary system. Apply a unitary transformation to the combined system. Measure the state of the auxiliary subsystem. If (and only if) it is in a specified final state, consider the process successful, and take the resulting state of the original (principal) system as the result of the process. We review known information about exact realization of transformations by such a process. Then we present results about approximate realization of finite partial transformations. We not only consider primarily the issue of approximation to within a specified positive ε, but also address the question of arbitrarily close approximation

Ancilla-approximable quantum state transformations

Energy Technology Data Exchange (ETDEWEB)

Blass, Andreas [Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109 (United States); Gurevich, Yuri [Microsoft Research, Redmond, Washington 98052 (United States)

2015-04-15

We consider the transformations of quantum states obtainable by a process of the following sort. Combine the given input state with a specially prepared initial state of an auxiliary system. Apply a unitary transformation to the combined system. Measure the state of the auxiliary subsystem. If (and only if) it is in a specified final state, consider the process successful, and take the resulting state of the original (principal) system as the result of the process. We review known information about exact realization of transformations by such a process. Then we present results about approximate realization of finite partial transformations. We not only consider primarily the issue of approximation to within a specified positive ε, but also address the question of arbitrarily close approximation.

Recognition of computerized facial approximations by familiar assessors.

Science.gov (United States)

Richard, Adam H; Monson, Keith L

2017-11-01

Studies testing the effectiveness of facial approximations typically involve groups of participants who are unfamiliar with the approximated individual(s). This limitation requires the use of photograph arrays including a picture of the subject for comparison to the facial approximation. While this practice is often necessary due to the difficulty in obtaining a group of assessors who are familiar with the approximated subject, it may not accurately simulate the thought process of the target audience (friends and family members) in comparing a mental image of the approximated subject to the facial approximation. As part of a larger process to evaluate the effectiveness and best implementation of the ReFace facial approximation software program, the rare opportunity arose to conduct a recognition study using assessors who were personally acquainted with the subjects of the approximations. ReFace facial approximations were generated based on preexisting medical scans, and co-workers of the scan donors were tested on whether they could accurately pick out the approximation of their colleague from arrays of facial approximations. Results from the study demonstrated an overall poor recognition performance (i.e., where a single choice within a pool is not enforced) for individuals who were familiar with the approximated subjects. Out of 220 recognition tests only 10.5% resulted in the assessor selecting the correct approximation (or correctly choosing not to make a selection when the array consisted only of foils), an outcome that was not significantly different from the 9% random chance rate. When allowed to select multiple approximations the assessors felt resembled the target individual, the overall sensitivity for ReFace approximations was 16.0% and the overall specificity was 81.8%. These results differ markedly from the results of a previous study using assessors who were unfamiliar with the approximated subjects. Some possible explanations for this disparity in

Approximating The DCM

DEFF Research Database (Denmark)

Madsen, Rasmus Elsborg

2005-01-01

The Dirichlet compound multinomial (DCM), which has recently been shown to be well suited for modeling for word burstiness in documents, is here investigated. A number of conceptual explanations that account for these recent results, are provided. An exponential family approximation of the DCM...

An approximation for kanban controlled assembly systems

NARCIS (Netherlands)

Topan, E.; Avsar, Z.M.

2011-01-01

An approximation is proposed to evaluate the steady-state performance of kanban controlled two-stage assembly systems. The development of the approximation is as follows. The considered continuous-time Markov chain is aggregated keeping the model exact, and this aggregate model is approximated

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

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...... 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...... to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field....

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.

Improved Dutch Roll Approximation for Hypersonic Vehicle

Directory of Open Access Journals (Sweden)

Liang-Liang Yin

2014-06-01

Full Text Available An improved dutch roll approximation for hypersonic vehicle is presented. From the new approximations, the dutch roll frequency is shown to be a function of the stability axis yaw stability and the dutch roll damping is mainly effected by the roll damping ratio. In additional, an important parameter called roll-to-yaw ratio is obtained to describe the dutch roll mode. Solution shows that large-roll-to-yaw ratio is the generate character of hypersonic vehicle, which results the large error for the practical approximation. Predictions from the literal approximations derived in this paper are compared with actual numerical values for s example hypersonic vehicle, results show the approximations work well and the error is below 10 %.

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 a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...

Rational approximation of vertical segments

Science.gov (United States)

Salazar Celis, Oliver; Cuyt, Annie; Verdonk, Brigitte

2007-08-01

In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.

On Nash-Equilibria of Approximation-Stable Games

Science.gov (United States)

Awasthi, Pranjal; Balcan, Maria-Florina; Blum, Avrim; Sheffet, Or; Vempala, Santosh

One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are far apart, or ɛ-equilibria that are far in variation distance from the true Nash equilibrium strategies, then this prediction may not be possible even in principle. Motivated by this consideration, in this paper we define the notion of games that are approximation stable, meaning that all ɛ-approximate equilibria are contained inside a small ball of radius Δ around a true equilibrium, and investigate a number of their properties. Many natural small games such as matching pennies and rock-paper-scissors are indeed approximation stable. We show furthermore there exist 2-player n-by-n approximation-stable games in which the Nash equilibrium and all approximate equilibria have support Ω(log n). On the other hand, we show all (ɛ,Δ) approximation-stable games must have an ɛ-equilibrium of support O(Δ^{2-o(1)}/ɛ2{log n}), yielding an immediate n^{O(Δ^{2-o(1)}/ɛ^2log n)}-time algorithm, improving over the bound of [11] for games satisfying this condition. We in addition give a polynomial-time algorithm for the case that Δ and ɛ are sufficiently close together. We also consider an inverse property, namely that all non-approximate equilibria are far from some true equilibrium, and give an efficient algorithm for games satisfying that condition.

Legendre-tau approximations for functional differential equations

Science.gov (United States)

Ito, K.; Teglas, R.

1986-01-01

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

Approximate maximum parsimony and ancestral maximum likelihood.

Science.gov (United States)

Alon, Noga; Chor, Benny; Pardi, Fabio; Rapoport, Anat

2010-01-01

We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP-hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to a 16/9 approximation ratio for AML and asymptotically to a 1.55 approximation ratio for MP.

Local density approximations for relativistic exchange energies

International Nuclear Information System (INIS)

MacDonald, A.H.

1986-01-01

The use of local density approximations to approximate exchange interactions in relativistic electron systems is reviewed. Particular attention is paid to the physical content of these exchange energies by discussing results for the uniform relativistic electron gas from a new point of view. Work on applying these local density approximations in atoms and solids is reviewed and it is concluded that good accuracy is usually possible provided self-interaction corrections are applied. The local density approximations necessary for spin-polarized relativistic systems are discussed and some new results are presented

Fixation of theoretical ambiguities in the improved fits to $xF_{3}$ CCFR data at the next-to-next-to-leading order and beyond

CERN Document Server

Kataev, A L; Sidorov, A V

2003-01-01

Using new theoretical information on the NNLO and N$^3$LO perturbative QCD corrections to renormalization-group quantities of odd $xF_3$ Mellin moments, we perform the reanalysis of the CCFR'97 data for $xF_3$ structure function. The fits were done without and with twist-4 power suppressed terms. Theoretical questions of applicability of the renormalon-inspired large-$\\beta_0$ approximation for estimating NNLO and N$^3$LO terms in the coefficient functions of odd $xF_3$ moments and even non-singlet moments of $F_2$ are considered. The comparison with [1/1] Pad\\'e estimates is presented. The small $x$ behaviour of the phenomenological model for $xF_3$ is compared with available theoretical predictions. The $x$-shape of the twist-4 contributions is determined. Indications of oscillating-type behaviour of $h(x)$ are obtained from more detailed NNLO fits when only statistical uncertainties are taken into account. The scale-dependent uncertainties of $\\alpha_s(M_Z)$ are analyzed. The obtained NNLO and approximate ...

Singular-perturbation--strong-coupling field theory and the moments problem

International Nuclear Information System (INIS)

Handy, C.R.

1981-01-01

Motivated by recent work of Bender, Cooper, Guralnik, Mjolsness, Rose, and Sharp, a new technique is presented for solving field equations in terms of singular-perturbation--strong-coupling expansions. Two traditional mathematical tools are combined into one effective procedure. Firstly, high-temperature lattice expansions are obtained for the corresponding power moments of the field solution. The approximate continuum-limit power moments are subsequently obtained through the application of Pade techniques. Secondly, in order to reconstruct the corresponding approximate global field solution, one must use function-moments reconstruction techniques. The latter involves reconsidering the traditional ''moments problem'' of interest to pure and applied mathematicians. The above marriage between lattice methods and moments reconstruction procedures for functions yields good results for the phi 4 field-theory kink, and the sine-Gordon kink solutions. It is argued that the power moments are the most efficient dynamical variables for the generation of strong-coupling expansions. Indeed, a momentum-space formulation is being advocated in which the long-range behavior of the space-dependent fields are determined by the small-momentum, infrared, domain

Some relations between entropy and approximation numbers

Institute of Scientific and Technical Information of China (English)

郑志明

1999-01-01

A general result is obtained which relates the entropy numbers of compact maps on Hilbert space to its approximation numbers. Compared with previous works in this area, it is particularly convenient for dealing with the cases where the approximation numbers decay rapidly. A nice estimation between entropy and approximation numbers for noncompact maps is given.

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

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.

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.

Strong-coupling expansion for the ground-state energy in the Vertical BarxVertical Bar/sup α/ potential

International Nuclear Information System (INIS)

Bender, C.M.; Mead, L.R.; Simmons, L.M. Jr.

1981-01-01

Using lattice techniques we examine the strong-coupling expansion for the ground-state energy of a gVertical BarxVertical Bar/sup α/ (α>0) potential in quantum mechanics. We are particularly interested in studying the effectiveness of various Pade-type methods for extrapolating the lattice series back to the continuum. We have computed the lattice series out to 12th order for all α and we identify three regions. When α or =2 the lattice series has a finite radius of convergence; here, completely-off-diagonal Pade extrapolants work best. As α increases beyond 2 it becomes more difficult to obtain good continuum results, apparently because the sign pattern of the lattice series seems to fluctuate randomly. The onset of randomness occurs earlier in the lattice series as α→infinity

Approximation properties of fine hyperbolic graphs

Indian Academy of Sciences (India)

2016-08-26

Aug 26, 2016 ... 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 ... Department of Applied Mathematics, Shanghai Finance University, Shanghai 201209, People's Republic of China ...

Efficient automata constructions and approximate automata

NARCIS (Netherlands)

Watson, B.W.; Kourie, D.G.; Ngassam, E.K.; Strauss, T.; Cleophas, L.G.W.A.

2008-01-01

In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at least L. Such automata can be used in a variety of practical applications, including network security pattern

Efficient automata constructions and approximate automata

NARCIS (Netherlands)

Watson, B.W.; Kourie, D.G.; Ngassam, E.K.; Strauss, T.; Cleophas, L.G.W.A.; Holub, J.; Zdárek, J.

2006-01-01

In this paper, we present data structures and algorithms for efficiently constructing approximate automata. An approximate automaton for a regular language L is one which accepts at least L. Such automata can be used in a variety of practical applications, including network security pattern

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.

Rational approximations for tomographic reconstructions

International Nuclear Information System (INIS)

Reynolds, Matthew; Beylkin, Gregory; Monzón, Lucas

2013-01-01

We use optimal rational approximations of projection data collected in x-ray tomography to improve image resolution. Under the assumption that the object of interest is described by functions with jump discontinuities, for each projection we construct its rational approximation with a small (near optimal) number of terms for a given accuracy threshold. This allows us to augment the measured data, i.e., double the number of available samples in each projection or, equivalently, extend (double) the domain of their Fourier transform. We also develop a new, fast, polar coordinate Fourier domain algorithm which uses our nonlinear approximation of projection data in a natural way. Using augmented projections of the Shepp–Logan phantom, we provide a comparison between the new algorithm and the standard filtered back-projection algorithm. We demonstrate that the reconstructed image has improved resolution without additional artifacts near sharp transitions in the image. (paper)

'LTE-diffusion approximation' for arc calculations

International Nuclear Information System (INIS)

Lowke, J J; Tanaka, M

2006-01-01

This paper proposes the use of the 'LTE-diffusion approximation' for predicting the properties of electric arcs. Under this approximation, local thermodynamic equilibrium (LTE) is assumed, with a particular mesh size near the electrodes chosen to be equal to the 'diffusion length', based on D e /W, where D e is the electron diffusion coefficient and W is the electron drift velocity. This approximation overcomes the problem that the equilibrium electrical conductivity in the arc near the electrodes is almost zero, which makes accurate calculations using LTE impossible in the limit of small mesh size, as then voltages would tend towards infinity. Use of the LTE-diffusion approximation for a 200 A arc with a thermionic cathode gives predictions of total arc voltage, electrode temperatures, arc temperatures and radial profiles of heat flux density and current density at the anode that are in approximate agreement with more accurate calculations which include an account of the diffusion of electric charges to the electrodes, and also with experimental results. Calculations, which include diffusion of charges, agree with experimental results of current and heat flux density as a function of radius if the Milne boundary condition is used at the anode surface rather than imposing zero charge density at the anode

Nonlinear approximation with general wave packets

DEFF Research Database (Denmark)

Borup, Lasse; Nielsen, Morten

2005-01-01

We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating and translating one single function g. A general Jackson inequality is derived for best m-term approximation with such dictionaries. In some special cases where g has a special structure, a complete...

Approximations for stop-loss reinsurance premiums

NARCIS (Netherlands)

Reijnen, Rajko; Albers, Willem/Wim; Kallenberg, W.C.M.

2005-01-01

Various approximations of stop-loss reinsurance premiums are described in literature. For a wide variety of claim size distributions and retention levels, such approximations are compared in this paper to each other, as well as to a quantitative criterion. For the aggregate claims two models are

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.

Approximation for the adjoint neutron spectrum

International Nuclear Information System (INIS)

Suster, Luis Carlos; Martinez, Aquilino Senra; Silva, Fernando Carvalho da

2002-01-01

The proposal of this work is the determination of an analytical approximation which is capable to reproduce the adjoint neutron flux for the energy range of the narrow resonances (NR). In a previous work we developed a method for the calculation of the adjoint spectrum which was calculated from the adjoint neutron balance equations, that were obtained by the collision probabilities method, this method involved a considerable quantity of numerical calculation. In the analytical method some approximations were done, like the multiplication of the escape probability in the fuel by the adjoint flux in the moderator, and after these approximations, taking into account the case of the narrow resonances, were substituted in the adjoint neutron balance equation for the fuel, resulting in an analytical approximation for the adjoint flux. The results obtained in this work were compared to the results generated with the reference method, which demonstrated a good and precise results for the adjoint neutron flux for the narrow resonances. (author)

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.

Non-Linear Approximation of Bayesian Update

KAUST Repository

Litvinenko, Alexander

2016-01-01

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.

Quirks of Stirling's Approximation

Science.gov (United States)

Macrae, Roderick M.; Allgeier, Benjamin M.

2013-01-01

Stirling's approximation to ln "n"! is typically introduced to physical chemistry students as a step in the derivation of the statistical expression for the entropy. However, naive application of this approximation leads to incorrect conclusions. In this article, the problem is first illustrated using a familiar "toy…

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.

Approximations to camera sensor noise

Science.gov (United States)

Jin, Xiaodan; Hirakawa, Keigo

2013-02-01

Noise is present in all image sensor data. Poisson distribution is said to model the stochastic nature of the photon arrival process, while it is common to approximate readout/thermal noise by additive white Gaussian noise (AWGN). Other sources of signal-dependent noise such as Fano and quantization also contribute to the overall noise profile. Question remains, however, about how best to model the combined sensor noise. Though additive Gaussian noise with signal-dependent noise variance (SD-AWGN) and Poisson corruption are two widely used models to approximate the actual sensor noise distribution, the justification given to these types of models are based on limited evidence. The goal of this paper is to provide a more comprehensive characterization of random noise. We concluded by presenting concrete evidence that Poisson model is a better approximation to real camera model than SD-AWGN. We suggest further modification to Poisson that may improve the noise model.

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

APPROXIMATIONS TO PERFORMANCE MEASURES IN QUEUING SYSTEMS

Directory of Open Access Journals (Sweden)

Kambo, N. S.

2012-11-01

Full Text Available Approximations to various performance measures in queuing systems have received considerable attention because these measures have wide applicability. In this paper we propose two methods to approximate the queuing characteristics of a GI/M/1 system. The first method is non-parametric in nature, using only the first three moments of the arrival distribution. The second method treads the known path of approximating the arrival distribution by a mixture of two exponential distributions by matching the first three moments. Numerical examples and optimal analysis of performance measures of GI/M/1 queues are provided to illustrate the efficacy of the methods, and are compared with benchmark approximations.

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.

Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities

KAUST Repository

Cheon, Sooyoung; Liang, Faming; Chen, Yuguo; Yu, Kai

2013-01-01

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.

Approximate Bayesian evaluations of measurement uncertainty

Science.gov (United States)

Possolo, Antonio; Bodnar, Olha

2018-04-01

The Guide to the Expression of Uncertainty in Measurement (GUM) includes formulas that produce an estimate of a scalar output quantity that is a function of several input quantities, and an approximate evaluation of the associated standard uncertainty. This contribution presents approximate, Bayesian counterparts of those formulas for the case where the output quantity is a parameter of the joint probability distribution of the input quantities, also taking into account any information about the value of the output quantity available prior to measurement expressed in the form of a probability distribution on the set of possible values for the measurand. The approximate Bayesian estimates and uncertainty evaluations that we present have a long history and illustrious pedigree, and provide sufficiently accurate approximations in many applications, yet are very easy to implement in practice. Differently from exact Bayesian estimates, which involve either (analytical or numerical) integrations, or Markov Chain Monte Carlo sampling, the approximations that we describe involve only numerical optimization and simple algebra. Therefore, they make Bayesian methods widely accessible to metrologists. We illustrate the application of the proposed techniques in several instances of measurement: isotopic ratio of silver in a commercial silver nitrate; odds of cryptosporidiosis in AIDS patients; height of a manometer column; mass fraction of chromium in a reference material; and potential-difference in a Zener voltage standard.

Improved radiative corrections for (e,e'p) experiments: Beyond the peaking approximation and implications of the soft-photon approximation

International Nuclear Information System (INIS)

Weissbach, F.; Hencken, K.; Rohe, D.; Sick, I.; Trautmann, D.

2006-01-01

Analyzing (e,e ' p) experimental data involves corrections for radiative effects which change the interaction kinematics and which have to be carefully considered in order to obtain the desired accuracy. Missing momentum and energy due to bremsstrahlung have so far often been incorporated into the simulations and the experimental analyses using the peaking approximation. It assumes that all bremsstrahlung is emitted in the direction of the radiating particle. In this article we introduce a full angular Monte Carlo simulation method which overcomes this approximation. As a test, the angular distribution of the bremsstrahlung photons is reconstructed from H(e,e ' p) data. Its width is found to be underestimated by the peaking approximation and described much better by the approach developed in this work. The impact of the soft-photon approximation on the photon angular distribution is found to be minor as compared to the impact of the peaking approximation. (orig.)

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.

Toward a consistent random phase approximation based on the relativistic Hartree approximation

International Nuclear Information System (INIS)

Price, C.E.; Rost, E.; Shepard, J.R.; McNeil, J.A.

1992-01-01

We examine the random phase approximation (RPA) based on a relativistic Hartree approximation description for nuclear ground states. This model includes contributions from the negative energy sea at the one-loop level. We emphasize consistency between the treatment of the ground state and the RPA. This consistency is important in the description of low-lying collective levels but less important for the longitudinal (e,e') quasielastic response. We also study the effect of imposing a three-momentum cutoff on negative energy sea contributions. A cutoff of twice the nucleon mass improves agreement with observed spin-orbit splittings in nuclei compared to the standard infinite cutoff results, an effect traceable to the fact that imposing the cutoff reduces m * /m. Consistency is much more important than the cutoff in the description of low-lying collective levels. The cutoff model also provides excellent agreement with quasielastic (e,e') data

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.

Approximation algorithms for guarding holey polygons ...

African Journals Online (AJOL)

Guarding edges of polygons is a version of art gallery problem.The goal is finding the minimum number of guards to cover the edges of a polygon. This problem is NP-hard, and to our knowledge there are approximation algorithms just for simple polygons. In this paper we present two approximation algorithms for guarding ...

Approximation properties of fine hyperbolic graphs

Indian Academy of Sciences (India)

2010 Mathematics Subject Classification. 46L07. 1. Introduction. Given a countable discrete group G, some nice approximation properties for the reduced. C∗-algebras C∗ r (G) can give us the approximation properties of G. For example, Lance. [7] proved that the nuclearity of C∗ r (G) is equivalent to the amenability of G; ...

The delta expansion in zero dimensions

International Nuclear Information System (INIS)

Cho, H.T.; Milton, K.A.; Pinsky, S.S.; Simmons, L.M. Jr.

1989-01-01

The recently introduced δ-expansion (or logarithmic-expansion) technique for obtaining nonperturbative information about quantum field theories is reviewed in the zero-dimensional context. There, it is easy to study questions of analytic continuation that arise in the construction of the Feynman rules that generate the δ series. It is found that for six- and higher-point Green's functions, a cancellation occurs among the most divergent terms, and that divergences that arise from summing over an infinite number of internal lines are illusory. The numerical accuracy is studied in some detail: The δ series converges inside a circle of radius one for positive bare mass squared, and diverges if the bare mass squared is negative, but in all cases, low-order Pade approximants are extremely accurate. These general features are expected to hold in higher dimensions, such as four

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.

Approximate Bayesian computation.

Directory of Open Access Journals (Sweden)

Mikael Sunnåker

Full Text Available Approximate Bayesian computation (ABC constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology.

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.

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.

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.

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.

Uniform analytic approximation of Wigner rotation matrices

Science.gov (United States)

Hoffmann, Scott E.

2018-02-01

We derive the leading asymptotic approximation, for low angle θ, of the Wigner rotation matrix elements, dm1m2 j(θ ) , uniform in j, m1, and m2. The result is in terms of a Bessel function of integer order. We numerically investigate the error for a variety of cases and find that the approximation can be useful over a significant range of angles. This approximation has application in the partial wave analysis of wavepacket scattering.

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.

Making the Case for ‘Power Abuse Disorder' as a Nosologic Entity

Science.gov (United States)

Zernig, Gerald; Hiemke, Christoph

2017-01-01

The development of societies and cultures arguably is based on the ability of human primates to form hierarchies in which some individuals acquire and wield power, that is, control resources and influence and control the behavior of their conspecifics. In the following, we focus on the type of human primate power wielding that (a) harms and (b) produces excessive negative emotions in (1) the victim(s) of the power wielder and (2) the power wielder her/himself. If such a harmful behavior of the power wielder is not accompanied by an ethically justifiable benefit for the involved human primate groups, it can be considered “power abuse.” We propose to term the associated behaviors, cognitions, and emotions of the power wielder as “power abuse disorder” (PAD). This behavior results from what we consider addictive behavior of the power abuse disordered (PADed) power wielder. PAD can be diagnosed on the basis of the World Health Organization's criteria for “dependence syndrome” as listed in the International Classification of Diseases version 10. We will demonstrate that many PADed individuals may very likely carry the Zeitgeist diagnosis “burnout.” This article reviews the current understanding of the neural correlates of PAD and suggests future research. Based on the available evidence, PAD seems to be associated with a dysfunction of the mesocorticolimbic dopamine system, rendering PADed individuals vulnerable for psychostimulant abuse/dependence, and suggesting specific pharmacotherapeutic approaches to treat PAD. PMID:28467994

Making the Case for 'Power Abuse Disorder' as a Nosologic Entity.

Science.gov (United States)

Zernig, Gerald; Hiemke, Christoph

2017-01-01

The development of societies and cultures arguably is based on the ability of human primates to form hierarchies in which some individuals acquire and wield power, that is, control resources and influence and control the behavior of their conspecifics. In the following, we focus on the type of human primate power wielding that (a) harms and (b) produces excessive negative emotions in (1) the victim(s) of the power wielder and (2) the power wielder her/himself. If such a harmful behavior of the power wielder is not accompanied by an ethically justifiable benefit for the involved human primate groups, it can be considered "power abuse." We propose to term the associated behaviors, cognitions, and emotions of the power wielder as "power abuse disorder" (PAD). This behavior results from what we consider addictive behavior of the power abuse disordered (PADed) power wielder. PAD can be diagnosed on the basis of the World Health Organization's criteria for "dependence syndrome" as listed in the International Classification of Diseases version 10. We will demonstrate that many PADed individuals may very likely carry the Zeitgeist diagnosis "burnout." This article reviews the current understanding of the neural correlates of PAD and suggests future research. Based on the available evidence, PAD seems to be associated with a dysfunction of the mesocorticolimbic dopamine system, rendering PADed individuals vulnerable for psychostimulant abuse/dependence, and suggesting specific pharmacotherapeutic approaches to treat PAD. © 2017 S. Karger AG, Basel.

Approximation Properties of Certain Summation Integral Type Operators

Directory of Open Access Journals (Sweden)

Patel P.

2015-03-01

Full Text Available In the present paper, we study approximation properties of a family of linear positive operators and establish direct results, asymptotic formula, rate of convergence, weighted approximation theorem, inverse theorem and better approximation for this family of linear positive operators.

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.

The adiabatic approximation in multichannel scattering

International Nuclear Information System (INIS)

Schulte, A.M.

1978-01-01

Using two-dimensional models, an attempt has been made to get an impression of the conditions of validity of the adiabatic approximation. For a nucleon bound to a rotating nucleus the Coriolis coupling is neglected and the relation between this nuclear Coriolis coupling and the classical Coriolis force has been examined. The approximation for particle scattering from an axially symmetric rotating nucleus based on a short duration of the collision, has been combined with an approximation based on the limitation of angular momentum transfer between particle and nucleus. Numerical calculations demonstrate the validity of the new combined method. The concept of time duration for quantum mechanical collisions has also been studied, as has the collective description of permanently deformed nuclei. (C.F.)

Minimal entropy approximation for cellular automata

International Nuclear Information System (INIS)

Fukś, Henryk

2014-01-01

We present a method for the construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that is, construction of a probability measure consistent with given block probabilities and maximizing entropy. If instead of maximizing entropy one minimizes it, one can develop another method for the construction of approximate orbits, at the heart of which is the iteration of finite-dimensional maps, called minimal entropy maps. We present numerical evidence that the minimal entropy approximation sometimes outperforms the local structure theory in characterizing the properties of cellular automata. The density response curve for elementary CA rule 26 is used to illustrate this claim. (paper)

Function approximation using combined unsupervised and supervised learning.

Science.gov (United States)

Andras, Peter

2014-03-01

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

Hardness and Approximation for Network Flow Interdiction

OpenAIRE

Chestnut, Stephen R.; Zenklusen, Rico

2015-01-01

In the Network Flow Interdiction problem an adversary attacks a network in order to minimize the maximum s-t-flow. Very little is known about the approximatibility of this problem despite decades of interest in it. We present the first approximation hardness, showing that Network Flow Interdiction and several of its variants cannot be much easier to approximate than Densest k-Subgraph. In particular, any $n^{o(1)}$-approximation algorithm for Network Flow Interdiction would imply an $n^{o(1)}...

Approximate reasoning in physical systems

International Nuclear Information System (INIS)

Mutihac, R.

1991-01-01

The theory of fuzzy sets provides excellent ground to deal with fuzzy observations (uncertain or imprecise signals, wavelengths, temperatures,etc.) fuzzy functions (spectra and depth profiles) and fuzzy logic and approximate reasoning. First, the basic ideas of fuzzy set theory are briefly presented. Secondly, stress is put on application of simple fuzzy set operations for matching candidate reference spectra of a spectral library to an unknown sample spectrum (e.g. IR spectroscopy). Thirdly, approximate reasoning is applied to infer an unknown property from information available in a database (e.g. crystal systems). Finally, multi-dimensional fuzzy reasoning techniques are suggested. (Author)

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

Stochastic quantization and mean field approximation

International Nuclear Information System (INIS)

Jengo, R.; Parga, N.

1983-09-01

In the context of the stochastic quantization we propose factorized approximate solutions for the Fokker-Planck equation for the XY and Zsub(N) spin systems in D dimensions. The resulting differential equation for a factor can be solved and it is found to give in the limit of t→infinity the mean field or, in the more general case, the Bethe-Peierls approximation. (author)

Approximative solutions of stochastic optimization problem

Czech Academy of Sciences Publication Activity Database

Lachout, Petr

2010-01-01

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

Trajectory averaging for stochastic approximation MCMC algorithms

KAUST Repository

Liang, Faming

2010-01-01

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

Reduction of Linear Programming to Linear Approximation

OpenAIRE

Vaserstein, Leonid N.

2006-01-01

It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.

Thin-wall approximation in vacuum decay: A lemma

Science.gov (United States)

Brown, Adam R.

2018-05-01

The "thin-wall approximation" gives a simple estimate of the decay rate of an unstable quantum field. Unfortunately, the approximation is uncontrolled. In this paper I show that there are actually two different thin-wall approximations and that they bracket the true decay rate: I prove that one is an upper bound and the other a lower bound. In the thin-wall limit, the two approximations converge. In the presence of gravity, a generalization of this lemma provides a simple sufficient condition for nonperturbative vacuum instability.

Comparisons of perturbation and integral equation theories for the angular pair correlation function in molecular fluids

International Nuclear Information System (INIS)

Murad, S.; Gubbins, K.E.; Gray, C.G.

1983-01-01

We compare several recently proposed theories for the angular pair correlation function g(rω 1 ω 2 ), including first- and second-order perturbation theory (the u-expansion), a Pade approximant to this series, first-order f-expansion, the single superchain, generalized mean field, linearized hypernetted chain, and quadratic hypernetted chain approximations. Numerical results from these theories are compared with available computer simulation data for four model fluids whose intermolecular pair potential is of the form u 0 +usub(a), where u 0 is a hard-sphere of Lennard-Jones model, while usub(a) is a dipole-dipole or quadrupole-quadrupole interaction; we refer to these model fluids as HS+μμ, HS+QQ, LJ+μμ, and LJ+QQ. Properties studied include the angular pair correlation function and its spherical harmonic components, the thermodynamic properties, and the angular correlation parameters G 1 and G 2 that are related to the dielectric and Kerr constants. The second-order perturbation theory is superior to the integral equation theories for the thermodynamic harmonics of g(rω 1 ω 2 ) and for the thermodynamic properties themselves at moderate multipole strengths. For other harmonics and properties, the integral equation theories are better, with the quadratic hypernetted chain approximation being the best overall. (orig.)

Smooth function approximation using neural networks.

Science.gov (United States)

Ferrari, Silvia; Stengel, Robert F

2005-01-01

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

An improved saddlepoint approximation.

Science.gov (United States)

Gillespie, Colin S; Renshaw, Eric

2007-08-01

Given a set of third- or higher-order moments, not only is the saddlepoint approximation the only realistic 'family-free' technique available for constructing an associated probability distribution, but it is 'optimal' in the sense that it is based on the highly efficient numerical method of steepest descents. However, it suffers from the problem of not always yielding full support, and whilst [S. Wang, General saddlepoint approximations in the bootstrap, Prob. Stat. Lett. 27 (1992) 61.] neat scaling approach provides a solution to this hurdle, it leads to potentially inaccurate and aberrant results. We therefore propose several new ways of surmounting such difficulties, including: extending the inversion of the cumulant generating function to second-order; selecting an appropriate probability structure for higher-order cumulants (the standard moment closure procedure takes them to be zero); and, making subtle changes to the target cumulants and then optimising via the simplex algorithm.

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

Comparison of four support-vector based function approximators

NARCIS (Netherlands)

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

2004-01-01

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

Coefficients Calculation in Pascal Approximation for Passive Filter Design

Directory of Open Access Journals (Sweden)

George B. Kasapoglu

2018-02-01

Full Text Available The recently modified Pascal function is further exploited in this paper in the design of passive analog filters. The Pascal approximation has non-equiripple magnitude, in contrast of the most well-known approximations, such as the Chebyshev approximation. A novelty of this work is the introduction of a precise method that calculates the coefficients of the Pascal function. Two examples are presented for the passive design to illustrate the advantages and the disadvantages of the Pascal approximation. Moreover, the values of the passive elements can be taken from tables, which are created to define the normalized values of these elements for the Pascal approximation, as Zverev had done for the Chebyshev, Elliptic, and other approximations. Although Pascal approximation can be implemented to both passive and active filter designs, a passive filter design is addressed in this paper, and the benefits and shortcomings of Pascal approximation are presented and discussed.

Recursive B-spline approximation using the Kalman filter

Directory of Open Access Journals (Sweden)

Jens Jauch

2017-02-01

Full Text Available This paper proposes a novel recursive B-spline approximation (RBA algorithm which approximates an unbounded number of data points with a B-spline function and achieves lower computational effort compared with previous algorithms. Conventional recursive algorithms based on the Kalman filter (KF restrict the approximation to a bounded and predefined interval. Conversely RBA includes a novel shift operation that enables to shift estimated B-spline coefficients in the state vector of a KF. This allows to adapt the interval in which the B-spline function can approximate data points during run-time.

Approximate Computing Techniques for Iterative Graph Algorithms

Energy Technology Data Exchange (ETDEWEB)

Panyala, Ajay R.; Subasi, Omer; Halappanavar, Mahantesh; Kalyanaraman, Anantharaman; Chavarria Miranda, Daniel G.; Krishnamoorthy, Sriram

2017-12-18

Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

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

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.

On Love's approximation for fluid-filled elastic tubes

International Nuclear Information System (INIS)

Caroli, E.; Mainardi, F.

1980-01-01

A simple procedure is set up to introduce Love's approximation for wave propagation in thin-walled fluid-filled elastic tubes. The dispersion relation for linear waves and the radial profile for fluid pressure are determined in this approximation. It is shown that the Love approximation is valid in the low-frequency regime. (author)

WKB approximation in atomic physics

International Nuclear Information System (INIS)

Karnakov, Boris Mikhailovich

2013-01-01

Provides extensive coverage of the Wentzel-Kramers-Brillouin approximation and its applications. Presented as a sequence of problems with highly detailed solutions. Gives a concise introduction for calculating Rydberg states, potential barriers and quasistationary systems. This book has evolved from lectures devoted to applications of the Wentzel-Kramers-Brillouin- (WKB or quasi-classical) approximation and of the method of 1/N -expansion for solving various problems in atomic and nuclear physics. The intent of this book is to help students and investigators in this field to extend their knowledge of these important calculation methods in quantum mechanics. Much material is contained herein that is not to be found elsewhere. WKB approximation, while constituting a fundamental area in atomic physics, has not been the focus of many books. A novel method has been adopted for the presentation of the subject matter, the material is presented as a succession of problems, followed by a detailed way of solving them. The methods introduced are then used to calculate Rydberg states in atomic systems and to evaluate potential barriers and quasistationary states. Finally, adiabatic transition and ionization of quantum systems are covered.

SFU-driven transparent approximation acceleration on GPUs

NARCIS (Netherlands)

Li, A.; Song, S.L.; Wijtvliet, M.; Kumar, A.; Corporaal, H.

2016-01-01

Approximate computing, the technique that sacrifices certain amount of accuracy in exchange for substantial performance boost or power reduction, is one of the most promising solutions to enable power control and performance scaling towards exascale. Although most existing approximation designs

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.

Variational Gaussian approximation for Poisson data

Science.gov (United States)

Arridge, Simon R.; Ito, Kazufumi; Jin, Bangti; Zhang, Chen

2018-02-01

The Poisson model is frequently employed to describe count data, but in a Bayesian context it leads to an analytically intractable posterior probability distribution. In this work, we analyze a variational Gaussian approximation to the posterior distribution arising from the Poisson model with a Gaussian prior. This is achieved by seeking an optimal Gaussian distribution minimizing the Kullback-Leibler divergence from the posterior distribution to the approximation, or equivalently maximizing the lower bound for the model evidence. We derive an explicit expression for the lower bound, and show the existence and uniqueness of the optimal Gaussian approximation. The lower bound functional can be viewed as a variant of classical Tikhonov regularization that penalizes also the covariance. Then we develop an efficient alternating direction maximization algorithm for solving the optimization problem, and analyze its convergence. We discuss strategies for reducing the computational complexity via low rank structure of the forward operator and the sparsity of the covariance. Further, as an application of the lower bound, we discuss hierarchical Bayesian modeling for selecting the hyperparameter in the prior distribution, and propose a monotonically convergent algorithm for determining the hyperparameter. We present extensive numerical experiments to illustrate the Gaussian approximation and the algorithms.

Approximation in two-stage stochastic integer programming

NARCIS (Netherlands)

W. Romeijnders; L. Stougie (Leen); M. van der Vlerk

2014-01-01

htmlabstractApproximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solution value.

Approximation in two-stage stochastic integer programming

NARCIS (Netherlands)

Romeijnders, W.; Stougie, L.; van der Vlerk, M.H.

2014-01-01

Approximation algorithms are the prevalent solution methods in the field of stochastic programming. Problems in this field are very hard to solve. Indeed, most of the research in this field has concentrated on designing solution methods that approximate the optimal solution value. However,

Magnus approximation in the adiabatic picture

International Nuclear Information System (INIS)

Klarsfeld, S.; Oteo, J.A.

1991-01-01

A simple approximate nonperturbative method is described for treating time-dependent problems that works well in the intermediate regime far from both the sudden and the adiabatic limits. The method consists of applying the Magnus expansion after transforming to the adiabatic basis defined by the eigenstates of the instantaneous Hamiltonian. A few exactly soluble examples are considered in order to assess the domain of validity of the approximation. (author) 32 refs., 4 figs

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

Aspects of three field approximations: Darwin, frozen, EMPULSE

International Nuclear Information System (INIS)

Boyd, J.K.; Lee, E.P.; Yu, S.S.

1985-01-01

The traditional approach used to study high energy beam propagation relies on the frozen field approximation. A minor modification of the frozen field approximation yields the set of equations applied to the analysis of the hose instability. These models are constrasted with the Darwin field approximation. A statement is made of the Darwin model equations relevant to the analysis of the hose instability

On Convex Quadratic Approximation

NARCIS (Netherlands)

den Hertog, D.; de Klerk, E.; Roos, J.

2000-01-01

In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of

All-Norm Approximation Algorithms

NARCIS (Netherlands)

Azar, Yossi; Epstein, Leah; Richter, Yossi; Woeginger, Gerhard J.; Penttonen, Martti; Meineche Schmidt, Erik

2002-01-01

A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different ℓ p norms. We address this problem by introducing the concept of an All-norm ρ-approximation

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

Approximate Noether symmetries and collineations for regular perturbative Lagrangians

Science.gov (United States)

Paliathanasis, Andronikos; Jamal, Sameerah

2018-01-01

Regular perturbative Lagrangians that admit approximate Noether symmetries and approximate conservation laws are studied. Specifically, we investigate the connection between approximate Noether symmetries and collineations of the underlying manifold. In particular we determine the generic Noether symmetry conditions for the approximate point symmetries and we find that for a class of perturbed Lagrangians, Noether symmetries are related to the elements of the Homothetic algebra of the metric which is defined by the unperturbed Lagrangian. Moreover, we discuss how exact symmetries become approximate symmetries. Finally, some applications are presented.

Square well approximation to the optical potential

International Nuclear Information System (INIS)

Jain, A.K.; Gupta, M.C.; Marwadi, P.R.

1976-01-01

Approximations for obtaining T-matrix elements for a sum of several potentials in terms of T-matrices for individual potentials are studied. Based on model calculations for S-wave for a sum of two separable non-local potentials of Yukawa type form factors and a sum of two delta function potentials, it is shown that the T-matrix for a sum of several potentials can be approximated satisfactorily over all the energy regions by the sum of T-matrices for individual potentials. Based on this, an approximate method for finding T-matrix for any local potential by approximating it by a sum of suitable number of square wells is presented. This provides an interesting way to calculate the T-matrix for any arbitary potential in terms of Bessel functions to a good degree of accuracy. The method is applied to the Saxon-Wood potentials and good agreement with exact results is found. (author)

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.

Uncertainty relations for approximation and estimation

International Nuclear Information System (INIS)

Lee, Jaeha; Tsutsui, Izumi

2016-01-01

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.

Diophantine approximation

CERN Document Server

Schmidt, Wolfgang M

1980-01-01

"In 1970, at the U. of Colorado, the author delivered a course of lectures on his famous generalization, then just established, relating to Roth's theorem on rational approxi- mations to algebraic numbers. The present volume is an ex- panded and up-dated version of the original mimeographed notes on the course. As an introduction to the author's own remarkable achievements relating to the Thue-Siegel-Roth theory, the text can hardly be bettered and the tract can already be regarded as a classic in its field."(Bull.LMS) "Schmidt's work on approximations by algebraic numbers belongs to the deepest and most satisfactory parts of number theory. These notes give the best accessible way to learn the subject. ... this book is highly recommended." (Mededelingen van het Wiskundig Genootschap)

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.

Irreversibility analysis of magneto-hydrodynamic nanofluid flow injected through a rotary disk

Directory of Open Access Journals (Sweden)

Rashidi Mohammad Mehdi

2015-01-01

Full Text Available The non-linear Navier-Stokes equations governed on the nanofluid flow injected through a rotary porous disk in the presence of an external uniform vertical magnetic field can be changed to a system of non-linear partial differential equations by applying similar parameter. In this study, partial differential equations are analytically solved by the modified differential transform method, Pade differential transformation method to obtain self-similar functions of motion and temperature. A very good agreement is observed between the obtained results of Pade differential transformation method and those of previously published ones. Then it has become possible to do a comprehensive parametric analysis on the entropy generation in this case to demonstrate the effects of physical flow parameters such as magnetic interaction parameter, injection parameter, nanoparticle volume fraction, dimensionless temperature difference, rotational Brinkman number and the type of nanofluid on the problem.

Approximation of the inverse G-frame operator

Indian Academy of Sciences (India)

... 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 like using finite-dimensional linear algebra.

Optical approximation in the theory of geometric impedance

International Nuclear Information System (INIS)

Stupakov, G.; Bane, K.L.F.; Zagorodnov, I.

2007-02-01

In this paper we introduce an optical approximation into the theory of impedance calculation, one valid in the limit of high frequencies. This approximation neglects diffraction effects in the radiation process, and is conceptually equivalent to the approximation of geometric optics in electromagnetic theory. Using this approximation, we derive equations for the longitudinal impedance for arbitrary offsets, with respect to a reference orbit, of source and test particles. With the help of the Panofsky-Wenzel theorem we also obtain expressions for the transverse impedance (also for arbitrary offsets). We further simplify these expressions for the case of the small offsets that are typical for practical applications. Our final expressions for the impedance, in the general case, involve two dimensional integrals over various cross-sections of the transition. We further demonstrate, for several known axisymmetric examples, how our method is applied to the calculation of impedances. Finally, we discuss the accuracy of the optical approximation and its relation to the diffraction regime in the theory of impedance. (orig.)

APPROXIMATION OF FREE-FORM CURVE – AIRFOIL SHAPE

Directory of Open Access Journals (Sweden)

CHONG PERK LIN

2013-12-01

Full Text Available Approximation of free-form shape is essential in numerous engineering applications, particularly in automotive and aircraft industries. Commercial CAD software for the approximation of free-form shape is based almost exclusively on parametric polynomial and rational parametric polynomial. The parametric curve is defined by vector function of one independent variable R(u = (x(u, y(u, z(u, where 0≤u≤1. Bézier representation is one of the parametric functions, which is widely used in the approximating of free-form shape. Given a string of points with the assumption of sufficiently dense to characterise airfoil shape, it is desirable to approximate the shape with Bézier representation. The expectation is that the representation function is close to the shape within an acceptable working tolerance. In this paper, the aim is to explore the use of manual and automated methods for approximating section curve of airfoil with Bézier representation.

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

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.

Advances in the development of a subgroup method for the self-shielding of resonant isotopes in arbitrary geometries

International Nuclear Information System (INIS)

Hebert, A.

1997-01-01

The subgroup method is used to compute self-shielded cross sections defined over coarse energy groups in the resolved energy domain. The validity of the subgroup approach was extended beyond the unresolved energy domain by partially taking into account correlation effects between the slowing-down source with the collision probability terms of the transport equation. This approach enables one to obtain a pure subgroup solution of the self-shielding problem without relying on any form of equivalence in dilution. Specific improvements are presented on existing subgroup methods: an N-term rational approximation for the fuel-to-fuel collision probability, a new Pade deflation technique for computing probability tables, and the introduction of a superhomogenization correction. The absorption rates obtained after self-shielding are compared with exact values obtained using an elastic slowing-down calculation where each resonance is modeled individually in the resolved energy domain

Synthesis and magnetic properties of ferrites spinels Mg{sub x}Cu{sub 1-x}Fe{sub 2}O{sub 4}

Energy Technology Data Exchange (ETDEWEB)

Mounkachi, O.; Hamedoun, M. [Institute of Nanomaterials and Nanotechnology, MAScIR, Rabat (Morocco); Belaiche, M. [Institute of Nanomaterials and Nanotechnology, MAScIR, Rabat (Morocco); Hassan II Academy of Science and Technology, Rabat (Morocco); Laboratoire de Magnetisme, Materiaux Magnetiques, Microonde et Ceramique, Ecole Normale Superieure, Universite Mohammed V-Agdal, B.P. 9235, Ocean, Rabat (Morocco); Benyoussef, A. [Institute of Nanomaterials and Nanotechnology, MAScIR, Rabat (Morocco); Hassan II Academy of Science and Technology, Rabat (Morocco); LMPHE, (URAC 12), Faculte des Sciences, Universite Mohammed V-Agdal, Rabat (Morocco); Masrour, R. [Laboratory of Materials, Process, Environment and Quality, Cady Ayad University, National School of Applied Sciences, Safi (Morocco); El Moussaoui, H. [Institute of Nanomaterials and Nanotechnology, MAScIR, Rabat (Morocco); LMPHE, (URAC 12), Faculte des Sciences, Universite Mohammed V-Agdal, Rabat (Morocco); Sajieddine, M., E-mail: hamedoun@hotmail.com [Faculte des Sciences et Techniques, Universite Moulay Slimane, Beni Mellal (Morocco)

2012-01-01

Polycrystalline Mg{sub 0.6}Cu{sub 0.4}Fe{sub 2}O{sub 4} ferrites have been prepared using solid-state reaction technique. Their structural and magnetic properties have been studied, using X-ray diffraction and magnetic measurements. Using mean field theory and high-temperature series expansions (HTSE), extrapolated with the pade approximants method, the magnetic properties of Mg{sub 1-x}Cu{sub x}Fe{sub 2}O{sub 4} have been studied. The nearest neighbor super-exchange interactions for intra-site and inter-site of the Mg{sub 1-x}Cu{sub x}Fe{sub 2}O{sub 4} ferrites spinels, in the range 0{<=}x{<=}1, have been computed using the probability approach, based on Moessbauer data. The Curie temperature T{sub c} is calculated as a function of Mg concentration. The obtained theoretical results are in good agreement with experimental ones obtained by magnetic measurements.

A test of the adhesion approximation for gravitational clustering

Science.gov (United States)

Melott, Adrian L.; Shandarin, Sergei; Weinberg, David H.

1993-01-01

We quantitatively compare a particle implementation of the adhesion approximation to fully non-linear, numerical 'N-body' simulations. Our primary tool, cross-correlation of N-body simulations with the adhesion approximation, indicates good agreement, better than that found by the same test performed with the Zel-dovich approximation (hereafter ZA). However, the cross-correlation is not as good as that of the truncated Zel-dovich approximation (TZA), obtained by applying the Zel'dovich approximation after smoothing the initial density field with a Gaussian filter. We confirm that the adhesion approximation produces an excessively filamentary distribution. Relative to the N-body results, we also find that: (a) the power spectrum obtained from the adhesion approximation is more accurate than that from ZA or TZA, (b) the error in the phase angle of Fourier components is worse than that from TZA, and (c) the mass distribution function is more accurate than that from ZA or TZA. It appears that adhesion performs well statistically, but that TZA is more accurate dynamically, in the sense of moving mass to the right place.

Hydrogen: Beyond the Classic Approximation

International Nuclear Information System (INIS)

Scivetti, Ivan

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

Simultaneous approximation in scales of Banach spaces

International Nuclear Information System (INIS)

Bramble, J.H.; Scott, R.

1978-01-01

The problem of verifying optimal approximation simultaneously in different norms in a Banach scale is reduced to verification of optimal approximation in the highest order norm. The basic tool used is the Banach space interpolation method developed by Lions and Peetre. Applications are given to several problems arising in the theory of finite element methods

On transparent potentials: a Born approximation study

International Nuclear Information System (INIS)

Coudray, C.

1980-01-01

In the frame of the scattering inverse problem at fixed energy, a class of potentials transparent in Born approximation is obtained. All these potentials are spherically symmetric and are oscillating functions of the reduced radial variable. Amongst them, the Born approximation of the transparent potential of the Newton-Sabatier method is found. In the same class, quasi-transparent potentials are exhibited. Very general features of potentials transparent in Born approximation are then stated. And bounds are given for the exact scattering amplitudes corresponding to most of the potentials previously exhibited. These bounds, obtained at fixed energy, and for large values of the angular momentum, are found to be independent on the energy

Approximate supernova remnant dynamics with cosmic ray production

Science.gov (United States)

Voelk, H. J.; Drury, L. O.; Dorfi, E. A.

1985-01-01

Supernova explosions are the most violent and energetic events in the galaxy and have long been considered probably sources of Cosmic Rays. Recent shock acceleration models treating the Cosmic Rays (CR's) as test particles nb a prescribed Supernova Remnant (SNR) evolution, indeed indicate an approximate power law momentum distribution f sub source (p) approximation p(-a) for the particles ultimately injected into the Interstellar Medium (ISM). This spectrum extends almost to the momentum p = 1 million GeV/c, where the break in the observed spectrum occurs. The calculated power law index approximately less than 4.2 agrees with that inferred for the galactic CR sources. The absolute CR intensity can however not be well determined in such a test particle approximation.

Approximate supernova remnant dynamics with cosmic ray production

International Nuclear Information System (INIS)

Voelk, H.J.; Drury, L.O.; Dorfi, E.A.

1985-01-01

Supernova explosions are the most violent and energetic events in the galaxy and have long been considered probable sources of cosmic rays. Recent shock acceleration models treating the cosmic rays (CR's) as test particles nb a prescribed supernova remnant (SNR) evolution, indeed indicate an approximate power law momentum distribution f sub source (p) approximation p(-a) for the particles ultimately injected into the interstellar medium (ISM). This spectrum extends almost to the momentum p = 1 million GeV/c, where the break in the observed spectrum occurs. The calculated power law index approximately less than 4.2 agrees with that inferred for the galactic CR sources. The absolute CR intensity can however not be well determined in such a test particle approximation

Standard filter approximations for low power Continuous Wavelet Transforms.

Science.gov (United States)

Casson, Alexander J; Rodriguez-Villegas, Esther

2010-01-01

Analogue domain implementations of the Continuous Wavelet Transform (CWT) have proved popular in recent years as they can be implemented at very low power consumption levels. This is essential for use in wearable, long term physiological monitoring systems. Present analogue CWT implementations rely on taking mathematical a approximation of the wanted mother wavelet function to give a filter transfer function that is suitable for circuit implementation. This paper investigates the use of standard filter approximations (Butterworth, Chebyshev, Bessel) as an alternative wavelet approximation technique. This extends the number of approximation techniques available for generating analogue CWT filters. An example ECG analysis shows that signal information can be successfully extracted using these CWT approximations.

Ordering, symbols and finite-dimensional approximations of path integrals

International Nuclear Information System (INIS)

Kashiwa, Taro; Sakoda, Seiji; Zenkin, S.V.

1994-01-01

We derive general form of finite-dimensional approximations of path integrals for both bosonic and fermionic canonical systems in terms of symbols of operators determined by operator ordering. We argue that for a system with a given quantum Hamiltonian such approximations are independent of the type of symbols up to terms of O(ε), where ε of is infinitesimal time interval determining the accuracy of the approximations. A new class of such approximations is found for both c-number and Grassmannian dynamical variables. The actions determined by the approximations are non-local and have no classical continuum limit except the cases of pq- and qp-ordering. As an explicit example the fermionic oscillator is considered in detail. (author)

Hardness of approximation for strip packing

DEFF Research Database (Denmark)

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

2017-01-01

Strip packing is a classical packing problem, where the goal is to pack a set of rectangular objects into a strip of a given width, while minimizing the total height of the packing. The problem has multiple applications, for example, in scheduling and stock-cutting, and has been studied extensively......)-approximation by two independent research groups [FSTTCS 2016,WALCOM 2017]. This raises a questionwhether strip packing with polynomially bounded input data admits a quasi-polynomial time approximation scheme, as is the case for related twodimensional packing problems like maximum independent set of rectangles or two...

Adaptive control using neural networks and approximate models.

Science.gov (United States)

Narendra, K S; Mukhopadhyay, S

1997-01-01

The NARMA model is an exact representation of the input-output behavior of finite-dimensional nonlinear discrete-time dynamical systems in a neighborhood of the equilibrium state. However, it is not convenient for purposes of adaptive control using neural networks due to its nonlinear dependence on the control input. Hence, quite often, approximate methods are used for realizing the neural controllers to overcome computational complexity. In this paper, we introduce two classes of models which are approximations to the NARMA model, and which are linear in the control input. The latter fact substantially simplifies both the theoretical analysis as well as the practical implementation of the controller. Extensive simulation studies have shown that the neural controllers designed using the proposed approximate models perform very well, and in many cases even better than an approximate controller designed using the exact NARMA model. In view of their mathematical tractability as well as their success in simulation studies, a case is made in this paper that such approximate input-output models warrant a detailed study in their own right.

Analytical models approximating individual processes: a validation method.

Science.gov (United States)

Favier, C; Degallier, N; Menkès, C E

2010-12-01

Upscaling population models from fine to coarse resolutions, in space, time and/or level of description, allows the derivation of fast and tractable models based on a thorough knowledge of individual processes. The validity of such approximations is generally tested only on a limited range of parameter sets. A more general validation test, over a range of parameters, is proposed; this would estimate the error induced by the approximation, using the original model's stochastic variability as a reference. This method is illustrated by three examples taken from the field of epidemics transmitted by vectors that bite in a temporally cyclical pattern, that illustrate the use of the method: to estimate if an approximation over- or under-fits the original model; to invalidate an approximation; to rank possible approximations for their qualities. As a result, the application of the validation method to this field emphasizes the need to account for the vectors' biology in epidemic prediction models and to validate these against finer scale models. Copyright © 2010 Elsevier Inc. All rights reserved.

The Hartree-Fock seniority approximation

International Nuclear Information System (INIS)

Gomez, J.M.G.; Prieto, C.

1986-01-01

A new self-consistent method is used to take into account the mean-field and the pairing correlations in nuclei at the same time. We call it the Hartree-Fock seniority approximation, because the long-range and short-range correlations are treated in the frameworks of Hartree-Fock theory and the seniority scheme. The method is developed in detail for a minimum-seniority variational wave function in the coordinate representation for an effective interaction of the Skyrme type. An advantage of the present approach over the Hartree-Fock-Bogoliubov theory is the exact conservation of angular momentum and particle number. Furthermore, the computational effort required in the Hartree-Fock seniority approximation is similar to that ofthe pure Hartree-Fock picture. Some numerical calculations for Ca isotopes are presented. (orig.)

Quasi-fractional approximation to the Bessel functions

International Nuclear Information System (INIS)

Guerrero, P.M.L.

1989-01-01

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

Scattering theory and effective medium approximations to heterogeneous materials

International Nuclear Information System (INIS)

Gubernatis, J.E.

1977-01-01

The formal analogy existing between problems studied in the microscopic theory of disordered alloys and problems concerned with the effective (macroscopic) behavior of heterogeneous materials is discussed. Attention is focused on (1) analogous approximations (effective medium approximations) developed for the microscopic problems by scattering theory concepts and techniques, but for the macroscopic problems principally by intuitive means, (2) the link, provided by scattering theory, of the intuitively developed approximations to a well-defined perturbative analysis, (3) the possible presence of conditionally convergent integrals in effective medium approximations

Approximate modal analysis using Fourier decomposition

International Nuclear Information System (INIS)

Kozar, Ivica; Jericevic, Zeljko; Pecak, Tatjana

2010-01-01

The paper presents a novel numerical approach for approximate solution of eigenvalue problem and investigates its suitability for modal analysis of structures with special attention on plate structures. The approach is based on Fourier transformation of the matrix equation into frequency domain and subsequent removal of potentially less significant frequencies. The procedure results in a much reduced problem that is used in eigenvalue calculation. After calculation eigenvectors are expanded and transformed back into time domain. The principles are presented in Jericevic [1]. Fourier transform can be formulated in a way that some parts of the matrix that should not be approximated are not transformed but are fully preserved. In this paper we present formulation that preserves central or edge parts of the matrix and compare it with the formulation that performs transform on the whole matrix. Numerical experiments on transformed structural dynamic matrices describe quality of the approximations obtained in modal analysis of structures. On the basis of the numerical experiments, from the three approaches to matrix reduction one is recommended.

A Gaussian Approximation Potential for Silicon

Science.gov (United States)

Bernstein, Noam; Bartók, Albert; Kermode, James; Csányi, Gábor

We present an interatomic potential for silicon using the Gaussian Approximation Potential (GAP) approach, which uses the Gaussian process regression method to approximate the reference potential energy surface as a sum of atomic energies. Each atomic energy is approximated as a function of the local environment around the atom, which is described with the smooth overlap of atomic environments (SOAP) descriptor. The potential is fit to a database of energies, forces, and stresses calculated using density functional theory (DFT) on a wide range of configurations from zero and finite temperature simulations. These include crystalline phases, liquid, amorphous, and low coordination structures, and diamond-structure point defects, dislocations, surfaces, and cracks. We compare the results of the potential to DFT calculations, as well as to previously published models including Stillinger-Weber, Tersoff, modified embedded atom method (MEAM), and ReaxFF. We show that it is very accurate as compared to the DFT reference results for a wide range of properties, including low energy bulk phases, liquid structure, as well as point, line, and plane defects in the diamond structure.

Development of the relativistic impulse approximation

International Nuclear Information System (INIS)

Wallace, S.J.

1985-01-01

This talk contains three parts. Part I reviews the developments which led to the relativistic impulse approximation for proton-nucleus scattering. In Part II, problems with the impulse approximation in its original form - principally the low energy problem - are discussed and traced to pionic contributions. Use of pseudovector covariants in place of pseudoscalar ones in the NN amplitude provides more satisfactory low energy results, however, the difference between pseudovector and pseudoscalar results is ambiguous in the sense that it is not controlled by NN data. Only with further theoretical input can the ambiguity be removed. Part III of the talk presents a new development of the relativistic impulse approximation which is the result of work done in the past year and a half in collaboration with J.A. Tjon. A complete NN amplitude representation is developed and a complete set of Lorentz invariant amplitudes are calculated based on a one-meson exchange model and appropriate integral equations. A meson theoretical basis for the important pair contributions to proton-nucleus scattering is established by the new developments. 28 references

Local approximation of a metapopulation's equilibrium.

Science.gov (United States)

Barbour, A D; McVinish, R; Pollett, P K

2018-04-18

We consider the approximation of the equilibrium of a metapopulation model, in which a finite number of patches are randomly distributed over a bounded subset [Formula: see text] of Euclidean space. The approximation is good when a large number of patches contribute to the colonization pressure on any given unoccupied patch, and when the quality of the patches varies little over the length scale determined by the colonization radius. If this is the case, the equilibrium probability of a patch at z being occupied is shown to be close to [Formula: see text], the equilibrium occupation probability in Levins's model, at any point [Formula: see text] not too close to the boundary, if the local colonization pressure and extinction rates appropriate to z are assumed. The approximation is justified by giving explicit upper and lower bounds for the occupation probabilities, expressed in terms of the model parameters. Since the patches are distributed randomly, the occupation probabilities are also random, and we complement our bounds with explicit bounds on the probability that they are satisfied at all patches simultaneously.

Approximate Bayesian recursive estimation

Czech Academy of Sciences Publication Activity Database

Kárný, Miroslav

2014-01-01

Roč. 285, č. 1 (2014), s. 100-111 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf

Pion-nucleus cross sections approximation

International Nuclear Information System (INIS)

Barashenkov, V.S.; Polanski, A.; Sosnin, A.N.

1990-01-01

Analytical approximation of pion-nucleus elastic and inelastic interaction cross-section is suggested, with could be applied in the energy range exceeding several dozens of MeV for nuclei heavier than beryllium. 3 refs.; 4 tabs

Approximal morphology as predictor of approximal caries in primary molar teeth

DEFF Research Database (Denmark)

Cortes, A; Martignon, S; Qvist, V

2018-01-01

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

Finite Element Approximation of the FENE-P Model

OpenAIRE

Barrett , John ,; Boyaval , Sébastien

2017-01-01

We extend our analysis on the Oldroyd-B model in Barrett and Boyaval [1] to consider the finite element approximation of the FENE-P system of equations, which models a dilute polymeric fluid, in a bounded domain $D $\\subset$ R d , d = 2 or 3$, subject to no flow boundary conditions. Our schemes are based on approximating the pressure and the symmetric conforma-tion tensor by either (a) piecewise constants or (b) continuous piecewise linears. In case (a) the velocity field is approximated by c...

Lattice quantum chromodynamics with approximately chiral fermions

International Nuclear Information System (INIS)

Hierl, Dieter

2008-05-01

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 Θ + 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.)

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

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

Using function approximation to determine neural network accuracy

International Nuclear Information System (INIS)

Wichman, R.F.; Alexander, J.

2013-01-01

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

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

Beyond the random phase approximation

DEFF Research Database (Denmark)

Olsen, Thomas; Thygesen, Kristian S.

2013-01-01

We assess the performance of a recently proposed renormalized adiabatic local density approximation (rALDA) for ab initio calculations of electronic correlation energies in solids and molecules. The method is an extension of the random phase approximation (RPA) derived from time-dependent density...... functional theory and the adiabatic connection fluctuation-dissipation theorem and contains no fitted parameters. The new kernel is shown to preserve the accurate description of dispersive interactions from RPA while significantly improving the description of short-range correlation in molecules, insulators......, and metals. For molecular atomization energies, the rALDA is a factor of 7 better than RPA and a factor of 4 better than the Perdew-Burke-Ernzerhof (PBE) functional when compared to experiments, and a factor of 3 (1.5) better than RPA (PBE) for cohesive energies of solids. For transition metals...

Vacancy-rearrangement theory in the first Magnus approximation

International Nuclear Information System (INIS)

Becker, R.L.

1984-01-01

In the present paper we employ the first Magnus approximation (M1A), a unitarized Born approximation, in semiclassical collision theory. We have found previously that the M1A gives a substantial improvement over the first Born approximation (B1A) and can give a good approximation to a full coupled channels calculation of the mean L-shell vacancy probability per electron, p/sub L/, when the L-vacancies are accompanied by a K-shell vacancy (p/sub L/ is obtained experimentally from measurements of K/sub α/-satellite intensities). For sufficiently strong projectile-electron interactions (sufficiently large Z/sub p/ or small v) the M1A ceases to reproduce the coupled channels results, but it is accurate over a much wider range of Z/sub p/ and v than the B1A. 27 references

On summation of perturbation expansions

International Nuclear Information System (INIS)

Horzela, A.

1985-04-01

The problem of the restoration of physical quantities defined by divergent perturbation expansions is analysed. The Pad'e and Borel summability is proved for alternating perturbation expansions with factorially growing coefficients. The proof is based on the methods of the classical moments theory. 17 refs. (author)

Minimax rational approximation of the Fermi-Dirac distribution

Science.gov (United States)

Moussa, Jonathan E.

2016-10-01

Accurate rational approximations of the Fermi-Dirac distribution are a useful component in many numerical algorithms for electronic structure calculations. The best known approximations use O(log(βΔ)log(ɛ-1)) poles to achieve an error tolerance ɛ at temperature β-1 over an energy interval Δ. We apply minimax approximation to reduce the number of poles by a factor of four and replace Δ with Δocc, the occupied energy interval. This is particularly beneficial when Δ ≫ Δocc, such as in electronic structure calculations that use a large basis set.

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.

Approximate Coulomb effects in the three-body scattering problem

International Nuclear Information System (INIS)

Haftel, M.I.; Zankel, H.

1981-01-01

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

Framework for sequential approximate optimization

NARCIS (Netherlands)

Jacobs, J.H.; Etman, L.F.P.; Keulen, van F.; Rooda, J.E.

2004-01-01

An object-oriented framework for Sequential Approximate Optimization (SAO) isproposed. The framework aims to provide an open environment for thespecification and implementation of SAO strategies. The framework is based onthe Python programming language and contains a toolbox of Python

Perturbative corrections for approximate inference in gaussian latent variable models

DEFF Research Database (Denmark)

Opper, Manfred; Paquet, Ulrich; Winther, Ole

2013-01-01

Expectation Propagation (EP) provides a framework for approximate inference. When the model under consideration is over a latent Gaussian field, with the approximation being Gaussian, we show how these approximations can systematically be corrected. A perturbative expansion is made of the exact b...... 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....

Approximating the physical inner product of loop quantum cosmology

International Nuclear Information System (INIS)

Bahr, Benjamin; Thiemann, Thomas

2007-01-01

In this paper, we investigate the possibility of approximating the physical inner product of constrained quantum theories. In particular, we calculate the physical inner product of a simple cosmological model in two ways: firstly, we compute it analytically via a trick; secondly, we use the complexifier coherent states to approximate the physical inner product defined by the master constraint of the system. We find that the approximation is able to recover the analytic solution of the problem, which consolidates hopes that coherent states will help to approximate solutions of more complicated theories, like loop quantum gravity

Polynomial approximation of functions in Sobolev spaces

International Nuclear Information System (INIS)

Dupont, T.; Scott, R.

1980-01-01

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

Nernst effect beyond the relaxation-time approximation

OpenAIRE

Pikulin, D. I.; Hou, Chang-Yu; Beenakker, C. W. J.

2011-01-01

Motivated by recent interest in the Nernst effect in cuprate superconductors, we calculate this magneto-thermo-electric effect for an arbitrary (anisotropic) quasiparticle dispersion relation and elastic scattering rate. The exact solution of the linearized Boltzmann equation is compared with the commonly used relaxation-time approximation. We find qualitative deficiencies of this approximation, to the extent that it can get the sign wrong of the Nernst coefficient. Ziman's improvement of the...

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

Approximate spatio-temporal top-k publish/subscribe

KAUST Repository

Chen, Lisi

2018-04-26

Location-based publish/subscribe plays a significant role in mobile information disseminations. In this light, we propose and study a novel problem of processing location-based top-k subscriptions over spatio-temporal data streams. We define a new type of approximate location-based top-k subscription, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription, that continuously feeds users with relevant spatio-temporal messages by considering textual similarity, spatial proximity, and information freshness. Different from existing location-based top-k subscriptions, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription can automatically adjust the triggering condition by taking the triggering score of other subscriptions into account. The group filtering efficacy can be substantially improved by sacrificing the publishing result quality with a bounded guarantee. We conduct extensive experiments on two real datasets to demonstrate the performance of the developed solutions.

Approximate spatio-temporal top-k publish/subscribe

KAUST Repository

Chen, Lisi; Shang, Shuo

2018-01-01

Location-based publish/subscribe plays a significant role in mobile information disseminations. In this light, we propose and study a novel problem of processing location-based top-k subscriptions over spatio-temporal data streams. We define a new type of approximate location-based top-k subscription, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription, that continuously feeds users with relevant spatio-temporal messages by considering textual similarity, spatial proximity, and information freshness. Different from existing location-based top-k subscriptions, Approximate Temporal Spatial-Keyword Top-k (ATSK) Subscription can automatically adjust the triggering condition by taking the triggering score of other subscriptions into account. The group filtering efficacy can be substantially improved by sacrificing the publishing result quality with a bounded guarantee. We conduct extensive experiments on two real datasets to demonstrate the performance of the developed solutions.

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

On root mean square approximation by exponential functions

OpenAIRE

Sharipov, Ruslan

2014-01-01

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

Approximate estimation of system reliability via fault trees

International Nuclear Information System (INIS)

Dutuit, Y.; Rauzy, A.

2005-01-01

In this article, we show how fault tree analysis, carried out by means of binary decision diagrams (BDD), is able to approximate reliability of systems made of independent repairable components with a good accuracy and a good efficiency. We consider four algorithms: the Murchland lower bound, the Barlow-Proschan lower bound, the Vesely full approximation and the Vesely asymptotic approximation. For each of these algorithms, we consider an implementation based on the classical minimal cut sets/rare events approach and another one relying on the BDD technology. We present numerical results obtained with both approaches on various examples

Usefulness of bound-state approximations in reaction theory

International Nuclear Information System (INIS)

Adhikari, S.K.

1981-01-01

A bound-state approximation when applied to certain operators, such as the many-body resolvent operator for a two-body fragmentation channel, in many-body scattering equations, reduces such equations to equivalent two-body scattering equations which are supposed to provide a good description of the underlying physical process. In this paper we test several variants of bound-state approximations in the soluble three-boson Amado model and find that such approximations lead to weak and unacceptable kernels for the equivalent two-body scattering equations and hence to a poor description of the underlying many-body process

Quenched Approximation to ΔS = 1 K Decay

International Nuclear Information System (INIS)

Christ, Norman H.

2005-01-01

The importance of explicit quark loops in the amplitudes contributing to ΔS = 1, K meson decays raises potential ambiguities when these amplitudes are evaluated in the quenched approximation. Using the factorization of these amplitudes into short- and long-distance parts provided by the standard low-energy effective weak Hamiltonian, we argue that the quenched approximation can be conventionally justified if it is applied to the long-distance portion of each amplitude. The result is a reasonably well-motivated definition of the quenched approximation that is close to that employed in the RBC and CP-PACS calculations of these quantities

Discovering approximate-associated sequence patterns for protein-DNA interactions

KAUST Repository

Chan, Tak Ming

2010-12-30

Motivation: The bindings between transcription factors (TFs) and transcription factor binding sites (TFBSs) are fundamental protein-DNA interactions in transcriptional regulation. Extensive efforts have been made to better understand the protein-DNA interactions. Recent mining on exact TF-TFBS-associated sequence patterns (rules) has shown great potentials and achieved very promising results. However, exact rules cannot handle variations in real data, resulting in limited informative rules. In this article, we generalize the exact rules to approximate ones for both TFs and TFBSs, which are essential for biological variations. Results: A progressive approach is proposed to address the approximation to alleviate the computational requirements. Firstly, similar TFBSs are grouped from the available TF-TFBS data (TRANSFAC database). Secondly, approximate and highly conserved binding cores are discovered from TF sequences corresponding to each TFBS group. A customized algorithm is developed for the specific objective. We discover the approximate TF-TFBS rules by associating the grouped TFBS consensuses and TF cores. The rules discovered are evaluated by matching (verifying with) the actual protein-DNA binding pairs from Protein Data Bank (PDB) 3D structures. The approximate results exhibit many more verified rules and up to 300% better verification ratios than the exact ones. The customized algorithm achieves over 73% better verification ratios than traditional methods. Approximate rules (64-79%) are shown statistically significant. Detailed variation analysis and conservation verification on NCBI records demonstrate that the approximate rules reveal both the flexible and specific protein-DNA interactions accurately. The approximate TF-TFBS rules discovered show great generalized capability of exploring more informative binding rules. © The Author 2010. Published by Oxford University Press. All rights reserved.

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

Approximate convex hull of affine iterated function system attractors

International Nuclear Information System (INIS)

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

2012-01-01

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

The high intensity approximation applied to multiphoton ionization

International Nuclear Information System (INIS)

Brandi, H.S.; Davidovich, L.; Zagury, N.

1980-08-01

It is shown that the most commonly used high intensity approximations as applied to ionization by strong electromagnetic fields are related. The applicability of the steepest descent method in these approximations, and the relation between them and first-order perturbation theory, are also discussed. (Author) [pt

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

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

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

Diatomic molecule vibrational potentials: Accuracy of representations

International Nuclear Information System (INIS)

Engelke, R.

1978-01-01

A method is presented for increasing the radius of convergence of certain representations of diatomic molecule vibrational potentials. The method relies on using knowledge of the analytic structure of such potentials to the maximum when attempting to approximate them. The known singular point (due to the centrifugal and/or Coulomb potentials) at zero internuclear separation should be included in its exact form in an approximate representation. The efficacy of this idea is tested [using Peek's ''exact'' numerical Born-Oppenheimer potential for the (1ssigma/sub g/) 2 Σ + /sub g/ state of H + 2 as a test problem] when the representational form is the series of (1) Dunham, (2) Simons, Parr, and Finlan, (3) Thakkar, and (4) Ogilvie-Tipping, and also (5) when the form is a [2, 2] or a [3, 3] Pade approximant. Significant improvements in accuracy are obtained in some of these cases, particularly on the inner wall of the potential. A comparison of the effectiveness of the five methods is made both with and without the origin behavior being included exactly. This is useful in itself as no comprehensive accuracy comparison of the standard representations seems to have appeared in the literature. The Ogilvie-Tipping series, corrected at the origin for singular behavior, is the best representation presently available for states analogous to the (1ssigma/sub g/) 2 Σ + /sub g/ state of H + 2

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

Directory of Open Access Journals (Sweden)

V. A. Baturin

2017-03-01

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

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

Modified semiclassical approximation for trapped Bose gases

International Nuclear Information System (INIS)

Yukalov, V.I.

2005-01-01

A generalization of the semiclassical approximation is suggested allowing for an essential extension of its region of applicability. In particular, it becomes possible to describe Bose-Einstein condensation of a trapped gas in low-dimensional traps and in traps of low confining dimensions, for which the standard semiclassical approximation is not applicable. The result of the modified approach is shown to coincide with purely quantum-mechanical calculations for harmonic traps, including the one-dimensional harmonic trap. The advantage of the semiclassical approximation is in its simplicity and generality. Power-law potentials of arbitrary powers are considered. The effective thermodynamic limit is defined for any confining dimension. The behavior of the specific heat, isothermal compressibility, and density fluctuations is analyzed, with an emphasis on low confining dimensions, where the usual semiclassical method fails. The peculiarities of the thermodynamic characteristics in the effective thermodynamic limit are discussed

On Born approximation in black hole scattering

Science.gov (United States)

Batic, D.; Kelkar, N. G.; Nowakowski, M.

2011-12-01

A massless field propagating on spherically symmetric black hole metrics such as the Schwarzschild, Reissner-Nordström and Reissner-Nordström-de Sitter backgrounds is considered. In particular, explicit formulae in terms of transcendental functions for the scattering of massless scalar particles off black holes are derived within a Born approximation. It is shown that the conditions on the existence of the Born integral forbid a straightforward extraction of the quasi normal modes using the Born approximation for the scattering amplitude. Such a method has been used in literature. We suggest a novel, well defined method, to extract the large imaginary part of quasinormal modes via the Coulomb-like phase shift. Furthermore, we compare the numerically evaluated exact scattering amplitude with the Born one to find that the approximation is not very useful for the scattering of massless scalar, electromagnetic as well as gravitational waves from black holes.

Efficient solution of parabolic equations by Krylov approximation methods

Science.gov (United States)

Gallopoulos, E.; Saad, Y.

1990-01-01

Numerical techniques for solving parabolic equations by the method of lines is addressed. The main motivation for the proposed approach is the possibility of exploiting a high degree of parallelism in a simple manner. The basic idea of the method is to approximate the action of the evolution operator on a given state vector by means of a projection process onto a Krylov subspace. Thus, the resulting approximation consists of applying an evolution operator of a very small dimension to a known vector which is, in turn, computed accurately by exploiting well-known rational approximations to the exponential. Because the rational approximation is only applied to a small matrix, the only operations required with the original large matrix are matrix-by-vector multiplications, and as a result the algorithm can easily be parallelized and vectorized. Some relevant approximation and stability issues are discussed. We present some numerical experiments with the method and compare its performance with a few explicit and implicit algorithms.

Diversity comparison of Pareto front approximations in many-objective optimization.

Science.gov (United States)

Li, Miqing; Yang, Shengxiang; Liu, Xiaohui

2014-12-01

Diversity assessment of Pareto front approximations is an important issue in the stochastic multiobjective optimization community. Most of the diversity indicators in the literature were designed to work for any number of objectives of Pareto front approximations in principle, but in practice many of these indicators are infeasible or not workable when the number of objectives is large. In this paper, we propose a diversity comparison indicator (DCI) to assess the diversity of Pareto front approximations in many-objective optimization. DCI evaluates relative quality of different Pareto front approximations rather than provides an absolute measure of distribution for a single approximation. In DCI, all the concerned approximations are put into a grid environment so that there are some hyperboxes containing one or more solutions. The proposed indicator only considers the contribution of different approximations to nonempty hyperboxes. Therefore, the computational cost does not increase exponentially with the number of objectives. In fact, the implementation of DCI is of quadratic time complexity, which is fully independent of the number of divisions used in grid. Systematic experiments are conducted using three groups of artificial Pareto front approximations and seven groups of real Pareto front approximations with different numbers of objectives to verify the effectiveness of DCI. Moreover, a comparison with two diversity indicators used widely in many-objective optimization is made analytically and empirically. Finally, a parametric investigation reveals interesting insights of the division number in grid and also offers some suggested settings to the users with different preferences.

Approximating Preemptive Stochastic Scheduling

OpenAIRE

Megow Nicole; Vredeveld Tjark

2009-01-01

We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online scheduling. The performance guarantee we give matches the best result known for the corresponding determinist...

Precise analytic approximations for the Bessel function J1 (x)

Science.gov (United States)

Maass, Fernando; Martin, Pablo

2018-03-01

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

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

Some properties of dual and approximate dual of fusion frames

OpenAIRE

Arefijamaal, Ali Akbar; Neyshaburi, Fahimeh Arabyani

2016-01-01

In this paper we extend the notion of approximate dual to fusion frames and present some approaches to obtain dual and approximate alternate dual fusion frames. Also, we study the stability of dual and approximate alternate dual fusion frames.

Geometrical-optics approximation of forward scattering by coated particles.

Science.gov (United States)

Xu, Feng; Cai, Xiaoshu; Ren, Kuanfang

2004-03-20

By means of geometrical optics we present an approximation algorithm with which to accelerate the computation of scattering intensity distribution within a forward angular range (0 degrees-60 degrees) for coated particles illuminated by a collimated incident beam. Phases of emerging rays are exactly calculated to improve the approximation precision. This method proves effective for transparent and tiny absorbent particles with size parameters larger than 75 but fails to give good approximation results at scattering angles at which refractive rays are absent. When the absorption coefficient of a particle is greater than 0.01, the geometrical optics approximation is effective only for forward small angles, typically less than 10 degrees or so.

Inertial parameters in the interacting boson fermion approximation

International Nuclear Information System (INIS)

Dukelsky, J.; Lima, C.

1986-06-01

The Hartree-Bose-Fermi and the adiabatic approximations are used to derive analytic formulas for the moment of inertia and the decoupling parameter of the interacting boson fermion approximation for deformed systems. These formulas are applied to the SU(3) dynamical symmetry, obtaining perfect agreement with the exact results. (Authors) [pt

Strange resonance poles from Kπ scattering below 1.8 GeV

Energy Technology Data Exchange (ETDEWEB)

Pelaez, J.R.; Rodas, A. [Universidad Complutense de Madrid, Departamento de Fisica Teorica II, Madrid (Spain); Ruiz de Elvira, J. [Universitaet Bonn, Helmholtz-Institut fuer Strahlen- und Kernphysik (Theorie) and Bethe Center for Theoretical Physics, Bonn (Germany); University of Bern, Albert Einstein Center for Fundamental Physics, Institute for Theoretical Physics, Bern (Switzerland)

2017-02-15

In this work we present a determination of the mass, width, and coupling of the resonances that appear in kaon-pion scattering below 1.8 GeV. These are: the much debated scalar κ-meson, nowadays known as K{sub 0}{sup *}(800), the scalar K{sub 0}{sup *}(1430), the K*(892) and K{sub 1}{sup *}(1410) vectors, the spin-two K{sub 2}{sup *}(1430) as well as the spin-three K{sup *}{sub 3}(1780). The parameters will be determined from the pole associated to each resonance by means of an analytic continuation of the Kπ scattering amplitudes obtained in a recent and precise data analysis constrained with dispersion relations, which were not well satisfied in previous analyses. This analytic continuation will be performed by means of Pade approximants, thus avoiding a particular model for the pole parameterization. We also pay particular attention to the evaluation of uncertainties. (orig.)

Phase transition in Ising, XY and Heisenberg magnetic films

Energy Technology Data Exchange (ETDEWEB)

Masrour, R., E-mail: rachidmasrour@hotmail.com [Laboratory of Materials, Processes, Environment and Quality, Cady Ayyed University, National School of Applied Sciences, Route Sidi Bouzid - BP 63 46000 Safi (Morocco); LMPHE, Faculte des Sciences, Universite Mohamed V, Rabat (Morocco); Hamedoun, M. [Institute for Nanomaterials and Nanotechnologies, Rabat (Morocco); Academie Hassan II des Sciences et Techniques, Rabat (Morocco); Benyoussef, A. [LMPHE, Faculte des Sciences, Universite Mohamed V, Rabat (Morocco); Institute for Nanomaterials and Nanotechnologies, Rabat (Morocco); Academie Hassan II des Sciences et Techniques, Rabat (Morocco)

2012-01-01

The phase transition and magnetic properties of a ferromagnet spin-S, a disordered diluted thin and semi-infinite film with a face-centered cubic lattice are investigated using the high-temperature series expansions technique extrapolated with Pade approximants method for Heisenberg, XY and Ising models. The reduced critical temperature of the system {tau}{sub c} is studied as function of the thickness of the thin film and the exchange interactions in the bulk, and within the surfaces J{sub b}, J{sub s} and J{sub Up-Tack }, respectively. It is found that {tau}{sub c} increases with the exchange interactions of surface. The magnetic phase diagrams ({tau}{sub c} versus the dilution x) and the percolation threshold are obtained. The shifts of the critical temperatures T{sub c}(l) from the bulk value (T{sub c}({infinity})/T{sub c}(l) - 1) can be described by a power law l{sup -{lambda}}, where {lambda} = 1/{upsilon} is the inverse of the correlation length exponent.

Non-ideal dust acoustic waves

International Nuclear Information System (INIS)

Konefka, F; Contreras, J P; Puerta, J; Castro, E; MartIn, P

2008-01-01

The dispersion relation for dust acoustic waves (DA waves) functionally depends on the state equation for the charged dust grains. The ideal gas equation is usually used for studying the effect of temperature on this dispersion relation. However, since the space occupied by the grains can be important in high-density plasmas, the non-ideal effects can be important in this case. This paper analyses the dispersion relation for DA waves, when more precise state equations are used as those described for Pade approximants. The correction to the usual wave equation has been determined and the break point in density, where the ideal gas-state equation has been found. The non-ideal effects are more important for short wavelength ones, and the limits where those effects become important are also studied. Since there are several experimental results for these kinds of waves, the importance of the non-ideal effects in these cases is analysed in detail.

Magnetic phase diagram of the Ca1-xMnxO systems

International Nuclear Information System (INIS)

Masrour, R.; Hamedoun, M.

2008-01-01

The magnetic properties of the Ca 1-x Mn x O systems in the range 0≤x≤1 have been studied by mean field theory and high-temperature series expansions (HTSEs). By using the first theory, we have evaluated the nearest neighbour and the next-neighbour super-exchange interaction J 1 (x) and J 2 (x) respectively, in the range 0.45≤x≤1. The corresponding classical exchange energy for magnetic structure is obtained for the Ca 1-x Mn x O systems. The HTSEs combined with the Pade approximants (PA) method is applied to the Ca 1-x Mn x O systems; we have obtained the magnetic phase diagrams (T N or T SG versus dilution x) in the range 0≤x≤1. The obtained theoretical results are in agreement with experimental ones obtained by magnetic measurements. The critical exponents associated with the magnetic susceptibility (γ) and the correlation lengths (ν) are deduced in the range 0≤x≤1

Three dimensional iterative beam propagation method for optical waveguide devices

Science.gov (United States)

Ma, Changbao; Van Keuren, Edward

2006-10-01

The finite difference beam propagation method (FD-BPM) is an effective model for simulating a wide range of optical waveguide structures. The classical FD-BPMs are based on the Crank-Nicholson scheme, and in tridiagonal form can be solved using the Thomas method. We present a different type of algorithm for 3-D structures. In this algorithm, the wave equation is formulated into a large sparse matrix equation which can be solved using iterative methods. The simulation window shifting scheme and threshold technique introduced in our earlier work are utilized to overcome the convergence problem of iterative methods for large sparse matrix equation and wide-angle simulations. This method enables us to develop higher-order 3-D wide-angle (WA-) BPMs based on Pade approximant operators and the multistep method, which are commonly used in WA-BPMs for 2-D structures. Simulations using the new methods will be compared to the analytical results to assure its effectiveness and applicability.

Surface effects in quantum spin chains

International Nuclear Information System (INIS)

Parkinson, J B

2004-01-01

Chains of quantum spins with open ends and isotropic Heisenberg exchange are studied. By diagonalizing the Hamiltonian for chains of finite length N and obtaining all the energy eigenvalues, the magnetic susceptibility χ, the specific heat C v , and the partition function Z can be calculated exactly for these chains. The high-temperature series expansions of these are then evaluated. For χ and C v it is found that the terms in the series consist of three parts. One is the normal high-T series already known in great detail for the N → infinity ring(chain with periodic boundary conditions). The other two consist of a 'surface' term and a correction term of order (1/T) N . The surface term is found as a series up to and including (1/T) 8 for spin S = 1/2 and 1. Simple Pade approximant formulae are given to extend the range of validity below T = 1

Approximation of bivariate copulas by patched bivariate Fréchet copulas

KAUST Repository

Zheng, Yanting; Yang, Jingping; Huang, Jianhua Z.

2011-01-01

Bivariate Fréchet (BF) copulas characterize dependence as a mixture of three simple structures: comonotonicity, independence and countermonotonicity. They are easily interpretable but have limitations when used as approximations to general dependence structures. To improve the approximation property of the BF copulas and keep the advantage of easy interpretation, we develop a new copula approximation scheme by using BF copulas locally and patching the local pieces together. Error bounds and a probabilistic interpretation of this approximation scheme are developed. The new approximation scheme is compared with several existing copula approximations, including shuffle of min, checkmin, checkerboard and Bernstein approximations and exhibits better performance, especially in characterizing the local dependence. The utility of the new approximation scheme in insurance and finance is illustrated in the computation of the rainbow option prices and stop-loss premiums. © 2010 Elsevier B.V.

Approximation of bivariate copulas by patched bivariate Fréchet copulas

KAUST Repository

Zheng, Yanting

2011-03-01

Bivariate Fréchet (BF) copulas characterize dependence as a mixture of three simple structures: comonotonicity, independence and countermonotonicity. They are easily interpretable but have limitations when used as approximations to general dependence structures. To improve the approximation property of the BF copulas and keep the advantage of easy interpretation, we develop a new copula approximation scheme by using BF copulas locally and patching the local pieces together. Error bounds and a probabilistic interpretation of this approximation scheme are developed. The new approximation scheme is compared with several existing copula approximations, including shuffle of min, checkmin, checkerboard and Bernstein approximations and exhibits better performance, especially in characterizing the local dependence. The utility of the new approximation scheme in insurance and finance is illustrated in the computation of the rainbow option prices and stop-loss premiums. © 2010 Elsevier B.V.

On badly approximable complex numbers

DEFF Research Database (Denmark)

Esdahl-Schou, Rune; Kristensen, S.

We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...

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

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…

PWL approximation of nonlinear dynamical systems, part I: structural stability

International Nuclear Information System (INIS)

Storace, M; De Feo, O

2005-01-01

This paper and its companion address the problem of the approximation/identification of nonlinear dynamical systems depending on parameters, with a view to their circuit implementation. The proposed method is based on a piecewise-linear approximation technique. In particular, this paper describes the approximation method and applies it to some particularly significant dynamical systems (topological normal forms). The structural stability of the PWL approximations of such systems is investigated through a bifurcation analysis (via continuation methods)

Dynamic Analyses of Result Quality in Energy-Aware Approximate Programs

Science.gov (United States)

RIngenburg, Michael F.

Energy efficiency is a key concern in the design of modern computer systems. One promising approach to energy-efficient computation, approximate computing, trades off output precision for energy efficiency. However, this tradeoff can have unexpected effects on computation quality. This thesis presents dynamic analysis tools to study, debug, and monitor the quality and energy efficiency of approximate computations. We propose three styles of tools: prototyping tools that allow developers to experiment with approximation in their applications, online tools that instrument code to determine the key sources of error, and online tools that monitor the quality of deployed applications in real time. Our prototyping tool is based on an extension to the functional language OCaml. We add approximation constructs to the language, an approximation simulator to the runtime, and profiling and auto-tuning tools for studying and experimenting with energy-quality tradeoffs. We also present two online debugging tools and three online monitoring tools. The first online tool identifies correlations between output quality and the total number of executions of, and errors in, individual approximate operations. The second tracks the number of approximate operations that flow into a particular value. Our online tools comprise three low-cost approaches to dynamic quality monitoring. They are designed to monitor quality in deployed applications without spending more energy than is saved by approximation. Online monitors can be used to perform real time adjustments to energy usage in order to meet specific quality goals. We present prototype implementations of all of these tools and describe their usage with several applications. Our prototyping, profiling, and autotuning tools allow us to experiment with approximation strategies and identify new strategies, our online tools succeed in providing new insights into the effects of approximation on output quality, and our monitors succeed in

An improved corrective smoothed particle method approximation for second‐order derivatives

NARCIS (Netherlands)

Korzilius, S.P.; Schilders, W.H.A.; Anthonissen, M.J.H.

2013-01-01

To solve (partial) differential equations it is necessary to have good numerical approximations. In SPH, most approximations suffer from the presence of boundaries. In this work a new approximation for the second-order derivative is derived and numerically compared with two other approximation

Blind sensor calibration using approximate message passing

International Nuclear Information System (INIS)

Schülke, Christophe; Caltagirone, Francesco; Zdeborová, Lenka

2015-01-01

The ubiquity of approximately sparse data has led a variety of communities to take great interest in compressed sensing algorithms. Although these are very successful and well understood for linear measurements with additive noise, applying them to real data can be problematic if imperfect sensing devices introduce deviations from this ideal signal acquisition process, caused by sensor decalibration or failure. We propose a message passing algorithm called calibration approximate message passing (Cal-AMP) that can treat a variety of such sensor-induced imperfections. In addition to deriving the general form of the algorithm, we numerically investigate two particular settings. In the first, a fraction of the sensors is faulty, giving readings unrelated to the signal. In the second, sensors are decalibrated and each one introduces a different multiplicative gain to the measurements. Cal-AMP shares the scalability of approximate message passing, allowing us to treat large sized instances of these problems, and experimentally exhibits a phase transition between domains of success and failure. (paper)

The binary collision approximation: Background and introduction

International Nuclear Information System (INIS)

Robinson, M.T.

1992-08-01

The binary collision approximation (BCA) has long been used in computer simulations of the interactions of energetic atoms with solid targets, as well as being the basis of most analytical theory in this area. While mainly a high-energy approximation, the BCA retains qualitative significance at low energies and, with proper formulation, gives useful quantitative information as well. Moreover, computer simulations based on the BCA can achieve good statistics in many situations where those based on full classical dynamical models require the most advanced computer hardware or are even impracticable. The foundations of the BCA in classical scattering are reviewed, including methods of evaluating the scattering integrals, interaction potentials, and electron excitation effects. The explicit evaluation of time at significant points on particle trajectories is discussed, as are scheduling algorithms for ordering the collisions in a developing cascade. An approximate treatment of nearly simultaneous collisions is outlined and the searching algorithms used in MARLOWE are presented

An inductive algorithm for smooth approximation of functions

International Nuclear Information System (INIS)

Kupenova, T.N.

2011-01-01

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

Gauge-invariant intense-field approximations to all orders

International Nuclear Information System (INIS)

Faisal, F H M

2007-01-01

We present a gauge-invariant formulation of the so-called strong-field KFR approximations in the 'velocity' and 'length' gauges and demonstrate their equivalence in all orders. The theory thus overcomes a longstanding discrepancy between the strong-field velocity and the length-gauge approximations for non-perturbative processes in intense laser fields. (fast track communication)

On the convergence of multigroup discrete-ordinates approximations

International Nuclear Information System (INIS)

Victory, H.D. Jr.; Allen, E.J.; Ganguly, K.

1987-01-01

Our analysis is divided into two distinct parts which we label for convenience as Part A and Part B. In Part A, we demonstrate that the multigroup discrete-ordinates approximations are well-defined and converge to the exact transport solution in any subcritical setting. For the most part, we focus on transport in two-dimensional Cartesian geometry. A Nystroem technique is used to extend the discrete ordinates multigroup approximates to all values of the angular and energy variables. Such an extension enables us to employ collectively compact operator theory to deduce stability and convergence of the approximates. In Part B, we perform a thorough convergence analysis for the multigroup discrete-ordinates method for an anisotropically-scattering subcritical medium in slab geometry. The diamond-difference and step-characteristic spatial approximation methods are each studied. The multigroup neutron fluxes are shown to converge in a Banach space setting under realistic smoothness conditions on the solution. This is the first thorough convergence analysis for the fully-discretized multigroup neutron transport equations

Approximation theorems by Meyer-Koenig and Zeller type operators

International Nuclear Information System (INIS)

Ali Ozarslan, M.; Duman, Oktay

2009-01-01

This paper is mainly connected with the approximation properties of Meyer-Koenig and Zeller (MKZ) type operators. We first introduce a general sequence of MKZ operators based on q-integers and then obtain a Korovkin-type approximation theorem for these operators. We also compute their rates of convergence by means of modulus of continuity and the elements of Lipschitz class functionals. Furthermore, we give an rth order generalization of our operators in order to get some explicit approximation results.

Space-angle approximations in the variational nodal method

International Nuclear Information System (INIS)

Lewis, E. E.; Palmiotti, G.; Taiwo, T.

1999-01-01

The variational nodal method is formulated such that the angular and spatial approximations maybe examined separately. Spherical harmonic, simplified spherical harmonic, and discrete ordinate approximations are coupled to the primal hybrid finite element treatment of the spatial variables. Within this framework, two classes of spatial trial functions are presented: (1) orthogonal polynomials for the treatment of homogeneous nodes and (2) bilinear finite subelement trial functions for the treatment of fuel assembly sized nodes in which fuel-pin cell cross sections are represented explicitly. Polynomial and subelement trial functions are applied to benchmark water-reactor problems containing MOX fuel using spherical harmonic and simplified spherical harmonic approximations. The resulting accuracy and computing costs are compared

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.

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 starting point. In this method message passing fixed point equations (which correspond to the update rules in a message passing algorithm) are then obtained by imposing different region-based approximations and constraints on the mean field and belief propagation parts of the corresponding factor graph....... Our results can be applied, for example, to algorithms that perform joint channel estimation and decoding in iterative receivers. This is demonstrated in a simple example....

Explicitly solvable complex Chebyshev approximation problems related to sine polynomials

Science.gov (United States)

Freund, Roland

1989-01-01

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

APPROXIMATION OF PROBABILITY DISTRIBUTIONS IN QUEUEING MODELS

Directory of Open Access Journals (Sweden)

T. I. Aliev

2013-03-01

Full Text Available For probability distributions with variation coefficient, not equal to unity, mathematical dependences for approximating distributions on the basis of first two moments are derived by making use of multi exponential distributions. It is proposed to approximate distributions with coefficient of variation less than unity by using hypoexponential distribution, which makes it possible to generate random variables with coefficient of variation, taking any value in a range (0; 1, as opposed to Erlang distribution, having only discrete values of coefficient of variation.

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.

Sharp Bounds for Symmetric and Asymmetric Diophantine Approximation

Institute of Scientific and Technical Information of China (English)

Cornelis KRAAIKAMP; Ionica SMEETS

2011-01-01

In 2004,Tong found bounds for the approximation quality of a regular continued fraction convergent to a rational number,expressed in bounds for both the previous and next approximation.The authors sharpen his results with a geometric method and give both sharp upper and lower bounds.The asymptotic frequencies that these bounds occur are also calculated.

evaluation of approximate design procedures for biaxially loaded

African Journals Online (AJOL)

The approximation according to the ACI is based on the work by Parme [9] who chose to approximate a as a logarithmic function 9f a parameter /3 representing an actual point on· the non-dimensional load contour, where the two moment components, . related to the respective uniaxial capacities are equal,. i.e. f3=;: my lmuy ...

Effective medium super-cell approximation for interacting disordered systems: an alternative real-space derivation of generalized dynamical cluster approximation

International Nuclear Information System (INIS)

Moradian, Rostam

2006-01-01

We develop a generalized real-space effective medium super-cell approximation (EMSCA) method to treat the electronic states of interacting disordered systems. This method is general and allows randomness both in the on-site energies and in the hopping integrals. For a non-interacting disordered system, in the special case of randomness in the on-site energies, this method is equivalent to the non-local coherent potential approximation (NLCPA) derived previously. Also, for an interacting system the EMSCA method leads to the real-space derivation of the generalized dynamical cluster approximation (DCA) for a general lattice structure. We found that the original DCA and the NLCPA are two simple cases of this technique, so the EMSCA is equivalent to the generalized DCA where there is included interaction and randomness in the on-site energies and in the hopping integrals. All of the equations of this formalism are derived by using the effective medium theory in real space

Faster and Simpler Approximation of Stable Matchings

Directory of Open Access Journals (Sweden)

Katarzyna Paluch

2014-04-01

Full Text Available We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.

On the dipole approximation with error estimates

Science.gov (United States)

Boßmann, Lea; Grummt, Robert; Kolb, Martin

2018-01-01

The dipole approximation is employed to describe interactions between atoms and radiation. It essentially consists of neglecting the spatial variation of the external field over the atom. Heuristically, this is justified by arguing that the wavelength is considerably larger than the atomic length scale, which holds under usual experimental conditions. We prove the dipole approximation in the limit of infinite wavelengths compared to the atomic length scale and estimate the rate of convergence. Our results include N-body Coulomb potentials and experimentally relevant electromagnetic fields such as plane waves and laser pulses.

On approximation of Lie groups by discrete subgroups

Indian Academy of Sciences (India)

2016-08-26

Aug 26, 2016 ... The notion of approximation of Lie groups by discrete subgroups was introduced by Tôyama in Kodai Math. Sem. Rep. 1 (1949) 36–37 and investigated in detail by Kuranishi in Nagoya Math. J. 2 (1951) 63–71. It is known as a theorem of Tôyama that any connected Lie group approximated by discrete ...

A simple approximation method for dilute Ising systems

International Nuclear Information System (INIS)

Saber, M.

1996-10-01

We describe a simple approximate method to analyze dilute Ising systems. The method takes into consideration the fluctuations of the effective field, and is based on a probability distribution of random variables which correctly accounts for all the single site kinematic relations. It is shown that the simplest approximation gives satisfactory results when compared with other methods. (author). 12 refs, 2 tabs

The modified signed likelihood statistic and saddlepoint approximations

DEFF Research Database (Denmark)

Jensen, Jens Ledet

1992-01-01

SUMMARY: For a number of tests in exponential families we show that the use of a normal approximation to the modified signed likelihood ratio statistic r * is equivalent to the use of a saddlepoint approximation. This is also true in a large deviation region where the signed likelihood ratio...... statistic r is of order √ n. © 1992 Biometrika Trust....

Confidence Intervals for Asbestos Fiber Counts: Approximate Negative Binomial Distribution.

Science.gov (United States)

Bartley, David; Slaven, James; Harper, Martin

2017-03-01

The negative binomial distribution is adopted for analyzing asbestos fiber counts so as to account for both the sampling errors in capturing only a finite number of fibers and the inevitable human variation in identifying and counting sampled fibers. A simple approximation to this distribution is developed for the derivation of quantiles and approximate confidence limits. The success of the approximation depends critically on the use of Stirling's expansion to sufficient order, on exact normalization of the approximating distribution, on reasonable perturbation of quantities from the normal distribution, and on accurately approximating sums by inverse-trapezoidal integration. Accuracy of the approximation developed is checked through simulation and also by comparison to traditional approximate confidence intervals in the specific case that the negative binomial distribution approaches the Poisson distribution. The resulting statistics are shown to relate directly to early research into the accuracy of asbestos sampling and analysis. Uncertainty in estimating mean asbestos fiber concentrations given only a single count is derived. Decision limits (limits of detection) and detection limits are considered for controlling false-positive and false-negative detection assertions and are compared to traditional limits computed assuming normal distributions. Published by Oxford University Press on behalf of the British Occupational Hygiene Society 2017.

Nonresonant approximations to the optical potential

International Nuclear Information System (INIS)

Kowalski, K.L.

1982-01-01

A new class of approximations to the optical potential, which includes those of the multiple-scattering variety, is investigated. These approximations are constructed so that the optical potential maintains the correct unitarity properties along with a proper treatment of nucleon identity. The special case of nucleon-nucleus scattering with complete inclusion of Pauli effects is studied in detail. The treatment is such that the optical potential receives contributions only from subsystems embedded in their own physically correct antisymmetrized subspaces. It is found that a systematic development of even the lowest-order approximations requires the use of the off-shell extension due to Alt, Grassberger, and Sandhas along with a consistent set of dynamical equations for the optical potential. In nucleon-nucleus scattering a lowest-order optical potential is obtained as part of a systematic, exact, inclusive connectivity expansion which is expected to be useful at moderately high energies. This lowest-order potential consists of an energy-shifted (trho)-type term with three-body kinematics plus a heavy-particle exchange or pickup term. The natural appearance of the exchange term additivity in the optical potential clarifies the role of the elastic distortion in connection with the treatment of these processes. The relationship of the relevant aspects of the present analysis of the optical potential to conventional multiple scattering methods is discussed

Sequential function approximation on arbitrarily distributed point sets

Science.gov (United States)

Wu, Kailiang; Xiu, Dongbin

2018-02-01

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

Semiclassical approximation to time-dependent Hartree--Fock theory

International Nuclear Information System (INIS)

Dworzecka, M.; Poggioli, R.

1976-01-01

Working within a time-dependent Hartree-Fock framework, one develops a semiclassical approximation appropriate for large systems. It is demonstrated that the standard semiclassical approach, the Thomas-Fermi approximation, is inconsistent with Hartree-Fock theory when the basic two-body interaction is short-ranged (as in nuclear systems, for example). However, by introducing a simple extension of the Thomas-Fermi approximation, one overcomes this problem. One also discusses the infinite nuclear matter problem and point out that time-dependent Hartree-Fock theory yields collective modes of the zero sound variety instead of ordinary hydrodynamic (first) sound. One thus emphasizes that one should be extremely circumspect when attempting to cast the equations of motion of time-dependent Hartree-Fock theory into a hydrodynamic-like form

Good and Bad Neighborhood Approximations for Outlier Detection Ensembles

DEFF Research Database (Denmark)

Kirner, Evelyn; Schubert, Erich; Zimek, Arthur

2017-01-01

Outlier detection methods have used approximate neighborhoods in filter-refinement approaches. Outlier detection ensembles have used artificially obfuscated neighborhoods to achieve diverse ensemble members. Here we argue that outlier detection models could be based on approximate neighborhoods...... in the first place, thus gaining in both efficiency and effectiveness. It depends, however, on the type of approximation, as only some seem beneficial for the task of outlier detection, while no (large) benefit can be seen for others. In particular, we argue that space-filling curves are beneficial...

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

The complex variable boundary element method: Applications in determining approximative boundaries

Science.gov (United States)

Hromadka, T.V.

1984-01-01

The complex variable boundary element method (CVBEM) is used to determine approximation functions for boundary value problems of the Laplace equation such as occurs in potential theory. By determining an approximative boundary upon which the CVBEM approximator matches the desired constant (level curves) boundary conditions, the CVBEM is found to provide the exact solution throughout the interior of the transformed problem domain. Thus, the acceptability of the CVBEM approximation is determined by the closeness-of-fit of the approximative boundary to the study problem boundary. ?? 1984.

Gaussian and 1/N approximations in semiclassical cosmology

International Nuclear Information System (INIS)

Mazzitelli, F.D.; Paz, J.P.

1989-01-01

We study the λphi 4 theory and the interacting O(N) model in a curved background using the Gaussian approximation for the former and the large-N approximation for the latter. We obtain the renormalized version of the semiclassical Einstein equations having in mind a future application of these models to investigate the physics of the very early Universe. We show that, while the Gaussian approximation has two different phases, in the large-N limit only one is present. The different features of the two phases are analyzed at the level of the effective field equations. We discuss the initial-value problem and find the initial conditions that make the theory renormalizable. As an example, we study the de Sitter self-consistent solutions of the semiclassical Einstein equations. Finally, for an identically zero mean value of the field we find the evolution equations for the classical field Ω(x) = (λ 2 >)/sup 1/2/ and the spacetime metric. They are very similar to the ones obtained by replacing the classical potential by the one-loop effective potential in the classical equations but do not have the drawbacks of the one-loop approximation

Approximate Matching of Hierarchial Data

DEFF Research Database (Denmark)

Augsten, Nikolaus

-grams of a tree are all its subtrees of a particular shape. Intuitively, two trees are similar if they have many pq-grams in common. The pq-gram distance is an efficient and effective approximation of the tree edit distance. We analyze the properties of the pq-gram distance and compare it with the tree edit...

Pythagorean Approximations and Continued Fractions

Science.gov (United States)

Peralta, Javier

2008-01-01

In this article, we will show that the Pythagorean approximations of [the square root of] 2 coincide with those achieved in the 16th century by means of continued fractions. Assuming this fact and the known relation that connects the Fibonacci sequence with the golden section, we shall establish a procedure to obtain sequences of rational numbers…

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.

Function approximation of tasks by neural networks

International Nuclear Information System (INIS)

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

2008-01-01

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

Approximate particle number projection in hot nuclei

International Nuclear Information System (INIS)

Kosov, D.S.; Vdovin, A.I.

1995-01-01

Heated finite systems like, e.g., hot atomic nuclei have to be described by the canonical partition function. But this is a quite difficult technical problem and, as a rule, the grand canonical partition function is used in the studies. As a result, some shortcomings of the theoretical description appear because of the thermal fluctuations of the number of particles. Moreover, in nuclei with pairing correlations the quantum number fluctuations are introduced by some approximate methods (e.g., by the standard BCS method). The exact particle number projection is very cumbersome and an approximate number projection method for T ≠ 0 basing on the formalism of thermo field dynamics is proposed. The idea of the Lipkin-Nogami method to perform any operator as a series in the number operator powers is used. The system of equations for the coefficients of this expansion is written and the solution of the system in the next approximation after the BCS one is obtained. The method which is of the 'projection after variation' type is applied to a degenerate single j-shell model. 14 refs., 1 tab

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

An approximation to the interference term using Frobenius Method

Energy Technology Data Exchange (ETDEWEB)

Palma, Daniel A.P.; Martinez, Aquilino S.; Silva, Fernando C. da [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear; E-mail: aquilino@lmp.ufrj.br

2007-07-01

An analytical approximation of the interference term {chi}(x,{xi}) is proposed. The approximation is based on the differential equation to {chi}(x,{xi}) using the Frobenius method and the parameter variation. The analytical expression of the {chi}(x,{xi}) obtained in terms of the elementary functions is very simple and precise. In this work one applies the approximations to the Doppler broadening functions and to the interference term in determining the neutron cross sections. Results were validated for the resonances of the U{sup 238} isotope for different energies and temperature ranges. (author)

An approximation to the interference term using Frobenius Method

International Nuclear Information System (INIS)

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

2007-01-01

An analytical approximation of the interference term χ(x,ξ) is proposed. The approximation is based on the differential equation to χ(x,ξ) using the Frobenius method and the parameter variation. The analytical expression of the χ(x,ξ) obtained in terms of the elementary functions is very simple and precise. In this work one applies the approximations to the Doppler broadening functions and to the interference term in determining the neutron cross sections. Results were validated for the resonances of the U 238 isotope for different energies and temperature ranges. (author)

The mathematical structure of the approximate linear response relation

International Nuclear Information System (INIS)

Yasuda, Muneki; Tanaka, Kazuyuki

2007-01-01

In this paper, we study the mathematical structures of the linear response relation based on Plefka's expansion and the cluster variation method in terms of the perturbation expansion, and we show how this linear response relation approximates the correlation functions of the specified system. Moreover, by comparing the perturbation expansions of the correlation functions estimated by the linear response relation based on these approximation methods with exact perturbative forms of the correlation functions, we are able to explain why the approximate techniques using the linear response relation work well

Efficient approximation of random fields for numerical applications

KAUST Repository

Harbrecht, Helmut; Peters, Michael; Siebenmorgen, Markus

2015-01-01

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.

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.

Intensity-based hierarchical elastic registration using approximating splines.

Science.gov (United States)

Serifovic-Trbalic, Amira; Demirovic, Damir; Cattin, Philippe C

2014-01-01

We introduce a new hierarchical approach for elastic medical image registration using approximating splines. In order to obtain the dense deformation field, we employ Gaussian elastic body splines (GEBS) that incorporate anisotropic landmark errors and rotation information. Since the GEBS approach is based on a physical model in form of analytical solutions of the Navier equation, it can very well cope with the local as well as global deformations present in the images by varying the standard deviation of the Gaussian forces. The proposed GEBS approximating model is integrated into the elastic hierarchical image registration framework, which decomposes a nonrigid registration problem into numerous local rigid transformations. The approximating GEBS registration scheme incorporates anisotropic landmark errors as well as rotation information. The anisotropic landmark localization uncertainties can be estimated directly from the image data, and in this case, they represent the minimal stochastic localization error, i.e., the Cramér-Rao bound. The rotation information of each landmark obtained from the hierarchical procedure is transposed in an additional angular landmark, doubling the number of landmarks in the GEBS model. The modified hierarchical registration using the approximating GEBS model is applied to register 161 image pairs from a digital mammogram database. The obtained results are very encouraging, and the proposed approach significantly improved all registrations comparing the mean-square error in relation to approximating TPS with the rotation information. On artificially deformed breast images, the newly proposed method performed better than the state-of-the-art registration algorithm introduced by Rueckert et al. (IEEE Trans Med Imaging 18:712-721, 1999). The average error per breast tissue pixel was less than 2.23 pixels compared to 2.46 pixels for Rueckert's method. The proposed hierarchical elastic image registration approach incorporates the GEBS

Lognormal Approximations of Fault Tree Uncertainty Distributions.

Science.gov (United States)

El-Shanawany, Ashraf Ben; Ardron, Keith H; Walker, Simon P

2018-01-26

Fault trees are used in reliability modeling to create logical models of fault combinations that can lead to undesirable events. The output of a fault tree analysis (the top event probability) is expressed in terms of the failure probabilities of basic events that are input to the model. Typically, the basic event probabilities are not known exactly, but are modeled as probability distributions: therefore, the top event probability is also represented as an uncertainty distribution. Monte Carlo methods are generally used for evaluating the uncertainty distribution, but such calculations are computationally intensive and do not readily reveal the dominant contributors to the uncertainty. In this article, a closed-form approximation for the fault tree top event uncertainty distribution is developed, which is applicable when the uncertainties in the basic events of the model are lognormally distributed. The results of the approximate method are compared with results from two sampling-based methods: namely, the Monte Carlo method and the Wilks method based on order statistics. It is shown that the closed-form expression can provide a reasonable approximation to results obtained by Monte Carlo sampling, without incurring the computational expense. The Wilks method is found to be a useful means of providing an upper bound for the percentiles of the uncertainty distribution while being computationally inexpensive compared with full Monte Carlo sampling. The lognormal approximation method and Wilks's method appear attractive, practical alternatives for the evaluation of uncertainty in the output of fault trees and similar multilinear models. © 2018 Society for Risk Analysis.

Direct application of Padé approximant for solving nonlinear differential equations.

Science.gov (United States)

Vazquez-Leal, Hector; Benhammouda, Brahim; Filobello-Nino, Uriel; Sarmiento-Reyes, Arturo; Jimenez-Fernandez, Victor Manuel; Garcia-Gervacio, Jose Luis; Huerta-Chua, Jesus; Morales-Mendoza, Luis Javier; Gonzalez-Lee, Mario

2014-01-01

This work presents a direct procedure to apply Padé method to find approximate solutions for nonlinear differential equations. Moreover, we present some cases study showing the strength of the method to generate highly accurate rational approximate solutions compared to other semi-analytical methods. The type of tested nonlinear equations are: a highly nonlinear boundary value problem, a differential-algebraic oscillator problem, and an asymptotic problem. The high accurate handy approximations obtained by the direct application of Padé method shows the high potential if the proposed scheme to approximate a wide variety of problems. What is more, the direct application of the Padé approximant aids to avoid the previous application of an approximative method like Taylor series method, homotopy perturbation method, Adomian Decomposition method, homotopy analysis method, variational iteration method, among others, as tools to obtain a power series solutions to post-treat with the Padé approximant. 34L30.

Continuum orbital approximations in weak-coupling theories for inelastic electron scattering

International Nuclear Information System (INIS)

Peek, J.M.; Mann, J.B.

1977-01-01

Two approximations, motivated by heavy-particle scattering theory, are tested for weak-coupling electron-atom (ion) inelastic scattering theory. They consist of replacing the one-electron scattering orbitals by their Langer uniform approximations and the use of an average trajectory approximation which entirely avoids the necessity for generating continuum orbitals. Numerical tests for a dipole-allowed and a dipole-forbidden event, based on Coulomb-Born theory with exchange neglected, reveal the error trends. It is concluded that the uniform approximation gives a satisfactory prediction for traditional weak-coupling theories while the average approximation should be limited to collision energies exceeding at least twice the threshold energy. The accuracy for both approximations is higher for positive ions than for neutral targets. Partial-wave collision-strength data indicate that greater care should be exercised in using these approximations to predict quantities differential in the scattering angle. An application to the 2s 2 S-2p 2 P transition in Ne VIII is presented

Self-consistent approximations beyond the CPA: Part II

International Nuclear Information System (INIS)

Kaplan, T.; Gray, L.J.

1982-01-01

This paper concentrates on a self-consistent approximation for random alloys developed by Kaplan, Leath, Gray, and Diehl. The construction of the augmented space formalism for a binary alloy is sketched, and the notation to be used derived. Using the operator methods of the augmented space, the self-consistent approximation is derived for the average Green's function, and for evaluating the self-energy, taking into account the scattering by clusters of excitations. The particular cluster approximation desired is derived by treating the scattering by the excitations with S /SUB T/ exactly. Fourier transforms on the disorder-space clustersite labels solve the self-consistent set of equations. Expansion to short range order in the alloy is also discussed. A method to reduce the problem to a computationally tractable form is described

Perturbation expansions generated by an approximate propagator

International Nuclear Information System (INIS)

Znojil, M.

1987-01-01

Starting from a knowledge of an approximate propagator R at some trial energy guess E 0 , a new perturbative prescription for p-plet of bound states and of their energies is proposed. It generalizes the Rayleigh-Schroedinger (RS) degenerate perturbation theory to the nondiagonal operators R (eliminates a RS need of their diagnolisation) and defines an approximate Hamiltonian T by mere inversion. The deviation V of T from the exact Hamiltonian H is assumed small only after a substraction of a further auxiliary Hartree-Fock-like separable ''selfconsistent'' potential U of rank p. The convergence is illustrated numerically on the anharmonic oscillator example

Congruence Approximations for Entrophy Endowed Hyperbolic Systems

Science.gov (United States)

Barth, Timothy J.; Saini, Subhash (Technical Monitor)

1998-01-01

Building upon the standard symmetrization theory for hyperbolic systems of conservation laws, congruence properties of the symmetrized system are explored. These congruence properties suggest variants of several stabilized numerical discretization procedures for hyperbolic equations (upwind finite-volume, Galerkin least-squares, discontinuous Galerkin) that benefit computationally from congruence approximation. Specifically, it becomes straightforward to construct the spatial discretization and Jacobian linearization for these schemes (given a small amount of derivative information) for possible use in Newton's method, discrete optimization, homotopy algorithms, etc. Some examples will be given for the compressible Euler equations and the nonrelativistic MHD equations using linear and quadratic spatial approximation.

Multilevel weighted least squares polynomial approximation

KAUST Repository

Haji-Ali, Abdul-Lateef; Nobile, Fabio; Tempone, Raul; Wolfers, Sö ren

2017-01-01

, 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

Approximating the ground state of gapped quantum spin systems

Energy Technology Data Exchange (ETDEWEB)

Michalakis, Spyridon [Los Alamos National Laboratory; Hamza, Eman [NON LANL; Nachtergaele, Bruno [NON LANL; Sims, Robert [NON LANL

2009-01-01

We consider quantum spin systems defined on finite sets V equipped with a metric. In typical examples, V is a large, but finite subset of Z{sup d}. For finite range Hamiltonians with uniformly bounded interaction terms and a unique, gapped ground state, we demonstrate a locality property of the corresponding ground state projector. In such systems, this ground state projector can be approximated by the product of observables with quantifiable supports. In fact, given any subset {chi} {contained_in} V the ground state projector can be approximated by the product of two projections, one supported on {chi} and one supported on {chi}{sup c}, and a bounded observable supported on a boundary region in such a way that as the boundary region increases, the approximation becomes better. Such an approximation was useful in proving an area law in one dimension, and this result corresponds to a multi-dimensional analogue.

Polynomial approximation on polytopes

CERN Document Server

Totik, Vilmos

2014-01-01

Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.

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.

Approximate reasoning in decision analysis

Energy Technology Data Exchange (ETDEWEB)

Gupta, M M; Sanchez, E

1982-01-01

The volume aims to incorporate the recent advances in both theory and applications. It contains 44 articles by 74 contributors from 17 different countries. The topics considered include: membership functions; composite fuzzy relations; fuzzy logic and inference; classifications and similarity measures; expert systems and medical diagnosis; psychological measurements and human behaviour; approximate reasoning and decision analysis; and fuzzy clustering algorithms.

Green-Ampt approximations: A comprehensive analysis

Science.gov (United States)

Ali, Shakir; Islam, Adlul; Mishra, P. K.; Sikka, Alok K.

2016-04-01

Green-Ampt (GA) model and its modifications are widely used for simulating infiltration process. Several explicit approximate solutions to the implicit GA model have been developed with varying degree of accuracy. In this study, performance of nine explicit approximations to the GA model is compared with the implicit GA model using the published data for broad range of soil classes and infiltration time. The explicit GA models considered are Li et al. (1976) (LI), Stone et al. (1994) (ST), Salvucci and Entekhabi (1994) (SE), Parlange et al. (2002) (PA), Barry et al. (2005) (BA), Swamee et al. (2012) (SW), Ali et al. (2013) (AL), Almedeij and Esen (2014) (AE), and Vatankhah (2015) (VA). Six statistical indicators (e.g., percent relative error, maximum absolute percent relative error, average absolute percent relative errors, percent bias, index of agreement, and Nash-Sutcliffe efficiency) and relative computer computation time are used for assessing the model performance. Models are ranked based on the overall performance index (OPI). The BA model is found to be the most accurate followed by the PA and VA models for variety of soil classes and infiltration periods. The AE, SW, SE, and LI model also performed comparatively better. Based on the overall performance index, the explicit models are ranked as BA > PA > VA > LI > AE > SE > SW > ST > AL. Results of this study will be helpful in selection of accurate and simple explicit approximate GA models for solving variety of hydrological problems.

Nonlinear Ritz approximation for Fredholm functionals

Directory of Open Access Journals (Sweden)

Mudhir A. Abdul Hussain

2015-11-01

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

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.

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

International Nuclear Information System (INIS)

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

2014-01-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(N 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 ^2 〉 are also developed and tested

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.

Comment on 'Approximation for a large-angle simple pendulum period'

International Nuclear Information System (INIS)

Yuan Qingxin; Ding Pei

2009-01-01

In a recent letter, Belendez et al (2009 Eur. J. Phys. 30 L25-8) proposed an alternative of approximation for the period of a simple pendulum suggested earlier by Hite (2005 Phys. Teach. 43 290-2) who set out to improve on the Kidd and Fogg formula (2002 Phys. Teach. 40 81-3). As a response to the approximation scheme, we obtain another analytical approximation for the large-angle pendulum period, which owns the simplicity and accuracy in evaluating the exact period, and moreover, for amplitudes less than 144 deg. the analytical approximate expression is more accurate than others in the literature. (letters and comments)

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

Science.gov (United States)

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 version of the local linear approximation procedure…

Approximations for Markovian multi-class queues with preemptive priorities

NARCIS (Netherlands)

van der Heijden, Matthijs C.; van Harten, Aart; Sleptchenko, Andrei

2004-01-01

We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach

Approximations for W-Pair Production at Linear-Collider Energies

CERN Document Server

Denner, A

1997-01-01

We determine the accuracy of various approximations to the O(alpha) corrections for on-shell W-pair production. While an approximation based on the universal corrections arising from initial-state radiation, from the running of alpha, and from corrections proportional to m_t^2 fails in the Linear-Collider energy range, a high-energy approximation improved by the exact universal corrections is sufficiently good above about 500GeV. These results indicate that in Monte Carlo event generators for off-shell W-pair production the incorporation of the universal corrections is not sufficient and more corrections should be included.

Applicability of point-dipoles approximation to all-dielectric metamaterials

DEFF Research Database (Denmark)

Kuznetsova, S. M.; Andryieuski, Andrei; Lavrinenko, Andrei

2015-01-01

All-dielectric metamaterials consisting of high-dielectric inclusions in a low-dielectric matrix are considered as a low-loss alternative to resonant metal-based metamaterials. In this paper we investigate the applicability of the point electric and magnetic dipoles approximation to dielectric meta......-atoms on the example of a dielectric ring metamaterial. Despite the large electrical size of high-dielectric meta-atoms, the dipole approximation allows for accurate prediction of the metamaterials properties for the rings with diameters up to approximate to 0.8 of the lattice constant. The results provide important...... guidelines for design and optimization of all-dielectric metamaterials....

Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations

NARCIS (Netherlands)

Groenwold, A.A.; Wood, D.W.; Etman, L.F.P.; Tosserams, S.

2009-01-01

We implement and test a globally convergent sequential approximate optimization algorithm based on (convexified) diagonal quadratic approximations. The algorithm resides in the class of globally convergent optimization methods based on conservative convex separable approximations developed by

Fractal image coding by an approximation of the collage error

Science.gov (United States)

Salih, Ismail; Smith, Stanley H.

1998-12-01

In fractal image compression an image is coded as a set of contractive transformations, and is guaranteed to generate an approximation to the original image when iteratively applied to any initial image. In this paper we present a method for mapping similar regions within an image by an approximation of the collage error; that is, range blocks can be approximated by a linear combination of domain blocks.

Thermodynamic properties of sticky electrolytes in the HNC/MS approximation

International Nuclear Information System (INIS)

Herrera, J.N.; Blum, L.

1991-01-01

We study an approximation for a model which combines the sticky potential of Baxter and charged spheres. In the hypernetted chain (HNC)/mean spherical approximation (MSA), simple expressions for the thermodynamic functions are obtained. There equations should be useful in representing the properties of real electrolytes. Approximate expressions that are similar to those of the primitive model are obtained, for low densities (concentrations) of the electrolyte (Author)

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.

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.

RATIONAL APPROXIMATIONS TO GENERALIZED HYPERGEOMETRIC FUNCTIONS.

Science.gov (United States)

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

The generalized gradient approximation in solids and molecules

International Nuclear Information System (INIS)

Haas, P.

2010-01-01

Today, most methods are based on theoretical calculations of the electronic structure of molecules, surfaces and solids on density functional theory (DFT) and the resulting Kohn-Sham equations. Unfortunately, the exact analytical expression for the exchange-correlation functional is not known and has to be approximated. The reliability of such a Kohn-Sham calculation depends i) from the numerical accuracy and ii) from the used approximation for the exchange-correlation energy. To solve the Kohn-Sham equations, the WIEN2k code, which is one of the most accurate methods for solid-state calculations, is used. The search for better approximations for the exchange-correlation energy is an intense field of research in chemistry and physics. The main objectives of the dissertation is the development, implementation and testing of advanced exchange-correlation functionals and the analysis of existing functionals. The focus of this work are GGA - functionals. Such GGA functionals are still the most widely used functionals, in particular because they are easy to implement and require little computational effort. Several recent studies have shown that an improvement of the GGA should be possible. A detailed analysis of the results will allow us to understand why a particular GGA approximation for a class of elements (compounds) works better than for another. (Kancsar) [de

An approximation method for diffusion based leaching models

International Nuclear Information System (INIS)

Shukla, B.S.; Dignam, M.J.

1987-01-01

In connection with the fixation of nuclear waste in a glassy matrix equations have been derived for leaching models based on a uniform concentration gradient approximation, and hence a uniform flux, therefore requiring the use of only Fick's first law. In this paper we improve on the uniform flux approximation, developing and justifying the approach. The resulting set of equations are solved to a satisfactory approximation for a matrix dissolving at a constant rate in a finite volume of leachant to give analytical expressions for the time dependence of the thickness of the leached layer, the diffusional and dissolutional contribution to the flux, and the leachant composition. Families of curves are presented which cover the full range of all the physical parameters for this system. The same procedure can be readily extended to more complex systems. (author)

Approximation of ruin probabilities via Erlangized scale mixtures

DEFF Research Database (Denmark)

Peralta, Oscar; Rojas-Nandayapa, Leonardo; Xie, Wangyue

2018-01-01

In this paper, we extend an existing scheme for numerically calculating the probability of ruin of a classical Cramér–Lundbergreserve process having absolutely continuous but otherwise general claim size distributions. We employ a dense class of distributions that we denominate Erlangized scale...... a simple methodology for constructing a sequence of distributions having the form Π⋆G with the purpose of approximating the integrated tail distribution of the claim sizes. Then we adapt a recent result which delivers an explicit expression for the probability of ruin in the case that the claim size...... distribution is modeled as an Erlangized scale mixture. We provide simplified expressions for the approximation of the probability of ruin and construct explicit bounds for the error of approximation. We complement our results with a classical example where the claim sizes are heavy-tailed....

Approximate models for broken clouds in stochastic radiative transfer theory

International Nuclear Information System (INIS)

Doicu, Adrian; Efremenko, Dmitry S.; Loyola, Diego; Trautmann, Thomas

2014-01-01

This paper presents approximate models in stochastic radiative transfer theory. The independent column approximation and its modified version with a solar source computed in a full three-dimensional atmosphere are formulated in a stochastic framework and for arbitrary cloud statistics. The nth-order stochastic models describing the independent column approximations are equivalent to the nth-order stochastic models for the original radiance fields in which the gradient vectors are neglected. Fast approximate models are further derived on the basis of zeroth-order stochastic models and the independent column approximation. The so-called “internal mixing” models assume a combination of the optical properties of the cloud and the clear sky, while the “external mixing” models assume a combination of the radiances corresponding to completely overcast and clear skies. A consistent treatment of internal and external mixing models is provided, and a new parameterization of the closure coefficient in the effective thickness approximation is given. An efficient computation of the closure coefficient for internal mixing models, using a previously derived vector stochastic model as a reference, is also presented. Equipped with appropriate look-up tables for the closure coefficient, these models can easily be integrated into operational trace gas retrieval systems that exploit absorption features in the near-IR solar spectrum. - Highlights: • Independent column approximation in a stochastic setting. • Fast internal and external mixing models for total and diffuse radiances. • Efficient optimization of internal mixing models to match reference models

Plasma Physics Approximations in Ares

International Nuclear Information System (INIS)

Managan, R. A.

2015-01-01

Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, Fn( μ/θ ), the chemical potential, μ or ζ = ln(1+e μ/θ ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A α (ζ ),A β (ζ ), ζ, f(ζ ) = (1 + e -μ/θ )F 1/2 (μ/θ), F 1/2 '/F 1/2 , F c α , and F c β . In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.

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

On a saddlepoint approximation to the Markov binomial distribution

DEFF Research Database (Denmark)

Jensen, Jens Ledet

A nonstandard saddlepoint approximation to the distribution of a sum of Markov dependent trials is introduced. The relative error of the approximation is studied, not only for the number of summands tending to infinity, but also for the parameter approaching the boundary of its definition range...

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

36 CFR 254.11 - Exchanges at approximately equal value.

Science.gov (United States)

2010-07-01

... 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 authorized officer may exchange lands which are of approximately equal value upon a determination that: (1...

Modification of linear response theory for mean-field approximations

NARCIS (Netherlands)

Hütter, M.; Öttinger, H.C.

1996-01-01

In the framework of statistical descriptions of many particle systems, the influence of mean-field approximations on the linear response theory is studied. A procedure, analogous to one where no mean-field approximation is involved, is used in order to determine the first order response of the

On the mathematical treatment of the Born-Oppenheimer approximation

International Nuclear Information System (INIS)

Jecko, Thierry

2014-01-01

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

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.

Nonstandard approximation schemes for lower dimensional quantum field theories

International Nuclear Information System (INIS)

Fitzpatrick, D.A.

1981-01-01

The purpose of this thesis has been to apply two different nonstandard approximation schemes to a variety of lower-dimensional schemes. In doing this, we show their applicability where (e.g., Feynman or Rayleigh-Schroedinger) approximation schemes are inapplicable. We have applied the well-known mean-field approximation scheme by Guralnik et al. to general lower dimensional theories - the phi 4 field theory in one dimension, and the massive and massless Thirring models in two dimensions. In each case, we derive a bound-state propagator and then expand the theory in terms of the original and bound-state propagators. The results obtained can be compared with previously known results thereby show, in general, reasonably good convergence. In the second half of the thesis, we develop a self-consistent quantum mechanical approximation scheme. This can be applied to any monotonic polynomial potential. It has been applied in detail to the anharmonic oscillator, and the results in several analytical domains are very good, including extensive tables of numerical results

APPECT: An Approximate Backbone-Based Clustering Algorithm for Tags

DEFF Research Database (Denmark)

Zong, Yu; Xu, Guandong; Jin, Pin

2011-01-01

algorithm for Tags (APPECT). The main steps of APPECT are: (1) we execute the K-means algorithm on a tag similarity matrix for M times and collect a set of tag clustering results Z={C1,C2,…,Cm}; (2) we form the approximate backbone of Z by executing a greedy search; (3) we fix the approximate backbone...... as the initial tag clustering result and then assign the rest tags into the corresponding clusters based on the similarity. Experimental results on three real world datasets namely MedWorm, MovieLens and Dmoz demonstrate the effectiveness and the superiority of the proposed method against the traditional...... 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...

Breakdown of the few-level approximation in collective systems

International Nuclear Information System (INIS)

Kiffner, M.; Evers, J.; Keitel, C. H.

2007-01-01

The validity of the few-level approximation in dipole-dipole interacting collective systems is discussed. As an example system, we study the archetype case of two dipole-dipole interacting atoms, each modeled by two complete sets of angular momentum multiplets. We establish the breakdown of the few-level approximation by first proving the intuitive result that the dipole-dipole induced energy shifts between collective two-atom states depend on the length of the vector connecting the atoms, but not on its orientation, if complete and degenerate multiplets are considered. A careful analysis of our findings reveals that the simplification of the atomic level scheme by artificially omitting Zeeman sublevels in a few-level approximation generally leads to incorrect predictions. We find that this breakdown can be traced back to the dipole-dipole coupling of transitions with orthogonal dipole moments. Our interpretation enables us to identify special geometries in which partial few-level approximations to two- or three-level systems are valid

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

Science.gov (United States)

Martin, Pablo; Olivares, Jorge; Maass, Fernando

2017-12-01

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

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.

Ranking Support Vector Machine with Kernel Approximation

Directory of Open Access Journals (Sweden)

Kai Chen

2017-01-01

Full Text Available 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.

Traveling-cluster approximation for uncorrelated amorphous systems

International Nuclear Information System (INIS)

Sen, A.K.; Mills, R.; Kaplan, T.; Gray, L.J.

1984-01-01

We have developed a formalism for including cluster effects in the one-electron Green's function for a positionally disordered (liquid or amorphous) system without any correlation among the scattering sites. This method is an extension of the technique known as the traveling-cluster approximation (TCA) originally obtained and applied to a substitutional alloy by Mills and Ratanavararaksa. We have also proved the appropriate fixed-point theorem, which guarantees, for a bounded local potential, that the self-consistent equations always converge upon iteration to a unique, Herglotz solution. To our knowledge, this is the only analytic theory for considering cluster effects. Furthermore, we have performed some computer calculations in the pair TCA, for the model case of delta-function potentials on a one-dimensional random chain. These results have been compared with ''exact calculations'' (which, in principle, take into account all cluster effects) and with the coherent-potential approximation (CPA), which is the single-site TCA. The density of states for the pair TCA clearly shows some improvement over the CPA and yet, apparently, the pair approximation distorts some of the features of the exact results

Lagrangians for plasmas in drift-fluid approximation

International Nuclear Information System (INIS)

Pfirsch, D.; Correa-Restrepo, D.

1996-10-01

For drift waves and related instabilities conservation laws can play a crucial role. In an ideal theory these conservation laws are guaranteed when a Lagrangian can be found from which the equations for the various quantities result by Hamilton's principle. Such a Lagrangian for plasmas in drift-fluid approximation was obtained by a heuristic method in a recent paper by Pfirsch and Correa-Restrepo. In the present paper the same Lagrangian is derived from the exact multi-fluid Lagrangian via an iterative approximation procedure which resembles the standard method usually applied to the equations of motion. That method, however, does not guarantee all the conservation laws to hold. (orig.)

Error Estimates for the Approximation of the Effective Hamiltonian

International Nuclear Information System (INIS)

Camilli, Fabio; Capuzzo Dolcetta, Italo; Gomes, Diogo A.

2008-01-01

We study approximation schemes for the cell problem arising in homogenization of Hamilton-Jacobi equations. We prove several error estimates concerning the rate of convergence of the approximation scheme to the effective Hamiltonian, both in the optimal control setting and as well as in the calculus of variations setting

Mean-field approximation for spacing distribution functions in classical systems

Science.gov (United States)

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

2012-01-01

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

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

Discrete-Time Stable Generalized Self-Learning Optimal Control With Approximation Errors.

Science.gov (United States)

Wei, Qinglai; Li, Benkai; Song, Ruizhuo

2018-04-01

In this paper, a generalized policy iteration (GPI) algorithm with approximation errors is developed for solving infinite horizon optimal control problems for nonlinear systems. The developed stable GPI algorithm provides a general structure of discrete-time iterative adaptive dynamic programming algorithms, by which most of the discrete-time reinforcement learning algorithms can be described using the GPI structure. It is for the first time that approximation errors are explicitly considered in the GPI algorithm. The properties of the stable GPI algorithm with approximation errors are analyzed. The admissibility of the approximate iterative control law can be guaranteed if the approximation errors satisfy the admissibility criteria. The convergence of the developed algorithm is established, which shows that the iterative value function is convergent to a finite neighborhood of the optimal performance index function, if the approximate errors satisfy the convergence criterion. Finally, numerical examples and comparisons are presented.

Approximate Arithmetic Training Improves Informal Math Performance in Low Achieving Preschoolers

Directory of Open Access Journals (Sweden)

Emily Szkudlarek

2018-05-01

Full Text Available Recent studies suggest that practice with approximate and non-symbolic arithmetic problems improves the math performance of adults, school aged children, and preschoolers. However, the relative effectiveness of approximate arithmetic training compared to available educational games, and the type of math skills that approximate arithmetic targets are unknown. The present study was designed to (1 compare the effectiveness of approximate arithmetic training to two commercially available numeral and letter identification tablet applications and (2 to examine the specific type of math skills that benefit from approximate arithmetic training. Preschool children (n = 158 were pseudo-randomly assigned to one of three conditions: approximate arithmetic, letter identification, or numeral identification. All children were trained for 10 short sessions and given pre and post tests of informal and formal math, executive function, short term memory, vocabulary, alphabet knowledge, and number word knowledge. We found a significant interaction between initial math performance and training condition, such that children with low pretest math performance benefited from approximate arithmetic training, and children with high pretest math performance benefited from symbol identification training. This effect was restricted to informal, and not formal, math problems. There were also effects of gender, socio-economic status, and age on post-test informal math score after intervention. A median split on pretest math ability indicated that children in the low half of math scores in the approximate arithmetic training condition performed significantly better than children in the letter identification training condition on post-test informal math problems when controlling for pretest, age, gender, and socio-economic status. Our results support the conclusion that approximate arithmetic training may be especially effective for children with low math skills, and that

Approximate Arithmetic Training Improves Informal Math Performance in Low Achieving Preschoolers.

Science.gov (United States)

Szkudlarek, Emily; Brannon, Elizabeth M

2018-01-01

Recent studies suggest that practice with approximate and non-symbolic arithmetic problems improves the math performance of adults, school aged children, and preschoolers. However, the relative effectiveness of approximate arithmetic training compared to available educational games, and the type of math skills that approximate arithmetic targets are unknown. The present study was designed to (1) compare the effectiveness of approximate arithmetic training to two commercially available numeral and letter identification tablet applications and (2) to examine the specific type of math skills that benefit from approximate arithmetic training. Preschool children ( n = 158) were pseudo-randomly assigned to one of three conditions: approximate arithmetic, letter identification, or numeral identification. All children were trained for 10 short sessions and given pre and post tests of informal and formal math, executive function, short term memory, vocabulary, alphabet knowledge, and number word knowledge. We found a significant interaction between initial math performance and training condition, such that children with low pretest math performance benefited from approximate arithmetic training, and children with high pretest math performance benefited from symbol identification training. This effect was restricted to informal, and not formal, math problems. There were also effects of gender, socio-economic status, and age on post-test informal math score after intervention. A median split on pretest math ability indicated that children in the low half of math scores in the approximate arithmetic training condition performed significantly better than children in the letter identification training condition on post-test informal math problems when controlling for pretest, age, gender, and socio-economic status. Our results support the conclusion that approximate arithmetic training may be especially effective for children with low math skills, and that approximate arithmetic

Approximate Dispersion Relations for Waves on Arbitrary Shear Flows

Science.gov (United States)

Ellingsen, S. À.; Li, Y.

2017-12-01

An approximate dispersion relation is derived and presented for linear surface waves atop a shear current whose magnitude and direction can vary arbitrarily with depth. The approximation, derived to first order of deviation from potential flow, is shown to produce good approximations at all wavelengths for a wide range of naturally occuring shear flows as well as widely used model flows. The relation reduces in many cases to a 3-D generalization of the much used approximation by Skop (1987), developed further by Kirby and Chen (1989), but is shown to be more robust, succeeding in situations where the Kirby and Chen model fails. The two approximations incur the same numerical cost and difficulty. While the Kirby and Chen approximation is excellent for a wide range of currents, the exact criteria for its applicability have not been known. We explain the apparently serendipitous success of the latter and derive proper conditions of applicability for both approximate dispersion relations. Our new model has a greater range of applicability. A second order approximation is also derived. It greatly improves accuracy, which is shown to be important in difficult cases. It has an advantage over the corresponding second-order expression proposed by Kirby and Chen that its criterion of accuracy is explicitly known, which is not currently the case for the latter to our knowledge. Our second-order term is also arguably significantly simpler to implement, and more physically transparent, than its sibling due to Kirby and Chen.Plain Language SummaryIn order to answer key questions such as how the ocean surface affects the climate, erodes the coastline and transports nutrients, we must understand how waves move. This is not so easy when depth varying currents are present, as they often are in coastal waters. We have developed a modeling tool for accurately predicting wave properties in such situations, ready for use, for example, in the complex oceanographic computer models. Our

Approximated solutions to Born-Infeld dynamics

International Nuclear Information System (INIS)

Ferraro, Rafael; Nigro, Mauro

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

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.

A domian Decomposition Method for Transient Neutron Transport with Pomrning-Eddington Approximation

International Nuclear Information System (INIS)

Hendi, A.A.; Abulwafa, E.E.

2008-01-01

The time-dependent neutron transport problem is approximated using the Pomraning-Eddington approximation. This approximation is two-flux approximation that expands the angular intensity in terms of the energy density and the net flux. This approximation converts the integro-differential Boltzmann equation into two first order differential equations. The A domian decomposition method that used to solve the linear or nonlinear differential equations is used to solve the resultant two differential equations to find the neutron energy density and net flux, which can be used to calculate the neutron angular intensity through the Pomraning-Eddington approximation

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.

The generalized Mayer theorem in the approximating hamiltonian method

International Nuclear Information System (INIS)

Bakulev, A.P.; Bogoliubov, N.N. Jr.; Kurbatov, A.M.

1982-07-01

With the help of the generalized Mayer theorem we obtain the improved inequality for free energies of model and approximating systems, where only ''connected parts'' over the approximating hamiltonian are taken into account. For the concrete system we discuss the problem of convergency of appropriate series of ''connected parts''. (author)

Radiative transfer in disc galaxies - V. The accuracy of the KB approximation

Science.gov (United States)

Lee, Dukhang; Baes, Maarten; Seon, Kwang-Il; Camps, Peter; Verstocken, Sam; Han, Wonyong

2016-12-01

We investigate the accuracy of an approximate radiative transfer technique that was first proposed by Kylafis & Bahcall (hereafter the KB approximation) and has been popular in modelling dusty late-type galaxies. We compare realistic galaxy models calculated with the KB approximation with those of a three-dimensional Monte Carlo radiative transfer code SKIRT. The SKIRT code fully takes into account of the contribution of multiple scattering whereas the KB approximation calculates only single scattered intensity and multiple scattering components are approximated. We find that the KB approximation gives fairly accurate results if optically thin, face-on galaxies are considered. However, for highly inclined (I ≳ 85°) and/or optically thick (central face-on optical depth ≳1) galaxy models, the approximation can give rise to substantial errors, sometimes, up to ≳40 per cent. Moreover, it is also found that the KB approximation is not always physical, sometimes producing infinite intensities at lines of sight with high optical depth in edge-on galaxy models. There is no `simple recipe' to correct the errors of the KB approximation that is universally applicable to any galaxy models. Therefore, it is recommended that the full radiative transfer calculation be used, even though it is slower than the KB approximation.

Compound Poisson Approximations for Sums of Random Variables

OpenAIRE

Serfozo, Richard F.

1986-01-01

We show that a sum of dependent random variables is approximately compound Poisson when the variables are rarely nonzero and, given they are nonzero, their conditional distributions are nearly identical. We give several upper bounds on the total-variation distance between the distribution of such a sum and a compound Poisson distribution. Included is an example for Markovian occurrences of a rare event. Our bounds are consistent with those that are known for Poisson approximations for sums of...

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.

PWL approximation of nonlinear dynamical systems, part II: identification issues

International Nuclear Information System (INIS)

De Feo, O; Storace, M

2005-01-01

This paper and its companion address the problem of the approximation/identification of nonlinear dynamical systems depending on parameters, with a view to their circuit implementation. The proposed method is based on a piecewise-linear approximation technique. In particular, this paper describes a black-box identification method based on state space reconstruction and PWL approximation, and applies it to some particularly significant dynamical systems (two topological normal forms and the Colpitts oscillator)

Analysis of the dynamical cluster approximation for the Hubbard model

OpenAIRE

Aryanpour, K.; Hettler, M. H.; Jarrell, M.

2002-01-01

We examine a central approximation of the recently introduced Dynamical Cluster Approximation (DCA) by example of the Hubbard model. By both analytical and numerical means we study non-compact and compact contributions to the thermodynamic potential. We show that approximating non-compact diagrams by their cluster analogs results in a larger systematic error as compared to the compact diagrams. Consequently, only the compact contributions should be taken from the cluster, whereas non-compact ...

Multijet final states: exact results and the leading pole approximation

International Nuclear Information System (INIS)

Ellis, R.K.; Owens, J.F.

1984-09-01

Exact results for the process gg → ggg are compared with those obtained using the leading pole approximation. Regions of phase space where the approximation breaks down are discussed. A specific example relevant for background estimates to W boson production is presented. It is concluded that in this instance the leading pole approximation may underestimate the standard QCD background by more than a factor of two in certain kinematic regions of physical interest

Clinical and radiographic assessment of approximal carious lesions

International Nuclear Information System (INIS)

Espelid, I.; Tveit, A.B.

1986-01-01

The aim of the study was to compare the radiographic diagnosis of approximal carious lesions with visual observations of the approximal surfaces and within drilled Class II cavities (made into the pulp). Sound (n=28) and carious (n=123) approximal surfaces of extracted premolars and molars were radiographed. The radiographs were studied by seven observers to diagnose caries. Lesions without cavitation were most often classified as sound (61.3%). When lesions had cavities, the rate of detection increased to 89.1%. Sound surfaces were erroneously classified as carious in 15.7% of cases. Statistically, about 6 our of every 10 qualitative assessments of lesion depth on the basis of radiographs, correctly recorded lesions as being in enamel or extending into dentin. The interexaminer variation in radiographic caries diagnosis were mostly due to difference in diagnostic criteria, whereas differences in diagnostic capability were less important

On the WKBJ approximation

International Nuclear Information System (INIS)

El Sawi, M.

1983-07-01

A simple approach employing properties of solutions of differential equations is adopted to derive an appropriate extension of the WKBJ method. Some of the earlier techniques that are commonly in use are unified, whereby the general approximate solution to a second-order homogeneous linear differential equation is presented in a standard form that is valid for all orders. In comparison to other methods, the present one is shown to be leading in the order of iteration, and thus possibly has the ability of accelerating the convergence of the solution. The method is also extended for the solution of inhomogeneous equations. (author)

The relaxation time approximation

International Nuclear Information System (INIS)

Gairola, R.P.; Indu, B.D.

1991-01-01

A plausible approximation has been made to estimate the relaxation time from a knowledge of the transition probability of phonons from one state (r vector, q vector) to other state (r' vector, q' vector), as a result of collision. The relaxation time, thus obtained, shows a strong dependence on temperature and weak dependence on the wave vector. In view of this dependence, relaxation time has been expressed in terms of a temperature Taylor's series in the first Brillouin zone. Consequently, a simple model for estimating the thermal conductivity is suggested. the calculations become much easier than the Callaway model. (author). 14 refs

Approximate approaches to the one-dimensional finite potential well

International Nuclear Information System (INIS)

Singh, Shilpi; Pathak, Praveen; Singh, Vijay A

2011-01-01

The one-dimensional finite well is a textbook problem. We propose approximate approaches to obtain the energy levels of the well. The finite well is also encountered in semiconductor heterostructures where the carrier mass inside the well (m i ) is taken to be distinct from mass outside (m o ). A relevant parameter is the mass discontinuity ratio β = m i /m o . To correctly account for the mass discontinuity, we apply the BenDaniel-Duke boundary condition. We obtain approximate solutions for two cases: when the well is shallow and when the well is deep. We compare the approximate results with the exact results and find that higher-order approximations are quite robust. For the shallow case, the approximate solution can be expressed in terms of a dimensionless parameter σ l = 2m o V 0 L 2 /ℎ 2 (or σ = β 2 σ l for the deep case). We show that the lowest-order results are related by a duality transform. We also discuss how the energy upscales with L (E∼1/L γ ) and obtain the exponent γ. Exponent γ → 2 when the well is sufficiently deep and β → 1. The ratio of the masses dictates the physics. Our presentation is pedagogical and should be useful to students on a first course on elementary quantum mechanics or low-dimensional semiconductors.

Validity of the broken-pair approximation for N = 50, even-A nuclei

International Nuclear Information System (INIS)

Haq, S.; Gambhir, Y.K.

1977-01-01

The validity of the broken-pair approximation as an approximation to the seniority shell model is investigated. The results of the broken-pair approximation and the seniority shell model, obtained by employing identical input information (single-particle levels and their energies, effective two-body matrix elements, 88 Sr inert core) for N = 50, even-A nuclei are compared. A close agreement obtained between the calculated broken-pair approximation and the seniority shell model energies for 90 Zr, 92 Mo, 94 Ru, and 96 Pd nuclei and large (95--100 %) overlaps between the broken-pair approximation and the senority shell model wave functions for 92 Mo, demonstrates the validity of the broken-pair approximation in this region and in general its usefulness as a good approximation to the seniority shell model

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.

Nucleon-pair approximation to the nuclear shell model

Energy Technology Data Exchange (ETDEWEB)

Zhao, Y.M., E-mail: ymzhao@sjtu.edu.cn [Department of Physics and Astronomy, Shanghai Jiao Tong University, Shanghai 200240 (China); Arima, A. [Department of Physics and Astronomy, Shanghai Jiao Tong University, Shanghai 200240 (China); Musashi Gakuen, 1-26-1 Toyotamakami Nerima-ku, Tokyo 176-8533 (Japan)

2014-12-01

Atomic nuclei are complex systems of nucleons–protons and neutrons. Nucleons interact with each other via an attractive and short-range force. This feature of the interaction leads to a pattern of dominantly monopole and quadrupole correlations between like particles (i.e., proton–proton and neutron–neutron correlations) in low-lying states of atomic nuclei. As a consequence, among dozens or even hundreds of possible types of nucleon pairs, very few nucleon pairs such as proton and neutron pairs with spin zero, two (in some cases spin four), and occasionally isoscalar spin-aligned proton–neutron pairs, play important roles in low-energy nuclear structure. The nucleon-pair approximation therefore provides us with an efficient truncation scheme of the full shell model configurations which are otherwise too large to handle for medium and heavy nuclei in foreseeable future. Furthermore, the nucleon-pair approximation leads to simple pictures in physics, as the dimension of nucleon-pair subspace is always small. The present paper aims at a sound review of its history, formulation, validity, applications, as well as its link to previous approaches, with the focus on the new developments in the last two decades. The applicability of the nucleon-pair approximation and numerical calculations of low-lying states for realistic atomic nuclei are demonstrated with examples. Applications of pair approximations to other problems are also discussed.

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.

Fast approximate convex decomposition using relative concavity

KAUST Repository

Ghosh, Mukulika; Amato, Nancy M.; Lu, Yanyan; Lien, Jyh-Ming

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

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.

Iterative method for Amado's model

International Nuclear Information System (INIS)

Tomio, L.

1980-01-01

A recently proposed iterative method for solving scattering integral equations is applied to the spin doublet and spin quartet neutron-deuteron scattering in the Amado model. The method is tested numerically in the calculation of scattering lengths and phase-shifts and results are found better than those obtained by using the conventional Pade technique. (Author) [pt

Approximate analytical methods for solving ordinary differential equations

CERN Document Server

Radhika, TSL; Rani, T Raja

2015-01-01

Approximate Analytical Methods for Solving Ordinary Differential Equations (ODEs) is the first book to present all of the available approximate methods for solving ODEs, eliminating the need to wade through multiple books and articles. It covers both well-established techniques and recently developed procedures, including the classical series solution method, diverse perturbation methods, pioneering asymptotic methods, and the latest homotopy methods.The book is suitable not only for mathematicians and engineers but also for biologists, physicists, and economists. It gives a complete descripti

Approximate representations of propagators in an external field

International Nuclear Information System (INIS)

Fried, H.M.

1979-01-01

A method of forming approximate representations for propagators with external field dependence is suggested and discussed in the context of potential scattering. An integro-differential equation in D+1 variables, where D represents the dimensionality of Euclidian space-time, is replaced by a Volterra equation in one variable. Approximate solutions to the latter provide a generalization of the Bloch-Nordsieck representation, containing the effects of all powers of hard-potential interactions, each modified by a characteristic soft-potential dependence [fr

Study of some approximation schemes in the spin-boson problem

International Nuclear Information System (INIS)

Kenkre, V.M.; Giuggioli, L.

2004-01-01

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

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

Science.gov (United States)

Andras, Peter

2018-02-01

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

Approximate radiative solutions of the Einstein equations

International Nuclear Information System (INIS)

Kuusk, P.; Unt, V.

1976-01-01

In this paper the external field of a bounded source emitting gravitational radiation is considered. A successive approximation method is used to integrate the Einstein equations in Bondi's coordinates (Bondi et al, Proc. R. Soc.; A269:21 (1962)). A method of separation of angular variables is worked out and the approximate Einstein equations are reduced to key equations. The losses of mass, momentum, and angular momentum due to gravitational multipole radiation are found. It is demonstrated that in the case of proper treatment a real mass occurs instead of a mass aspect in a solution of the Einstein equations. In an appendix Bondi's new function is given in terms of sources. (author)

Analytical Ballistic Trajectories with Approximately Linear Drag

Directory of Open Access Journals (Sweden)

Giliam J. P. de Carpentier

2014-01-01

Full Text Available 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. Although the trajectories are only approximate, they still capture many of the characteristics of a real projectile in free fall under the influence of an invariant wind, gravitational pull, and terminal velocity, while the required math for these trajectories and planners is still simple enough to efficiently run on almost all modern hardware devices. Together, these properties make the proposed approach particularly useful for real-time applications where accuracy and performance need to be carefully balanced, such as in computer games.

The generalized approximation method and nonlinear heat transfer equations

Directory of Open Access Journals (Sweden)

Rahmat Khan

2009-01-01

Full Text Available Generalized approximation technique for a solution of one-dimensional steady state heat transfer problem in a slab made of a material with temperature dependent thermal conductivity, is developed. The results obtained by the generalized approximation method (GAM are compared with those studied via homotopy perturbation method (HPM. For this problem, the results obtained by the GAM are more accurate as compared to the HPM. Moreover, our (GAM generate a sequence of solutions of linear problems that converges monotonically and rapidly to a solution of the original nonlinear problem. Each approximate solution is obtained as the solution of a linear problem. We present numerical simulations to illustrate and confirm the theoretical results.

Large hierarchies from approximate R symmetries

International Nuclear Information System (INIS)

Kappl, Rolf; Ratz, Michael; Vaudrevange, Patrick K.S.

2008-12-01

We show that hierarchically small vacuum expectation values of the superpotential in supersymmetric theories can be a consequence of an approximate R symmetry. We briefly discuss the role of such small constants in moduli stabilization and understanding the huge hierarchy between the Planck and electroweak scales. (orig.)