Hanson-Heine, Magnus W. D.; George, Michael W.; Besley, Nicholas A.
2018-06-01
The restricted excitation subspace approximation is explored as a basis to reduce the memory storage required in linear response time-dependent density functional theory (TDDFT) calculations within the Tamm-Dancoff approximation. It is shown that excluding the core orbitals and up to 70% of the virtual orbitals in the construction of the excitation subspace does not result in significant changes in computed UV/vis spectra for large molecules. The reduced size of the excitation subspace greatly reduces the size of the subspace vectors that need to be stored when using the Davidson procedure to determine the eigenvalues of the TDDFT equations. Furthermore, additional screening of the two-electron integrals in combination with a reduction in the size of the numerical integration grid used in the TDDFT calculation leads to significant computational savings. The use of these approximations represents a simple approach to extend TDDFT to the study of large systems and make the calculations increasingly tractable using modest computing resources.
The restricted isometry property meets nonlinear approximation with redundant frames
DEFF Research Database (Denmark)
Gribonval, Rémi; Nielsen, Morten
2013-01-01
with a redundant frame. The main ingredients of our approach are: a) Jackson and Bernstein inequalities, associated to the characterization of certain approximation spaces with interpolation spaces; b) a proof that for overcomplete frames which satisfy a Bernstein inequality, these interpolation spaces are nothing...
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
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
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
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.
Conference on Abstract Spaces and Approximation
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...
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 nlogn space bound of Thorup and Zwick if approximate paths rather than distances need...
Curves of restricted type in euclidean spaces
Directory of Open Access Journals (Sweden)
Bengü Kılıç Bayram
2014-01-01
Full Text Available Submanifolds of restricted type were introduced in [7]. In the present study we consider restricted type of curves in Em. We give some special examples. We also show that spherical curve in S2(r C E3 is of restricted type if and only if either ƒ(s is constant or a linear function of s of the form ƒ(s = ±s + b and every closed W - curve of rank k and of length 2(r in E2k is of restricted type.
Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Villa, Umberto; Engsig-Karup, Allan Peter
The paper introduces a nonlinear multigrid solver for mixed finite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstructured problems is the guaranteed approximation property of the AMGe coarse...... properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on unstructured meshes has the ability to be as powerful/successful as FAS on geometrically refined meshes. For comparison, Newton’s method and Picard iterations with an inner state-of-the-art linear solver...... are compared to FAS on a nonlinear saddle point problem with applications to porous media flow. It is demonstrated that FAS is faster than Newton’s method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate...
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Energy Technology Data Exchange (ETDEWEB)
Christensen, Max La Cour [Technical Univ. of Denmark, Lyngby (Denmark); Villa, Umberto E. [Univ. of Texas, Austin, TX (United States); Engsig-Karup, Allan P. [Technical Univ. of Denmark, Lyngby (Denmark); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-22
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.
Open superstring field theory on the restricted Hilbert space
International Nuclear Information System (INIS)
Konopka, Sebastian; Sachs, Ivo
2016-01-01
It appears that the formulation of an action for the Ramond sector of open superstring field theory requires to either restrict the Hilbert space for the Ramond sector or to introduce auxiliary fields with picture −3/2. The purpose of this note is to clarify the relation of the restricted Hilbert space with other approaches and to formulate open superstring field theory entirely in the small Hilbert space.
Validity of the Aluminum Equivalent Approximation in Space Radiation Shielding
Badavi, Francis F.; Adams, Daniel O.; Wilson, John W.
2009-01-01
The origin of the aluminum equivalent shield approximation in space radiation analysis can be traced back to its roots in the early years of the NASA space programs (Mercury, Gemini and Apollo) wherein the primary radiobiological concern was the intense sources of ionizing radiation causing short term effects which was thought to jeopardize the safety of the crew and hence the mission. Herein, it is shown that the aluminum equivalent shield approximation, although reasonably well suited for that time period and to the application for which it was developed, is of questionable usefulness to the radiobiological concerns of routine space operations of the 21 st century which will include long stays onboard the International Space Station (ISS) and perhaps the moon. This is especially true for a risk based protection system, as appears imminent for deep space exploration where the long-term effects of Galactic Cosmic Ray (GCR) exposure is of primary concern. The present analysis demonstrates that sufficiently large errors in the interior particle environment of a spacecraft result from the use of the aluminum equivalent approximation, and such approximations should be avoided in future astronaut risk estimates. In this study, the aluminum equivalent approximation is evaluated as a means for estimating the particle environment within a spacecraft structure induced by the GCR radiation field. For comparison, the two extremes of the GCR environment, the 1977 solar minimum and the 2001 solar maximum, are considered. These environments are coupled to the Langley Research Center (LaRC) deterministic ionized particle transport code High charge (Z) and Energy TRaNsport (HZETRN), which propagates the GCR spectra for elements with charges (Z) in the range I aluminum equivalent approximation for a good polymeric shield material such as genetic polyethylene (PE). The shield thickness is represented by a 25 g/cm spherical shell. Although one could imagine the progression to greater
Galerkin approximations of nonlinear optimal control problems in Hilbert spaces
Directory of Open Access Journals (Sweden)
Mickael D. Chekroun
2017-07-01
Full Text Available Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on the identification of a set of natural assumptions that allows us to deal with a broad class of nonlinear evolution equations and cost functionals for which we derive convergence of the value functions associated with the optimal control problem of the Galerkin approximations. This convergence result holds for a broad class of nonlinear control strategies as well. In particular, we show that the framework applies to the optimal control of semilinear heat equations posed on a general compact manifold without boundary. The framework is then shown to apply to geoengineering and mitigation of greenhouse gas emissions formulated here in terms of optimal control of energy balance climate models posed on the sphere $\\mathbb{S}^2$.
Space-Efficient Approximation Scheme for Circular Earth Mover Distance
DEFF Research Database (Denmark)
Brody, Joshua Eric; Liang, Hongyu; Sun, Xiaoming
2012-01-01
The Earth Mover Distance (EMD) between point sets A and B is the minimum cost of a bipartite matching between A and B. EMD is an important measure for estimating similarities between objects with quantifiable features and has important applications in several areas including computer vision...... to computer vision [13] and can be seen as a special case of computing EMD on a discretized grid. We achieve a (1 ±ε) approximation for EMD in $\\tilde O(\\varepsilon^{-3})$ space, for every 0 ... that matches the space bound asked in [9]....
Nodal approximations in space and time for neutron kinetics
International Nuclear Information System (INIS)
Grossman, L.M.; Hennart, J.P.
2005-01-01
A general formalism is described of the nodal type in time and space for the neutron kinetics equations. In space, several nodal methods are given of the Raviart-Thomas type (RT0 and RT1), of the Brezzi-Douglas-Marini type (BDM0 and BDM1) and of the Brezzi-Douglas-Fortin-Marini type (BDFM 1). In time, polynomial and analytical approximations are derived. In the analytical case, they are based on the inclusion of an exponential term in the basis function. They can be continuous or discontinuous in time, leading in particular to the well-known Crank-Nicolson, Backward Euler and θ schemes
Nonlinear multigrid solvers exploiting AMGe coarse spaces with approximation properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Vassilevski, Panayot S.; Villa, Umberto
2017-01-01
discretizations on general unstructured grids for a large class of nonlinear partial differential equations, including saddle point problems. The approximation properties of the coarse spaces ensure that our FAS approach for general unstructured meshes leads to optimal mesh-independent convergence rates similar...... to those achieved by geometric FAS on a nested hierarchy of refined meshes. In the numerical results, Newton’s method and Picard iterations with state-of-the-art inner linear solvers are compared to our FAS algorithm for the solution of a nonlinear saddle point problem arising from porous media flow...
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
Muentz-Szasz type approximation in direct products of spaces
International Nuclear Information System (INIS)
Sedletskii, A M
2006-01-01
We consider the problem of completeness of the system of exponentials exp{-λ n t}, Re λ n >0, in direct products E=E 1 x E 2 of the spaces E 1 =E 1 (0,1) and E 2 =E 2 (1,∞) of functions defined on (0,1) and (1,∞), respectively. We describe rather broad classes of spaces E 1 and E 2 such that the well-known condition of Szasz is necessary for the completeness of the above system in E and sufficient for this completeness
Restrictive metric regularity and generalized differential calculus in Banach spaces
Directory of Open Access Journals (Sweden)
Bingwu Wang
2004-10-01
Full Text Available We consider nonlinear mappings f:XÃ¢Â†Â’Y between Banach spaces and study the notion of restrictive metric regularity of f around some point xÃ‚Â¯, that is, metric regularity of f from X into the metric space E=f(X. Some sufficient as well as necessary and sufficient conditions for restrictive metric regularity are obtained, which particularly include an extension of the classical Lyusternik-Graves theorem in the case when f is strictly differentiable at xÃ‚Â¯ but its strict derivative Ã¢ÂˆÂ‡f(xÃ‚Â¯ is not surjective. We develop applications of the results obtained and some other techniques in variational analysis to generalized differential calculus involving normal cones to nonsmooth and nonconvex sets, coderivatives of set-valued mappings, as well as first-order and second-order subdifferentials of extended real-valued functions.
Approximating tunneling rates in multi-dimensional field spaces
Energy Technology Data Exchange (ETDEWEB)
Masoumi, Ali; Olum, Ken D.; Wachter, Jeremy M., E-mail: ali@cosmos.phy.tufts.edu, E-mail: kdo@cosmos.phy.tufts.edu, E-mail: Jeremy.Wachter@tufts.edu [Institute of Cosmology, Department of Physics and Astronomy, Tufts University, Medford, MA 02155 (United States)
2017-10-01
Quantum mechanics makes the otherwise stable vacua of a theory metastable through the nucleation of bubbles of the new vacuum. This in turn causes a first order phase transition. These cosmological phase transitions may have played an important role in settling our universe into its current vacuum, and they may also happen in future. The most important frameworks where vacuum decay happens contain a large number of fields. Unfortunately, calculating the tunneling rates in these models is very time-consuming. In this paper we present a simple approximation for the tunneling rate by reducing it to a one-field problem which is easy to calculate. We demonstrate the validity of this approximation using our recent code 'Anybubble' for several classes of potentials.
Marginalized approximate filtering of state-space models
Czech Academy of Sciences Publication Activity Database
Dedecius, Kamil
2018-01-01
Roč. 32, č. 1 (2018), s. 1-12 ISSN 0890-6327 R&D Projects: GA ČR(CZ) GA16-09848S Institutional support: RVO:67985556 Keywords : approximate filtering * marginalized filters * particle filtering Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 1.708, year: 2016 http://library.utia.cas.cz/separaty/2017/AS/dedecius-0478074.pdf
Adaptive kernels in approximate filtering of state-space models
Czech Academy of Sciences Publication Activity Database
Dedecius, Kamil
2017-01-01
Roč. 31, č. 6 (2017), s. 938-952 ISSN 0890-6327 R&D Projects: GA ČR(CZ) GP14-06678P Institutional support: RVO:67985556 Keywords : filtering * nonlinear filters * Bayesian filtering * sequential Monte Carlo * approximate filtering Subject RIV: BB - Applied Statistics, Operational Research OBOR OECD: Statistics and probability Impact factor: 1.708, year: 2016 http://library.utia.cs.cz/separaty/2016/AS/dedecius-0466448.pdf
Approximation by Müntz spaces on positive intervals
Ait-Haddou, Rachid
2013-11-01
The so-called Bernstein operators were introduced by S.N. Bernstein in 1912 to give a constructive proof of Weierstrass\\' theorem. We show how to extend his result to Müntz spaces on positive intervals. © 2013 Académie des sciences.
Approximation by Müntz spaces on positive intervals
Ait-Haddou, Rachid; Mazure, Marie Laurence
2013-01-01
The so-called Bernstein operators were introduced by S.N. Bernstein in 1912 to give a constructive proof of Weierstrass' theorem. We show how to extend his result to Müntz spaces on positive intervals. © 2013 Académie des sciences.
Muentz-Szasz type approximation in direct products of spaces
Energy Technology Data Exchange (ETDEWEB)
Sedletskii, A M [M.V. Lomonosov Moscow State University, Moscow (Russian Federation)
2006-10-31
We consider the problem of completeness of the system of exponentials exp{l_brace}-{lambda}{sub n}t{r_brace}, Re {lambda}{sub n}>0, in direct products E=E{sub 1} x E{sub 2} of the spaces E{sub 1}=E{sub 1}(0,1) and E{sub 2}=E{sub 2}(1,{infinity}) of functions defined on (0,1) and (1,{infinity}), respectively. We describe rather broad classes of spaces E{sub 1} and E{sub 2} such that the well-known condition of Szasz is necessary for the completeness of the above system in E and sufficient for this completeness.
Validation of ecological state space models using the Laplace approximation
DEFF Research Database (Denmark)
Thygesen, Uffe Høgsbro; Albertsen, Christoffer Moesgaard; Berg, Casper Willestofte
2017-01-01
Many statistical models in ecology follow the state space paradigm. For such models, the important step of model validation rarely receives as much attention as estimation or hypothesis testing, perhaps due to lack of available algorithms and software. Model validation is often based on a naive...... for estimation in general mixed effects models. Implementing one-step predictions in the R package Template Model Builder, we demonstrate that it is possible to perform model validation with little effort, even if the ecological model is multivariate, has non-linear dynamics, and whether observations...... useful directions in which the model could be improved....
Approximating fixed points for nonself mappings in CAT(0) spaces
Razani Abdolrahman; Shabani Saeed
2011-01-01
Abstract Suppose K is a nonempty closed convex subset of a complete CAT(0) space X with the nearest point projection P from X onto K. Let T : K → X be a nonself mapping, satisfying Condition (E) with F(T): = {x ∈ K : Tx = x} ≠ ∅. Suppose {xn} is generated iteratively by x1 ∈ K, xn+1 = P ((1 - αn)xn ⊕ αnTP [(1 - βn)xn ⊕ βnTxn]),n ≥ 1, where {αn} and {βn} are real sequences in [ε, 1 - ε] for some ε W...
Directory of Open Access Journals (Sweden)
Anjan Mukherjee
2016-08-01
Full Text Available In this paper we introduce the concept of restricted interval valued neutrosophic sets (RIVNS in short. Some basic operations and properties of RIVNS are discussed. The concept of restricted interval valued neutrosophic topology is also introduced together with restricted interval valued neutrosophic finer and restricted interval valued neutrosophic coarser topology. We also define restricted interval valued neutrosophic interior and closer of a restricted interval valued neutrosophic set. Some theorems and examples are cites. Restricted interval valued neutrosophic subspace topology is also studied.
On the approximative normal values of multivalued operators in topological vector space
International Nuclear Information System (INIS)
Nguyen Minh Chuong; Khuat van Ninh
1989-09-01
In this paper the problem of approximation of normal values of multivalued linear closed operators from topological vector Mackey space into E-space is considered. Existence of normal value and convergence of approximative values to normal value are proved. (author). 4 refs
Preventing Restricted Space Inference in Online Route Planning Services
Directory of Open Access Journals (Sweden)
Florian Dorfmeister
2016-03-01
Full Text Available Online route planning services compute routes from any given location to a desired destination address. Unlike offline implementations, they do so in a traffic-aware fashion by taking into consideration up-to-date map data and real-time traffic information. In return, users have to provide precise location information about a route’s endpoints to a not necessarily trusted service provider. As suchlike leakage of personal information threatens a user’s privacy and anonymity, this paper presents PrOSPR, a comprehensive approach for using current online route planning services in a privacy-preserving way, and introduces the concept of k-immune route requests to avert inference attacks based on restricted space information. Using a map-based approach for creating cloaked regions for the start and destination addresses, our solution queries the online service for routes between subsets of points from these regions. This, however, might result in the returned path deviating from the optimal route. By means of empirical evaluation on a real road network, we demonstrate the feasibility of our approach regarding quality of service and communication overhead.
An angularly refineable phase space finite element method with approximate sweeping procedure
International Nuclear Information System (INIS)
Kophazi, J.; Lathouwers, D.
2013-01-01
An angularly refineable phase space finite element method is proposed to solve the neutron transport equation. The method combines the advantages of two recently published schemes. The angular domain is discretized into small patches and patch-wise discontinuous angular basis functions are restricted to these patches, i.e. there is no overlap between basis functions corresponding to different patches. This approach yields block diagonal Jacobians with small block size and retains the possibility for S n -like approximate sweeping of the spatially discontinuous elements in order to provide efficient preconditioners for the solution procedure. On the other hand, the preservation of the full FEM framework (as opposed to collocation into a high-order S n scheme) retains the possibility of the Galerkin interpolated connection between phase space elements at arbitrary levels of discretization. Since the basis vectors are not orthonormal, a generalization of the Riemann procedure is introduced to separate the incoming and outgoing contributions in case of unstructured meshes. However, due to the properties of the angular discretization, the Riemann procedure can be avoided at a large fraction of the faces and this fraction rapidly increases as the level of refinement increases, contributing to the computational efficiency. In this paper the properties of the discretization scheme are studied with uniform refinement using an iterative solver based on the S 2 sweep order of the spatial elements. The fourth order convergence of the scalar flux is shown as anticipated from earlier schemes and the rapidly decreasing fraction of required Riemann faces is illustrated. (authors)
Approximate distance oracles for planar graphs with improved query time-space tradeoff
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
2016-01-01
We consider approximate distance oracles for edge-weighted n-vertex undirected planar graphs. Given fixed ϵ > 0, we present a (1 + ϵ)-approximate distance oracle with O(n(log log n)2) space and O((loglogr?,)3) query time. This improves the previous best product of query time and space...... of the oracles of Thorup (FOCS 2001, J. ACM 2004) and Klein (SODA 2002) from O(nlogn) to O(n(loglogn)5)....
Approximately dual frames in Hilbert spaces and applications to Gabor frames
Christensen, Ole; Laugesen, Richard S.
2011-01-01
Approximately dual frames are studied in the Hilbert space setting. Approximate duals are easier to construct than classical dual frames, and can be tailored to yield almost perfect reconstruction. Bounds on the deviation from perfect reconstruction are obtained for approximately dual frames constructed via perturbation theory. An alternative bound is derived for the rich class of Gabor frames, by using the Walnut representation of the frame operator to estimate the deviation from equality in...
Tree-space statistics and approximations for large-scale analysis of anatomical trees
DEFF Research Database (Denmark)
Feragen, Aasa; Owen, Megan; Petersen, Jens
2013-01-01
parametrize the relevant parts of tree-space well. Using the developed approximate statistics, we illustrate how the structure and geometry of airway trees vary across a population and show that airway trees with Chronic Obstructive Pulmonary Disease come from a different distribution in tree-space than...
New approximation of a scale space kernel on SE(3) and applications in neuroimaging
Portegies, J.M.; Sanguinetti, G.R.; Meesters, S.P.L.; Duits, R.
2015-01-01
We provide a new, analytic kernel for scale space filtering of dMRI data. The kernel is an approximation for the Green's function of a hypo-elliptic diffusion on the 3D rigid body motion group SE(3), for fiber enhancement in dMRI. The enhancements are described by linear scale space PDEs in the
Parallel magnetic resonance imaging as approximation in a reproducing kernel Hilbert space
International Nuclear Information System (INIS)
Athalye, Vivek; Lustig, Michael; Martin Uecker
2015-01-01
In magnetic resonance imaging data samples are collected in the spatial frequency domain (k-space), typically by time-consuming line-by-line scanning on a Cartesian grid. Scans can be accelerated by simultaneous acquisition of data using multiple receivers (parallel imaging), and by using more efficient non-Cartesian sampling schemes. To understand and design k-space sampling patterns, a theoretical framework is needed to analyze how well arbitrary sampling patterns reconstruct unsampled k-space using receive coil information. As shown here, reconstruction from samples at arbitrary locations can be understood as approximation of vector-valued functions from the acquired samples and formulated using a reproducing kernel Hilbert space with a matrix-valued kernel defined by the spatial sensitivities of the receive coils. This establishes a formal connection between approximation theory and parallel imaging. Theoretical tools from approximation theory can then be used to understand reconstruction in k-space and to extend the analysis of the effects of samples selection beyond the traditional image-domain g-factor noise analysis to both noise amplification and approximation errors in k-space. This is demonstrated with numerical examples. (paper)
Osada, Hirofumi; Osada, Shota
2018-01-01
We prove tail triviality of determinantal point processes μ on continuous spaces. Tail triviality has been proved for such processes only on discrete spaces, and hence we have generalized the result to continuous spaces. To do this, we construct tree representations, that is, discrete approximations of determinantal point processes enjoying a determinantal structure. There are many interesting examples of determinantal point processes on continuous spaces such as zero points of the hyperbolic Gaussian analytic function with Bergman kernel, and the thermodynamic limit of eigenvalues of Gaussian random matrices for Sine_2 , Airy_2 , Bessel_2 , and Ginibre point processes. Our main theorem proves all these point processes are tail trivial.
The approximate inverse in action: IV. Semi-discrete equations in a Banach space setting
International Nuclear Information System (INIS)
Schuster, T; Schöpfer, F; Rieder, A
2012-01-01
This article concerns the method of approximate inverse to solve semi-discrete, linear operator equations in Banach spaces. Semi-discrete means that we search for a solution in an infinite-dimensional Banach space having only a finite number of data available. In this sense the situation is applicable to a large variety of applications where a measurement process delivers a discretization of an infinite-dimensional data space. The method of approximate inverse computes scalar products of the data with pre-computed reconstruction kernels which are associated with mollifiers and the dual of the model operator. The convergence, approximation power and regularization property of this method when applied to semi-discrete operator equations in Hilbert spaces has been investigated in three prequels to this paper. Here we extend these results to a Banach space setting. We prove convergence and stability for general Banach spaces and reproduce the results specifically for the integration operator acting on the space of continuous functions. (paper)
The metric approximation property and Lipschitz-free spaces over subsets of R-N
Czech Academy of Sciences Publication Activity Database
Pernecká, Eva; Smith, R.J.
2015-01-01
Roč. 199, November (2015), s. 29-44 ISSN 0021-9045 R&D Projects: GA ČR(CZ) GAP201/11/0345 Institutional support: RVO:67985840 Keywords : Lipschitz-free space * approximation property Subject RIV: BA - General Mathematics Impact factor: 0.921, year: 2015 http://www.sciencedirect.com/science/article/pii/S0021904515000970
Ito, Kazufumi
1987-01-01
The linear quadratic optimal control problem on infinite time interval for linear time-invariant systems defined on Hilbert spaces is considered. The optimal control is given by a feedback form in terms of solution pi to the associated algebraic Riccati equation (ARE). A Ritz type approximation is used to obtain a sequence pi sup N of finite dimensional approximations of the solution to ARE. A sufficient condition that shows pi sup N converges strongly to pi is obtained. Under this condition, a formula is derived which can be used to obtain a rate of convergence of pi sup N to pi. The results of the Galerkin approximation is demonstrated and applied for parabolic systems and the averaging approximation for hereditary differential systems.
Mean-field approximation for spacing distribution functions in classical systems
González, Diego Luis; Pimpinelli, Alberto; Einstein, T. L.
2012-01-01
We propose a mean-field method to calculate approximately the spacing distribution functions p(n)(s) in one-dimensional classical many-particle systems. We compare our method with two other commonly used methods, the independent interval approximation and the extended Wigner surmise. In our mean-field approach, p(n)(s) is calculated from a set of Langevin equations, which are decoupled by using a mean-field approximation. We find that in spite of its simplicity, the mean-field approximation provides good results in several systems. We offer many examples illustrating that the three previously mentioned methods give a reasonable description of the statistical behavior of the system. The physical interpretation of each method is also discussed.
A Numerical Approximation Framework for the Stochastic Linear Quadratic Regulator on Hilbert Spaces
Energy Technology Data Exchange (ETDEWEB)
Levajković, Tijana, E-mail: tijana.levajkovic@uibk.ac.at, E-mail: t.levajkovic@sf.bg.ac.rs; Mena, Hermann, E-mail: hermann.mena@uibk.ac.at [University of Innsbruck, Department of Mathematics (Austria); Tuffaha, Amjad, E-mail: atufaha@aus.edu [American University of Sharjah, Department of Mathematics (United Arab Emirates)
2017-06-15
We present an approximation framework for computing the solution of the stochastic linear quadratic control problem on Hilbert spaces. We focus on the finite horizon case and the related differential Riccati equations (DREs). Our approximation framework is concerned with the so-called “singular estimate control systems” (Lasiecka in Optimal control problems and Riccati equations for systems with unbounded controls and partially analytic generators: applications to boundary and point control problems, 2004) which model certain coupled systems of parabolic/hyperbolic mixed partial differential equations with boundary or point control. We prove that the solutions of the approximate finite-dimensional DREs converge to the solution of the infinite-dimensional DRE. In addition, we prove that the optimal state and control of the approximate finite-dimensional problem converge to the optimal state and control of the corresponding infinite-dimensional problem.
Approximate Bayesian Computation by Subset Simulation using hierarchical state-space models
Vakilzadeh, Majid K.; Huang, Yong; Beck, James L.; Abrahamsson, Thomas
2017-02-01
A new multi-level Markov Chain Monte Carlo algorithm for Approximate Bayesian Computation, ABC-SubSim, has recently appeared that exploits the Subset Simulation method for efficient rare-event simulation. ABC-SubSim adaptively creates a nested decreasing sequence of data-approximating regions in the output space that correspond to increasingly closer approximations of the observed output vector in this output space. At each level, multiple samples of the model parameter vector are generated by a component-wise Metropolis algorithm so that the predicted output corresponding to each parameter value falls in the current data-approximating region. Theoretically, if continued to the limit, the sequence of data-approximating regions would converge on to the observed output vector and the approximate posterior distributions, which are conditional on the data-approximation region, would become exact, but this is not practically feasible. In this paper we study the performance of the ABC-SubSim algorithm for Bayesian updating of the parameters of dynamical systems using a general hierarchical state-space model. We note that the ABC methodology gives an approximate posterior distribution that actually corresponds to an exact posterior where a uniformly distributed combined measurement and modeling error is added. We also note that ABC algorithms have a problem with learning the uncertain error variances in a stochastic state-space model and so we treat them as nuisance parameters and analytically integrate them out of the posterior distribution. In addition, the statistical efficiency of the original ABC-SubSim algorithm is improved by developing a novel strategy to regulate the proposal variance for the component-wise Metropolis algorithm at each level. We demonstrate that Self-regulated ABC-SubSim is well suited for Bayesian system identification by first applying it successfully to model updating of a two degree-of-freedom linear structure for three cases: globally
Directory of Open Access Journals (Sweden)
Mourad Kerboua
2014-12-01
Full Text Available We introduce a new notion called fractional stochastic nonlocal condition, and then we study approximate controllability of class of fractional stochastic nonlinear differential equations of Sobolev type in Hilbert spaces. We use Hölder's inequality, fixed point technique, fractional calculus, stochastic analysis and methods adopted directly from deterministic control problems for the main results. A new set of sufficient conditions is formulated and proved for the fractional stochastic control system to be approximately controllable. An example is given to illustrate the abstract results.
Polygonal approximation and scale-space analysis of closed digital curves
Ray, Kumar S
2013-01-01
This book covers the most important topics in the area of pattern recognition, object recognition, computer vision, robot vision, medical computing, computational geometry, and bioinformatics systems. Students and researchers will find a comprehensive treatment of polygonal approximation and its real life applications. The book not only explains the theoretical aspects but also presents applications with detailed design parameters. The systematic development of the concept of polygonal approximation of digital curves and its scale-space analysis are useful and attractive to scholars in many fi
International Nuclear Information System (INIS)
Brown, M.R.; Ottewill, A.C.
1986-01-01
We present the symmetric Hadamard representation for scalar and photon Feynman Green's functions. We use these representations to give a simple definition for their associated renormalized stress tensors. We investigate the connection between the accuracy of the WKB approximation and the vanishing of the trace anomaly for these fields. We show that, although for scalars there is a direct connection, this is not true for photons, and we discuss the relevance of these results to the approximation of renormalized stress tensors in static Einstein space-times
Energy Technology Data Exchange (ETDEWEB)
Breban, Romulus [Institut Pasteur, Paris Cedex 15 (France)
2016-09-15
Five-dimensional (5D) space-time symmetry greatly facilitates how a 4D observer perceives the propagation of a single spinless particle in a 5D space-time. In particular, if the 5D geometry is independent of the fifth coordinate then the 5D physics may be interpreted as 4D quantum mechanics. In this work we address the case where the symmetry is approximate, focusing on the case where the 5D geometry depends weakly on the fifth coordinate. We show that concepts developed for the case of exact symmetry approximately hold when other concepts such as decaying quantum states, resonant quantum scattering, and Stokes drag are adopted, as well. We briefly comment on the optical model of the nuclear interactions and Millikan's oil drop experiment. (orig.)
Approximate solution of space and time fractional higher order phase field equation
Shamseldeen, S.
2018-03-01
This paper is concerned with a class of space and time fractional partial differential equation (STFDE) with Riesz derivative in space and Caputo in time. The proposed STFDE is considered as a generalization of a sixth-order partial phase field equation. We describe the application of the optimal homotopy analysis method (OHAM) to obtain an approximate solution for the suggested fractional initial value problem. An averaged-squared residual error function is defined and used to determine the optimal convergence control parameter. Two numerical examples are studied, considering periodic and non-periodic initial conditions, to justify the efficiency and the accuracy of the adopted iterative approach. The dependence of the solution on the order of the fractional derivative in space and time and model parameters is investigated.
Directory of Open Access Journals (Sweden)
Abdon Atangana
2014-01-01
Full Text Available The notion of uncertainty in groundwater hydrology is of great importance as it is known to result in misleading output when neglected or not properly accounted for. In this paper we examine this effect in groundwater flow models. To achieve this, we first introduce the uncertainties functions u as function of time and space. The function u accounts for the lack of knowledge or variability of the geological formations in which flow occur (aquifer in time and space. We next make use of Riemann-Liouville fractional derivatives that were introduced by Kobelev and Romano in 2000 and its approximation to modify the standard version of groundwater flow equation. Some properties of the modified Riemann-Liouville fractional derivative approximation are presented. The classical model for groundwater flow, in the case of density-independent flow in a uniform homogeneous aquifer is reformulated by replacing the classical derivative by the Riemann-Liouville fractional derivatives approximations. The modified equation is solved via the technique of green function and the variational iteration method.
Probing quantum entanglement in the Schwarzschild space-time beyond the single-mode approximation
He, Juan; Ding, Zhi-Yong; Ye, Liu
2018-05-01
In this paper, we deduce the vacuum structure for Dirac fields in the background of Schwarzschild space-time beyond the single-mode approximation and discuss the performance of quantum entanglement between particle and antiparticle modes of a Dirac field with Hawking effect. It is shown that Hawking radiation does not always destroy the physically accessible entanglement, and entanglement amplification may happen in some cases. This striking result is different from that of the single-mode approximation, which holds that the Hawking radiation can only destroy entanglement. Lastly, we analyze the physically accessible entanglement relation outside the event horizon and demonstrate that the monogamy inequality is constantly established regardless of the choice of given parameters.
Iterative approximation of the solution of a monotone operator equation in certain Banach spaces
International Nuclear Information System (INIS)
Chidume, C.E.
1988-01-01
Let X=L p (or l p ), p ≥ 2. The solution of the equation Ax=f, f is an element of X is approximated in X by an iteration process in each of the following two cases: (i) A is a bounded linear mapping of X into itself which is also bounded below; and, (ii) A is a nonlinear Lipschitz mapping of X into itself and satisfies ≥ m |x-y| 2 , for some constant m > 0 and for all x, y in X, where j is the single-valued normalized duality mapping of X into X* (the dual space of X). A related result deals with the iterative approximation of the fixed point of a Lipschitz strictly pseudocontractive mapping in X. (author). 12 refs
Approximation of fixed points of Lipschitz pseudo-contractive mapping in Banach spaces
International Nuclear Information System (INIS)
Chidume, C.E.
1988-01-01
Let K be a subset of a real Banach space X. A mapping T:K → X is called pseudo-contractive if the inequality ||x-y|| ≤ ||(1+r)(x-y)-r(Tx-Ty)|| holds for all x,y in K and r > 0. Fixed points of Lipschitz pseudo-contractive maps are approximated under appropriate conditions, by an iteration process of the type introduced by W.R. Mann. This gives an affirmative answer to the problem stated by T.L. Hicks and J.R. Rubicek (J. Math. Anal. Appl. 59 (1977) 504). (author). 28 refs
Approximating second-order vector differential operators on distorted meshes in two space dimensions
International Nuclear Information System (INIS)
Hermeline, F.
2008-01-01
A new finite volume method is presented for approximating second-order vector differential operators in two space dimensions. This method allows distorted triangle or quadrilateral meshes to be used without the numerical results being too much altered. The matrices that need to be inverted are symmetric positive definite therefore, the most powerful linear solvers can be applied. The method has been tested on a few second-order vector partial differential equations coming from elasticity and fluids mechanics areas. These numerical experiments show that it is second-order accurate and locking-free. (authors)
Numerical solution of the ekpyrotic scenario in the moduli space approximation
International Nuclear Information System (INIS)
Soerensen, Torquil MacDonald
2005-01-01
A numerical solution to the equations of motion for the ekpyrotic bulk brane scenario in the moduli space approximation is presented. The visible universe brane has positive tension, and we use a potential that goes to zero exponentially at large distance, and also goes to zero at small distance. In the case considered, no bulk brane, visible brane collision occurs in the solution. This property and the general behavior of the solution is qualitatively the same when the visible brane tension is negative, and for many different parameter choices
International Nuclear Information System (INIS)
Mookerjee, A.; Prasad, R.
1993-09-01
We present a method for calculating the electronic structure of disordered alloys with short range order (SRO) which guarantees positive density of states for all values of the SRO parameter. The method is based on the generalized augmented space theorem which is valid for alloys with SRO. This theorem is applied to alloys with SRO in the tight-binding linear muffin-tin orbital (TB-LMTO) framework. This is done by using the augmented space formulation of Mookerjee and cluster coherent potential approximation. As an illustration, the method is applied to a single band mode TB-LMTO Hamiltonian. We find that the SRO can induce substantial changes in the density of states. (author). 22 refs, 2 figs
Approximate symmetries of Hamiltonians
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.
International Nuclear Information System (INIS)
Stamatelatos, M.G.
1976-01-01
A simple yet accurate method of space-shielding cross sections in a doubly heterogeneous high-temperature gas-cooled reactor (HTGR) system using collision probabilities and rational approximations is presented. Unlike other more elaborate methods, this method does not require point-wise cross sections that are not explicitly generated in most popular cross-section codes. Consequently, this method makes double heterogeneity space-shielding possible for cross-section codes that do not proceed via point-wise cross sections and that usually allow only for single (fuel-rod) heterogeneity cross-section space-shielding. Results of calculations based on this method compare well with results of calculations based on more elaborate methods using point-wise cross sections. Moreover, the systematic trend of the difference between the results from this method and those from the more elaborate methods used for comparison supports the already existent opinion that the latter methods tend to overestimate the space-shielding cross-section correction in doubly heterogeneous HTGR systems
Chaaban, Anas; Morvan, Jean-Marie; Alouini, Mohamed-Slim
2016-01-01
The capacity of the free-space optical channel is studied. A new recursive approach for bounding the capacity of the channel based on sphere-packing is proposed. This approach leads to new capacity upper bounds for a channel with a peak intensity constraint or an average intensity constraint. Under an average constraint only, the derived bound is tighter than an existing sphere-packing bound derived earlier by Farid and Hranilovic. The achievable rate of a truncated-Gaussian input distribution is also derived. It is shown that under both average and peak constraints, this achievable rate and the sphere-packing bounds are within a small gap at high SNR, leading to a simple high-SNR capacity approximation. Simple fitting functions that capture the best known achievable rate for the channel are provided. These functions can be of practical importance especially for the study of systems operating under atmospheric turbulence and misalignment conditions.
Chaaban, Anas
2016-02-03
The capacity of the free-space optical channel is studied. A new recursive approach for bounding the capacity of the channel based on sphere-packing is proposed. This approach leads to new capacity upper bounds for a channel with a peak intensity constraint or an average intensity constraint. Under an average constraint only, the derived bound is tighter than an existing sphere-packing bound derived earlier by Farid and Hranilovic. The achievable rate of a truncated-Gaussian input distribution is also derived. It is shown that under both average and peak constraints, this achievable rate and the sphere-packing bounds are within a small gap at high SNR, leading to a simple high-SNR capacity approximation. Simple fitting functions that capture the best known achievable rate for the channel are provided. These functions can be of practical importance especially for the study of systems operating under atmospheric turbulence and misalignment conditions.
Gerencsér, Máté; Jentzen, Arnulf; Salimova, Diyora
2017-11-01
In a recent article (Jentzen et al. 2016 Commun. Math. Sci. 14 , 1477-1500 (doi:10.4310/CMS.2016.v14.n6.a1)), it has been established that, for every arbitrarily slow convergence speed and every natural number d ∈{4,5,…}, there exist d -dimensional stochastic differential equations with infinitely often differentiable and globally bounded coefficients such that no approximation method based on finitely many observations of the driving Brownian motion can converge in absolute mean to the solution faster than the given speed of convergence. In this paper, we strengthen the above result by proving that this slow convergence phenomenon also arises in two ( d =2) and three ( d =3) space dimensions.
Free-space optical communications with peak and average constraints: High SNR capacity approximation
Chaaban, Anas
2015-09-07
The capacity of the intensity-modulation direct-detection (IM-DD) free-space optical channel with both average and peak intensity constraints is studied. A new capacity lower bound is derived by using a truncated-Gaussian input distribution. Numerical evaluation shows that this capacity lower bound is nearly tight at high signal-to-noise ratio (SNR), while it is shown analytically that the gap to capacity upper bounds is a small constant at high SNR. In particular, the gap to the high-SNR asymptotic capacity of the channel under either a peak or an average constraint is small. This leads to a simple approximation of the high SNR capacity. Additionally, a new capacity upper bound is derived using sphere-packing arguments. This bound is tight at high SNR for a channel with a dominant peak constraint.
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
The Zeldovich approximation and wide-angle redshift-space distortions
Castorina, Emanuele; White, Martin
2018-06-01
The contribution of line-of-sight peculiar velocities to the observed redshift of objects breaks the translational symmetry of the underlying theory, modifying the predicted 2-point functions. These `wide angle effects' have mostly been studied using linear perturbation theory in the context of the multipoles of the correlation function and power spectrum . In this work we present the first calculation of wide angle terms in the Zeldovich approximation, which is known to be more accurate than linear theory on scales probed by the next generation of galaxy surveys. We present the exact result for dark matter and perturbatively biased tracers as well as the small angle expansion of the configuration- and Fourier-space two-point functions and the connection to the multi-frequency angular power spectrum. We compare different definitions of the line-of-sight direction and discuss how to translate between them. We show that wide angle terms can reach tens of percent of the total signal in a measurement at low redshift in some approximations, and that a generic feature of wide angle effects is to slightly shift the Baryon Acoustic Oscillation scale.
Inoue, Kentaro; Shimozono, Shinichi; Yoshida, Hideaki; Kurata, Hiroyuki
2012-01-01
For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.
Directory of Open Access Journals (Sweden)
Kentaro Inoue
Full Text Available BACKGROUND: For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. RESULTS: We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. CONCLUSIONS: Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.
International Nuclear Information System (INIS)
Musazay, M.S.
1981-01-01
A solution to the space and energy dependent neutron transport equation in the framework of the consistent P-1 approximation is sought. The transport equation for thermal neutrons in a moderator of 1/v absorption and constant scattering cross section is changed into a set of coupled partial differential equations. The space dependent part is removed by assuming a cosine shaped flux due to a cosine shaped source at a very high energy. The resulting set of strongly coupled ordinary differential equations is decoupled by assuming expansion of collision density in the powers of a leakage parameter whose coefficients are energy and absorption dependent. These energy dependent coefficients are solutions of a set of weakly coupled differential equations. Series solutions to these differential equations in powers of epsilon and 1/epsilon, where epsilon = E/kT, E being the neutron energy and kT the moderator temperature in units of energy, are found. The properties of these solutions are studied extensively. Absorption appears as a parameter in the coefficients of the series. The difficulties arising in choosing the correct form of the asymptotic solutions are resolved by comparing slowing and thermalization. The limitations on the size of the slab and on the range of absorption are included in the analysis
Migliorati, Giovanni
2016-01-01
We review the main results achieved in the analysis of the stability and accuracy of the discrete leastsquares approximation on multivariate polynomial spaces, with noiseless evaluations at random points, noiseless evaluations at low
Migliorati, G.; Nobile, F.; von Schwerin, E.; Tempone, Raul
2013-01-01
In this work we consider the random discrete L^2 projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input
International Nuclear Information System (INIS)
Nguyen Buong.
1992-11-01
The purpose of this paper is to investigate convergence rates for an operator version of Tikhonov regularization constructed by dual mapping for nonlinear ill-posed problems involving monotone operators in real reflective Banach spaces. The obtained results are considered in combination with finite-dimensional approximations for the space. An example is considered for illustration. (author). 15 refs
Energy Technology Data Exchange (ETDEWEB)
Garcia-Fernandez, P.; Velarde, M.G.
1988-05-01
To a first approximation the effects of detuning and/or space inhomogeneity on the stability domain of a model for a laser with a saturable absorber are presented. It appears that the space dependence increases the domain of the emissionless state, thus delaying the laser action.
Predicting risk in space: Genetic markers for differential vulnerability to sleep restriction
Goel, Namni; Dinges, David F.
2012-08-01
Several laboratories have found large, highly reliable individual differences in the magnitude of cognitive performance, fatigue and sleepiness, and sleep homeostatic vulnerability to acute total sleep deprivation and to chronic sleep restriction in healthy adults. Such individual differences in neurobehavioral performance are also observed in space flight as a result of sleep loss. The reasons for these stable phenotypic differential vulnerabilities are unknown: such differences are not yet accounted for by demographic factors, IQ or sleep need, and moreover, psychometric scales do not predict those individuals cognitively vulnerable to sleep loss. The stable, trait-like (phenotypic) inter-individual differences observed in response to sleep loss—with intraclass correlation coefficients accounting for 58-92% of the variance in neurobehavioral measures—point to an underlying genetic component. To this end, we utilized multi-day highly controlled laboratory studies to investigate the role of various common candidate gene variants—each independently—in relation to cumulative neurobehavioral and sleep homeostatic responses to sleep restriction. These data suggest that common genetic variations (polymorphisms) involved in sleep-wake, circadian, and cognitive regulation may serve as markers for prediction of inter-individual differences in sleep homeostatic and neurobehavioral vulnerability to sleep restriction in healthy adults. Identification of genetic predictors of differential vulnerability to sleep restriction—as determined from candidate gene studies—will help identify astronauts most in need of fatigue countermeasures in space flight and inform medical standards for obtaining adequate sleep in space. This review summarizes individual differences in neurobehavioral vulnerability to sleep deprivation and ongoing genetic efforts to identify markers of such differences.
International Nuclear Information System (INIS)
Toledo Piza, A.F.R. de.
1987-01-01
The Random Phase Approximation (RPA) treatment of nuclear small amplitude vibrations including particle-hole continua is handled in terms of previously developed techniques to treat single-particle resonances in a reaction theoretical framework. A hierarchy of interpretable approximations is derived and a simple working approximation is proposed which involves a numerical effort no larger than that involved in standard, discrete RPA calculations. (Author) [pt
Thacker, B. H.; Mcclung, R. C.; Millwater, H. R.
1990-01-01
An eigenvalue analysis of a typical space propulsion system turbopump blade is presented using an approximate probabilistic analysis methodology. The methodology was developed originally to investigate the feasibility of computing probabilistic structural response using closed-form approximate models. This paper extends the methodology to structures for which simple closed-form solutions do not exist. The finite element method will be used for this demonstration, but the concepts apply to any numerical method. The results agree with detailed analysis results and indicate the usefulness of using a probabilistic approximate analysis in determining efficient solution strategies.
On approximating restricted cycle covers
Manthey, Bodo
2008-01-01
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An $L$-cycle cover is a cycle cover in which the length of every cycle is in the set $L$. The weight of a cycle cover of an edge-weighted graph is the sum of the weights of its edges. We come close to
Perception of Peripersonal and Interpersonal Space in Patients with Restrictive-type Anorexia.
Nandrino, Jean-Louis; Ducro, Claire; Iachini, Tina; Coello, Yann
2017-05-01
This study examines whether the perception of peripersonal action-space and interpersonal social-space is modified in patients with restrictive-type anorexia in two experimental conditions using videos. First, participants stopped the video of an approaching stimulus when they felt the distance to be comfortable for interacting with it (first-person perspective). Second, participants stopped the video when an observed individual approaching a stimulus, or being approached by it, was at a comfortable distance (third-person perspective). In the first-person perspective, the results showed an estimation of peripersonal space that did not differ from controls when an object was approaching and an increase in interpersonal space compared with controls when a male or female individual was approaching. In the third-person perspective, both individual-object and individual-individual distances were larger in anorexic patients. These results indicate a specific deficit in adjusting interpersonal distances in both the first-person and third-person perspectives. Copyright © 2017 John Wiley & Sons, Ltd and Eating Disorders Association. Copyright © 2017 John Wiley & Sons, Ltd and Eating Disorders Association.
Polygonal-path approximation on the path spaces of quantum mechanical systems: extended Feynman maps
International Nuclear Information System (INIS)
Exner, R.; Kolerov, G.I.
1981-01-01
Various types of polygonal-path approximations appearing in the functional-integration theory are discussed. The uniform approximation is applied to extend the definition of the Feynman maps from our previous paper and to prove consistency of this extension. Relations of the extended Fsub(-i)-map to the Wiener integral are given. In particular, the basic theorem about the sequential Wiener integral by Cameron is improved [ru
Migliorati, Giovanni
2016-01-05
We review the main results achieved in the analysis of the stability and accuracy of the discrete leastsquares approximation on multivariate polynomial spaces, with noiseless evaluations at random points, noiseless evaluations at low-discrepancy point sets, and noisy evaluations at random points.
Approximation of Müntz-Szász type in weighted spaces
Energy Technology Data Exchange (ETDEWEB)
Sedletskii, A M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2013-07-31
The paper looks at whether a system of exponentials exp(-λ{sub n}t), Reλ{sub n}>0, is complete in various function spaces on the half-line R{sub +}. Wide classes of Banach spaces E and F of functions on R{sub +} are described such that this system is complete in E and F simultaneously. A test is established to determine when this system is complete in the weighted spaces C{sub 0} and L{sup p} with weight (1+t){sup α} on R{sub +}, for α<0 and α<-1, respectively. Bibliography: 18 titles.
Approximately dual frames in Hilbert spaces and applications to Gabor frames
DEFF Research Database (Denmark)
Christensen, Ole; Laugesen, Richard S.
2011-01-01
constructed via perturbation theory. An alternative bound is derived for the rich class of Gabor frames, by using the Walnut representation of the frame operator to estimate the deviation from equality in the duality conditions. To illustrate these results, we construct explicit approximate duals of Gabor...
International Nuclear Information System (INIS)
Sentis, R.
1984-07-01
The radiative transfer equations may be approximated by a non linear diffusion equation (called Rosseland equation) when the mean free paths of the photons are small with respect to the size of the medium. Some technical assomptions are made, namely about the initial conditions, to avoid any problem of initial layer terms
Approximation theorems for modified Szasz-Mirakjan operators in polynomial weight spaces
Directory of Open Access Journals (Sweden)
Monika Herzog
1999-05-01
Full Text Available In this paper we will study properties of Szasz-Mirakjan type operators A_n^ν , B_n^ ν defined by modified Bessel function I_ν . We shall present theorems giving a degree of approximation for these operators.
Hossen, Abul; Westhues, Anne
2010-09-01
This study was an exploration of the experiences of 17 women, age 60 or more years, from Bangladesh. The women were asked about decision-making processes with respect to their access to health care and whether they perceived that there were differences based on age and sex in the way a household responds to an illness episode. The overall theme that characterized their experiences was "being in a socially excluded space." The themes that explained this perception of social exclusion included gender- and age-based social practices, gender- and class-based economic practices, religious beliefs that restricted the mobility of women, and social constructions of health and illness that led the women to avoid seeking health care. We conclude that the Bangladesh constitutional guarantee that disparities will be eliminated in access to health care between rich and poor, men and women, rural and urban residents, and younger and older citizens has not yet been realized.
Iterative approximation of a solution of a general variational-like inclusion in Banach spaces
International Nuclear Information System (INIS)
Chidume, C.E.; Kazmi, K.R.; Zegeye, H.
2002-07-01
In this paper, we introduce a class of η-accretive mappings in a real Banach space, and show that the η-proximal point mapping for η-m-accretive mapping is Lipschitz continuous. Further we develop an iterative algorithm for a class of general variational-like inclusions involving η-accretive mappings in real Banach space, and discuss its convergence criteria. The class of η-accretive mappings includes several important classes of operators that have been studied by various authors. (author)
International Nuclear Information System (INIS)
Exner, P.; Kolerov, G.I.
1981-01-01
Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru
DEFF Research Database (Denmark)
Miyagi, Haruhide; Madsen, Lars Bojer
2013-01-01
We present the time-dependent restricted-active-space self-consistent-field (TD-RASSCF) theory as a framework for the time-dependent many-electron problem. The theory generalizes the multiconfigurational time-dependent Hartree-Fock (MCTDHF) theory by incorporating the restricted-active-space scheme...... well known in time-independent quantum chemistry. Optimization of the orbitals as well as the expansion coefficients at each time step makes it possible to construct the wave function accurately while using only a relatively small number of electronic configurations. In numerical calculations of high...
Approximation of Mixed-Type Functional Equations in Menger PN-Spaces
Directory of Open Access Journals (Sweden)
M. Eshaghi Gordji
2012-01-01
Full Text Available Let X and Y be vector spaces. We show that a function f:X→Y with f(0=0 satisfies Δf(x1,…,xn=0 for all x1,…,xn∈X, if and only if there exist functions C:X×X×X→Y, B:X×X→Y and A:X→Y such that f(x=C(x,x,x+B(x,x+A(x for all x∈X, where the function C is symmetric for each fixed one variable and is additive for fixed two variables, B is symmetric bi-additive, A is additive and Δf(x1,…,xn=∑k=2n(∑i1=2k∑i2=i1+1k+1⋯∑in-k+1=in-k+1nf(∑i=1,i≠i1,…,in-k+1nxi-∑r=1n-k+1xir+f(∑i=1nxi-2n-2∑i=2n(f(x1+xi+f(x1-xi+2n-1(n-2f(x1 (n∈N, n≥3 for all x1,…,xn∈X. Furthermore, we solve the stability problem for a given function f satisfying Δf(x1,…,xn=0, in the Menger probabilistic normed spaces.
International Nuclear Information System (INIS)
Potluri, U S; Madanayake, A; Rajapaksha, N; Cintra, R J; Bayer, F M
2012-01-01
Multi-beamforming is an important requirement for broadband space imaging applications based on dense aperture arrays (AAs). Usually, the discrete Fourier transform is the transform of choice for AA electromagnetic imaging. Here, the discrete cosine transform (DCT) is proposed as an alternative, enabling the use of emerging fast algorithms that offer greatly reduced complexity in digital arithmetic circuits. We propose two novel high-speed digital architectures for recently proposed fast algorithms (Bouguezel, Ahmad and Swamy 2008 Electron. Lett. 44 1249–50) (BAS-2008) and (Cintra and Bayer 2011 IEEE Signal Process. Lett. 18 579–82) (CB-2011) that provide good approximations to the DCT at zero multiplicative complexity. Further, we propose a novel DCT approximation having zero multiplicative complexity that is shown to be better for multi-beamforming AAs when compared to BAS-2008 and CB-2011. The far-field array pattern of ideal DCT, BAS-2008, CB-2011 and proposed approximation are investigated with error analysis. Extensive hardware realizations, implementation details and performance metrics are provided for synchronous field programmable gate array (FPGA) technology from Xilinx. The resource consumption and speed metrics of BAS-2008, CB-2011 and the proposed approximation are investigated as functions of system word size. The 8-bit versions are mapped to emerging asynchronous FPGAs leading to significantly increased real-time throughput with clock rates at up to 925.6 MHz implying the fastest DCT approximations using reconfigurable logic devices in the literature. (paper)
Time-dependent restricted-active-space self-consistent-field theory for bosonic many-body systems
International Nuclear Information System (INIS)
Lévêque, Camille; Madsen, Lars Bojer
2017-01-01
We develop an ab initio time-dependent wavefunction based theory for the description of a many-body system of cold interacting bosons. Like the multi-configurational time-dependent Hartree method for bosons (MCTDHB), the theory is based on a configurational interaction Ansatz for the many-body wavefunction with time-dependent self-consistent-field orbitals. The theory generalizes the MCTDHB method by incorporating restrictions on the active space of the orbital excitations. The restrictions are specified based on the physical situation at hand. The equations of motion of this time-dependent restricted-active-space self-consistent-field (TD-RASSCF) theory are derived. The similarity between the formal development of the theory for bosons and fermions is discussed. The restrictions on the active space allow the theory to be evaluated under conditions where other wavefunction based methods due to exponential scaling in the numerical effort cannot, and to clearly identify the excitations that are important for an accurate description, significantly beyond the mean-field approach. For ground state calculations we find it to be important to allow a few particles to have the freedom to move in many orbitals, an insight facilitated by the flexibility of the restricted-active-space Ansatz . Moreover, we find that a high accuracy can be obtained by including only even excitations in the many-body self-consistent-field wavefunction. Time-dependent simulations of harmonically trapped bosons subject to a quenching of their noncontact interaction, show failure of the mean-field Gross-Pitaevskii approach within a fraction of a harmonic oscillation period. The TD-RASSCF theory remains accurate at much reduced computational cost compared to the MCTDHB method. Exploring the effect of changes of the restricted-active-space allows us to identify that even self-consistent-field excitations are mainly responsible for the accuracy of the method. (paper)
Jo, Sunhwan; Lee, Hui Sun; Skolnick, Jeffrey; Im, Wonpil
2013-01-01
Understanding glycan structure and dynamics is central to understanding protein-carbohydrate recognition and its role in protein-protein interactions. Given the difficulties in obtaining the glycan's crystal structure in glycoconjugates due to its flexibility and heterogeneity, computational modeling could play an important role in providing glycosylated protein structure models. To address if glycan structures available in the PDB can be used as templates or fragments for glycan modeling, we present a survey of the N-glycan structures of 35 different sequences in the PDB. Our statistical analysis shows that the N-glycan structures found on homologous glycoproteins are significantly conserved compared to the random background, suggesting that N-glycan chains can be confidently modeled with template glycan structures whose parent glycoproteins share sequence similarity. On the other hand, N-glycan structures found on non-homologous glycoproteins do not show significant global structural similarity. Nonetheless, the internal substructures of these N-glycans, particularly, the substructures that are closer to the protein, show significantly similar structures, suggesting that such substructures can be used as fragments in glycan modeling. Increased interactions with protein might be responsible for the restricted conformational space of N-glycan chains. Our results suggest that structure prediction/modeling of N-glycans of glycoconjugates using structure database could be effective and different modeling approaches would be needed depending on the availability of template structures.
Directory of Open Access Journals (Sweden)
Sunhwan Jo
Full Text Available Understanding glycan structure and dynamics is central to understanding protein-carbohydrate recognition and its role in protein-protein interactions. Given the difficulties in obtaining the glycan's crystal structure in glycoconjugates due to its flexibility and heterogeneity, computational modeling could play an important role in providing glycosylated protein structure models. To address if glycan structures available in the PDB can be used as templates or fragments for glycan modeling, we present a survey of the N-glycan structures of 35 different sequences in the PDB. Our statistical analysis shows that the N-glycan structures found on homologous glycoproteins are significantly conserved compared to the random background, suggesting that N-glycan chains can be confidently modeled with template glycan structures whose parent glycoproteins share sequence similarity. On the other hand, N-glycan structures found on non-homologous glycoproteins do not show significant global structural similarity. Nonetheless, the internal substructures of these N-glycans, particularly, the substructures that are closer to the protein, show significantly similar structures, suggesting that such substructures can be used as fragments in glycan modeling. Increased interactions with protein might be responsible for the restricted conformational space of N-glycan chains. Our results suggest that structure prediction/modeling of N-glycans of glycoconjugates using structure database could be effective and different modeling approaches would be needed depending on the availability of template structures.
$O(N)$ model in Euclidean de Sitter space: beyond the leading infrared approximation
Nacir, Diana López; Trombetta, Leonardo G
2016-01-01
We consider an $O(N)$ scalar field model with quartic interaction in $d$-dimensional Euclidean de Sitter space. In order to avoid the problems of the standard perturbative calculations for light and massless fields, we generalize to the $O(N)$ theory a systematic method introduced previously for a single field, which treats the zero modes exactly and the nonzero modes perturbatively. We compute the two-point functions taking into account not only the leading infrared contribution, coming from the self-interaction of the zero modes, but also corrections due to the interaction of the ultraviolet modes. For the model defined in the corresponding Lorentzian de Sitter spacetime, we obtain the two-point functions by analytical continuation. We point out that a partial resummation of the leading secular terms (which necessarily involves nonzero modes) is required to obtain a decay at large distances for massless fields. We implement this resummation along with a systematic double expansion in an effective coupling c...
Chaaban, Anas
2015-04-01
The capacity of the intensity-modulation direct-detection (IM-DD) free-space optical channel is studied. It is shown that for an IM-DD channel with generally input-dependent noise, the worst noise at high SNR is input-independent Gaussian with variance dependent on the input cost. Based on this result, a Gaussian IM-DD channel model is proposed where the noise variance depends on the optical intensity constraints only. A new recursive approach for bounding the capacity of the channel based on sphere-packing is proposed, which leads to a tighter bound than an existing sphere-packing bound for the channel with only an average intensity constraint. Under both average and peak constraints, it yields bounds that characterize the high SNR capacity within a negligible gap, where the achievability is proved by using a truncated Gaussian input distribution. This completes the high SNR capacity characterization of the channel, by closing the gap in the existing characterization for a small average-to-peak ratio. Simple fitting functions that capture the best known achievable rate for the channel are provided. These functions can be of significant practical importance especially for the study of systems operating under atmospheric turbulence and misalignment conditions. Finally, the capacity/SNR loss between heterodyne detection (HD) systems and IM-DD systems is bounded at high SNR, where it is shown that the loss grows as SNR increases for a complex-valued HD system, while it is bounded by 1.245 bits or 3.76 dB at most for a real-valued one.
Chaaban, Anas; Morvan, Jean-Marie; Alouini, Mohamed-Slim
2015-01-01
The capacity of the intensity-modulation direct-detection (IM-DD) free-space optical channel is studied. It is shown that for an IM-DD channel with generally input-dependent noise, the worst noise at high SNR is input-independent Gaussian with variance dependent on the input cost. Based on this result, a Gaussian IM-DD channel model is proposed where the noise variance depends on the optical intensity constraints only. A new recursive approach for bounding the capacity of the channel based on sphere-packing is proposed, which leads to a tighter bound than an existing sphere-packing bound for the channel with only an average intensity constraint. Under both average and peak constraints, it yields bounds that characterize the high SNR capacity within a negligible gap, where the achievability is proved by using a truncated Gaussian input distribution. This completes the high SNR capacity characterization of the channel, by closing the gap in the existing characterization for a small average-to-peak ratio. Simple fitting functions that capture the best known achievable rate for the channel are provided. These functions can be of significant practical importance especially for the study of systems operating under atmospheric turbulence and misalignment conditions. Finally, the capacity/SNR loss between heterodyne detection (HD) systems and IM-DD systems is bounded at high SNR, where it is shown that the loss grows as SNR increases for a complex-valued HD system, while it is bounded by 1.245 bits or 3.76 dB at most for a real-valued one.
Directory of Open Access Journals (Sweden)
Lee L . Mason
2016-11-01
Full Text Available Over the past few years an increasing number of schools and community organizations have developed transformative learning spaces referred to as “MakerSpaces” for research and training purposes. MakerSpaces are organizations in which members sharing similar interests in science, technology, engineering, and math (STEM gather to work on self-selected projects. Proponents of MakerSpaces highlight the implicit benefits arising from participants’ increased engagement with complex technical content in a voluntary, authentic context. We extend the MakerSpace concept to applications of training special education teachers to address the needs of students with Autism Spectrum Disorder (ASD. Applied behavior analysis (ABA has vast empirical support for treating ASD. We believe the MakerSpace model provides a platform for developing a new generation of special education teachers. However, rather than making novel products, the focus is on shaping the behavior-analytic repertoires of special education teachers. In the field of ABA, the term “shaping” describes the differential reinforcement of successive approximations to a target behavior. Accordingly, we propose the name ShaperSpace to describe a novel clinical training approach to developing special education teachers who employ research-validated interventions for individuals with ASD. The supervision model described in this article is provided, not as a recommendation, but as an exemplar that has developed over four years’ contingency shaping and continues to be refined. We appeal to the reader to consider the ShaperSpace as a starting point from which skills developed through free-operant field experiences will ultimately be shaped and selected by the naturally occurring contingencies of the environment.
Migliorati, G.
2013-05-30
In this work we consider the random discrete L^2 projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input parameters. In the RDP technique the QOI is first computed for independent samples of the random input parameters, as in a standard Monte Carlo approach, and then the QOI is approximated by a multivariate polynomial function of the input parameters using a discrete least squares approach. We consider several examples including the Darcy equations with random permeability, the linear elasticity equations with random elastic coefficient, and the Navier--Stokes equations in random geometries and with random fluid viscosity. We show that the RDP technique is well suited to QOIs that depend smoothly on a moderate number of random parameters. Our numerical tests confirm the theoretical findings in [G. Migliorati, F. Nobile, E. von Schwerin, and R. Tempone, Analysis of the Discrete $L^2$ Projection on Polynomial Spaces with Random Evaluations, MOX report 46-2011, Politecnico di Milano, Milano, Italy, submitted], which have shown that, in the case of a single uniformly distributed random parameter, the RDP technique is stable and optimally convergent if the number of sampling points is proportional to the square of the dimension of the polynomial space. Here optimality means that the weighted $L^2$ norm of the RDP error is bounded from above by the best $L^\\\\infty$ error achievable in the given polynomial space, up to logarithmic factors. In the case of several random input parameters, the numerical evidence indicates that the condition on quadratic growth of the number of sampling points could be relaxed to a linear growth and still achieve stable and optimal convergence. This makes the RDP technique very promising for moderately high dimensional uncertainty quantification.
Zimmerman, Paul M; Bell, Franziska; Goldey, Matthew; Bell, Alexis T; Head-Gordon, Martin
2012-10-28
The restricted active space spin flip (RAS-SF) method is extended to allow ground and excited states of molecular radicals to be described at low cost (for small numbers of spin flips). RAS-SF allows for any number of spin flips and a flexible active space while maintaining pure spin eigenfunctions for all states by maintaining a spin complete set of determinants and using spin-restricted orbitals. The implementation supports both even and odd numbers of electrons, while use of resolution of the identity integrals and a shared memory parallel implementation allow for fast computation. Examples of multiple-bond dissociation, excited states in triradicals, spin conversions in organic multi-radicals, and mixed-valence metal coordination complexes demonstrate the broad usefulness of RAS-SF.
Bhrawy, A. H.; Zaky, M. A.
2015-01-01
In this paper, we propose and analyze an efficient operational formulation of spectral tau method for multi-term time-space fractional differential equation with Dirichlet boundary conditions. The shifted Jacobi operational matrices of Riemann-Liouville fractional integral, left-sided and right-sided Caputo fractional derivatives are presented. By using these operational matrices, we propose a shifted Jacobi tau method for both temporal and spatial discretizations, which allows us to present an efficient spectral method for solving such problem. Furthermore, the error is estimated and the proposed method has reasonable convergence rates in spatial and temporal discretizations. In addition, some known spectral tau approximations can be derived as special cases from our algorithm if we suitably choose the corresponding special cases of Jacobi parameters θ and ϑ. Finally, in order to demonstrate its accuracy, we compare our method with those reported in the literature.
International Nuclear Information System (INIS)
Aoyama, Tatsumi; Kawai, Hikaru; Shibusa, Yuuichiro
2006-01-01
We investigate the origin of our four-dimensional space-time by considering dynamical aspects of the IIB matrix model using the improved mean field approximation. Previous works have focused on the specific choices of configurations as ansatz which preserve SO(d) rotational symmetry. In this report, an extended ansatz is proposed and examined up to a third-order approximation which includes both the SO(4) ansatz and the SO(7) ansatz in their respective limits. From the solutions of the self-consistency condition represented by the extrema of the free energy of the system, it is found that some of the solutions found in the SO(4) or SO(7) ansatz disappear in the extended ansatz. This implies that the extension of ansatz can be used to distinguish stable solutions from unstable solutions. It is also found that there is a non-trivial accumulation of extrema including the SO(4)-preserving solution, which may lead to the formation of a plateau. (author)
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...
2008-11-01
Although the current crew rest and duty restrictions for commercial space transportation remain in place, the Federal Aviation Administration (FAA) continues to review the regulation on a regular basis for validity and efficacy based on input from sc...
Msibi, Thabo; Jagessar, Valenshia
2015-01-01
International higher education research focused on students who claim same-sex identifications in university residential spaces has tended to prioritise the "gay as victim" discourse, often leading to the pathologising of same-sex identification. While there is emerging research seeking to challenge this dimension of scholarship by…
Mason, Lee L.; Andrews, Alonzo; Rivera, Christopher J.; Davis, Don
2016-01-01
Over the past few years an increasing number of schools and community organizations have developed transformative learning spaces referred to as "MakerSpaces" for research and training purposes. MakerSpaces are organizations in which members sharing similar interests in science, technology, engineering, and math (STEM) gather to work on…
Directory of Open Access Journals (Sweden)
Tong-Huei Chang
2009-01-01
Full Text Available We use a concept of abstract convexity to define the almost S-KKM𝒞 property, al-S-KKM𝒞(X,Y family, and almost Φ-spaces. We get some new approximate fixed point theorems and fixed point theorems in almost Φ-spaces. Our results extend some results of other authors.
International Nuclear Information System (INIS)
Prati, M.C.
1986-01-01
The eigenfunctions psub(nm)sup(μ) (z, z-bar), n,m are elements of N, μ is an element of (-1/3, + infinity), z is an element of C, of two differential operators, which for some particular values of μ are the generators of the algebra of invariant differential operators on symmetric spaces, having A 2 as a restricted root system, are studied. The group-theoretic interpretation and the explicit form of these functions as polynomials of z , z-bar are given in the following cases: when μ = 0, 1 for every n, m belonging to N; when m = 0, for every n belonging to N and when μ is an element of (-1/3, +infinity). Furthermore, all solutions psub(nm)sup(μ) (z, z-bar) for every μ belonging to (-1/3, +infinity) and n + m <= 5 are explicitly written. This research has applications in quantum mechanics and in quantum field theory
Directory of Open Access Journals (Sweden)
Andriy Tyushka
2016-02-01
Full Text Available Peter Van Elsuwege and Roman Petrov, eds. Legislative Approximation and Application of EU Law in the Eastern Neighbourhood of the European Union: Towards a Common Regulatory Space? London and New York: Routledge, 2014. xxx, 268 pp. Notes on Contributors. Preface by Marc Maresceau. Foreward by Kostiantyn Yelisieiev. Illustrations. Informative table and list. Index. $145.00, cloth.
Directory of Open Access Journals (Sweden)
David Z. Rose
2010-08-01
Full Text Available Extra-axial restriction on diffusion weighted imaging (DWI is an unusual finding on brain magnetic resonance imaging (MRI. Intra-axial restriction on DWI, however, is common, and can represent brain parenchymal infarction, tumor, abscess, or toxic-metabolic process. The infrequency of extra-axial DWI restriction and the paucity of clinico-pathological correlation in the literature limit its differential diagnosis. Scant case reports suggest that extra-axial DWI restriction could be a lymphoma, neurenteric cyst, or, in one patient, subdural empyema [1–3]. We postulate that pus formation must be excluded first, because it can provoke an aggressive meningo-vasculitis with rapidly fatal, intra-axial infarctions. Our patient was a 45-year-old man, presenting to our hospital with left facial droop and right (contralateral arm and leg weakness. Initial MRI revealed DWI restriction in the left lateral pons, consistent with a classic Millard-Gubler stroke. Also noted was a subtle, extra-axial area of curvilinear diffusion restriction in the left cerebellar-pontine angle’s subarachnoid space. Days later, the patient had a headache, and repeat MRI revealed extension of the two DWI lesions – both the intra-axial pontine infarction and the extra-axial area of restricted diffusion in the subarachnoid space. The patient became comatose, a third MRI revealed more extensive DWI restrictions, and he expired despite aggressive care. Autopsy revealed massive brainstem infarcts, a thick lymphoplasmacytic infiltrate, copious Gram-Positive cocci (likely MRSA and arteries partially occluded with fibrointimal proliferation. This emphasizes the concept that extra-axial DWI restriction can represent pus development in the subarachnoid space – a radiographic marker to identify a patient at risk for demise due to septic, meningo-vasculitic infarctions.
Pinjari, Rahul V; Delcey, Mickaël G; Guo, Meiyuan; Odelius, Michael; Lundberg, Marcus
2016-02-15
The restricted active-space (RAS) approach can accurately simulate metal L-edge X-ray absorption spectra of first-row transition metal complexes without the use of any fitting parameters. These characteristics provide a unique capability to identify unknown chemical species and to analyze their electronic structure. To find the best balance between cost and accuracy, the sensitivity of the simulated spectra with respect to the method variables has been tested for two models, [FeCl6 ](3-) and [Fe(CN)6 ](3-) . For these systems, the reference calculations give deviations, when compared with experiment, of ≤1 eV in peak positions, ≤30% for the relative intensity of major peaks, and ≤50% for minor peaks. When compared with these deviations, the simulated spectra are sensitive to the number of final states, the inclusion of dynamical correlation, and the ionization potential electron affinity shift, in addition to the selection of the active space. The spectra are less sensitive to the quality of the basis set and even a double-ζ basis gives reasonable results. The inclusion of dynamical correlation through second-order perturbation theory can be done efficiently using the state-specific formalism without correlating the core orbitals. Although these observations are not directly transferable to other systems, they can, together with a cost analysis, aid in the design of RAS models and help to extend the use of this powerful approach to a wider range of transition metal systems. © 2015 Wiley Periodicals, Inc.
Pinjari, Rahul V; Delcey, Mickaël G; Guo, Meiyuan; Odelius, Michael; Lundberg, Marcus
2014-09-28
The metal L-edge (2p → 3d) X-ray absorption spectra are affected by a number of different interactions: electron-electron repulsion, spin-orbit coupling, and charge transfer between metal and ligands, which makes the simulation of spectra challenging. The core restricted active space (RAS) method is an accurate and flexible approach that can be used to calculate X-ray spectra of a wide range of medium-sized systems without any symmetry constraints. Here, the applicability of the method is tested in detail by simulating three ferric (3d(5)) model systems with well-known electronic structure, viz., atomic Fe(3+), high-spin [FeCl6](3-) with ligand donor bonding, and low-spin [Fe(CN)6](3-) that also has metal backbonding. For these systems, the performance of the core RAS method, which does not require any system-dependent parameters, is comparable to that of the commonly used semi-empirical charge-transfer multiplet model. It handles orbitally degenerate ground states, accurately describes metal-ligand interactions, and includes both single and multiple excitations. The results are sensitive to the choice of orbitals in the active space and this sensitivity can be used to assign spectral features. A method has also been developed to analyze the calculated X-ray spectra using a chemically intuitive molecular orbital picture.
L2-approximating Pricing under Restricted Information
International Nuclear Information System (INIS)
Mania, M.; Tevzadze, R.; Toronjadze, T.
2009-01-01
We consider the mean-variance hedging problem under partial information in the case where the flow of observable events does not contain the full information on the underlying asset price process. We introduce a certain type martingale equation and characterize the optimal strategy in terms of the solution of this equation. We give relations between this equation and backward stochastic differential equations for the value process of the problem
Diophantine exponents for mildly restricted approximation
DEFF Research Database (Denmark)
Bugeaud, Yann; Kristensen, Simon
We are studying the Diophantine exponent defined for integers and a vector by letting , where is the scalar product and denotes the distance to the nearest integer and is the generalised cone consisting of all vectors with the height attained among the first coordinates. We show that the exponent...
Nobile, F.
2015-10-30
In this work we provide a convergence analysis for the quasi-optimal version of the sparse-grids stochastic collocation method we presented in a previous work: “On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods” (Beck et al., Math Models Methods Appl Sci 22(09), 2012). The construction of a sparse grid is recast into a knapsack problem: a profit is assigned to each hierarchical surplus and only the most profitable ones are added to the sparse grid. The convergence rate of the sparse grid approximation error with respect to the number of points in the grid is then shown to depend on weighted summability properties of the sequence of profits. This is a very general argument that can be applied to sparse grids built with any uni-variate family of points, both nested and non-nested. As an example, we apply such quasi-optimal sparse grids to the solution of a particular elliptic PDE with stochastic diffusion coefficients, namely the “inclusions problem”: we detail the convergence estimates obtained in this case using polynomial interpolation on either nested (Clenshaw–Curtis) or non-nested (Gauss–Legendre) abscissas, verify their sharpness numerically, and compare the performance of the resulting quasi-optimal grids with a few alternative sparse-grid construction schemes recently proposed in the literature.
Nobile, F.; Tamellini, L.; Tempone, Raul
2015-01-01
In this work we provide a convergence analysis for the quasi-optimal version of the sparse-grids stochastic collocation method we presented in a previous work: “On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods” (Beck et al., Math Models Methods Appl Sci 22(09), 2012). The construction of a sparse grid is recast into a knapsack problem: a profit is assigned to each hierarchical surplus and only the most profitable ones are added to the sparse grid. The convergence rate of the sparse grid approximation error with respect to the number of points in the grid is then shown to depend on weighted summability properties of the sequence of profits. This is a very general argument that can be applied to sparse grids built with any uni-variate family of points, both nested and non-nested. As an example, we apply such quasi-optimal sparse grids to the solution of a particular elliptic PDE with stochastic diffusion coefficients, namely the “inclusions problem”: we detail the convergence estimates obtained in this case using polynomial interpolation on either nested (Clenshaw–Curtis) or non-nested (Gauss–Legendre) abscissas, verify their sharpness numerically, and compare the performance of the resulting quasi-optimal grids with a few alternative sparse-grid construction schemes recently proposed in the literature.
DEFF Research Database (Denmark)
Nielsen, Mette; Lassen, Claus
2012-01-01
communities and shopping centres through mobility lenses. The article shows how different mobility systems enable and restrict the public access to private-public spaces, and it points out that proprietary communities create an unequal potential for human movement and access in the city. The main argument......Privatisation of public spaces in the contemporary city has increased during the last decades but only few studies have approached this field from a mobility perspective. Therefore the article seeks to rectify this by exploring two Australian examples of private spaces in the city; gated...... and stratification mechanisms. In conclusion the article therefore suggests that future urban research and planning also needs a mobile understanding of spaces in the cities and how different mobility systems play an important role to sustain the exclusiveness that often characterises the private/public spaces...
Bartošová-Sojková, Pavla; Lövy, Alena; Reed, Cecile C; Lisnerová, Martina; Tomková, Tereza; Holzer, Astrid S; Fiala, Ivan
2018-01-01
Intertidal rock pools where fish and invertebrates are in constant close contact due to limited space and water level fluctuations represent ideal conditions to promote life cycles in parasites using these two alternate hosts and to study speciation processes that could contribute to understanding the roles of parasitic species in such ecosystems. Gall bladder and liver samples from five clinid fish species (Blenniiformes: Clinidae) were morphologically and molecularly examined to determine the diversity, prevalence, distribution and host specificity of Ceratomyxa parasites (Cnidaria: Myxozoa) in intertidal habitats along the coast of South Africa. Phylogenetic relationships of clinid ceratomyxids based on the SSU rDNA, LSU rDNA and ITS regions were assessed additionally to the investigation of population genetic structure of Ceratomyxa cottoidii and subsequent comparison with the data known from type fish host Clinus cottoides. Seven Ceratomyxa species including previously described Ceratomyxa dehoopi and C. cottoidii were recognized in clinids. They represent a diverse group of rapidly evolving, closely related species with a remarkably high prevalence in their hosts, little host specificity and frequent concurrent infections, most probably as a result of parasite radiation after multiple speciation events triggered by limited host dispersal within restricted spaces. C. cottoidii represents the most common clinid parasite with a population structure characterized by young expanding populations in the south west and south east coast and by older populations in equilibrium on the west coast of its distribution. Parasite and fish host population structures show overlapping patterns and are very likely affected by similar oceanographic barriers possibly due to reduced host dispersal enhancing parasite community differentiation. While fish host specificity had little impact on parasite population structure, the habitat preference of the alternate invertebrate host as
Directory of Open Access Journals (Sweden)
M. Pattnaik
2013-08-01
Full Text Available In this paper the concept of fuzzy Non-Linear Programming Technique is applied to solve an economic order quantity (EOQ model under restricted space. Since various types of uncertainties and imprecision are inherent in real inventory problems they are classically modeled using the approaches from the probability theory. However, there are uncertainties that cannot be appropriately treated by usual probabilistic models. The questions how to define inventory optimization tasks in such environment how to interpret optimal solutions arise. This paper allows the modification of the Single item EOQ model in presence of fuzzy decision making process where demand is related to the unit price and the setup cost varies with the quantity produced/Purchased. This paper considers the modification of objective function and storage area in the presence of imprecisely estimated parameters. The model is developed for the problem by employing different modeling approaches over an infinite planning horizon. It incorporates all concepts of a fuzzy arithmetic approach, the quantity ordered and the demand per unit compares both fuzzy non linear and other models. Investigation of the properties of an optimal solution allows developing an algorithm whose validity is illustrated through an example problem and ugh MATLAB (R2009a version software, the two and three dimensional diagrams are represented to the application. Sensitivity analysis of the optimal solution is also studied with respect to changes in different parameter values and to draw managerial insights of the decision problem.
DEFF Research Database (Denmark)
Miyagi, Haruhide; Madsen, Lars Bojer
We have developed a new theoretical framework for time-dependent many-electron problems named time-dependent restricted-active-space self-consistent field (TD-RASSCF) theory. The theory generalizes the multicongurational time-dependent Hartree-Fock (MCTDHF) theory by truncating the expansion...
International Nuclear Information System (INIS)
Gramm, E.
1982-01-01
This is a study of possibilities to improve X-ray pictures of the teeth with regard to detail sharpness in the interdental space in a closed row of lateral teeth. For this purpose, X-ray pictures were made of a phantom showing a closed row of lateral teeth, with two different films being used. The row of teeth was made to include two healthy teeth, one tooth with two spots of initial caries, and one tooth with a caries lesion showing already a cavity. The two films used were the usual one, SUPER DOZAHN, and a fine-grain, insensitive film usually chosen for materials testing (NDT 55). The loss in contrast with increasing kV was observed with all X-ray pictures; the insensitive film was in every case more rich in contrast than the usual dental X-ray film. Use of a special paste on the teeth in the interdental space lead to an improved detail sharpness for visual detection. The spots of special interest, i.e. those with initial caries could in no case be clearly defined as such, whereas the caries lesion became evident on all images. The radiation dose was 4,4 times higher when using the insensitive, fine-grain film, as compared to the dental film; use of the paste still increased the radiation dose by a factor of 1.6. The results show that the measures studied in this thesis are not suited to improving the diagnostic value of the X-ray pictures taken as described above. (orig./MG) [de
Casanova, David
2012-08-28
The restricted active space spin-flip CI (RASCI-SF) performance is tested in the electronic structure computation of the ground and the lowest electronically excited states in the presence of near-degeneracies. The feasibility of the method is demonstrated by analyzing the avoided crossing between the ionic and neutral singlet states of LiF along the molecular dissociation. The two potential energy surfaces (PESs) are explored by means of the energies of computed adiabatic and approximated diabatic states, dipole moments, and natural orbital electronic occupancies of both states. The RASCI-SF methodology is also used to study the ground and first excited singlet surface crossing involved in the double bond isomerization of ethylene, as a model case. The two-dimensional PESs of the ground (S(0)) and excited (S(1)) states are calculated for the complete configuration space of torsion and pyramidalization molecular distortions. The parameters that define the state energetics in the vicinity of the S(0)/S(1) conical intersection region are compared to complete active space self-consistent field (CASSCF) results. These examples show that it is possible to describe strongly correlated electronic states using a single reference methodology without the need to expand the wavefunction to high levels of collective excitations. Finally, RASCI is also examined in the electronic structure characterization of the ground and 2(1)A(g)(-), 1(1)B(u)(+), 1(1)B(u)(-), and 1(3)B(u)(-) states of all-trans polyenes with two to seven double bonds and beyond. Transition energies are compared to configuration interaction singles, time-dependent density functional theory (TDDFT), CASSCF, and its second-order perturbation correction calculations, and to experimental data. The capability of RASCI-SF to describe the nature and properties of each electronic state is discussed in detail. This example is also used to expose the properties of different truncations of the RASCI wavefunction and to
Simulations of iron K pre-edge X-ray absorption spectra using the restricted active space method.
Guo, Meiyuan; Sørensen, Lasse Kragh; Delcey, Mickaël G; Pinjari, Rahul V; Lundberg, Marcus
2016-01-28
The intensities and relative energies of metal K pre-edge features are sensitive to both geometric and electronic structures. With the possibility to collect high-resolution spectral data it is important to find theoretical methods that include all important spectral effects: ligand-field splitting, multiplet structures, 3d-4p orbital hybridization, and charge-transfer excitations. Here the restricted active space (RAS) method is used for the first time to calculate metal K pre-edge spectra of open-shell systems, and its performance is tested against on six iron complexes: [FeCl6](n-), [FeCl4](n-), and [Fe(CN)6](n-) in ferrous and ferric oxidation states. The method gives good descriptions of the spectral shapes for all six systems. The mean absolute deviation for the relative energies of different peaks is only 0.1 eV. For the two systems that lack centrosymmetry [FeCl4](2-/1-), the ratios between dipole and quadrupole intensity contributions are reproduced with an error of 10%, which leads to good descriptions of the integrated pre-edge intensities. To gain further chemical insight, the origins of the pre-edge features have been analyzed with a chemically intuitive molecular orbital picture that serves as a bridge between the spectra and the electronic structures. The pre-edges contain information about both ligand-field strengths and orbital covalencies, which can be understood by analyzing the RAS wavefunction. The RAS method can thus be used to predict and rationalize the effects of changes in both the oxidation state and ligand environment in a number of hard X-ray studies of small and medium-sized molecular systems.
International Nuclear Information System (INIS)
Hansen, R.
1982-01-01
Within the framework of this thesis, X-ray pictures have been made of 430 gold or amalgam fillings in order to measure the gap between approximal cavity margin and filling margin. With amalgam fillings, the gap width measured after a residence time of half a year was 9.3 μm and widened to 136.9 μm after 8 years, which represents an increase to the 14-fold. The gap widths measured with gold inlays only doubled within this period, increasing from 38.8 μm after half a year to 77.4 μm after 8 years. The number of retention spots found in the approximal-cervical space with amalgam fillings was at least twice that found for gold fillings. From this it is concluded that gold inlays are by far the better solution for dental restorations. (orig./MG) [de
Southworth, Benjamin Scott
linear systems arises often in the modeling of biological and physical phenomenon, data analysis through graphs and networks, and other scientific applications. This work focuses primarily on linear systems resulting from the discretization of partial differential equations (PDEs). Because solving linear systems is the bottleneck of many large simulation codes, there is a rich field of research in developing "fast" solvers, with the ultimate goal being a method that solves an n x n linear system in O(n) operations. One of the most effective classes of solvers is algebraic multigrid (AMG), which is a multilevel iterative method based on projecting the problem into progressively smaller spaces, and scales like O(n) or O(nlog n) for certain classes of problems. The field of AMG is well-developed for symmetric positive definite matrices, and is typically most effective on linear systems resulting from the discretization of scalar elliptic PDEs, such as the heat equation. Systems of PDEs can add additional difficulties, but the underlying linear algebraic theory is consistent and, in many cases, an elliptic system of PDEs can be handled well by AMG with appropriate modifications of the solver. Solving general, nonsymmetric linear systems remains the wild west of AMG (and other fast solvers), lacking significant results in convergence theory as well as robust methods. Here, we develop new theoretical motivation and practical variations of AMG to solve nonsymmetric linear systems, often resulting from the discretization of hyperbolic PDEs. In particular, multilevel convergence of AMG for nonsymmetric systems is proven for the first time. A new nonsymmetric AMG solver is also developed based on an approximate ideal restriction, referred to as AIR, which is able to solve advection-dominated, hyperbolic-type problems that are outside the scope of existing AMG solvers and other fast iterative methods. AIR demonstrates scalable convergence on unstructured meshes, in multiple
Sandor F. Toth; Robert Haight; Stephanie A. Snyder; Sonney George; James R. Miller; Mark S. Gregory; Adam M. Skibbe
2009-01-01
Conservation efforts often require site or parcel selection strategies that lead to spatially cohesive reserves. Although habitat contiguity is thought to be conducive to the persistence of many sensitive species, availability of funding and suitable land may restrict the extent to which this spatial attribute can be pursued in land management or conservation. Using...
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.
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)
Ordered cones and approximation
Keimel, Klaus
1992-01-01
This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.
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....
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.
Topology, calculus and approximation
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...
Limitations of shallow nets approximation.
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.
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.)
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...
Teng, Pengpeng; Han, Xiaopeng; Li, Jiawei; Xu, Ya; Kang, Lei; Wang, Yangrunqian; Yang, Ying; Yu, Tao
2018-03-21
It is a great challenge to obtain the uniform films of bromide-rich perovskites such as CsPbBr 3 in the two-step sequential solution process (two-step method), which was mainly due to the decomposition of the precursor films in solution. Herein, we demonstrated a novel and elegant face-down liquid-space-restricted deposition to inhibit the decomposition and fabricate high-quality CsPbBr 3 perovskite films. This method is highly reproducible, and the surface of the films was smooth and uniform with an average grain size of 860 nm. As a consequence, the planar perovskite solar cells (PSCs) without the hole-transport layer based on CsPbBr 3 and carbon electrodes exhibit enhanced power conversion efficiency (PCE) along with high open circuit voltage ( V OC ). The champion device has achieved a PCE of 5.86% with a V OC of 1.34 V, which to our knowledge is the highest performing CsPbBr 3 PSC in planar structure. Our results suggest an efficient and low-cost route to fabricate the high-quality planar all-inorganic PSCs.
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...
... People with restrictive cardiomyopathy may be heart transplant candidates. The outlook depends on the cause of the ... www.urac.org). URAC's accreditation program is an independent audit to verify that A.D.A.M. ...
Al-Ababneh, Nedal
2014-07-01
We propose an accurate analytical model to calculate the optical crosstalk of a first-order free space optical interconnects system that uses microlenses with circular apertures. The proposed model is derived by evaluating the resulted finite integral in terms of an infinite series of Bessel functions. Compared to the model that uses complex Gaussian functions to expand the aperture function, it is shown that the proposed model is superior in estimating the crosstalk and provides more accurate results. Moreover, it is shown that the proposed model gives results close to that of the numerical model with superior computational efficiency.
... up in the circulatory system. In time, the heart fails. What causes it? Restrictive cardiomyopathy is often caused by diseases in other parts of the body. One known cause is cardiac ... build up in the heart tissue, making the tissue stiff and thickened. Cardiac ...
Lu, Fang-Min; Hilgemann, Donald W
2017-07-03
Decades ago, it was proposed that Na transport in cardiac myocytes is modulated by large changes in cytoplasmic Na concentration within restricted subsarcolemmal spaces. Here, we probe this hypothesis for Na/K pumps by generating constitutive transsarcolemmal Na flux with the Na channel opener veratridine in whole-cell patch-clamp recordings. Using 25 mM Na in the patch pipette, pump currents decay strongly during continuous activation by extracellular K (τ, ∼2 s). In contradiction to depletion hypotheses, the decay becomes stronger when pump currents are decreased by hyperpolarization. Na channel currents are nearly unchanged by pump activity in these conditions, and conversely, continuous Na currents up to 0.5 nA in magnitude have negligible effects on pump currents. These outcomes are even more pronounced using 50 mM Li as a cytoplasmic Na congener. Thus, the Na/K pump current decay reflects mostly an inactivation mechanism that immobilizes Na/K pump charge movements, not cytoplasmic Na depletion. When channel currents are increased beyond 1 nA, models with unrestricted subsarcolemmal diffusion accurately predict current decay (τ ∼15 s) and reversal potential shifts observed for Na, Li, and K currents through Na channels opened by veratridine, as well as for Na, K, Cs, Li, and Cl currents recorded in nystatin-permeabilized myocytes. Ion concentrations in the pipette tip (i.e., access conductance) track without appreciable delay the current changes caused by sarcolemmal ion flux. Importantly, cytoplasmic mixing volumes, calculated from current decay kinetics, increase and decrease as expected with osmolarity changes (τ >30 s). Na/K pump current run-down over 20 min reflects a failure of pumps to recover from inactivation. Simulations reveal that pump inactivation coupled with Na-activated recovery enhances the rapidity and effectivity of Na homeostasis in cardiac myocytes. In conclusion, an autoregulatory mechanism enhances cardiac Na/K pump activity when
Directory of Open Access Journals (Sweden)
Patrícia de Góes Cruz
2011-09-01
restriction of space for their social activities. The approach that was used was qualitative research with the content analysis technique. Semi-structured interviews were performed with 20 mothers and guardians of children aged 6-10 years, and an operative group was also held with them. The results of this study indicated that, in an environment with restricted space and social vulnerability, children grow up experiencing constant physical or psychosocial risks. On the other hand, these children develop collective negotiation skills and a plasticity of social use of space in a significant way. Therefore, we conclude that in spite of the dense context marked by social and environmental vulnerability that is experienced on a daily basis at those places by the children, they incorporate, cognitively and affectionately, experiences that allow them to learn how to deal with the adversities they find everyday.
Guermond, Jean-Luc; Kanschat, Guido
2010-01-01
We revisit some results from M. L. Adams [Nu cl. Sci. Engrg., 137 (2001), pp. 298- 333]. Using functional analytic tools we prove that a necessary and sufficient condition for the standard upwind discontinuous Galerkin approximation to converge to the correct limit solution in the diffusive regime is that the approximation space contains a linear space of continuous functions, and the restrictions of the functions of this space to each mesh cell contain the linear polynomials. Furthermore, the discrete diffusion limit converges in the Sobolev space H1 to the continuous one if the boundary data is isotropic. With anisotropic boundary data, a boundary layer occurs, and convergence holds in the broken Sobolev space H with s < 1/2 only © 2010 Society for Industrial and Applied Mathematics.
Training Restricted Boltzmann Machines
DEFF Research Database (Denmark)
Fischer, Asja
relies on sampling based approximations of the log-likelihood gradient. I will present an empirical and theoretical analysis of the bias of these approximations and show that the approximation error can lead to a distortion of the learning process. The bias decreases with increasing mixing rate......Restricted Boltzmann machines (RBMs) are probabilistic graphical models that can also be interpreted as stochastic neural networks. Training RBMs is known to be challenging. Computing the likelihood of the model parameters or its gradient is in general computationally intensive. Thus, training...... of the applied sampling procedure and I will introduce a transition operator that leads to faster mixing. Finally, a different parametrisation of RBMs will be discussed that leads to better learning results and more robustness against changes in the data representation....
Diophantine approximation and Dirichlet series
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...
Lu, Fang-Min; Hilgemann, Donald W.
2017-01-01
The Na/K pump exports cytoplasmic Na ions while importing K ions, and its activity is thought to be affected by restricted intracellular Na diffusion in cardiac myocytes. Lu and Hilgemann find instead that the pump can enter an inactivated state and that inactivation can be relieved by cytoplasmic Na.
An approximate analysis of the diffusing flow in a self-controlled heat pipe.
Somogyi, D.; Yen, H. H.
1973-01-01
Constant-density two-dimensional axisymmetric equations are presented for the diffusing flow of a class of self-controlled heat pipes. The analysis is restricted to the vapor space. Condensation of the vapor is related to its mass fraction at the wall by the gas kinetic formula. The Karman-Pohlhausen integral method is applied to obtain approximate solutions. Solutions are presented for a water heat pipe with neon control gas.
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.
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.
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Basu, Samik; Ghosh, Arka P.; He, Ru
We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate methods have been proposed primarily to deal with state-space explosion that makes the exact model checking by numerical methods practically infeasible for large systems. However, the existing statistical methods either consider a restricted subset of PCTL, specifically, the subset that can only express bounded until properties; or rely on user-specified finite bound on the sample path length. We propose a new method that does not have such restrictions and can be effectively used to reason about unbounded until properties. We approximate probabilistic characteristics of an unbounded until property by that of a bounded until property for a suitably chosen value of the bound. In essence, our method is a two-phase process: (a) the first phase is concerned with identifying the bound k 0; (b) the second phase computes the probability of satisfying the k 0-bounded until property as an estimate for the probability of satisfying the corresponding unbounded until property. In both phases, it is sufficient to verify bounded until properties which can be effectively done using existing statistical techniques. We prove the correctness of our technique and present its prototype implementations. We empirically show the practical applicability of our method by considering different case studies including a simple infinite-state model, and large finite-state models such as IPv4 zeroconf protocol and dining philosopher protocol modeled as Discrete Time Markov chains.
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 diﬀerent ﬁelds for example in security. Throughout the years this ﬁeld evolved and there are many approaches and many diﬀerent algorithms which aim to make the face recognition as eﬀective...... 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....
International Nuclear Information System (INIS)
Ginsburg, C.A.
1980-01-01
In many problems, a desired property A of a function f(x) is determined by the behaviour of f(x) approximately equal to g(x,A) as x→xsup(*). In this letter, a method for resuming the power series in x of f(x) and approximating A (modulated Pade approximant) is presented. This new approximant is an extension of a resumation method for f(x) in terms of rational functions. (author)
Generating families in the restricted three-body problem
Hénon, Michel
The classical restricted three-body problem is of fundamental importance because of its applications in astronomy and space navigation, and also as a simple model of a non-integrable Hamiltonian dynamical system. A central role is played by periodic orbits, of which many have been computed numerically. This is the second volume of an attempt to explain and organize the material through a systematic study of generating families, the limits of families of periodic orbits when the mass ratio of the two main bodies becomes vanishingly small. We use quantitative analysis in the vicinity of bifurcations of types 1 and 2. In most cases the junctions between branches can now be determined. A first-order approximation of families of periodic orbits in the vicinity of a bifurcation is also obtained. This book is intended for scientists and students interested in the restricted problem, in its applications to astronomy and space research, and in the theory of dynamical systems.
National Aeronautics and Space Administration — Ferrite control components including circulators and isolators are fundamental building blocks of Transmit/Receive modules (TRM) utilized in high data rate active...
Sparse approximation with bases
2015-01-01
This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications. The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...
Approximating distributions from moments
Pawula, R. F.
1987-11-01
A method based upon Pearson-type approximations from statistics is developed for approximating a symmetric probability density function from its moments. The extended Fokker-Planck equation for non-Markov processes is shown to be the underlying foundation for the approximations. The approximation is shown to be exact for the beta probability density function. The applicability of the general method is illustrated by numerous pithy examples from linear and nonlinear filtering of both Markov and non-Markov dichotomous noise. New approximations are given for the probability density function in two cases in which exact solutions are unavailable, those of (i) the filter-limiter-filter problem and (ii) second-order Butterworth filtering of the random telegraph signal. The approximate results are compared with previously published Monte Carlo simulations in these two cases.
CONTRIBUTIONS TO RATIONAL APPROXIMATION,
Some of the key results of linear Chebyshev approximation theory are extended to generalized rational functions. Prominent among these is Haar’s...linear theorem which yields necessary and sufficient conditions for uniqueness. Some new results in the classic field of rational function Chebyshev...Furthermore a Weierstrass type theorem is proven for rational Chebyshev approximation. A characterization theorem for rational trigonometric Chebyshev approximation in terms of sign alternation is developed. (Author)
Approximation techniques for engineers
Komzsik, Louis
2006-01-01
Presenting numerous examples, algorithms, and industrial applications, Approximation Techniques for Engineers is your complete guide to the major techniques used in modern engineering practice. Whether you need approximations for discrete data of continuous functions, or you''re looking for approximate solutions to engineering problems, everything you need is nestled between the covers of this book. Now you can benefit from Louis Komzsik''s years of industrial experience to gain a working knowledge of a vast array of approximation techniques through this complete and self-contained resource.
Quasiclassical approximation for ultralocal scalar fields
International Nuclear Information System (INIS)
Francisco, G.
1984-01-01
It is shown how to obtain the quasiclassical evolution of a class of field theories called ultralocal fields. Coherent states that follow the 'classical' orbit as defined by Klauder's weak corespondence principle and restricted action principle is explicitly shown to approximate the quantum evolutions as (h/2π) → o. (Author) [pt
RATIONAL APPROXIMATIONS TO GENERALIZED HYPERGEOMETRIC FUNCTIONS.
Under weak restrictions on the various free parameters, general theorems for rational representations of the generalized hypergeometric functions...and certain Meijer G-functions are developed. Upon specialization, these theorems yield a sequency of rational approximations which converge to the
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...
Steepest descent approximations for accretive operator equations
International Nuclear Information System (INIS)
Chidume, C.E.
1993-03-01
A necessary and sufficient condition is established for the strong convergence of the steepest descent approximation to a solution of equations involving quasi-accretive operators defined on a uniformly smooth Banach space. (author). 49 refs
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.)
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.)
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
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.
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 ...
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...
Geometric approximation algorithms
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.
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
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
Approximate kernel competitive learning.
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.
Cardiorespiratory effects of inelastic chest wall restriction.
Miller, Jordan D; Beck, Kenneth C; Joyner, Michael J; Brice, A Glenn; Johnson, Bruce D
2002-06-01
We examined the effects of chest wall restriction (CWR) on cardiorespiratory function at rest and during exercise in healthy subjects in an attempt to approximate the cardiorespiratory interactions observed in clinical conditions that result in restrictive lung and/or chest wall changes and a reduced intrathoracic space. Canvas straps were applied around the thorax and abdomen so that vital capacity was reduced by >35%. Data were acquired at rest and during cycle ergometry at 25 and 45% of peak workloads. CWR elicited significant increases in the flow-resistive work performed on the lung (160%) and the gastric pressure-time integral (>400%) at the higher workload, but it resulted in a decrease in the elastic work performed on the lung (56%) compared with control conditions. With CWR, heart rate increased and stroke volume (SV) fell, resulting in >10% fall in cardiac output at rest and during exercise at matched workloads (P < 0.05). Blood pressure and catecholamines were significantly elevated during CWR exercise conditions (P < 0.05). We conclude that CWR significantly impairs SV during exercise and that a compensatory increase in heart rate does not prevent a significant reduction in cardiac output. O(2) consumption appears to be maintained via increased extraction and a redistribution of blood flow via sympathetic activation.
International Nuclear Information System (INIS)
Matusz, J.M.
1991-01-01
This patent describes a service apparatus for one or more inverted canned motor pumps installed above a floor and beneath a steam generator in a nuclear or fossil power plant with limited access space and limited access time at least in the case of nuclear power plants, each of the canned motor pumps having a pump casing and a depending motor having a flange secured to a pump casing flange by tensioned studs with tightened nuts. It comprises a maintenance cart having a height greater than the height of the motor beneath the motor flange and further having a generally U-shaped frame means with an open vertical side that permits the cart to be moved horizontally such that the cart frame means can be moved under the pump casing to surround the depending motor; actuator means supported by the cart frame means and having translating arm means engageable with support means on the motor; means for operating the translating arm means to support, raise and lower the motor; means supported by the frame means to support the motor flange prior to raising the motor to its installed position and after the motor has been released from its installed position and lowered to the cart; work platform means provided on the cart frame means at an elevation beneath the motor flange elevation; and roller means provided on the bottom of the cart frame means to facilitate horizontal cart movement along the floor
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Prestack wavefield approximations
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.
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...
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...
Prestack wavefield approximations
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.
International Nuclear Information System (INIS)
Robinson, D.W.
1975-11-01
Let U,V be two strongly continuous one-parameter groups of bounded operators on a Banach space X with corresponding infinitesimal operators S, T. It is proved that: //U(t)-V(t)//=0(t), t→0, if, and only if, U=V; //U(t)-V(t)//=0 (t.exp.α), t→0, with 0 -1 where OMEGA, P, are bounded operators on X such that //U(t)OMEGA-OMEGA.U(t)//=0(t.exp.α), //U(t)P-PU(t)//=0(t.exp.α); t→0; //U(t)-V(t)//=0(t) if, and only if, S*-T* has a bounded extension to X*. Further results of this nature are inferred for semigroups, reflexive spaces, Hilbert spaces, and von Neumann algebras [fr
An improved saddlepoint approximation.
Gillespie, Colin S; Renshaw, Eric
2007-08-01
Given a set of third- or higher-order moments, not only is the saddlepoint approximation the only realistic 'family-free' technique available for constructing an associated probability distribution, but it is 'optimal' in the sense that it is based on the highly efficient numerical method of steepest descents. However, it suffers from the problem of not always yielding full support, and whilst [S. Wang, General saddlepoint approximations in the bootstrap, Prob. Stat. Lett. 27 (1992) 61.] neat scaling approach provides a solution to this hurdle, it leads to potentially inaccurate and aberrant results. We therefore propose several new ways of surmounting such difficulties, including: extending the inversion of the cumulant generating function to second-order; selecting an appropriate probability structure for higher-order cumulants (the standard moment closure procedure takes them to be zero); and, making subtle changes to the target cumulants and then optimising via the simplex algorithm.
Prestack traveltime approximations
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.
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
Approximating Preemptive Stochastic Scheduling
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...
Optimization and approximation
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.
Cyclic approximation to stasis
Directory of Open Access Journals (Sweden)
Stewart D. Johnson
2009-06-01
Full Text Available Neighborhoods of points in $mathbb{R}^n$ where a positive linear combination of $C^1$ vector fields sum to zero contain, generically, cyclic trajectories that switch between the vector fields. Such points are called stasis points, and the approximating switching cycle can be chosen so that the timing of the switches exactly matches the positive linear weighting. In the case of two vector fields, the stasis points form one-dimensional $C^1$ manifolds containing nearby families of two-cycles. The generic case of two flows in $mathbb{R}^3$ can be diffeomorphed to a standard form with cubic curves as trajectories.
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
Polynomial approximation on polytopes
Totik, Vilmos
2014-01-01
Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.
Finite elements and approximation
Zienkiewicz, O C
2006-01-01
A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
Abstract. The general theme of this note is illustrated by the following theorem: Theorem 1. Suppose K is a compact set in the complex plane and 0 belongs to the boundary ∂K. Let A(K) denote the space of all functions f on K such that f is holo- morphic in a neighborhood of K and f(0) = 0. Also for any given positive integer ...
Seismic wave extrapolation using lowrank symbol approximation
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.
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.
The random phase approximation
International Nuclear Information System (INIS)
Schuck, P.
1985-01-01
RPA is the adequate theory to describe vibrations of the nucleus of very small amplitudes. These vibrations can either be forced by an external electromagnetic field or can be eigenmodes of the nucleus. In a one dimensional analogue the potential corresponding to such eigenmodes of very small amplitude should be rather stiff otherwise the motion risks to be a large amplitude one and to enter a region where the approximation is not valid. This means that nuclei which are supposedly well described by RPA must have a very stable groundstate configuration (must e.g. be very stiff against deformation). This is usually the case for doubly magic nuclei or close to magic nuclei which are in the middle of proton and neutron shells which develop a very stable groundstate deformation; we take the deformation as an example but there are many other possible degrees of freedom as, for example, compression modes, isovector degrees of freedom, spin degrees of freedom, and many more
The quasilocalized charge approximation
International Nuclear Information System (INIS)
Kalman, G J; Golden, K I; Donko, Z; Hartmann, P
2005-01-01
The quasilocalized charge approximation (QLCA) has been used for some time as a formalism for the calculation of the dielectric response and for determining the collective mode dispersion in strongly coupled Coulomb and Yukawa liquids. The approach is based on a microscopic model in which the charges are quasilocalized on a short-time scale in local potential fluctuations. We review the conceptual basis and theoretical structure of the QLC approach and together with recent results from molecular dynamics simulations that corroborate and quantify the theoretical concepts. We also summarize the major applications of the QLCA to various physical systems, combined with the corresponding results of the molecular dynamics simulations and point out the general agreement and instances of disagreement between the two
Evaluation of variational approximations
International Nuclear Information System (INIS)
Trevisan, L.A.
1991-01-01
In Feynman's approach to quantum statistical mechanics, the partition function can e represented as a path integral. A recently proposed variation method of Feynman-Kleinert is able to transform the path integral into an integral in phase space, in which the quantum fluctuations have been taken care of by introducing the effective classical potential. This method has been testes with succeed for the smooth potentials and for the singular potential of delta. The method to the strong singular potentials is applied: a quadratic potential and a linear potential both with a rigid wall at the origin. By satisfying the condition that the density of the particle be vanish at the origin, and adapted method of Feynman-Kleinert in order to improve the method is introduced. (author)
Approximate quantum Markov chains
Sutter, David
2018-01-01
This book is an introduction to quantum Markov chains and explains how this concept is connected to the question of how well a lost quantum mechanical system can be recovered from a correlated subsystem. To achieve this goal, we strengthen the data-processing inequality such that it reveals a statement about the reconstruction of lost information. The main difficulty in order to understand the behavior of quantum Markov chains arises from the fact that quantum mechanical operators do not commute in general. As a result we start by explaining two techniques of how to deal with non-commuting matrices: the spectral pinching method and complex interpolation theory. Once the reader is familiar with these techniques a novel inequality is presented that extends the celebrated Golden-Thompson inequality to arbitrarily many matrices. This inequality is the key ingredient in understanding approximate quantum Markov chains and it answers a question from matrix analysis that was open since 1973, i.e., if Lieb's triple ma...
Prestack traveltime approximations
Alkhalifah, Tariq Ali
2012-05-01
Many of the explicit prestack traveltime relations used in practice are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multifocusing, based on the double square-root (DSR) equation, and the common reflection stack (CRS) approaches. Using the DSR equation, I constructed the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I recasted the eikonal in terms of the reflection angle, and thus, derived expansion based solutions of this eikonal in terms of the difference between the source and receiver velocities in a generally inhomogenous background medium. The zero-order term solution, corresponding to ignoring the lateral velocity variation in estimating the prestack part, is free of singularities and can be used to estimate traveltimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. The higher-order terms include limitations for horizontally traveling waves, however, we can readily enforce stability constraints to avoid such singularities. In fact, another expansion over reflection angle can help us avoid these singularities by requiring the source and receiver velocities to be different. On the other hand, expansions in terms of reflection angles result in singularity free equations. For a homogenous background medium, as a test, the solutions are reasonably accurate to large reflection and dip angles. A Marmousi example demonstrated the usefulness and versatility of the formulation. © 2012 Society of Exploration Geophysicists.
Approximate systems with confluent bonding mappings
Lončar, Ivan
2001-01-01
If X = {Xn, pnm, N} is a usual inverse system with confluent (monotone) bonding mappings, then the projections are confluent (monotone). This is not true for approximate inverse system. The main purpose of this paper is to show that the property of Kelley (smoothness) of the space Xn is a sufficient condition for the confluence (monotonicity) of the projections.
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
Methods of Fourier analysis and approximation theory
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.
Restrictions and Proportionality
DEFF Research Database (Denmark)
Werlauff, Erik
2009-01-01
The article discusses three central aspects of the freedoms under European Community law, namely 1) the prohibition against restrictions as an important extension of the prohibition against discrimination, 2) a prohibition against exit restrictions which is just as important as the prohibition...... against host country restrictions, but which is often not recognised to the same extent by national law, and 3) the importance of also identifying and recognising an exit restriction, so that it is possible to achieve the required test of appropriateness and proportionality in relation to the rule...
International Conference Approximation Theory XV
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...
Directory of Open Access Journals (Sweden)
F. O. Isiogugu
2016-01-01
Full Text Available The strong convergence of a hybrid algorithm to a common element of the fixed point sets of multivalued strictly pseudocontractive-type mappings and the set of solutions of an equilibrium problem in Hilbert spaces is obtained using a strict fixed point set condition. The obtained results improve, complement, and extend the results on multivalued and single-valued mappings in the contemporary literature.
Multilevel weighted least squares polynomial approximation
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.
Hierarchical low-rank approximation for high dimensional approximation
Nouy, Anthony
2016-01-01
Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.
Hierarchical low-rank approximation for high dimensional approximation
Nouy, Anthony
2016-01-07
Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.
Restricting wolves risks escape
Mech, L. David; Ballard, Warren; Bangs, Ed; Ream, Bob
2010-01-01
Implementing the proposal set forth by Licht and colleagues (BioScience 60: 147–153) requires restricting wolves to tiny "islands," areas that are magnitudes smaller than the ranges of most wolf populations. Wolves naturally have large ranges; restricting their spatial needs increases the risk of wolves escaping, exacerbating public relations and political and legal problems.
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.
Trembach, Vera
2014-01-01
Space is an introduction to the mysteries of the Universe. Included are Task Cards for independent learning, Journal Word Cards for creative writing, and Hands-On Activities for reinforcing skills in Math and Language Arts. Space is a perfect introduction to further research of the Solar System.
Elfwing, Stefan; Uchibe, Eiji; Doya, Kenji
2016-12-01
Free-energy based reinforcement learning (FERL) was proposed for learning in high-dimensional state and action spaces. However, the FERL method does only really work well with binary, or close to binary, state input, where the number of active states is fewer than the number of non-active states. In the FERL method, the value function is approximated by the negative free energy of a restricted Boltzmann machine (RBM). In our earlier study, we demonstrated that the performance and the robustness of the FERL method can be improved by scaling the free energy by a constant that is related to the size of network. In this study, we propose that RBM function approximation can be further improved by approximating the value function by the negative expected energy (EERL), instead of the negative free energy, as well as being able to handle continuous state input. We validate our proposed method by demonstrating that EERL: (1) outperforms FERL, as well as standard neural network and linear function approximation, for three versions of a gridworld task with high-dimensional image state input; (2) achieves new state-of-the-art results in stochastic SZ-Tetris in both model-free and model-based learning settings; and (3) significantly outperforms FERL and standard neural network function approximation for a robot navigation task with raw and noisy RGB images as state input and a large number of actions. Copyright © 2016 The Author(s). Published by Elsevier Ltd.. All rights reserved.
Forms of Approximate Radiation Transport
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.
Pawlak algebra and approximate structure on fuzzy lattice.
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.
Exact constants in approximation theory
Korneichuk, N
1991-01-01
This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base
International Conference Approximation Theory XIV
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.
Simple Lie groups without the approximation property
DEFF Research Database (Denmark)
Haagerup, Uffe; de Laat, Tim
2013-01-01
For a locally compact group G, let A(G) denote its Fourier algebra, and let M0A(G) denote the space of completely bounded Fourier multipliers on G. The group G is said to have the Approximation Property (AP) if the constant function 1 can be approximated by a net in A(G) in the weak-∗ topology...... on the space M0A(G). Recently, Lafforgue and de la Salle proved that SL(3,R) does not have the AP, implying the first example of an exact discrete group without it, namely, SL(3,Z). In this paper we prove that Sp(2,R) does not have the AP. It follows that all connected simple Lie groups with finite center...
International Nuclear Information System (INIS)
Amouyal, A.; Tariel, H.
1966-01-01
Code name: January 1 st SCEA 011S. 2) Computer: IBM 7094; Programme system: Fortran II, 2 nd version. 3) Nature of the problem: resolution of cell problems with one space variable (planar, spherical and cylindrical geometries) and with one energy group, with isotropic sources in the double P n approximation (DP 1 and DP 3 approximation in planar and spherical geometries, DP 1 and DP 2 in cylindrical geometry). 4) Method used: the differential equations with limiting conditions are transformed into differential system with initial conditions which are integrated by a separate-step method. 5) Restrictions: number of physical media [fr
Markdown Optimization via Approximate Dynamic Programming
Directory of Open Access Journals (Sweden)
Cos?gun
2013-02-01
Full Text Available We consider the markdown optimization problem faced by the leading apparel retail chain. Because of substitution among products the markdown policy of one product affects the sales of other products. Therefore, markdown policies for product groups having a significant crossprice elasticity among each other should be jointly determined. Since the state space of the problem is very huge, we use Approximate Dynamic Programming. Finally, we provide insights on the behavior of how each product price affects the markdown policy.
Euclidean scalar field theory in the bilocal approximation
Nagy, S.; Polonyi, J.; Steib, I.
2018-04-01
The blocking step of the renormalization group method is usually carried out by restricting it to fluctuations and to local blocked action. The tree-level, bilocal saddle point contribution to the blocking, defined by the infinitesimal decrease of the sharp cutoff in momentum space, is followed within the three dimensional Euclidean ϕ6 model in this work. The phase structure is changed, new phases and relevant operators are found, and certain universality classes are restricted by the bilocal saddle point.
Restriction techniques for the unit-commitment problem with total procurement costs
International Nuclear Information System (INIS)
Kaleta, Mariusz; Toczylowski, Eugeniusz
2008-01-01
Many discrete optimization problems may be solved much easier, if the solution space can be restricted in a convenient way. For a given specific problem, the restriction techniques can be helpful if an available optimization solver, perceived as a black box, is capable of solving quickly only reduced subproblems of a limited size. For the family of hard unit-commitment problems we investigate a hierarchical search algorithm, which is based on decomposition of the problem into two subproblems. The upper-level subproblem is a relatively small decision 'kernel' of the problem that can be solved approximately by a search algorithm. We define an appropriate restricted decision space for this subproblem. The lower-level subproblem is an appropriate restriction of the original problem that can be solved efficiently by a dedicated solver. Our approach was analyzed on a set of historical data from the Polish electrical balancing market and the best known solutions were improved by the average of about 2-5%
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...
Trade-off bounds for the Pareto surface approximation in multi-criteria IMRT planning
International Nuclear Information System (INIS)
Serna, J I; Monz, M; Kuefer, K H; Thieke, C
2009-01-01
One approach to multi-criteria IMRT planning is to automatically calculate a data set of Pareto-optimal plans for a given planning problem in a first phase, and then interactively explore the solution space and decide on the clinically best treatment plan in a second phase. The challenge of computing the plan data set is to ensure that all clinically meaningful plans are covered and that as many clinically irrelevant plans as possible are excluded to keep computation times within reasonable limits. In this work, we focus on the approximation of the clinically relevant part of the Pareto surface, the process that constitutes the first phase. It is possible that two plans on the Pareto surface have a small, clinically insignificant difference in one criterion and a significant difference in another criterion. For such cases, only the plan that is clinically clearly superior should be included into the data set. To achieve this during the Pareto surface approximation, we propose to introduce bounds that restrict the relative quality between plans, the so-called trade-off bounds. We show how to integrate these trade-off bounds into the approximation scheme and study their effects. The proposed scheme is applied to two artificial cases and one clinical case of a paraspinal tumor. For all cases, the quality of the Pareto surface approximation is measured with respect to the number of computed plans, and the range of values occurring in the approximation for different criteria is compared. Through enforcing trade-off bounds, the scheme disregards clinically irrelevant plans during the approximation. Thereby, the number of plans necessary to achieve a good approximation quality can be significantly reduced. Thus, trade-off bounds are an effective tool to focus the planning and to reduce computation time.
Trade-off bounds for the Pareto surface approximation in multi-criteria IMRT planning.
Serna, J I; Monz, M; Küfer, K H; Thieke, C
2009-10-21
One approach to multi-criteria IMRT planning is to automatically calculate a data set of Pareto-optimal plans for a given planning problem in a first phase, and then interactively explore the solution space and decide on the clinically best treatment plan in a second phase. The challenge of computing the plan data set is to ensure that all clinically meaningful plans are covered and that as many clinically irrelevant plans as possible are excluded to keep computation times within reasonable limits. In this work, we focus on the approximation of the clinically relevant part of the Pareto surface, the process that constitutes the first phase. It is possible that two plans on the Pareto surface have a small, clinically insignificant difference in one criterion and a significant difference in another criterion. For such cases, only the plan that is clinically clearly superior should be included into the data set. To achieve this during the Pareto surface approximation, we propose to introduce bounds that restrict the relative quality between plans, the so-called trade-off bounds. We show how to integrate these trade-off bounds into the approximation scheme and study their effects. The proposed scheme is applied to two artificial cases and one clinical case of a paraspinal tumor. For all cases, the quality of the Pareto surface approximation is measured with respect to the number of computed plans, and the range of values occurring in the approximation for different criteria is compared. Through enforcing trade-off bounds, the scheme disregards clinically irrelevant plans during the approximation. Thereby, the number of plans necessary to achieve a good approximation quality can be significantly reduced. Thus, trade-off bounds are an effective tool to focus the planning and to reduce computation time.
Approximate circuits for increased reliability
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.
Approximation properties of certain modified Szasz-Mirakyan operators
Directory of Open Access Journals (Sweden)
Lucyna Rempulska
2000-05-01
Full Text Available We introduce certain modified Szasz - Mirakyan operators in exponential weighted spaces of functions of one variable. We give theorems on the degree of approximation and the Voronovskaya type theorem.
Approximate Dynamic Programming: Combining Regional and Local State Following Approximations.
Deptula, Patryk; Rosenfeld, Joel A; Kamalapurkar, Rushikesh; Dixon, Warren E
2018-06-01
An infinite-horizon optimal regulation problem for a control-affine deterministic system is solved online using a local state following (StaF) kernel and a regional model-based reinforcement learning (R-MBRL) method to approximate the value function. Unlike traditional methods such as R-MBRL that aim to approximate the value function over a large compact set, the StaF kernel approach aims to approximate the value function in a local neighborhood of the state that travels within a compact set. In this paper, the value function is approximated using a state-dependent convex combination of the StaF-based and the R-MBRL-based approximations. As the state enters a neighborhood containing the origin, the value function transitions from being approximated by the StaF approach to the R-MBRL approach. Semiglobal uniformly ultimately bounded (SGUUB) convergence of the system states to the origin is established using a Lyapunov-based analysis. Simulation results are provided for two, three, six, and ten-state dynamical systems to demonstrate the scalability and performance of the developed method.
Protein restriction and cancer.
Yin, Jie; Ren, Wenkai; Huang, Xingguo; Li, Tiejun; Yin, Yulong
2018-03-26
Protein restriction without malnutrition is currently an effective nutritional intervention known to prevent diseases and promote health span from yeast to human. Recently, low protein diets are reported to be associated with lowered cancer incidence and mortality risk of cancers in human. In murine models, protein restriction inhibits tumor growth via mTOR signaling pathway. IGF-1, amino acid metabolic programing, FGF21, and autophagy may also serve as potential mechanisms of protein restriction mediated cancer prevention. Together, dietary intervention aimed at reducing protein intake can be beneficial and has the potential to be widely adopted and effective in preventing and treating cancers. Copyright © 2018 Elsevier B.V. All rights reserved.
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
An Origami Approximation to the Cosmic Web
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.
Approximate solutions of the Wei Hua oscillator using the Pekeris ...
Indian Academy of Sciences (India)
The approximate analytical bound-state solutions of the Schrödinger equation for the. Wei Hua oscillator are carried out in N-dimensional space by taking Pekeris approximation scheme to the orbital centrifugal term. Solutions of the corresponding hyper-radial equation are obtained using the conventional Nikiforov–Uvarov ...
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.
Rollout sampling approximate policy iteration
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
Weighted approximation with varying weight
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.
Framework for sequential approximate optimization
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
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)
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
Intrauterine growth restriction
Directory of Open Access Journals (Sweden)
Bernardita Donoso Bernales
2012-07-01
Full Text Available It is estimated that the true prevalence of intrauterine growth restriction is 3-10% of all pregnancies, making this fetal condition one of the most frequent obstetric problems, together with premature labor and premature rupture of membranes. The article stresses the importance of early diagnosis because of the associated risks.
Late gestational nutrient restriction
DEFF Research Database (Denmark)
Tygesen, Malin Plumhoff; Nielsen, Mette Olaf; Nørgaard, Peder
2008-01-01
We investigated the effect of 50% nutrient restriction during the last 6 weeks of gestation on twin-pregnant ewes' plasma glucose, non-esterified fatty acid, ß-hydroxybutyrate, insulin, IGF-1 and leptin concentrations and the effects on lamb birth weight and ewes' lactation performance. Plasma...
Restricted Variance Interaction Effects
DEFF Research Database (Denmark)
Cortina, Jose M.; Köhler, Tine; Keeler, Kathleen R.
2018-01-01
Although interaction hypotheses are increasingly common in our field, many recent articles point out that authors often have difficulty justifying them. The purpose of this article is to describe a particular type of interaction: the restricted variance (RV) interaction. The essence of the RV int...
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.
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.
Finite-dimensional approximation for operator equations of Hammerstein type
International Nuclear Information System (INIS)
Buong, N.
1992-11-01
The purpose of this paper is to establish convergence rate for a method of finite-dimensional approximation to solve operator equation of Hammerstein type in real reflexive Banach space. In order to consider a numerical example an iteration method is proposed in Hilbert space. (author). 25 refs
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
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....
Approximations to camera sensor noise
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.
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)
Approximation methods in probability theory
Č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.
The chainable continua are the spaces approximated by finite COTS
Directory of Open Access Journals (Sweden)
Judy A. Kennedy
2001-10-01
Full Text Available We show that the chainable continua (also called snake-like or arc-likecontinua, are precisely the Hausdorff reflections of inverse limits of sequences of finite COTS under maps which are continuous and are separating.
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)
Restricting uniformly open surjections
Czech Academy of Sciences Publication Activity Database
Kania, Tomasz; Rmoutil, M.
2017-01-01
Roč. 355, č. 9 (2017), s. 925-928 ISSN 1631-073X Institutional support: RVO:67985840 Keywords : Banach space * uniform spaces Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics Impact factor: 0.396, year: 2016 http://www.sciencedirect.com/science/article/pii/S1631073X17302261?via%3Dihub
2005-09-01
Command – Space and Global Strike JFCOM Joint Forces Command JFRL Joint Forces Restricted Frequency List JIC Joint Integrating Concept JIM Joint...into the theater’s Joint Restricted Frequency List (JRFL). The ARSST trained the coalition and US soldiers on installation, use and troubleshooting
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 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...
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...
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.
All-Norm Approximation Algorithms
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
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...
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...
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.
Rational approximation of vertical segments
Salazar Celis, Oliver; Cuyt, Annie; Verdonk, Brigitte
2007-08-01
In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.
Pythagorean Approximations and Continued Fractions
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…
Ultrafast Approximation for Phylogenetic Bootstrap
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
Local approximation of a metapopulation's equilibrium.
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 scaling properties of RNA free energy landscapes
Baskaran, S.; Stadler, P. F.; Schuster, P.
1996-01-01
RNA free energy landscapes are analysed by means of "time-series" that are obtained from random walks restricted to excursion sets. The power spectra, the scaling of the jump size distribution, and the scaling of the curve length measured with different yard stick lengths are used to describe the structure of these "time series". Although they are stationary by construction, we find that their local behavior is consistent with both AR(1) and self-affine processes. Random walks confined to excursion sets (i.e., with the restriction that the fitness value exceeds a certain threshold at each step) exhibit essentially the same statistics as free random walks. We find that an AR(1) time series is in general approximately self-affine on timescales up to approximately the correlation length. We present an empirical relation between the correlation parameter rho of the AR(1) model and the exponents characterizing self-affinity.
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...
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
Fawkes, S.
This paper compares and contrasts the characteristics of the first space race, which ran from the late 1950s to the late 1990s, and the second space race that began with the successful space flight of SpaceShipOne in 2004. The first space race was between superpowers seeking to establish geo-political dominance in the Cold War. The second space race will be between competing companies seeking to establish low cost access to space for ordinary people. The first space race achieved its geo- political objectives but did not open up low cost access to space but rather restricted access to a select few, highly trained astronauts and cosmonauts. The second space race, driven by the size and growth of the travel and tourism industry, promises to open up access to space to millions of space tourists.
Approximation errors during variance propagation
International Nuclear Information System (INIS)
Dinsmore, Stephen
1986-01-01
Risk and reliability analyses are often performed by constructing and quantifying large fault trees. The inputs to these models are component failure events whose probability of occuring are best represented as random variables. This paper examines the errors inherent in two approximation techniques used to calculate the top event's variance from the inputs' variance. Two sample fault trees are evaluated and several three dimensional plots illustrating the magnitude of the error over a wide range of input means and variances are given
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.
Emergency building temperature restrictions. Final evaluation
Energy Technology Data Exchange (ETDEWEB)
None
1980-11-01
On July 5, 1979, DOE promulgated final regulations of the Emergency Building Temperature Restrictions program, placing emergency restrictions on thermostat settings for space heating, space cooling, and hot water in commercial, industrial, and nonresidential public buildings. The final regulations restricted space heating to a maximum of 65/sup 0/F, hot water temperature to a maximum of 105/sup 0/F, and cooling temperature to a minimum of 78/sup 0/F. A comprehensive evaluation of the entire EBTF program for a nine-month period from July 16, 1979 is presented. In Chapter 1, an estimate of the population of buildings covered by EBTR is presented. In Chapter 2, EBTR compliance by building type and region is reported. Exemptions are also discussed. In Chapter 3, the simulations of building energy use are explained and the relative impact of various building characteristics and effectiveness of different control strategies are estimated. Finally, in Chapter 4, the methodology for scaling the individual building energy savings to the national level is described, and estimated national energy savings are presented.
Function approximation using combined unsupervised and supervised learning.
Andras, Peter
2014-03-01
Function approximation is one of the core tasks that are solved using neural networks in the context of many engineering problems. However, good approximation results need good sampling of the data space, which usually requires exponentially increasing volume of data as the dimensionality of the data increases. At the same time, often the high-dimensional data is arranged around a much lower dimensional manifold. Here we propose the breaking of the function approximation task for high-dimensional data into two steps: (1) the mapping of the high-dimensional data onto a lower dimensional space corresponding to the manifold on which the data resides and (2) the approximation of the function using the mapped lower dimensional data. We use over-complete self-organizing maps (SOMs) for the mapping through unsupervised learning, and single hidden layer neural networks for the function approximation through supervised learning. We also extend the two-step procedure by considering support vector machines and Bayesian SOMs for the determination of the best parameters for the nonlinear neurons in the hidden layer of the neural networks used for the function approximation. We compare the approximation performance of the proposed neural networks using a set of functions and show that indeed the neural networks using combined unsupervised and supervised learning outperform in most cases the neural networks that learn the function approximation using the original high-dimensional data.
Review: Neuroinflammation in intrauterine growth restriction.
Wixey, Julie A; Chand, Kirat K; Colditz, Paul B; Bjorkman, S Tracey
2017-06-01
Disruption to the maternal environment during pregnancy from events such as hypoxia, stress, toxins, inflammation, and reduced placental blood flow can affect fetal development. Intrauterine growth restriction (IUGR) is commonly caused by chronic placental insufficiency, interrupting supply of oxygen and nutrients to the fetus resulting in abnormal fetal growth. IUGR is a major cause of perinatal morbidity and mortality, occurring in approximately 5-10% of pregnancies. The fetal brain is particularly vulnerable in IUGR and there is an increased risk of long-term neurological disorders including cerebral palsy, epilepsy, learning difficulties, behavioural difficulties and psychiatric diagnoses. Few studies have focused on how growth restriction interferes with normal brain development in the IUGR neonate but recent studies in growth restricted animal models demonstrate increased neuroinflammation. This review describes the role of neuroinflammation in the progression of brain injury in growth restricted neonates. Identifying the mediators responsible for alterations in brain development in the IUGR infant is key to prevention and treatment of brain injury in these infants. Copyright © 2016 Elsevier Ltd. All rights reserved.
Approximate solutions to Mathieu's equation
Wilkinson, Samuel A.; Vogt, Nicolas; Golubev, Dmitry S.; Cole, Jared H.
2018-06-01
Mathieu's equation has many applications throughout theoretical physics. It is especially important to the theory of Josephson junctions, where it is equivalent to Schrödinger's equation. Mathieu's equation can be easily solved numerically, however there exists no closed-form analytic solution. Here we collect various approximations which appear throughout the physics and mathematics literature and examine their accuracy and regimes of applicability. Particular attention is paid to quantities relevant to the physics of Josephson junctions, but the arguments and notation are kept general so as to be of use to the broader physics community.
Approximate Inference for Wireless Communications
DEFF Research Database (Denmark)
Hansen, Morten
This thesis investigates signal processing techniques for wireless communication receivers. The aim is to improve the performance or reduce the computationally complexity of these, where the primary focus area is cellular systems such as Global System for Mobile communications (GSM) (and extensions...... to the optimal one, which usually requires an unacceptable high complexity. Some of the treated approximate methods are based on QL-factorization of the channel matrix. In the work presented in this thesis it is proven how the QL-factorization of frequency-selective channels asymptotically provides the minimum...
Quantum tunneling beyond semiclassical approximation
International Nuclear Information System (INIS)
Banerjee, Rabin; Majhi, Bibhas Ranjan
2008-01-01
Hawking radiation as tunneling by Hamilton-Jacobi method beyond semiclassical approximation is analysed. We compute all quantum corrections in the single particle action revealing that these are proportional to the usual semiclassical contribution. We show that a simple choice of the proportionality constants reproduces the one loop back reaction effect in the spacetime, found by conformal field theory methods, which modifies the Hawking temperature of the black hole. Using the law of black hole mechanics we give the corrections to the Bekenstein-Hawking area law following from the modified Hawking temperature. Some examples are explicitly worked out.
Generalized Gradient Approximation Made Simple
International Nuclear Information System (INIS)
Perdew, J.P.; Burke, K.; Ernzerhof, M.
1996-01-01
Generalized gradient approximations (GGA close-quote s) for the exchange-correlation energy improve upon the local spin density (LSD) description of atoms, molecules, and solids. We present a simple derivation of a simple GGA, in which all parameters (other than those in LSD) are fundamental constants. Only general features of the detailed construction underlying the Perdew-Wang 1991 (PW91) GGA are invoked. Improvements over PW91 include an accurate description of the linear response of the uniform electron gas, correct behavior under uniform scaling, and a smoother potential. copyright 1996 The American Physical Society
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
Impulse approximation in solid helium
International Nuclear Information System (INIS)
Glyde, H.R.
1985-01-01
The incoherent dynamic form factor S/sub i/(Q, ω) is evaluated in solid helium for comparison with the impulse approximation (IA). The purpose is to determine the Q values for which the IA is valid for systems such a helium where the atoms interact via a potential having a steeply repulsive but not infinite hard core. For 3 He, S/sub i/(Q, ω) is evaluated from first principles, beginning with the pair potential. The density of states g(ω) is evaluated using the self-consistent phonon theory and S/sub i/(Q,ω) is expressed in terms of g(ω). For solid 4 He resonable models of g(ω) using observed input parameters are used to evaluate S/sub i/(Q,ω). In both cases S/sub i/(Q, ω) is found to approach the impulse approximation S/sub IA/(Q, ω) closely for wave vector transfers Q> or approx. =20 A -1 . The difference between S/sub i/ and S/sub IA/, which is due to final state interactions of the scattering atom with the remainder of the atoms in the solid, is also predominantly antisymmetric in (ω-ω/sub R/), where ω/sub R/ is the recoil frequency. This suggests that the symmetrization procedure proposed by Sears to eliminate final state contributions should work well in solid helium
Finite approximations in fluid mechanics
International Nuclear Information System (INIS)
Hirschel, E.H.
1986-01-01
This book contains twenty papers on work which was conducted between 1983 and 1985 in the Priority Research Program ''Finite Approximations in Fluid Mechanics'' of the German Research Society (Deutsche Forschungsgemeinschaft). Scientists from numerical mathematics, fluid mechanics, and aerodynamics present their research on boundary-element methods, factorization methods, higher-order panel methods, multigrid methods for elliptical and parabolic problems, two-step schemes for the Euler equations, etc. Applications are made to channel flows, gas dynamical problems, large eddy simulation of turbulence, non-Newtonian flow, turbomachine flow, zonal solutions for viscous flow problems, etc. The contents include: multigrid methods for problems from fluid dynamics, development of a 2D-Transonic Potential Flow Solver; a boundary element spectral method for nonstationary viscous flows in 3 dimensions; navier-stokes computations of two-dimensional laminar flows in a channel with a backward facing step; calculations and experimental investigations of the laminar unsteady flow in a pipe expansion; calculation of the flow-field caused by shock wave and deflagration interaction; a multi-level discretization and solution method for potential flow problems in three dimensions; solutions of the conservation equations with the approximate factorization method; inviscid and viscous flow through rotating meridional contours; zonal solutions for viscous flow problems
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.
Local facet approximation for image stitching
Li, Jing; Lai, Shiming; Liu, Yu; Wang, Zhengming; Zhang, Maojun
2018-01-01
Image stitching aims at eliminating multiview parallax and generating a seamless panorama given a set of input images. This paper proposes a local adaptive stitching method, which could achieve both accurate and robust image alignments across the whole panorama. A transformation estimation model is introduced by approximating the scene as a combination of neighboring facets. Then, the local adaptive stitching field is constructed using a series of linear systems of the facet parameters, which enables the parallax handling in three-dimensional space. We also provide a concise but effective global projectivity preserving technique that smoothly varies the transformations from local adaptive to global planar. The proposed model is capable of stitching both normal images and fisheye images. The efficiency of our method is quantitatively demonstrated in the comparative experiments on several challenging cases.
Approximating the minimum cycle mean
Directory of Open Access Journals (Sweden)
Krishnendu Chatterjee
2013-07-01
Full Text Available We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1 First we show that the algorithmic question is reducible in O(n^2 time to the problem of a logarithmic number of min-plus matrix multiplications of n-by-n matrices, where n is the number of vertices of the graph. (2 Second, when the weights are nonnegative, we present the first (1 + ε-approximation algorithm for the problem and the running time of our algorithm is ilde(O(n^ω log^3(nW/ε / ε, where O(n^ω is the time required for the classic n-by-n matrix multiplication and W is the maximum value of the weights.
On Approximate Solutions of Functional Equations in Vector Lattices
Directory of Open Access Journals (Sweden)
Bogdan Batko
2014-01-01
Full Text Available We provide a method of approximation of approximate solutions of functional equations in the class of functions acting into a Riesz space (algebra. The main aim of the paper is to provide a general theorem that can act as a tool applicable to a possibly wide class of functional equations. The idea is based on the use of the Spectral Representation Theory for Riesz spaces. The main result will be applied to prove the stability of an alternative Cauchy functional equation F(x+y+F(x+F(y≠0⇒F(x+y=F(x+F(y in Riesz spaces, the Cauchy equation with squares F(x+y2=(F(x+F(y2 in f-algebras, and the quadratic functional equation F(x+y+F(x-y=2F(x+2F(y in Riesz spaces.
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 Receding Horizon Approach for Markov Decision Processes: Average Award Case
National Research Council Canada - National Science Library
Chang, Hyeong S; Marcus, Steven I
2002-01-01
...) with countable state space, finite action space, and bounded rewards that uses an approximate solution of a fixed finite-horizon sub-MDP of a given infinite-horizon MDP to create a stationary policy...
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 ...
Approximate models for the analysis of laser velocimetry correlation functions
International Nuclear Information System (INIS)
Robinson, D.P.
1981-01-01
Velocity distributions in the subchannels of an eleven pin test section representing a slice through a Fast Reactor sub-assembly were measured with a dual beam laser velocimeter system using a Malvern K 7023 digital photon correlator for signal processing. Two techniques were used for data reduction of the correlation function to obtain velocity and turbulence values. Whilst both techniques were in excellent agreement on the velocity, marked discrepancies were apparent in the turbulence levels. As a consequence of this the turbulence data were not reported. Subsequent investigation has shown that the approximate technique used as the basis of Malvern's Data Processor 7023V is restricted in its range of application. In this note alternative approximate models are described and evaluated. The objective of this investigation was to develop an approximate model which could be used for on-line determination of the turbulence level. (author)
Space charge emission in cylindrical diode
International Nuclear Information System (INIS)
Torres-Córdoba, Rafael; Martínez-García, Edgar
2014-01-01
In this paper, a mathematical model to describe cylindrical electron current emissions through a physics approximation method is presented. The proposed mathematical approximation consists of analyzing and solving the nonlinear Poisson's equation, with some determined mathematical restrictions. Our findings tackle the problem when charge-space creates potential barrier that disable the steady-state of the beam propagation. In this problem, the potential barrier effects of electron's speed with zero velocity emitted through the virtual cathode happens. The interaction between particles and the virtual cathode have been to find the inter-atomic potentials as boundary conditions from a quantum mechanics perspective. Furthermore, a non-stationary spatial solution of the electrical potential between anode and cathode is presented. The proposed solution is a 2D differential equation that was linearized from the generalized Poisson equation. A single condition was used solely, throughout the radial boundary conditions of the current density formation
On the approximation by single hidden layer feedforward neural networks with fixed weights
Guliyev, Namig J.; Ismailov, Vugar E.
2017-01-01
International audience; Feedforward neural networks have wide applicability in various disciplines of science due to their universal approximation property. Some authors have shown that single hidden layer feedforward neural networks (SLFNs) with fixed weights still possess the universal approximation property provided that approximated functions are univariate. But this phenomenon does not lay any restrictions on the number of neurons in the hidden layer. The more this number, the more the p...
Property Rights, Restrictions and Responsibilities
DEFF Research Database (Denmark)
Enemark, Stig
more to a social, ethical commitment or attitude to environmental sustainability and good husbandry. This paper provides an overall understanding of the concept of land administration systems for dealing with rights, restrictions and responsibilities in future spatially enabled government. Finally......Land Administration Systems are the basis for conceptualizing rights, restrictions and responsibilities related to people, policies and places. Property rights are normally concerned with ownership and tenure whereas restrictions usually control use and activities on land. Responsibilities relate...
About 'restriction', 'justified' and 'necessary'
DEFF Research Database (Denmark)
Werlauff, Erik
2016-01-01
The article is an academic fairy tale about why and how all national corporate tax protection legislation should undergo a 3-part test to ensure its consistency with EU law. Each Member State introduce a compulsory 3-step test for each new (corporate) tax provision. The test is simple: (1) Does...... the tax provision constitute a restriction in the sense of EU law? (2) If the answer is yes: Is the restriction justified? (3) If the answer is yes: Is the restriction necessary?"...
Hydration thermodynamics beyond the linear response approximation.
Raineri, Fernando O
2016-10-19
The solvation energetics associated with the transformation of a solute molecule at infinite dilution in water from an initial state A to a final state B is reconsidered. The two solute states have different potentials energies of interaction, [Formula: see text] and [Formula: see text], with the solvent environment. Throughout the A [Formula: see text] B transformation of the solute, the solvation system is described by a Hamiltonian [Formula: see text] that changes linearly with the coupling parameter ξ. By focusing on the characterization of the probability density [Formula: see text] that the dimensionless perturbational solute-solvent interaction energy [Formula: see text] has numerical value y when the coupling parameter is ξ, we derive a hierarchy of differential equation relations between the ξ-dependent cumulant functions of various orders in the expansion of the appropriate cumulant generating function. On the basis of this theoretical framework we then introduce an inherently nonlinear solvation model for which we are able to find analytical results for both [Formula: see text] and for the solvation thermodynamic functions. The solvation model is based on the premise that there is an upper or a lower bound (depending on the nature of the interactions considered) to the amplitude of the fluctuations of Y in the solution system at equilibrium. The results reveal essential differences in behavior for the model when compared with the linear response approximation to solvation, particularly with regards to the probability density [Formula: see text]. The analytical expressions for the solvation properties show, however, that the linear response behavior is recovered from the new model when the room for the thermal fluctuations in Y is not restricted by the existence of a nearby bound. We compare the predictions of the model with the results from molecular dynamics computer simulations for aqueous solvation, in which either (1) the solute
Extended model of restricted beam for FSO links
Poliak, Juraj; Wilfert, Otakar
2012-10-01
Modern wireless optical communication systems in many aspects overcome wire or radio communications. Their advantages are license-free operation and broad bandwidth that they offer. The medium in free-space optical (FSO) links is the atmosphere. Operation of outdoor FSO links struggles with many atmospheric phenomena that deteriorate phase and amplitude of the transmitted optical beam. This beam originates in the transmitter and is affected by its individual parts, especially by the lens socket and the transmitter aperture, where attenuation and diffraction effects take place. Both of these phenomena unfavourable influence the beam and cause degradation of link availability, or its total malfunction. Therefore, both of these phenomena should be modelled and simulated, so that one can judge the link function prior to the realization of the system. Not only the link availability and reliability are concerned, but also economic aspects. In addition, the transmitted beam is not, generally speaking, circularly symmetrical, what makes the link simulation more difficult. In a comprehensive model, it is necessary to take into account the ellipticity of the beam that is restricted by circularly symmetrical aperture where then the attenuation and diffraction occur. General model is too computationally extensive; therefore simplification of the calculations by means of analytical and numerical approaches will be discussed. Presented model is not only simulated using computer, but also experimentally proven. One can then deduce the ability of the model to describe the reality and to estimate how far can one go with approximations, i.e. limitations of the model are discussed.
An approximation method for nonlinear integral equations of Hammerstein type
International Nuclear Information System (INIS)
Chidume, C.E.; Moore, C.
1989-05-01
The solution of a nonlinear integral equation of Hammerstein type in Hilbert spaces is approximated by means of a fixed point iteration method. Explicit error estimates are given and, in some cases, convergence is shown to be at least as fast as a geometric progression. (author). 25 refs
An extension of Brosowski-Meinardus theorem on invariant approximation
International Nuclear Information System (INIS)
Liaqat Ali Khan; Abdul Rahim Khan.
1991-07-01
We obtain a generalization of a fixed point theorem of Dotson for non-expansive mappings on star-shaped sets and then use it to prove a unified Brosowski-Meinardus theorem on invariant approximation in the setting of p-normed linear spaces. (author). 13 refs
Approximation by modified Szasz–Mirakjan operators on weighted ...
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
English translation in Math. Notes 20(5–6) (1976) 996–998. [3] Gadzhiev A D, Positive linear operators in weighted spaces of functions of several vari- ables, Izv. Akad. Nauk. SSR Ser. Fiz-Tekhn. Math. Nauk 4 (1980) 32–37. [4] Gadzhiev A D, Weighted approximation of continuous functions by linear operators on the whole ...
Improved stochastic approximation methods for discretized parabolic partial differential equations
Guiaş, Flavius
2016-12-01
We present improvements of the stochastic direct simulation method, a known numerical scheme based on Markov jump processes which is used for approximating solutions of ordinary differential equations. This scheme is suited especially for spatial discretizations of evolution partial differential equations (PDEs). By exploiting the full path simulation of the stochastic method, we use this first approximation as a predictor and construct improved approximations by Picard iterations, Runge-Kutta steps, or a combination. This has as consequence an increased order of convergence. We illustrate the features of the improved method at a standard benchmark problem, a reaction-diffusion equation modeling a combustion process in one space dimension (1D) and two space dimensions (2D).
International Nuclear Information System (INIS)
Willis, W.L.; Ahrendt, M.R.
2009-01-01
Since this report was originally issued in 2001, several options proposed for increasing double-shell tank (DST) storage space were implemented or are in the process of implementation. Changes to the single-shell tank (SST) waste retrieval schedule, completion of DST space saving options, and the DST space saving options in progress have delayed the projected shortfall of DST storage space from the 2007-2011 to the 2018-2025 timeframe (ORP-11242, River Protection Project System Plan). This report reevaluates options from Rev. 0 and includes evaluations of new options for alleviating projected restrictions on SST waste retrieval beginning in 2018 because of the lack of DST storage space.
Molecular motion in restricted geometries
Indian Academy of Sciences (India)
Molecular dynamics in restricted geometries is known to exhibit anomalous behaviour. Diffusion, translational or rotational, of molecules is altered significantly on confinement in restricted geometries. Quasielastic neutron scattering (QENS) offers a unique possibility of studying molecular motion in such systems. Both time ...
Aging, adiposity, and calorie restriction.
Fontana, Luigi; Klein, Samuel
2007-03-07
Excessive calorie intake and subsequent obesity increases the risk of developing chronic disease and decreases life expectancy. In rodent models, calorie restriction with adequate nutrient intake decreases the risk of developing chronic disease and extends maximum life span. To evaluate the physiological and clinical implications of calorie restriction with adequate nutrient intake. Search of PubMed (1966-December 2006) using terms encompassing various aspects of calorie restriction, dietary restriction, aging, longevity, life span, adiposity, and obesity; hand search of journals that focus on obesity, geriatrics, or aging; and search of reference lists of pertinent research and review articles and books. Reviewed reports (both basic science and clinical) included epidemiologic studies, case-control studies, and randomized controlled trials, with quality of data assessed by taking into account publication in a peer-reviewed journal, number of animals or individuals studied, objectivity of measurements, and techniques used to minimize bias. It is not known whether calorie restriction extends maximum life span or life expectancy in lean humans. However, calorie restriction in adult men and women causes many of the same metabolic adaptations that occur in calorie-restricted rodents and monkeys, including decreased metabolic, hormonal, and inflammatory risk factors for diabetes, cardiovascular disease, and possibly cancer. Excessive calorie restriction causes malnutrition and has adverse clinical effects. Calorie restriction in adult men and women causes beneficial metabolic, hormonal, and functional changes, but the precise amount of calorie intake or body fat mass associated with optimal health and maximum longevity in humans is not known. In addition, it is possible that even moderate calorie restriction may be harmful in specific patient populations, such as lean persons who have minimal amounts of body fat.
Adaptive approximation of higher order posterior statistics
Lee, Wonjung
2014-02-01
Filtering is an approach for incorporating observed data into time-evolving systems. Instead of a family of Dirac delta masses that is widely used in Monte Carlo methods, we here use the Wiener chaos expansion for the parametrization of the conditioned probability distribution to solve the nonlinear filtering problem. The Wiener chaos expansion is not the best method for uncertainty propagation without observations. Nevertheless, the projection of the system variables in a fixed polynomial basis spanning the probability space might be a competitive representation in the presence of relatively frequent observations because the Wiener chaos approach not only leads to an accurate and efficient prediction for short time uncertainty quantification, but it also allows to apply several data assimilation methods that can be used to yield a better approximate filtering solution. The aim of the present paper is to investigate this hypothesis. We answer in the affirmative for the (stochastic) Lorenz-63 system based on numerical simulations in which the uncertainty quantification method and the data assimilation method are adaptively selected by whether the dynamics is driven by Brownian motion and the near-Gaussianity of the measure to be updated, respectively. © 2013 Elsevier Inc.
Semi-classical approximation to path integrals - phases and catastrophes
International Nuclear Information System (INIS)
Levit, S.
1977-01-01
Problems of phases and catastrophes were encountered when trying to apply the classical S-matrix theory to the scattering phenomena in nuclear physics. The path integral formulation provided a suitable basis for the treatment of these and related problems. Within conventional mathematical language it was possible to give practical prescriptions and discuss their limitations. Since the semi-classical (stationary phase) approximation is commonly used in any application of the path integral method, the results are not restricted to the scattering problems and may be of general interest. The derivation of the uniform approximations in the energy representation should use the exact path integral expression as the starting point, rather than performing Fourier transforms on the expressions derived in the present lecture. (B.G.)
High-Dimensional Function Approximation With Neural Networks for Large Volumes of Data.
Andras, Peter
2018-02-01
Approximation of high-dimensional functions is a challenge for neural networks due to the curse of dimensionality. Often the data for which the approximated function is defined resides on a low-dimensional manifold and in principle the approximation of the function over this manifold should improve the approximation performance. It has been show that projecting the data manifold into a lower dimensional space, followed by the neural network approximation of the function over this space, provides a more precise approximation of the function than the approximation of the function with neural networks in the original data space. However, if the data volume is very large, the projection into the low-dimensional space has to be based on a limited sample of the data. Here, we investigate the nature of the approximation error of neural networks trained over the projection space. We show that such neural networks should have better approximation performance than neural networks trained on high-dimensional data even if the projection is based on a relatively sparse sample of the data manifold. We also find that it is preferable to use a uniformly distributed sparse sample of the data for the purpose of the generation of the low-dimensional projection. We illustrate these results considering the practical neural network approximation of a set of functions defined on high-dimensional data including real world data as well.
Trajectory averaging for stochastic approximation MCMC algorithms
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
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.
Evaluation of Gaussian approximations for data assimilation in reservoir models
Iglesias, Marco A.
2013-07-14
The Bayesian framework is the standard approach for data assimilation in reservoir modeling. This framework involves characterizing the posterior distribution of geological parameters in terms of a given prior distribution and data from the reservoir dynamics, together with a forward model connecting the space of geological parameters to the data space. Since the posterior distribution quantifies the uncertainty in the geologic parameters of the reservoir, the characterization of the posterior is fundamental for the optimal management of reservoirs. Unfortunately, due to the large-scale highly nonlinear properties of standard reservoir models, characterizing the posterior is computationally prohibitive. Instead, more affordable ad hoc techniques, based on Gaussian approximations, are often used for characterizing the posterior distribution. Evaluating the performance of those Gaussian approximations is typically conducted by assessing their ability at reproducing the truth within the confidence interval provided by the ad hoc technique under consideration. This has the disadvantage of mixing up the approximation properties of the history matching algorithm employed with the information content of the particular observations used, making it hard to evaluate the effect of the ad hoc approximations alone. In this paper, we avoid this disadvantage by comparing the ad hoc techniques with a fully resolved state-of-the-art probing of the Bayesian posterior distribution. The ad hoc techniques whose performance we assess are based on (1) linearization around the maximum a posteriori estimate, (2) randomized maximum likelihood, and (3) ensemble Kalman filter-type methods. In order to fully resolve the posterior distribution, we implement a state-of-the art Markov chain Monte Carlo (MCMC) method that scales well with respect to the dimension of the parameter space, enabling us to study realistic forward models, in two space dimensions, at a high level of grid refinement. Our
Perturbative stability of the approximate Killing field eigenvalue problem
International Nuclear Information System (INIS)
Beetle, Christopher; Wilder, Shawn
2014-01-01
An approximate Killing field may be defined on a compact, Riemannian geometry by solving an eigenvalue problem for a certain elliptic operator. This paper studies the effect of small perturbations in the Riemannian metric on the resulting vector field. It shows that small metric perturbations, as measured using a Sobolev-type supremum norm on the space of Riemannian geometries on a fixed manifold, yield small perturbations in the approximate Killing field, as measured using a Hilbert-type square integral norm. It also discusses applications to the problem of computing the spin of a generic black hole in general relativity. (paper)
Approximate furthest neighbor with application to annulus query
DEFF Research Database (Denmark)
Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen
2016-01-01
-dimensional Euclidean space. The method builds on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk׳s approximation factor and reducing the running time by a logarithmic factor. We also present......, the query-dependent approach is used for deriving a data structure for the approximate annulus query problem, which is defined as follows: given an input set S and two parameters r>0 and w≥1, construct a data structure that returns for each query point q a point p∈S such that the distance between p and q...
Effects of scattering anisotropy approximation in multigroup radiation shielding calculations
International Nuclear Information System (INIS)
Altiparmakov, D.
1983-01-01
Expansion of the scattering cross sections into Legendre series is the usual way of solving neutron transport problems. Because of the large space gradients of the neutron flux, the effects of that approximation become especially remarkable in the radiation shielding calculations. In this paper, a method taking into account the scattering anisotropy is presented. From the point od view of the accuracy and computing rate, the optimal approximation of the scattering anisotropy is established for the basic protective materials on the basis of simple problem calculations. (author)
Pade approximants and the calculation of effective interactions
International Nuclear Information System (INIS)
Schucan, T.H.
1975-01-01
It is known that the series expansion of the effective interaction in nuclei diverges in practical applications due to the occurrence of low lying collective states. An approximation scheme which can be used to overcome the difficulties connected with this divergence is reviewed and it is shown that a continued fraction expansion can be used to calculate the eigenstate that has the larger overlap with the model space. An extension of this method is obtained by using Pade approximants (P.A.) which are then applied to the effective interaction, and to related matrices and matrix elements. Mathematical properties of the P.A. are discussed in light of these applications. 7 figures
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
How Harmful are Adaptation Restrictions
Bruin, de, K.C.; Dellink, R.B.
2009-01-01
The dominant assumption in economic models of climate policy remains that adaptation will be implemented in an optimal manner. There are, however, several reasons why optimal levels of adaptation may not be attainable. This paper investigates the effects of suboptimal levels of adaptation, i.e. adaptation restrictions, on the composition and level of climate change costs and on welfare. Several adaptation restrictions are identified and then simulated in a revised DICE model, extended with ad...
An approximation for kanban controlled assembly systems
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
Operator approximant problems arising from quantum theory
Maher, Philip J
2017-01-01
This book offers an account of a number of aspects of operator theory, mainly developed since the 1980s, whose problems have their roots in quantum theory. The research presented is in non-commutative operator approximation theory or, to use Halmos' terminology, in operator approximants. Focusing on the concept of approximants, this self-contained book is suitable for graduate courses.
Designing quantum information processing via structural physical approximation.
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.
33 CFR 334.870 - San Diego Harbor, Calif.; restricted area.
2010-07-01
..., Calif.; restricted area. (a) Restricted area at Bravo Pier, Naval Air Station—(1) The area. The water of... delay or loitering. On occasion, access to the bait barges may be delayed for intermittent periods not... Supply Center Pier—(1) The area. The waters of San Diego Bay extending approximately 100 feet out from...
Proposal of Realization Restricted Quantum Game with Linear Optic Method
International Nuclear Information System (INIS)
Zhao Haijun; Fang Ximing
2006-01-01
We present a quantum game with the restricted strategic space and its realization with linear optical system, which can be played by two players who are separated remotely. This game can also be realized on any other quantum computers. We find that the constraint brings some interesting properties that are useful for making game models.
Analysis of corrections to the eikonal approximation
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.
APPROXIMATION OF THE TIME TO INITIATE THE EVACUATION
Directory of Open Access Journals (Sweden)
Jiří POKORNÝ
2016-06-01
Full Text Available One of the basic prerequisites for securing the safety of people at large group events is to ensure their evacuation in case of emergencies. This article deals with the approximations of time to initiate the evacuation of persons in case of a fire at large group events organized in outdoor spaces. The solution is based on the principles of determining the period to initiate the evacuation of persons in terms of international ISO standards. Considering the specificities of the given outdoor space and possible related security measures, the article recommends the relevant sufficient amount of time to initiate an evacuation.
On exact and approximate exchange-energy densities
DEFF Research Database (Denmark)
Springborg, Michael; Dahl, Jens Peder
1999-01-01
Based on correspondence rules between quantum-mechanical operators and classical functions in phase space we construct exchange-energy densities in position space. Whereas these are not unique but depend on the chosen correspondence rule, the exchange potential is unique. We calculate this exchange......-energy density for 15 closed-shell atoms, and compare it with kinetic- and Coulomb-energy densities. It is found that it has a dominating local-density character, but electron-shell effects are recognizable. The approximate exchange-energy functionals that have been proposed so far are found to account only...
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
Mapping moveout approximations in TI media
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.
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
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
Mapping moveout approximations in TI media
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.
An Approximate Approach to Automatic Kernel Selection.
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.
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.
The Wigner transform and the semi-classical approximations
International Nuclear Information System (INIS)
Shlomo, S.
1985-01-01
The Wigner transform provides a reformulation of quantum mechanics in terms of classical concepts. Some properties of the Wigner transform of the density matrix which justify its interpretation as the quantum-mechanical analog of the classical phase-space distribution function are presented. Considering some applications, it is demonstrated that the Wigner distribution function serves as a good starting point for semi-classical approximations to properties of the (nuclear) many-body system
Adaptive ACMS: A robust localized Approximated Component Mode Synthesis Method
Madureira, Alexandre L.; Sarkis, Marcus
2017-01-01
We consider finite element methods of multiscale type to approximate solutions for two-dimensional symmetric elliptic partial differential equations with heterogeneous $L^\\infty$ coefficients. The methods are of Galerkin type and follows the Variational Multiscale and Localized Orthogonal Decomposition--LOD approaches in the sense that it decouples spaces into multiscale and fine subspaces. In a first method, the multiscale basis functions are obtained by mapping coarse basis functions, based...
Finite element approximation to a model problem of transonic flow
International Nuclear Information System (INIS)
Tangmanee, S.
1986-12-01
A model problem of transonic flow ''the Tricomi equation'' in Ω is contained in IR 2 bounded by the rectangular-curve boundary is posed in the form of symmetric positive differential equations. The finite element method is then applied. When the triangulation of Ω-bar is made of quadrilaterals and the approximation space is the Lagrange polynomial, we get the error estimates. 14 refs, 1 fig
Energy Technology Data Exchange (ETDEWEB)
Amouyal, A; Tariel, H [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires
1966-07-01
Code name: January 1{sup st} SCEA 011S. 2) Computer: IBM 7094; Programme system: Fortran II, 2{sup nd} version. 3) Nature of the problem: resolution of cell problems with one space variable (planar, spherical and cylindrical geometries) and with one energy group, with isotropic sources in the double P{sub n} approximation (DP 1 and DP 3 approximation in planar and spherical geometries, DP 1 and DP 2 in cylindrical geometry). 4) Method used: the differential equations with limiting conditions are transformed into differential system with initial conditions which are integrated by a separate-step method. 5) Restrictions: number of physical media < 100, number of geometrical regions < 100, number of points < 1000. 6) Physical approximations: limiting conditions for reflection, black body or grey body (restrictions for spherical and cylindrical geometries). The diffusion can include an isotropy term in cylindrical geometry, 2 terms in the other geometries. Taking into account of macroscopic data. 7) Duration: calculation time for a network of 100 points: planar and spherical geometry: double P 1 1 second, D P 3 = 4 seconds; cylindrical geometry: double P 1 2 seconds, D P 2 = 4 seconds. To these times should be added the 3 seconds required for the output. 8) State of the programme under production. (authors) [French] 1) Nom du Code: Janvier 1 SCEA 011S. 2) Calculateur: IBM 7094; Systeme de programmation: Fortran II version-2. 3) Nature du probleme: resolution des problemes de cellule a une variable d'espace (geometries plane, spherique et cylindrique) et un groupe d'energie, avec sources isotropes, dans l'approxirnation double P{sub n} (Approximations DP 1 et DP 3 en geometrie plane et spherique, approximations DP 1 et DP 2 en geometrie cylindrique). Methode employee: les equations differentielles avec conditions aux limites sont transformees en systemes differentiels avec conditions initiales que l'on integre par une methode a pas separes. 5) Restrictions: nombre de
Approximation of entropy solutions to degenerate nonlinear parabolic equations
Abreu, Eduardo; Colombeau, Mathilde; Panov, Evgeny Yu
2017-12-01
We approximate the unique entropy solutions to general multidimensional degenerate parabolic equations with BV continuous flux and continuous nondecreasing diffusion function (including scalar conservation laws with BV continuous flux) in the periodic case. The approximation procedure reduces, by means of specific formulas, a system of PDEs to a family of systems of the same number of ODEs in the Banach space L^∞, whose solutions constitute a weak asymptotic solution of the original system of PDEs. We establish well posedness, monotonicity and L^1-stability. We prove that the sequence of approximate solutions is strongly L^1-precompact and that it converges to an entropy solution of the original equation in the sense of Carrillo. This result contributes to justify the use of this original method for the Cauchy problem to standard multidimensional systems of fluid dynamics for which a uniqueness result is lacking.
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.
Bilinear reduced order approximate model of parabolic distributed solar collectors
Elmetennani, Shahrazed
2015-07-01
This paper proposes a novel, low dimensional and accurate approximate model for the distributed parabolic solar collector, by means of a modified gaussian interpolation along the spatial domain. The proposed reduced model, taking the form of a low dimensional bilinear state representation, enables the reproduction of the heat transfer dynamics along the collector tube for system analysis. Moreover, presented as a reduced order bilinear state space model, the well established control theory for this class of systems can be applied. The approximation efficiency has been proven by several simulation tests, which have been performed considering parameters of the Acurex field with real external working conditions. Model accuracy has been evaluated by comparison to the analytical solution of the hyperbolic distributed model and its semi discretized approximation highlighting the benefits of using the proposed numerical scheme. Furthermore, model sensitivity to the different parameters of the gaussian interpolation has been studied.
Restricted Interval Guelph permeameter: Theory and application
International Nuclear Information System (INIS)
Freifeld, Barry M.; Oldenburg, Curtis M.
2003-01-01
A constant head permeameter system has been developed for use in small diameter boreholes with any orientation. It is based upon the original Guelph permeameter concept of using a Mariotte siphon reservoir to control the applied head. The new tool, called a Restricted Interval Guelph (RIG) permeameter uses either a single pneumatic packer or straddle packer to restrict the area through which water is allowed to flow so that the borehole wetted area is independent of the applied head. The RIG permeameter has been used at Yucca Mountain, Nevada, in the nonwelded rhyolitic Paintbrush Tuff. Analysis of the acquired data is based upon saturated-unsaturated flow theory that relies upon the quasi-linear approximation to estimate field-saturated hydraulic conductivity (Kfs) and the a parameter (sorptive number) of the exponential relative hydraulic conductivity pressure head relationship. These results are compared with a numerical model based upon the solution of the Richards equation using a van Genuchten capillary pressure-saturation formulation. The numerical model incorporates laboratory capillary pressure versus saturation functions measured from cores taken from nearby boreholes. Comparison between the analytical and numerical approaches shows that the simple analytic model is valid for analyzing the data collected. Sensitivity analysis performed with the numerical model shows that the RIG permeameter is an effective tool for estimating permeability and sorptive number for the nonwelded Paintbrush Tuff
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
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.
Telomere Restriction Fragment (TRF) Analysis.
Mender, Ilgen; Shay, Jerry W
2015-11-20
While telomerase is expressed in ~90% of primary human tumors, most somatic tissue cells except transiently proliferating stem-like cells do not have detectable telomerase activity (Shay and Wright, 1996; Shay and Wright, 2001). Telomeres progressively shorten with each cell division in normal cells, including proliferating stem-like cells, due to the end replication (lagging strand synthesis) problem and other causes such as oxidative damage, therefore all somatic cells have limited cell proliferation capacity (Hayflick limit) (Hayflick and Moorhead, 1961; Olovnikov, 1973). The progressive telomere shortening eventually leads to growth arrest in normal cells, which is known as replicative senescence (Shay et al. , 1991). Once telomerase is activated in cancer cells, telomere length is stabilized by the addition of TTAGGG repeats to the end of chromosomes, thus enabling the limitless continuation of cell division (Shay and Wright, 1996; Shay and Wright, 2001). Therefore, the link between aging and cancer can be partially explained by telomere biology. There are many rapid and convenient methods to study telomere biology such as Telomere Restriction Fragment (TRF), Telomere Repeat Amplification Protocol (TRAP) (Mender and Shay, 2015b) and Telomere dysfunction Induced Foci (TIF) analysis (Mender and Shay, 2015a). In this protocol paper we describe Telomere Restriction Fragment (TRF) analysis to determine average telomeric length of cells. Telomeric length can be indirectly measured by a technique called Telomere Restriction Fragment analysis (TRF). This technique is a modified Southern blot, which measures the heterogeneous range of telomere lengths in a cell population using the length distribution of the terminal restriction fragments (Harley et al. , 1990; Ouellette et al. , 2000). This method can be used in eukaryotic cells. The description below focuses on the measurement of human cancer cells telomere length. The principle of this method relies on the lack of
Multilevel Monte Carlo in Approximate Bayesian Computation
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.
Uniform analytic approximation of Wigner rotation matrices
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.
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
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
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
Approximate maximum parsimony and ancestral maximum likelihood.
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.
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.
Multiple Scattering Model for Optical Coherence Tomography with Rytov Approximation
Li, Muxingzi
2017-04-24
Optical Coherence Tomography (OCT) is a coherence-gated, micrometer-resolution imaging technique that focuses a broadband near-infrared laser beam to penetrate into optical scattering media, e.g. biological tissues. The OCT resolution is split into two parts, with the axial resolution defined by half the coherence length, and the depth-dependent lateral resolution determined by the beam geometry, which is well described by a Gaussian beam model. The depth dependence of lateral resolution directly results in the defocusing effect outside the confocal region and restricts current OCT probes to small numerical aperture (NA) at the expense of lateral resolution near the focus. Another limitation on OCT development is the presence of a mixture of speckles due to multiple scatterers within the coherence length, and other random noise. Motivated by the above two challenges, a multiple scattering model based on Rytov approximation and Gaussian beam optics is proposed for the OCT setup. Some previous papers have adopted the first Born approximation with the assumption of small perturbation of the incident field in inhomogeneous media. The Rytov method of the same order with smooth phase perturbation assumption benefits from a wider spatial range of validity. A deconvolution method for solving the inverse problem associated with the first Rytov approximation is developed, significantly reducing the defocusing effect through depth and therefore extending the feasible range of NA.
Analytical models approximating individual processes: a validation method.
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.
Gentile statistics and restricted partitions
Indian Academy of Sciences (India)
In a recent paper (Tran et al, Ann. Phys. 311, 204 (2004)), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We generalise these results to obtain an asymptotic formula for the restricted or coloured ...
Diagonal Pade approximations for initial value problems
International Nuclear Information System (INIS)
Reusch, M.F.; Ratzan, L.; Pomphrey, N.; Park, W.
1987-06-01
Diagonal Pade approximations to the time evolution operator for initial value problems are applied in a novel way to the numerical solution of these problems by explicitly factoring the polynomials of the approximation. A remarkable gain over conventional methods in efficiency and accuracy of solution is obtained. 20 refs., 3 figs., 1 tab
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; ...
Non-Linear Approximation of Bayesian Update
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.
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 ...
Efficient automata constructions and approximate automata
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
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
Spline approximation, Part 1: Basic methodology
Ezhov, Nikolaj; Neitzel, Frank; Petrovic, Svetozar
2018-04-01
In engineering geodesy point clouds derived from terrestrial laser scanning or from photogrammetric approaches are almost never used as final results. For further processing and analysis a curve or surface approximation with a continuous mathematical function is required. In this paper the approximation of 2D curves by means of splines is treated. Splines offer quite flexible and elegant solutions for interpolation or approximation of "irregularly" distributed data. Depending on the problem they can be expressed as a function or as a set of equations that depend on some parameter. Many different types of splines can be used for spline approximation and all of them have certain advantages and disadvantages depending on the approximation problem. In a series of three articles spline approximation is presented from a geodetic point of view. In this paper (Part 1) the basic methodology of spline approximation is demonstrated using splines constructed from ordinary polynomials and splines constructed from truncated polynomials. In the forthcoming Part 2 the notion of B-spline will be explained in a unique way, namely by using the concept of convex combinations. The numerical stability of all spline approximation approaches as well as the utilization of splines for deformation detection will be investigated on numerical examples in Part 3.
Quirks of Stirling's Approximation
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
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 for stop-loss reinsurance premiums
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
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 %.
Approximate error conjugation gradient minimization methods
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.
49 CFR 215.203 - Restricted cars.
2010-10-01
... 49 Transportation 4 2010-10-01 2010-10-01 false Restricted cars. 215.203 Section 215.203..., DEPARTMENT OF TRANSPORTATION RAILROAD FREIGHT CAR SAFETY STANDARDS Restricted Equipment § 215.203 Restricted cars. (a) This section restricts the operation of any railroad freight car that is— (1) More than 50...
Approximating Fair Use in LicenseScript
Chong, C.N.; Law, Y.W.; Etalle, Sandro; Hartel, Pieter H.; Sembok, Tengku Mohd Tengku
2003-01-01
Current rights management systems are not able to enforce copyright laws because of both legal and technological reasons. The contract rights granted by a copyright owner typically restrict the users' statutory rights that are endorsed by copyright laws. In particular, Fair Use allows these
Diliberto–Straus algorithm for the uniform approximation by a sum of ...
Indian Academy of Sciences (India)
AIDA KH ASGAROVA
uniform approximation of a bivariate function, defined on a rectangle with ... Let U and V be subspaces of a Banach space having central proximity ..... that this idea can be useful in future attempts to prove the convergence of the Diliberto–.
Efficient anisotropic quasi-P wavefield extrapolation using an isotropic low-rank approximation
Zhang, Zhendong; Liu, Yike; Alkhalifah, Tariq Ali; Wu, Zedong
2017-01-01
efficient. A dynamic implementation of this approach decomposes the original pseudo-differential operator into a Laplacian, handled using the low-rank approximation of the spectral operator, plus an angular dependent correction factor applied in the space
International Nuclear Information System (INIS)
Shvets', D.V.
2009-01-01
By the first approximation analyzing stability conditions of unperturbed solution of one-dimensional dynamic model with magnetic interaction between two superconducting rings obtained. The stability region in the frozen magnetic flux parameters space was constructed.
Giuliani, Matteo; Mason, Emanuele; Castelletti, Andrea; Pianosi, Francesca
2014-05-01
The optimal operation of water resources systems is a wide and challenging problem due to non-linearities in the model and the objectives, high dimensional state-control space, and strong uncertainties in the hydroclimatic regimes. The application of classical optimization techniques (e.g., SDP, Q-learning, gradient descent-based algorithms) is strongly limited by the dimensionality of the system and by the presence of multiple, conflicting objectives. This study presents a novel approach which combines Direct Policy Search (DPS) and Multi-Objective Evolutionary Algorithms (MOEAs) to solve high-dimensional state and control space problems involving multiple objectives. DPS, also known as parameterization-simulation-optimization in the water resources literature, is a simulation-based approach where the reservoir operating policy is first parameterized within a given family of functions and, then, the parameters optimized with respect to the objectives of the management problem. The selection of a suitable class of functions to which the operating policy belong to is a key step, as it might restrict the search for the optimal policy to a subspace of the decision space that does not include the optimal solution. In the water reservoir literature, a number of classes have been proposed. However, many of these rules are based largely on empirical or experimental successes and they were designed mostly via simulation and for single-purpose reservoirs. In a multi-objective context similar rules can not easily inferred from the experience and the use of universal function approximators is generally preferred. In this work, we comparatively analyze two among the most common universal approximators: artificial neural networks (ANN) and radial basis functions (RBF) under different problem settings to estimate their scalability and flexibility in dealing with more and more complex problems. The multi-purpose HoaBinh water reservoir in Vietnam, accounting for hydropower
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...
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...
Hardness and Approximation for Network Flow Interdiction
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)}...
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.
Mathematical analysis, approximation theory and their applications
Gupta, Vijay
2016-01-01
Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.
Efficient characterization of phase space mapping in axially symmetric optical systems
Barbero, Sergio; Portilla, Javier
2018-01-01
Phase space mapping, typically between an object and image plane, characterizes an optical system within a geometrical optics framework. We propose a novel conceptual frame to characterize the phase mapping in axially symmetric optical systems for arbitrary object locations, not restricted to a specific object plane. The idea is based on decomposing the phase mapping into a set of bivariate equations corresponding to different values of the radial coordinate on a specific object surface (most likely the entrance pupil). These equations are then approximated through bivariate Chebyshev interpolation at Chebyshev nodes, which guarantees uniform convergence. Additionally, we propose the use of a new concept (effective object phase space), defined as the set of points of the phase space at the first optical element (typically the entrance pupil) that are effectively mapped onto the image surface. The effective object phase space provides, by means of an inclusion test, a way to avoid tracing rays that do not reach the image surface.
Directory of Open Access Journals (Sweden)
Berenguer MI
2010-01-01
Full Text Available This paper deals with obtaining a numerical method in order to approximate the solution of the nonlinear Volterra integro-differential equation. We define, following a fixed-point approach, a sequence of functions which approximate the solution of this type of equation, due to some properties of certain biorthogonal systems for the Banach spaces and .
Directory of Open Access Journals (Sweden)
Meili Li
2015-01-01
Full Text Available The approximate controllability of semilinear neutral stochastic integrodifferential inclusions with infinite delay in an abstract space is studied. Sufficient conditions are established for the approximate controllability. The results are obtained by using the theory of analytic resolvent operator, the fractional power theory, and the theorem of nonlinear alternative for Kakutani maps. Finally, an example is provided to illustrate the theory.
Multilevel weighted least squares polynomial approximation
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
Low Rank Approximation Algorithms, Implementation, Applications
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; ...
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.
Euclidean shortest paths exact or approximate algorithms
Li, Fajie
2014-01-01
This book reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms. The coverage includes mathematical proofs for many of the given statements.
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)
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)
Saddlepoint approximation methods in financial engineering
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...
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
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
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.
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.
International Nuclear Information System (INIS)
Agazzi, A.; Gavazzi, C.; Vincenti, E.; Monterosso, R.
1964-01-01
1 - Nature of physical problem solved: The programme studies the spatial dynamics of reactor TESI, in the two group and one space dimension approximation. Only one group of delayed neutrons is considered. The programme simulates the vertical movement of the control rods according to any given movement law. The programme calculates the evolution of the fluxes and temperature and precursor concentration in space and time during the power excursion. 2 - Restrictions on the complexity of the problem: The maximum number of lattice points is 100
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
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.)
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....
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)
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
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.)
On the Distribution of Zeros and Poles of Rational Approximants on Intervals
Directory of Open Access Journals (Sweden)
V. V. Andrievskii
2012-01-01
Full Text Available The distribution of zeros and poles of best rational approximants is well understood for the functions (=||, >0. If ∈[−1,1] is not holomorphic on [−1,1], the distribution of the zeros of best rational approximants is governed by the equilibrium measure of [−1,1] under the additional assumption that the rational approximants are restricted to a bounded degree of the denominator. This phenomenon was discovered first for polynomial approximation. In this paper, we investigate the asymptotic distribution of zeros, respectively, -values, and poles of best real rational approximants of degree at most to a function ∈[−1,1] that is real-valued, but not holomorphic on [−1,1]. Generalizations to the lower half of the Walsh table are indicated.
Approximating centrality in evolving graphs: toward sublinearity
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.
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
Approximate representation of optimal strategies from influence diagrams
DEFF Research Database (Denmark)
Jensen, Finn V.
2008-01-01
, and where the policy functions for the decisions have so large do- mains that they cannot be represented directly in a strategy tree. The approach is to have separate ID representations for each decision variable. In each representation the actual information is fully exploited, however the representation...... of policies for future decisions are approximations. We call the approximation information abstraction. It consists in introducing a dummy structure connecting the past with the decision. We study how to specify, implement and learn information abstraction.......There are three phases in the life of a decision problem, specification, solution, and rep- resentation of solution. The specification and solution phases are off-line, while the rep- resention of solution often shall serve an on-line situation with rather tough constraints on time and space. One...
Monte Carlo Euler approximations of HJM term structure financial models
Björk, Tomas
2012-11-22
We present Monte Carlo-Euler methods for a weak approximation problem related to the Heath-Jarrow-Morton (HJM) term structure model, based on Itô stochastic differential equations in infinite dimensional spaces, and prove strong and weak error convergence estimates. The weak error estimates are based on stochastic flows and discrete dual backward problems, and they can be used to identify different error contributions arising from time and maturity discretization as well as the classical statistical error due to finite sampling. Explicit formulas for efficient computation of sharp error approximation are included. Due to the structure of the HJM models considered here, the computational effort devoted to the error estimates is low compared to the work to compute Monte Carlo solutions to the HJM model. Numerical examples with known exact solution are included in order to show the behavior of the estimates. © 2012 Springer Science+Business Media Dordrecht.
Monte Carlo Euler approximations of HJM term structure financial models
Bjö rk, Tomas; Szepessy, Anders; Tempone, Raul; Zouraris, Georgios E.
2012-01-01
We present Monte Carlo-Euler methods for a weak approximation problem related to the Heath-Jarrow-Morton (HJM) term structure model, based on Itô stochastic differential equations in infinite dimensional spaces, and prove strong and weak error convergence estimates. The weak error estimates are based on stochastic flows and discrete dual backward problems, and they can be used to identify different error contributions arising from time and maturity discretization as well as the classical statistical error due to finite sampling. Explicit formulas for efficient computation of sharp error approximation are included. Due to the structure of the HJM models considered here, the computational effort devoted to the error estimates is low compared to the work to compute Monte Carlo solutions to the HJM model. Numerical examples with known exact solution are included in order to show the behavior of the estimates. © 2012 Springer Science+Business Media Dordrecht.
Local Approximation and Hierarchical Methods for Stochastic Optimization
Cheng, Bolong
In this thesis, we present local and hierarchical approximation methods for two classes of stochastic optimization problems: optimal learning and Markov decision processes. For the optimal learning problem class, we introduce a locally linear model with radial basis function for estimating the posterior mean of the unknown objective function. The method uses a compact representation of the function which avoids storing the entire history, as is typically required by nonparametric methods. We derive a knowledge gradient policy with the locally parametric model, which maximizes the expected value of information. We show the policy is asymptotically optimal in theory, and experimental works suggests that the method can reliably find the optimal solution on a range of test functions. For the Markov decision processes problem class, we are motivated by an application where we want to co-optimize a battery for multiple revenue, in particular energy arbitrage and frequency regulation. The nature of this problem requires the battery to make charging and discharging decisions at different time scales while accounting for the stochastic information such as load demand, electricity prices, and regulation signals. Computing the exact optimal policy becomes intractable due to the large state space and the number of time steps. We propose two methods to circumvent the computation bottleneck. First, we propose a nested MDP model that structure the co-optimization problem into smaller sub-problems with reduced state space. This new model allows us to understand how the battery behaves down to the two-second dynamics (that of the frequency regulation market). Second, we introduce a low-rank value function approximation for backward dynamic programming. This new method only requires computing the exact value function for a small subset of the state space and approximate the entire value function via low-rank matrix completion. We test these methods on historical price data from the
An approximate methods approach to probabilistic structural analysis
Mcclung, R. C.; Millwater, H. R.; Wu, Y.-T.; Thacker, B. H.; Burnside, O. H.
1989-01-01
A probabilistic structural analysis method (PSAM) is described which makes an approximate calculation of the structural response of a system, including the associated probabilistic distributions, with minimal computation time and cost, based on a simplified representation of the geometry, loads, and material. The method employs the fast probability integration (FPI) algorithm of Wu and Wirsching. Typical solution strategies are illustrated by formulations for a representative critical component chosen from the Space Shuttle Main Engine (SSME) as part of a major NASA-sponsored program on PSAM. Typical results are presented to demonstrate the role of the methodology in engineering design and analysis.
Fuzzy Universal Model Approximator for Distributed Solar Collector Field Control
Elmetennani, Shahrazed
2014-07-01
This paper deals with the control of concentrating parabolic solar collectors by forcing the outlet oil temperature to track a set reference. A fuzzy universal approximate model is introduced in order to accurately reproduce the behavior of the system dynamics. The proposed model is a low order state space representation derived from the partial differential equation describing the oil temperature evolution using fuzzy transform theory. The resulting set of ordinary differential equations simplifies the system analysis and the control law design and is suitable for real time control implementation. Simulation results show good performance of the proposed model.
Black hole equations of motion in the quasistationary approximation
International Nuclear Information System (INIS)
Zhdanov, V.I.; Shtelen', V.M.
1980-01-01
Black hole motion is considered under the effect of external actions from the point of view of a remoted observer. The shift of the black hole and the metrix structure are found at the presence of other gravitational bodies using the Zerilli equation. It is shown that in the region, where the space curvature is small, the contribution of the field of the black hole, moving with acceleration, coincides in configuration with the field of usual body, black hole motion in quasistationary approximation occuring according to laws of Newtonian dynamics
Particle in a standing wave field; beyond the oscillation center approximation
International Nuclear Information System (INIS)
Schmidt, G.
1982-01-01
The ponderomotive force arises in plasma physics as a weak field approximation on particle dynamics. Recent advances in stochasticity theory lead to the conclusion that for sufficiently strong fields, the ponderomotive potential well disappears, and significant portions of phase space are filled with stochastic trajectories. This is illustrated by numerically studying the phase space behavior of the oscillation center. (author)
Ghose, Ranajeet; Fushman, David; Cowburn, David
2001-04-01
In this paper we present a method for determining the rotational diffusion tensor from NMR relaxation data using a combination of approximate and exact methods. The approximate method, which is computationally less intensive, computes values of the principal components of the diffusion tensor and estimates the Euler angles, which relate the principal axis frame of the diffusion tensor to the molecular frame. The approximate values of the principal components are then used as starting points for an exact calculation by a downhill simplex search for the principal components of the tensor over a grid of the space of Euler angles relating the diffusion tensor frame to the molecular frame. The search space of Euler angles is restricted using the tensor orientations calculated using the approximate method. The utility of this approach is demonstrated using both simulated and experimental relaxation data. A quality factor that determines the extent of the agreement between the measured and predicted relaxation data is provided. This approach is then used to estimate the relative orientation of SH3 and SH2 domains in the SH(32) dual-domain construct of Abelson kinase complexed with a consolidated ligand.
Ghose, R; Fushman, D; Cowburn, D
2001-04-01
In this paper we present a method for determining the rotational diffusion tensor from NMR relaxation data using a combination of approximate and exact methods. The approximate method, which is computationally less intensive, computes values of the principal components of the diffusion tensor and estimates the Euler angles, which relate the principal axis frame of the diffusion tensor to the molecular frame. The approximate values of the principal components are then used as starting points for an exact calculation by a downhill simplex search for the principal components of the tensor over a grid of the space of Euler angles relating the diffusion tensor frame to the molecular frame. The search space of Euler angles is restricted using the tensor orientations calculated using the approximate method. The utility of this approach is demonstrated using both simulated and experimental relaxation data. A quality factor that determines the extent of the agreement between the measured and predicted relaxation data is provided. This approach is then used to estimate the relative orientation of SH3 and SH2 domains in the SH(32) dual-domain construct of Abelson kinase complexed with a consolidated ligand. Copyright 2001 Academic Press.
Efficient Method to Approximately Solve Retrial Systems with Impatience
Directory of Open Access Journals (Sweden)
Jose Manuel Gimenez-Guzman
2012-01-01
Full Text Available We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it considers the system in its Markov Decision Process setting. This technique, known as value extrapolation, truncates the infinite state space using a polynomial extrapolation method to approach the states outside the truncated state space. A numerical evaluation is carried out to evaluate this technique and to compare its performance with previous techniques. The obtained results show that value extrapolation greatly outperforms the previous approaches appeared in the literature not only in terms of accuracy but also in terms of computational cost.
Trajectory averaging for stochastic approximation MCMC algorithms
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.
'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
Semiclassical initial value approximation for Green's function.
Kay, Kenneth G
2010-06-28
A semiclassical initial value approximation is obtained for the energy-dependent Green's function. For a system with f degrees of freedom the Green's function expression has the form of a (2f-1)-dimensional integral over points on the energy surface and an integral over time along classical trajectories initiated from these points. This approximation is derived by requiring an integral ansatz for Green's function to reduce to Gutzwiller's semiclassical formula when the integrations are performed by the stationary phase method. A simpler approximation is also derived involving only an (f-1)-dimensional integral over momentum variables on a Poincare surface and an integral over time. The relationship between the present expressions and an earlier initial value approximation for energy eigenfunctions is explored. Numerical tests for two-dimensional systems indicate that good accuracy can be obtained from the initial value Green's function for calculations of autocorrelation spectra and time-independent wave functions. The relative advantages of initial value approximations for the energy-dependent Green's function and the time-dependent propagator are discussed.
Approximate Bayesian evaluations of measurement uncertainty
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.
Rurality study of restricted areas
Directory of Open Access Journals (Sweden)
Sergio Rivaroli
2011-02-01
Full Text Available Two main perspectives of investigation emerge from the study of a territory’s rurality: a geographical approach and a sociological approach. The research examines the sub-regional study case of ‘Nuovo circondario imolese’. The analysis shows that the combination of traditional institutional criteria with detailed informations about the territory, generates more accurate results which determine a better comprehension of the characteristics of restricted areas’ rurality. Over the period 1991-2001, the study highlights an increase in rural areas. This result could be interpreted as an effect of urban sprawl’s intensification, that increases the competition between non-farm residences and agricultural activities.
Uniform Boundedness for Approximations of the Identity with Nondoubling Measures
Directory of Open Access Journals (Sweden)
Dongyong Yang
2007-10-01
Full Text Available Let ÃŽÂ¼ be a nonnegative Radon measure on Ã¢Â„Âd which satisfies the growth condition that there exist constants C0>0 and nÃ¢ÂˆÂˆ(0,d] such that for all xÃ¢ÂˆÂˆÃ¢Â„Âd and r>0, ÃŽÂ¼(B(x,rÃ¢Â‰Â¤C0rn, where B(x,r is the open ball centered at x and having radius r. In this paper, the authors establish the uniform boundedness for approximations of the identity introduced by Tolsa in the Hardy space H1(ÃŽÂ¼ and the BLO-type space RBLO (ÃŽÂ¼. Moreover, the authors also introduce maximal operators Ã¢Â„Â³.s (homogeneous and Ã¢Â„Â³s (inhomogeneous associated with a given approximation of the identity S, and prove that Ã¢Â„Â³.s is bounded from H1(ÃŽÂ¼ to L1(ÃŽÂ¼ and Ã¢Â„Â³s is bounded from the local atomic Hardy space hatb1,Ã¢ÂˆÂž(ÃŽÂ¼ to L1(ÃŽÂ¼. These results are proved to play key roles in establishing relations between H1(ÃŽÂ¼ and hatb1,Ã¢ÂˆÂž(ÃŽÂ¼, BMO-type spaces RBMO (ÃŽÂ¼ and rbmo (ÃŽÂ¼ as well as RBLO (ÃŽÂ¼ and rblo (ÃŽÂ¼, and also in characterizing rbmo (ÃŽÂ¼ and rblo (ÃŽÂ¼.
Smooth function approximation using neural networks.
Ferrari, Silvia; Stengel, Robert F
2005-01-01
An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.
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
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
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.
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.
On Born approximation in black hole scattering
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.
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
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
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)
Resummation of perturbative QCD by pade approximants
International Nuclear Information System (INIS)
Gardi, E.
1997-01-01
In this lecture I present some of the new developments concerning the use of Pade Approximants (PA's) for resuming perturbative series in QCD. It is shown that PA's tend to reduce the renormalization scale and scheme dependence as compared to truncated series. In particular it is proven that in the limit where the β function is dominated by the 1-loop contribution, there is an exact symmetry that guarantees invariance of diagonal PA's under changing the renormalization scale. In addition it is shown that in the large β 0 approximation diagonal PA's can be interpreted as a systematic method for approximating the flow of momentum in Feynman diagrams. This corresponds to a new multiple scale generalization of the Brodsky-Lepage-Mackenzie (BLM) method to higher orders. I illustrate the method with the Bjorken sum rule and the vacuum polarization function. (author)
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.
Parenting and restrictions in childhood epilepsy
Rodenburg, R.; Meijer, A.M.; Scherphof, C.; Carpay, J.A.; Augustijn, P.; Aldenkamp, A.P.; Deković, M.
2013-01-01
Purpose: From the overprotection literature, the predictive and interactional (moderation) effects of controlling and indulgent parenting on restrictions in children with epilepsy were examined. Methods: Parents of 73 children with epilepsy completed questionnaires on parenting, restrictions, and
Finite approximations in discrete-time stochastic control quantized models and asymptotic optimality
Saldi, Naci; Yüksel, Serdar
2018-01-01
In a unified form, this monograph presents fundamental results on the approximation of centralized and decentralized stochastic control problems, with uncountable state, measurement, and action spaces. It demonstrates how quantization provides a system-independent and constructive method for the reduction of a system with Borel spaces to one with finite state, measurement, and action spaces. In addition to this constructive view, the book considers both the information transmission approach for discretization of actions, and the computational approach for discretization of states and actions. Part I of the text discusses Markov decision processes and their finite-state or finite-action approximations, while Part II builds from there to finite approximations in decentralized stochastic control problems. This volume is perfect for researchers and graduate students interested in stochastic controls. With the tools presented, readers will be able to establish the convergence of approximation models to original mo...
Approximation by Chebyshevian Bernstein Operators versus Convergence of Dimension Elevation
Ait-Haddou, Rachid; Mazure, Marie-Laurence
2016-01-01
On a closed bounded interval, consider a nested sequence of Extended Chebyshev spaces possessing Bernstein bases. This situation automatically generates an infinite dimension elevation algorithm transforming control polygons of any given level into control polygons of the next level. The convergence of these infinite sequences of polygons towards the corresponding curves is a classical issue in computer-aided geometric design. Moreover, according to recent work proving the existence of Bernstein-type operators in such Extended Chebyshev spaces, this nested sequence is automatically associated with an infinite sequence of Bernstein operators which all reproduce the same two-dimensional space. Whether or not this sequence of operators converges towards the identity on the space of all continuous functions is a natural issue in approximation theory. In the present article, we prove that the two issues are actually equivalent. Not only is this result interesting on the theoretical side, but it also has practical implications. For instance, it provides us with a Korovkin-type theorem of convergence of any infinite dimension elevation algorithm. It also enables us to tackle the question of convergence of the dimension elevation algorithm for any nested sequence obtained by repeated integration of the kernel of a given linear differential operator with constant coefficients. © 2016 Springer Science+Business Media New York
Approximation by Chebyshevian Bernstein Operators versus Convergence of Dimension Elevation
Ait-Haddou, Rachid
2016-03-18
On a closed bounded interval, consider a nested sequence of Extended Chebyshev spaces possessing Bernstein bases. This situation automatically generates an infinite dimension elevation algorithm transforming control polygons of any given level into control polygons of the next level. The convergence of these infinite sequences of polygons towards the corresponding curves is a classical issue in computer-aided geometric design. Moreover, according to recent work proving the existence of Bernstein-type operators in such Extended Chebyshev spaces, this nested sequence is automatically associated with an infinite sequence of Bernstein operators which all reproduce the same two-dimensional space. Whether or not this sequence of operators converges towards the identity on the space of all continuous functions is a natural issue in approximation theory. In the present article, we prove that the two issues are actually equivalent. Not only is this result interesting on the theoretical side, but it also has practical implications. For instance, it provides us with a Korovkin-type theorem of convergence of any infinite dimension elevation algorithm. It also enables us to tackle the question of convergence of the dimension elevation algorithm for any nested sequence obtained by repeated integration of the kernel of a given linear differential operator with constant coefficients. © 2016 Springer Science+Business Media New York
THE ISOTROPIC DIFFUSION SOURCE APPROXIMATION FOR SUPERNOVA NEUTRINO TRANSPORT
International Nuclear Information System (INIS)
Liebendoerfer, M.; Whitehouse, S. C.; Fischer, T.
2009-01-01
Astrophysical observations originate from matter that interacts with radiation or transported particles. We develop a pragmatic approximation in order to enable multidimensional simulations with basic spectral radiative transfer when the available computational resources are not sufficient to solve the complete Boltzmann transport equation. The distribution function of the transported particles is decomposed into a trapped particle component and a streaming particle component. Their separate evolution equations are coupled by a source term that converts trapped particles into streaming particles. We determine this source term by requiring the correct diffusion limit for the evolution of the trapped particle component. For a smooth transition to the free streaming regime, this 'diffusion source' is limited by the matter emissivity. The resulting streaming particle emission rates are integrated over space to obtain the streaming particle flux. Finally, a geometric estimate of the flux factor is used to convert the particle flux to the streaming particle density, which enters the evaluation of streaming particle-matter interactions. The efficiency of the scheme results from the freedom to use different approximations for each particle component. In supernovae, for example, reactions with trapped particles on fast timescales establish equilibria that reduce the number of primitive variables required to evolve the trapped particle component. On the other hand, a stationary-state approximation considerably facilitates the treatment of the streaming particle component. Different approximations may apply in applications to stellar atmospheres, star formation, or cosmological radiative transfer. We compare the isotropic diffusion source approximation with Boltzmann neutrino transport of electron flavor neutrinos in spherically symmetric supernova models and find good agreement. An extension of the scheme to the multidimensional case is also discussed.
An Approximate L p Difference Algorithm for Massive Data Streams
Directory of Open Access Journals (Sweden)
Jessica H. Fong
2001-12-01
Full Text Available Several recent papers have shown how to approximate the difference ∑ i |a i-b i | or ∑|a i-b i | 2 between two functions, when the function values a i and b i are given in a data stream, and their order is chosen by an adversary. These algorithms use little space (much less than would be needed to store the entire stream and little time to process each item in the stream. They approximate with small relative error. Using different techniques, we show how to approximate the L p-difference ∑ i |a i-b i | p for any rational-valued p∈(0,2], with comparable efficiency and error. We also show how to approximate ∑ i |a i-b i | p for larger values of p but with a worse error guarantee. Our results fill in gaps left by recent work, by providing an algorithm that is precisely tunable for the application at hand. These results can be used to assess the difference between two chronologically or physically separated massive data sets, making one quick pass over each data set, without buffering the data or requiring the data source to pause. For example, one can use our techniques to judge whether the traffic on two remote network routers are similar without requiring either router to transmit a copy of its traffic. A web search engine could use such algorithms to construct a library of small ``sketches,'' one for each distinct page on the web; one can approximate the extent to which new web pages duplicate old ones by comparing the sketches of the web pages. Such techniques will become increasingly important as the enormous scale, distributional nature, and one-pass processing requirements of data sets become more commonplace.
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
Approximate Inference and Deep Generative Models
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.
Unambiguous results from variational matrix Pade approximants
International Nuclear Information System (INIS)
Pindor, Maciej.
1979-10-01
Variational Matrix Pade Approximants are studied as a nonlinear variational problem. It is shown that although a stationary value of the Schwinger functional is a stationary value of VMPA, the latter has also another stationary value. It is therefore proposed that instead of looking for a stationary point of VMPA, one minimizes some non-negative functional and then one calculates VMPA at the point where the former has the absolute minimum. This approach, which we call the Method of the Variational Gradient (MVG) gives unambiguous results and is also shown to minimize a distance between the approximate and the exact stationary values of the Schwinger functional
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.
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.
On the dipole approximation with error estimates
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.
Congruence Approximations for Entrophy Endowed Hyperbolic Systems
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.
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...
Augmenting Ordinal Methods of Attribute Weight Approximation
DEFF Research Database (Denmark)
Daneilson, Mats; Ekenberg, Love; He, Ying
2014-01-01
of the obstacles and methods for introducing so-called surrogate weights have proliferated in the form of ordinal ranking methods for criteria weights. Considering the decision quality, one main problem is that the input information allowed in ordinal methods is sometimes too restricted. At the same time, decision...... makers often possess more background information, for example, regarding the relative strengths of the criteria, and might want to use that. We propose combined methods for facilitating the elicitation process and show how this provides a way to use partial information from the strength of preference...
2010-10-01
... the skills test and the restriction, air brakes shall include any braking system operating fully or...; REQUIREMENTS AND PENALTIES Vehicle Groups and Endorsements § 383.95 Restrictions. (a) Air brake restrictions... skills test in a vehicle not equipped with air brakes, the State must indicate on the CDL, if issued...
9 CFR 92.3 - Movement restrictions.
2010-01-01
... 9 Animals and Animal Products 1 2010-01-01 2010-01-01 false Movement restrictions. 92.3 Section 92... ANIMAL PRODUCTS: PROCEDURES FOR REQUESTING RECOGNITION OF REGIONS § 92.3 Movement restrictions. Whenever... exist and the EC imposes prohibitions or other restrictions on the movement of animals or animal...
21 CFR 203.20 - Sales restrictions.
2010-04-01
... 21 Food and Drugs 4 2010-04-01 2010-04-01 false Sales restrictions. 203.20 Section 203.20 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) DRUGS: GENERAL PRESCRIPTION DRUG MARKETING Sales Restrictions § 203.20 Sales restrictions. Except as provided in § 203.22 or...
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying
2015-01-01
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
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.)
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.
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.
Intrinsic Diophantine approximation on general polynomial surfaces
DEFF Research Database (Denmark)
Tiljeset, Morten Hein
2017-01-01
We study the Hausdorff measure and dimension of the set of intrinsically simultaneously -approximable points on a curve, surface, etc, given as a graph of integer polynomials. We obtain complete answers to these questions for algebraically “nice” manifolds. This generalizes earlier work done...
Perturbation of operators and approximation of spectrum
Indian Academy of Sciences (India)
outside the bounds of essential spectrum of A(x) can be approximated ... some perturbed discrete Schrödinger operators treating them as block ...... particular, one may think of estimating the spectrum and spectral gaps of Schrödinger.
Quasilinear theory without the random phase approximation
International Nuclear Information System (INIS)
Weibel, E.S.; Vaclavik, J.
1980-08-01
The system of quasilinear equations is derived without making use of the random phase approximation. The fluctuating quantities are described by the autocorrelation function of the electric field using the techniques of Fourier analysis. The resulting equations posses the necessary conservation properties, but comprise new terms which hitherto have been lost in the conventional derivations
Rational approximations and quantum algorithms with postselection
Mahadev, U.; de Wolf, R.
2015-01-01
We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using post-selection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We
Padé approximations and diophantine geometry.
Chudnovsky, D V; Chudnovsky, G V
1985-04-01
Using methods of Padé approximations we prove a converse to Eisenstein's theorem on the boundedness of denominators of coefficients in the expansion of an algebraic function, for classes of functions, parametrized by meromorphic functions. This result is applied to the Tate conjecture on the effective description of isogenies for elliptic curves.
Function approximation with polynomial regression slines
International Nuclear Information System (INIS)
Urbanski, P.
1996-01-01
Principles of the polynomial regression splines as well as algorithms and programs for their computation are presented. The programs prepared using software package MATLAB are generally intended for approximation of the X-ray spectra and can be applied in the multivariate calibration of radiometric gauges. (author)
Approximation Algorithms for Model-Based Diagnosis
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
On the parametric approximation in quantum optics
Energy Technology Data Exchange (ETDEWEB)
D' Ariano, G.M.; Paris, M.G.A.; Sacchi, M.F. [Istituto Nazionale di Fisica Nucleare, Pavia (Italy); Pavia Univ. (Italy). Dipt. di Fisica ' Alessandro Volta'
1999-03-01
The authors perform the exact numerical diagonalization of Hamiltonians that describe both degenerate and nondegenerate parametric amplifiers, by exploiting the conservation laws pertaining each device. It is clarify the conditions under which the parametric approximation holds, showing that the most relevant requirements is the coherence of the pump after the interaction, rather than its un depletion.
On the parametric approximation in quantum optics
International Nuclear Information System (INIS)
D'Ariano, G.M.; Paris, M.G.A.; Sacchi, M.F.; Pavia Univ.
1999-01-01
The authors perform the exact numerical diagonalization of Hamiltonians that describe both degenerate and nondegenerate parametric amplifiers, by exploiting the conservation laws pertaining each device. It is clarify the conditions under which the parametric approximation holds, showing that the most relevant requirements is the coherence of the pump after the interaction, rather than its un depletion
Uniform semiclassical approximation for absorptive scattering systems
International Nuclear Information System (INIS)
Hussein, M.S.; Pato, M.P.
1987-07-01
The uniform semiclassical approximation of the elastic scattering amplitude is generalized to absorptive systems. An integral equation is derived which connects the absorption modified amplitude to the absorption free one. Division of the amplitude into a diffractive and refractive components is then made possible. (Author) [pt
Tension and Approximation in Poetic Translation
Al-Shabab, Omar A. S.; Baka, Farida H.
2015-01-01
Simple observation reveals that each language and each culture enjoys specific linguistic features and rhetorical traditions. In poetry translation difference and the resultant linguistic tension create a gap between Source Language and Target language, a gap that needs to be bridged by creating an approximation processed through the translator's…
Variational Gaussian approximation for Poisson data
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.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-11-30
We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.
Multilevel Monte Carlo in Approximate Bayesian Computation
Jasra, Ajay; Jo, Seongil; Nott, David; Shoemaker, Christine; Tempone, Raul
2017-01-01
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.
Multidimensional stochastic approximation using locally contractive functions
Lawton, W. M.
1975-01-01
A Robbins-Monro type multidimensional stochastic approximation algorithm which converges in mean square and with probability one to the fixed point of a locally contractive regression function is developed. The algorithm is applied to obtain maximum likelihood estimates of the parameters for a mixture of multivariate normal distributions.
Pade approximant calculations for neutron escape probability
International Nuclear Information System (INIS)
El Wakil, S.A.; Saad, E.A.; Hendi, A.A.
1984-07-01
The neutron escape probability from a non-multiplying slab containing internal source is defined in terms of a functional relation for the scattering function for the diffuse reflection problem. The Pade approximant technique is used to get numerical results which compare with exact results. (author)
Optical bistability without the rotating wave approximation
Energy Technology Data Exchange (ETDEWEB)
Sharaby, Yasser A., E-mail: Yasser_Sharaby@hotmail.co [Physics Department, Faculty of Applied Sciences, Suez Canal University, Suez (Egypt); Joshi, Amitabh, E-mail: ajoshi@eiu.ed [Department of Physics, Eastern Illinois University, Charleston, IL 61920 (United States); Hassan, Shoukry S., E-mail: Shoukryhassan@hotmail.co [Mathematics Department, College of Science, University of Bahrain, P.O. Box 32038 (Bahrain)
2010-04-26
Optical bistability for two-level atomic system in a ring cavity is investigated outside the rotating wave approximation (RWA) using non-autonomous Maxwell-Bloch equations with Fourier decomposition up to first harmonic. The first harmonic output field component exhibits reversed or closed loop bistability simultaneously with the usual (anti-clockwise) bistability in the fundamental field component.
Optical bistability without the rotating wave approximation
International Nuclear Information System (INIS)
Sharaby, Yasser A.; Joshi, Amitabh; Hassan, Shoukry S.
2010-01-01
Optical bistability for two-level atomic system in a ring cavity is investigated outside the rotating wave approximation (RWA) using non-autonomous Maxwell-Bloch equations with Fourier decomposition up to first harmonic. The first harmonic output field component exhibits reversed or closed loop bistability simultaneously with the usual (anti-clockwise) bistability in the fundamental field component.
Lognormal Approximations of Fault Tree Uncertainty Distributions.
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.
A rational approximation of the effectiveness factor
DEFF Research Database (Denmark)
Wedel, Stig; Luss, Dan
1980-01-01
A fast, approximate method of calculating the effectiveness factor for arbitrary rate expressions is presented. The method does not require any iterative or interpolative calculations. It utilizes the well known asymptotic behavior for small and large Thiele moduli to derive a rational function...
Decision-theoretic troubleshooting: Hardness of approximation
Czech Academy of Sciences Publication Activity Database
Lín, Václav
2014-01-01
Roč. 55, č. 4 (2014), s. 977-988 ISSN 0888-613X R&D Projects: GA ČR GA13-20012S Institutional support: RVO:67985556 Keywords : Decision-theoretic troubleshooting * Hardness of approximation * NP-completeness Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.451, year: 2014
Approximate solution methods in engineering mechanics
International Nuclear Information System (INIS)
Boresi, A.P.; Cong, K.P.
1991-01-01
This is a short book of 147 pages including references and sometimes bibliographies at the end of each chapter, and subject and author indices at the end of the book. The test includes an introduction of 3 pages, 29 pages explaining approximate analysis, 41 pages on finite differences, 36 pages on finite elements, and 17 pages on specialized methods
Resonances, scattering theory and rigged Hilbert spaces
International Nuclear Information System (INIS)
Parravicini, G.; Gorini, V.; Sudarshan, E.C.G.
1979-01-01
The problem of decaying states and resonances is examined within the framework of scattering theory in a rigged Hilbert space formalism. The stationary free, in, and out eigenvectors of formal scattering theory, which have a rigorous setting in rigged Hilbert space, are considered to be analytic functions of the energy eigenvalue. The value of these analytic functions at any point of regularity, real or complex, is an eigenvector with eigenvalue equal to the position of the point. The poles of the eigenvector families give origin to other eigenvectors of the Hamiltonian; the singularities of the out eigenvector family are the same as those of the continued S matrix, so that resonances are seen as eigenvectors of the Hamiltonian with eigenvalue equal to their location in the complex energy plane. Cauchy theorem then provides for expansions in terms of complete sets of eigenvectors with complex eigenvalues of the Hamiltonian. Applying such expansions to the survival amplitude of a decaying state, one finds that resonances give discrete contributions with purely exponential time behavior; the background is of course present, but explicitly separated. The resolvent of the Hamiltonian, restricted to the nuclear space appearing in the rigged Hilbert space, can be continued across the absolutely continuous spectrum; the singularities of the continuation are the same as those of the out eigenvectors. The free, in and out eigenvectors with complex eigenvalues and those corresponding to resonances can be approximated by physical vectors in the Hilbert space, as plane waves can. The need for having some further physical information in addition to the specification of the total Hamiltonian is apparent in the proposed framework. The formalism is applied to the Lee-Friedrichs model. 48 references
New realisation of Preisach model using adaptive polynomial approximation
Liu, Van-Tsai; Lin, Chun-Liang; Wing, Home-Young
2012-09-01
Modelling system with hysteresis has received considerable attention recently due to the increasing accurate requirement in engineering applications. The classical Preisach model (CPM) is the most popular model to demonstrate hysteresis which can be represented by infinite but countable first-order reversal curves (FORCs). The usage of look-up tables is one way to approach the CPM in actual practice. The data in those tables correspond with the samples of a finite number of FORCs. This approach, however, faces two major problems: firstly, it requires a large amount of memory space to obtain an accurate prediction of hysteresis; secondly, it is difficult to derive efficient ways to modify the data table to reflect the timing effect of elements with hysteresis. To overcome, this article proposes the idea of using a set of polynomials to emulate the CPM instead of table look-up. The polynomial approximation requires less memory space for data storage. Furthermore, the polynomial coefficients can be obtained accurately by using the least-square approximation or adaptive identification algorithm, such as the possibility of accurate tracking of hysteresis model parameters.
Approximate solutions of common fixed-point problems
Zaslavski, Alexander J
2016-01-01
This book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take place. We show that our algorithms generate a good approximate solution if computational errors are bounded from above by a small positive constant. Beginning with an introduction, this monograph moves on to study: · dynamic string-averaging methods for common fixed point problems in a Hilbert space · dynamic string methods for common fixed point problems in a metric space · dynamic string-averaging version of the proximal...
International Nuclear Information System (INIS)
Pollock, M.D.
1988-01-01
In quantum cosmology, a wave function Ψ for a given theory can be obtained by solving the Wheeler-DeWitt equation, using the semi-classical approximation to the path integral over euclidean metrics to impose the boundary condition, as described by Hawking and his collaborators. If the universe is expanding as a quasi-de Sitter space-time, then it is possible to derive a Fokker-Planck equation for the probability distribution P, as shown by Starobinsky. Arguing by analogy with quantum mechanics in flat space-time, one would expect that P ∝ ΨΨ * . We examine this assertion by reference to the scale-invariant theory L = -1/24 βR 2 , whose wave function has been calculated in mini-superspace by Horowitz, and whose classical solutions are de Sitter space-times. It appears that deviations from the relation P ∝ ΨΨ * are attributable to long-wavelength fluctuations δΦ e ≅ H/2π in the effective inflaton field Φ c =√(βR)=√(12β) H. Their existence is taken into account in the derivation of the Fokker-Planck equation, but not in the derivation of Ψ when this is restricted to mini-superspace. In the limit β → ∞, we find that δΦ e /Φ c → 0 and that P ∝ ΨΨ * . The scale-invariant theory L = (1/2εφ 2 R-1/4λΦ 4 ) can be similarly analyzed. Inclusion of a kinetic term 1/2Φ; k Φ ;k destroys this similarity, which is restored however upon addition of a term (-1/24βR 2 ). (orig.)
Approximate maximum likelihood estimation for population genetic inference.
Bertl, Johanna; Ewing, Gregory; Kosiol, Carolin; Futschik, Andreas
2017-11-27
In many population genetic problems, parameter estimation is obstructed by an intractable likelihood function. Therefore, approximate estimation methods have been developed, and with growing computational power, sampling-based methods became popular. However, these methods such as Approximate Bayesian Computation (ABC) can be inefficient in high-dimensional problems. This led to the development of more sophisticated iterative estimation methods like particle filters. Here, we propose an alternative approach that is based on stochastic approximation. By moving along a simulated gradient or ascent direction, the algorithm produces a sequence of estimates that eventually converges to the maximum likelihood estimate, given a set of observed summary statistics. This strategy does not sample much from low-likelihood regions of the parameter space, and is fast, even when many summary statistics are involved. We put considerable efforts into providing tuning guidelines that improve the robustness and lead to good performance on problems with high-dimensional summary statistics and a low signal-to-noise ratio. We then investigate the performance of our resulting approach and study its properties in simulations. Finally, we re-estimate parameters describing the demographic history of Bornean and Sumatran orang-utans.
Approximate Controllability for Linear Stochastic Differential Equations in Infinite Dimensions
International Nuclear Information System (INIS)
Goreac, D.
2009-01-01
The objective of the paper is to investigate the approximate controllability property of a linear stochastic control system with values in a separable real Hilbert space. In a first step we prove the existence and uniqueness for the solution of the dual linear backward stochastic differential equation. This equation has the particularity that in addition to an unbounded operator acting on the Y-component of the solution there is still another one acting on the Z-component. With the help of this dual equation we then deduce the duality between approximate controllability and observability. Finally, under the assumption that the unbounded operator acting on the state process of the forward equation is an infinitesimal generator of an exponentially stable semigroup, we show that the generalized Hautus test provides a necessary condition for the approximate controllability. The paper generalizes former results by Buckdahn, Quincampoix and Tessitore (Stochastic Partial Differential Equations and Applications, Series of Lecture Notes in Pure and Appl. Math., vol. 245, pp. 253-260, Chapman and Hall, London, 2006) and Goreac (Applied Analysis and Differential Equations, pp. 153-164, World Scientific, Singapore, 2007) from the finite dimensional to the infinite dimensional case
Goodwin, Arthur H; O'Brien, Natalie P; Foss, Robert D
2012-09-01
A majority of states now restrict teenagers from using a mobile communication device while driving. The effect of these restrictions is largely unknown. In a previous study, we found North Carolina's teenage driver cell phone restriction had little influence on young driver behavior four months after the law took effect (Foss et al., 2009). The goal of the present study was to examine the longer-term effect of North Carolina's cell phone restriction. It was expected that compliance with the restriction would increase, as awareness of the restriction grew over time. Teenagers were observed at high schools in North Carolina approximately two years after the law was implemented. Observations were also conducted in South Carolina, which did not have a cell phone restriction. In both states, there was a broad decrease in cell phone use. A logistic regression analysis showed the decrease in cell phone use did not significantly differ between the two states. Although hand-held cell phone use decreased, there was an increase in the likelihood that drivers in North Carolina were observed physically manipulating a phone. Finally, a mail survey of teenagers in North Carolina showed awareness for the cell phone restriction now stands at 78% among licensed teens. Overall, the findings suggest North Carolina's cell phone restriction has had no long-term effect on the behavior of teenage drivers. Moreover, it appears many teenage drivers may be shifting from talking on a phone to texting. Copyright © 2012 Elsevier Ltd. All rights reserved.
Restricted Predicates for Hypothetical Datalog
Directory of Open Access Journals (Sweden)
Fernando Sáenz-Pérez
2015-12-01
Full Text Available Hypothetical Datalog is based on an intuitionistic semantics rather than on a classical logic semantics, and embedded implications are allowed in rule bodies. While the usual implication (i.e., the neck of a Horn clause stands for inferring facts, an embedded implication plays the role of assuming its premise for deriving its consequence. A former work introduced both a formal framework and a goal-oriented tabled implementation, allowing negation in rule bodies. While in that work positive assumptions for both facts and rules can occur in the premise, negative assumptions are not allowed. In this work, we cover this subject by introducing a new concept: a restricted predicate, which allows negative assumptions by pruning the usual semantics of a predicate. This new setting has been implemented in the deductive system DES.
A Traffic Restriction Scheme for Enhancing Carpooling
Directory of Open Access Journals (Sweden)
Dong Ding
2017-01-01
Full Text Available For the purpose of alleviating traffic congestion, this paper proposes a scheme to encourage travelers to carpool by traffic restriction. By a variational inequity we describe travelers’ mode (solo driving and carpooling and route choice under user equilibrium principle in the context of fixed demand and detect the performance of a simple network with various restriction links, restriction proportions, and carpooling costs. Then the optimal traffic restriction scheme aiming at minimal total travel cost is designed through a bilevel program and applied to a Sioux Fall network example with genetic algorithm. According to various requirements, optimal restriction regions and proportions for restricted automobiles are captured. From the results it is found that traffic restriction scheme is possible to enhance carpooling and alleviate congestion. However, higher carpooling demand is not always helpful to the whole network. The topology of network, OD demand, and carpooling cost are included in the factors influencing the performance of the traffic system.
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.)
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 optimal XFEM approximation for fracture analysis
International Nuclear Information System (INIS)
Jiang Shouyan; Du Chengbin; Ying Zongquan
2010-01-01
The extended finite element method (XFEM) provides an effective tool for analyzing fracture mechanics problems. A XFEM approximation consists of standard finite elements which are used in the major part of the domain and enriched elements in the enriched sub-domain for capturing special solution properties such as discontinuities and singularities. However, two issues in the standard XFEM should specially be concerned: efficient numerical integration methods and an appropriate construction of the blending elements. In the paper, an optimal XFEM approximation is proposed to overcome the disadvantage mentioned above in the standard XFEM. The modified enrichment functions are presented that can reproduced exactly everywhere in the domain. The corresponding FORTRAN program is developed for fracture analysis. A classic problem of fracture mechanics is used to benchmark the program. The results indicate that the optimal XFEM can alleviate the errors and improve numerical precision.
Traveltime approximations for inhomogeneous HTI media
Alkhalifah, Tariq Ali
2011-01-01
Traveltimes information is convenient for parameter estimation especially if the medium is described by an anisotropic set of parameters. This is especially true if we could relate traveltimes analytically to these medium parameters, which is generally hard to do in inhomogeneous media. As a result, I develop traveltimes approximations for horizontaly transversely isotropic (HTI) media as simplified and even linear functions of the anisotropic parameters. This is accomplished by perturbing the solution of the HTI eikonal equation with respect to η and the azimuthal symmetry direction (usually used to describe the fracture direction) from a generally inhomogeneous elliptically anisotropic background medium. The resulting approximations can provide accurate analytical description of the traveltime in a homogenous background compared to other published moveout equations out there. These equations will allow us to readily extend the inhomogenous background elliptical anisotropic model to an HTI with a variable, but smoothly varying, η and horizontal symmetry direction values. © 2011 Society of Exploration Geophysicists.
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)
Nonlinear analysis approximation theory, optimization and applications
2014-01-01
Many of our daily-life problems can be written in the form of an optimization problem. Therefore, solution methods are needed to solve such problems. Due to the complexity of the problems, it is not always easy to find the exact solution. However, approximate solutions can be found. The theory of the best approximation is applicable in a variety of problems arising in nonlinear functional analysis and optimization. This book highlights interesting aspects of nonlinear analysis and optimization together with many applications in the areas of physical and social sciences including engineering. It is immensely helpful for young graduates and researchers who are pursuing research in this field, as it provides abundant research resources for researchers and post-doctoral fellows. This will be a valuable addition to the library of anyone who works in the field of applied mathematics, economics and engineering.
Analysing organic transistors based on interface approximation
International Nuclear Information System (INIS)
Akiyama, Yuto; Mori, Takehiko
2014-01-01
Temperature-dependent characteristics of organic transistors are analysed thoroughly using interface approximation. In contrast to amorphous silicon transistors, it is characteristic of organic transistors that the accumulation layer is concentrated on the first monolayer, and it is appropriate to consider interface charge rather than band bending. On the basis of this model, observed characteristics of hexamethylenetetrathiafulvalene (HMTTF) and dibenzotetrathiafulvalene (DBTTF) transistors with various surface treatments are analysed, and the trap distribution is extracted. In turn, starting from a simple exponential distribution, we can reproduce the temperature-dependent transistor characteristics as well as the gate voltage dependence of the activation energy, so we can investigate various aspects of organic transistors self-consistently under the interface approximation. Small deviation from such an ideal transistor operation is discussed assuming the presence of an energetically discrete trap level, which leads to a hump in the transfer characteristics. The contact resistance is estimated by measuring the transfer characteristics up to the linear region
Fast approximate convex decomposition using relative concavity
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 Joint Diagonalization Incorporating Weight Matrices
Czech Academy of Sciences Publication Activity Database
Tichavský, Petr; Yeredor, A.
2009-01-01
Roč. 57, č. 3 (2009), s. 878-891 ISSN 1053-587X R&D Projects: GA MŠk 1M0572 Institutional research plan: CEZ:AV0Z10750506 Keywords : autoregressive processes * blind source separation * nonstationary random processes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.212, year: 2009 http://library.utia.cas.cz/separaty/2009/SI/tichavsky-fast approximate joint diagonalization incorporating weight matrices.pdf
Mean-field approximation minimizes relative entropy
International Nuclear Information System (INIS)
Bilbro, G.L.; Snyder, W.E.; Mann, R.C.
1991-01-01
The authors derive the mean-field approximation from the information-theoretic principle of minimum relative entropy instead of by minimizing Peierls's inequality for the Weiss free energy of statistical physics theory. They show that information theory leads to the statistical mechanics procedure. As an example, they consider a problem in binary image restoration. They find that mean-field annealing compares favorably with the stochastic approach
On approximation of functions by product operators
Directory of Open Access Journals (Sweden)
Hare Krishna Nigam
2013-12-01
Full Text Available In the present paper, two quite new reults on the degree of approximation of a function f belonging to the class Lip(α,r, 1≤ r <∞ and the weighted class W(Lr,ξ(t, 1≤ r <∞ by (C,2(E,1 product operators have been obtained. The results obtained in the present paper generalize various known results on single operators.
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.
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-07
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander
2015-01-05
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
Factorized Approximate Inverses With Adaptive Dropping
Czech Academy of Sciences Publication Activity Database
Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav
2016-01-01
Roč. 38, č. 3 (2016), A1807-A1820 ISSN 1064-8275 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverses * incomplete factorization * Gram–Schmidt orthogonalization * preconditioned iterative methods Subject RIV: BA - General Mathematics Impact factor: 2.195, year: 2016
Semiclassical approximation in Batalin-Vilkovisky formalism
International Nuclear Information System (INIS)
Schwarz, A.
1993-01-01
The geometry of supermanifolds provided with a Q-structure (i.e. with an odd vector field Q satisfying {Q, Q}=0), a P-structure (odd symplectic structure) and an S-structure (volume element) or with various combinations of these structures is studied. The results are applied to the analysis of the Batalin-Vilkovisky approach to the quantization of gauge theories. In particular the semiclassical approximation in this approach is expressed in terms of Reidemeister torsion. (orig.)
Approximation for limit cycles and their isochrons.
Demongeot, Jacques; Françoise, Jean-Pierre
2006-12-01
Local analysis of trajectories of dynamical systems near an attractive periodic orbit displays the notion of asymptotic phase and isochrons. These notions are quite useful in applications to biosciences. In this note, we give an expression for the first approximation of equations of isochrons in the setting of perturbations of polynomial Hamiltonian systems. This method can be generalized to perturbations of systems that have a polynomial integral factor (like the Lotka-Volterra equation).
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul
2015-01-01
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design
Hierarchical matrix approximation of large covariance matrices
Litvinenko, Alexander; Genton, Marc G.; Sun, Ying; Tempone, Raul
2015-01-01
We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.
Approximate Inverse Preconditioners with Adaptive Dropping
Czech Academy of Sciences Publication Activity Database
Kopal, J.; Rozložník, Miroslav; Tůma, Miroslav
2015-01-01
Roč. 84, June (2015), s. 13-20 ISSN 0965-9978 R&D Projects: GA ČR(CZ) GAP108/11/0853; GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : approximate inverse * Gram-Schmidt orthogonalization * incomplete decomposition * preconditioned conjugate gradient method * algebraic preconditioning * pivoting Subject RIV: BA - General Mathematics Impact factor: 1.673, year: 2015
Approximations and Implementations of Nonlinear Filtering Schemes.
1988-02-01
sias k an Ykar repctively the input and the output vectors. Asfold. First, there are intrinsic errors, due to explained in the previous section, the...e.g.[BV,P]). In the above example of a a-algebra, the distributive property SIA (S 2vS3) - (SIAS2)v(SIAS3) holds. A complete orthocomplemented...process can be approximated by a switched Control Systems: Stochastic Stability and parameter process depending on the aggregated slow Dynamic Relaibility
An analytical approximation for resonance integral
International Nuclear Information System (INIS)
Magalhaes, C.G. de; Martinez, A.S.
1985-01-01
It is developed a method which allows to obtain an analytical solution for the resonance integral. The problem formulation is completely theoretical and based in concepts of physics of general character. The analytical expression for integral does not involve any empiric correlation or parameter. Results of approximation are compared with pattern values for each individual resonance and for sum of all resonances. (M.C.K.) [pt
Fast approximate convex decomposition using relative concavity
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.
Evolutionary dynamics on infinite strategy spaces
Oechssler, Jörg; Riedel, Frank
1998-01-01
The study of evolutionary dynamics was so far mainly restricted to finite strategy spaces. In this paper we show that this unsatisfying restriction is unnecessary. We specify a simple condition under which the continuous time replicator dynamics are well defined for the case of infinite strategy spaces. Furthermore, we provide new conditions for the stability of rest points and show that even strict equilibria may be unstable. Finally, we apply this general theory to a number of applications ...
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