Optical bistability without the rotating wave approximation
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.
Gravitational Jaynes–Cummings model beyond the rotating wave approximation
M Mohammadi
2012-05-01
In this paper, the quantum properties of a two-level atom and the cavity-ﬁeld in the Jaynes–Cummings model with the gravity beyond the rotating wave approximation are investigated. For this purpose, by solving the Schrödinger equation in the interaction picture, the evolving state of the system is found by which the inﬂuence of the counter-rotating terms on the dynamical behaviour of atomic population inversion and the probability distribution of the cavity-ﬁeld as quantum properties is explored. The results in the atom–ﬁeld system beyond the rotating wave approximation with the gravity show that the quantum properties are not completely suppressed under certain conditions.
Geometric phases in qubit-oscillator system beyond conventional rotating-wave approximation
Wang Yue-Ming; Du Guan; Liang Jiu-Qing
2012-01-01
In this work we investigated the geometric phases of a qubit-oscillator system beyond the conventional rotatingwave approximation. We find that in the limiting of weak coupling the results coincide with that obtained under rotating-wave approximation while there exists an increasing difference with the increase of coupling constant.It was shown that the geometric phase is symmetric with respect to the sign of the detuning of the quantized field from the one-photon resonance under the conventional rotating-wave approximation while a red-blue detuning asymmetry occurs beyond the conventional rotating-wave approximation.
Integrable multi atom matter-radiation models without rotating wave approximation
Kundu, Anjan
2004-01-01
Interacting matter-radiation models close to physical systems are proposed, which without rotating wave approximation and with matter-matter interactions are Bethe ansatz solvable. This integrable system is constructed from the elliptic Gaudin model at high spin limit, where radiative excitation can be included perturbatively.
THE TWO-PHOTON DEGENERATE JAYNES-CUMMINGS MODEL WITH AND WITHOUT ROTATING-WAVE APPROXIMATION
ZHOU LING; SONG HE-SHAN; YAO LI
2001-01-01
We take into account the two-photon process and generalize the Jaynes-Cummings (JC) model to the case of atomic level degenerate in the projections of the angular momenta, and we establish two-photon degenerate JC models with and without the rotating-wave approximation (RWA) quantum theory. Comparing the atom population inversion of the generalized JC model with that of the original JC model, we found that the revival period of the degenerate JC model becomes longer and the maximum amplitude of atomic inversion decreases with RWA. Without RWA, the quantum chaos of the generalized JC model is much weaker than that of the original JC model
Atom-field entanglement in the Jaynes Cummings model without rotating wave approximation
M. Mirzaee; M. Batavani
2015-01-01
In this paper, we present a structure for obtaining the exact eigenfunctions and eigenvalues of the Jaynes–Cummings model (JCM) without the rotating wave approximation (RWA). We study the evolution of the system in the strong coupling region using the time evolution operator without RWA. The entanglement of the system without RWA is investigated using the Von Neumann entropy as an entanglement measure. It is interesting that in the weak coupling regime, the population of the atomic levels and Von Neumann entropy without RWA model shows a good agreement with the RWA whereas in strong coupling domain, the results of these two models are quite different.
Optomechanical dual-beam backaction-evading measurement beyond the rotating-wave approximation
Malz, Daniel; Nunnenkamp, Andreas
2016-11-01
We present the exact analytical solution of the explicitly time-periodic quantum Langevin equation describing the dual-beam backaction-evading measurement of a single mechanical oscillator quadrature due to V. B. Braginsky, Y. I. Vorontsov, and K. S. Thorne [Science 209, 547 (1980), 10.1126/science.209.4456.547] beyond the commonly used rotating-wave approximation. We show that counterrotating terms lead to extra sidebands in the optical and mechanical spectra and to a modification of the main peak. Physically, the backaction of the measurement is due to periodic coupling of the mechanical resonator to a light-field quadrature that only contains cavity-filtered shot noise. Since this fact is independent of other degrees of freedom the resonator might be coupled to, our solution can be generalized, including to dissipatively or parametrically squeezed oscillators, as well as recent two-mode backaction-evading measurements.
DING Bang-Fu; WANG Xiao-Yun; TANG Yan-Fang; MI Xian-Wu; ZHAO He-Ping
2011-01-01
An accurate method to solve the Jaynes-Cummings (J-C) Hamiltonian has been investigated here. The phenomenon of atomic collapse and revival predicted by Jaynes-Cummings model is demonstrated. Solutions are consistent with the precious such as using the operator method. Furthermore, the Jaynes-Cummings Hamiltonian including the anti-rotating term is also solved precisely using this accurate way so that results agree with experiments better.Essences of the anti-rotating term are revealed. We discuss the relations of the phenomenon of atonic collapse and revival with the average photons number, the light field phase angle, the resonant frequency, and the size of coupling constant. The discussions may make one select suitable conditions to carry out experiment well and study the virtual light field effect on cavity quantum electrodynamics.
Fast control of semiconductor qubits beyond the rotating-wave approximation
Song, Yang; Kestner, J. P.; Wang, Xin; Das Sarma, S.
2016-07-01
We present a theoretical study of single-qubit operations by oscillatory fields on various semiconductor platforms. We explicitly show how to perform faster gate operations by going beyond the universally used rotating-wave approximation (RWA) regime, while using only two sinusoidal pulses. We first show for specific published experiments how much error is currently incurred by implementing pulses designed using standard RWA. We then show that an even modest increase in gate speed would cause problems in using RWA for gate design in the singlet-triplet (ST) and resonant-exchange (RX) qubits. We discuss the extent to which analytically keeping higher orders in the perturbation theory would address the problem. More strikingly, we give a new prescription for gating with strong coupling far beyond the RWA regime. We perform numerical calculations for the phases and the durations of two consecutive pulses to realize the key Hadamard and π/8 gates with coupling strengths up to several times the qubit splitting. Working in this manifestly non-RWA regime, the gate operation speeds up by two to three orders of magnitude and nears the quantum speed limit without requiring complicated pulse shaping or optimal control sequences.
Liu, Ju; Li, Zhi-Yuan
2014-11-17
One of the simplest models involving the atom-field interaction is the coupling of a single two-level atom with single-mode optical field. Under the rotating wave approximation, this problem is reduced to a form that can be solved exactly. But the approximation is only valid when the two levels are resonant or nearly resonant with the applied electromagnetic radiation. Here we present an analytical solution without the rotating wave approximation and applicable to general atom-field interaction far away from the resonance. We find that there exists remarkable influence of the initial phase of optical field on the Rabi oscillations and Rabi splitting, and this issue cannot be explored in the context of the rotating wave approximation. Due to the retention of the counter-rotating terms, higher-order harmonic appears during the Rabi splitting. The analytical solution suggests a way to regulate and control the quantum dynamics of a two-level atom and allows for exploring more essential features of the atom-field interaction.
Cao, X [Department of Physics and Institute of Theoretical Physics and Astrophysics, Xiamen University, Xiamen, 361005 (China); You, J Q; Nori, F [Advanced Science Institute, RIKEN, Wako-shi 351-0198 (Japan); Zheng, H, E-mail: xfcao@xmu.edu.cn [Department of Physics, Shanghai Jiao Tong University, Shanghai 200240 (China)
2011-07-15
We investigate the spontaneous emission (SE) spectrum of a qubit in a lossy resonant cavity. We use neither the rotating-wave approximation nor the Markov approximation. For the weak-coupling case, the SE spectrum of the qubit is a single peak, with its location depending on the spectral density of the qubit environment. Then, the asymmetry (of the location and heights of the two peaks) of the two SE peaks (which are related to the vacuum Rabi splitting) changes as the qubit-cavity coupling increases. Explicitly, for a qubit in a low-frequency intrinsic bath, the height asymmetry of the splitting peaks is enhanced as the qubit-cavity coupling strength increases. However, for a qubit in an Ohmic bath, the height asymmetry of the spectral peaks is inverted compared to the low-frequency bath case. With further increasing the qubit-cavity coupling to the ultra-strong regime, the height asymmetry of the left and right peaks is slightly inverted, which is consistent with the corresponding case of a low-frequency bath. This inversion of the asymmetry arises from the competition between the Ohmic bath and the cavity bath. Therefore, after considering the anti-rotating terms, our results explicitly show how the height asymmetry in the SE spectrum peaks depends on the qubit-cavity coupling and the type of intrinsic noise experienced by the qubit.
Expectation Consistent Approximate Inference
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...
Vacuum Rabi Oscillation of an Atom without Rotating-Wave Approximation
WANG Fa-Qiang; LIU Wei-Ci; LIANG Rui-Sheng
2008-01-01
@@ We have investigated vacuum Rabi oscillation of an atom coupled with single-mode cavity field exactly, and compared the results with that of the Jaynes-Cummings (J-C) model.The results show that for resonant case, there is no Rabi oscillation for an atom.For small detuning and weak coupling case, the probability for the atom in excited state oscillates against time with different frequencies and amplitudes from that of the J-C model.It exhibits that the counter-rotating wave interaction could significantly effect the dynamic hehaviour of the atom, even under the condition in which the RWA is considered to be justified.
Fano-Agarwal couplings and non-rotating wave approximation in single-photon timed Dicke subradiance
Mirza, Imran M.; Begzjav, Tuguldur
2016-04-01
Recently a new class of single-photon timed Dicke (TD) subradiant states has been introduced with possible applications in single-photon-based quantum information storage and on demand ultrafast retrieval (Scully M. O., Phys. Rev. Lett., 115 (2015) 243602). However, the influence of any kind of virtual processes on the decay of these new kind of subradiant states has been left as an open question. In the present paper, we focus on this problem in detail. In particular, we investigate how pure Fano-Agarwal couplings and other virtual processes arising from non-rotating wave approximation impact the decay of otherwise sub- and superradiant states. In addition to the overall virtual couplings among all TD states, we also focus on the dominant role played by the couplings between specific TD states.
Zhang, Yu-Yu
2016-12-01
Generalized squeezing rotating-wave approximation (GSRWA) is proposed by employing both the displacement and the squeezing transformations. A solvable Hamiltonian is reformulated in the same form as the ordinary RWA ones. For a qubit coupled to oscillators experiment, a well-defined Schrödinger-cat-like entangled state is given by the displaced-squeezed oscillator state instead of the original displaced state. For the isotropic Rabi case, the mean photon number and the ground-state energy are expressed analytically with additional squeezing terms, exhibiting a substantial improvement of the GSRWA. And the ground-state energy in the anisotropic Rabi model confirms the effectiveness of the GSRWA. Due to the squeezing effect, the GSRWA improves the previous methods only with the displacement transformation in a wide range of coupling strengths even for large atom frequency.
Zeng, H. S.; Tang, N.; Zheng, Y. P.; Xu, T. T.
2012-10-01
By use of the recently presented two measures, the indivisibility and the backflow of information, we study the non-Markovianity of the dynamics for a two-level system interacting with a zero-temperature structured environment without using rotating wave approximation (RWA). In the limit of weak coupling between the system and its reservoir, and by expanding the time-convolutionless (TCL) generator to the forth order with respect to the coupling strength, the time-local non-Markovian master equation for the reduced state of the system is derived. Under the secular approximation, the exact analytic solution is obtained and the sufficient and necessary conditions for the indivisibility and the backflow of information for the system dynamics are presented. In the more general case, we investigate numerically the properties of the two measures for the case of Lorentzian reservoir. Our results show the importance of the counter-rotating terms to the short-time-scale non-Markovian behavior of the system dynamics, further expose the relation between the two measures and their rationality as non-Markovian measures. Finally, the complete positivity of the dynamics of the considered system is discussed.
Alam, Mohosin; Mandal, Swapan; Wahiddin, Mohamed Ridza
2017-09-01
The essence of the rotating wave approximation (RWA) is to eliminate the non-conserving energy terms from the interaction Hamiltonian. The cost of using RWA is heavy if the frequency of the input radiation field is low (e.g. below optical region). The well known Bloch-Siegert effect is the out come of the inclusion of the terms which are normally neglected under RWA. We investigate the fluctuations of the quantum phase of the coherent light and the thermal light coupled to a nondegenerate parametric oscillator (NDPO). The Hamiltonian and hence the equations of motion involving the signal and idler modes are framed by using the strong (classical) pump condition. These differential equations are nonlinear in nature and are found coupled to each other. Without using the RWA, we obtain the analytical solutions for the signal and idler fields. These solutions are obtained up to the second orders in dimensionless coupling constants. The analytical expressions for the quantum phase fluctuation parameters due to Carruther's and Nieto are obtained in terms of the coupling constants and the initial photon numbers of the input radiation field. Moreover, we keep ourselves confined to the Pegg-Barnett formalism for measured phase operators. With and without using the RWA, we compare the quantum phase fluctuations for coherent and thermal light coupled to the NDPO. In spite of the significant departures (quantitative), the qualitative features of the phase fluctuation parameters for the input thermal light are identical for NDPO with and without RWA. On the other hand, we report some interesting results of input coherent light coupled to the NDPO which are substantially different from their RWA counterpart. In spite of the various quantum optical phenomena in a NDPO, we claim that it is the first effort where the complete analytical approach towards the solutions and hence the quantum phase fluctuations of input radiation fields coupled to it are obtained beyond rotating wave
Chakrabarti, R.; Yogesh, V.
2016-04-01
We study the evolution of the hybrid entangled states in a bipartite (ultra) strongly coupled qubit-oscillator system. Using the generalized rotating wave approximation the reduced density matrices of the qubit and the oscillator are obtained. The reduced density matrix of the oscillator yields the phase space quasi probability distributions such as the diagonal P-representation, the Wigner W-distribution and the Husimi Q-function. In the strong coupling regime the Q-function evolves to uniformly separated macroscopically distinct Gaussian peaks representing ‘kitten’ states at certain specified times that depend on multiple time scales present in the interacting system. The ultrastrong coupling strength of the interaction triggers appearance of a large number of modes that quickly develop a randomization of their phase relationships. A stochastic averaging of the dynamical quantities sets in, and leads to the decoherence of the system. The delocalization in the phase space of the oscillator is studied by using the Wehrl entropy. The negativity of the W-distribution reflects the departure of the oscillator from the classical states, and allows us to study the underlying differences between various information-theoretic measures such as the Wehrl entropy and the Wigner entropy. Other features of nonclassicality such as the existence of the squeezed states and appearance of negative values of the Mandel parameter are realized during the course of evolution of the bipartite system. In the parametric regime studied here these properties do not survive in the time-averaged limit.
Compact difference approximation with consistent boundary condition
FU Dexun; MA Yanwen; LI Xinliang; LIU Mingyu
2003-01-01
For simulating multi-scale complex flow fields it should be noted that all the physical quantities we are interested in must be simulated well. With limitation of the computer resources it is preferred to use high order accurate difference schemes. Because of their high accuracy and small stencil of grid points computational fluid dynamics (CFD) workers pay more attention to compact schemes recently. For simulating the complex flow fields the treatment of boundary conditions at the far field boundary points and near far field boundary points is very important. According to authors' experience and published results some aspects of boundary condition treatment for far field boundary are presented, and the emphasis is on treatment of boundary conditions for the upwind compact schemes. The consistent treatment of boundary conditions at the near boundary points is also discussed. At the end of the paper are given some numerical examples. The computed results with presented method are satisfactory.
A consistent collinear triad approximation for operational wave models
Salmon, J. E.; Smit, P. B.; Janssen, T. T.; Holthuijsen, L. H.
2016-08-01
In shallow water, the spectral evolution associated with energy transfers due to three-wave (or triad) interactions is important for the prediction of nearshore wave propagation and wave-driven dynamics. The numerical evaluation of these nonlinear interactions involves the evaluation of a weighted convolution integral in both frequency and directional space for each frequency-direction component in the wave field. For reasons of efficiency, operational wave models often rely on a so-called collinear approximation that assumes that energy is only exchanged between wave components travelling in the same direction (collinear propagation) to eliminate the directional convolution. In this work, we show that the collinear approximation as presently implemented in operational models is inconsistent. This causes energy transfers to become unbounded in the limit of unidirectional waves (narrow aperture), and results in the underestimation of energy transfers in short-crested wave conditions. We propose a modification to the collinear approximation to remove this inconsistency and to make it physically more realistic. Through comparison with laboratory observations and results from Monte Carlo simulations, we demonstrate that the proposed modified collinear model is consistent, remains bounded, smoothly converges to the unidirectional limit, and is numerically more robust. Our results show that the modifications proposed here result in a consistent collinear approximation, which remains bounded and can provide an efficient approximation to model nonlinear triad effects in operational wave models.
Chang, L; Chang, Lei; Liu, Yu-xin
2006-01-01
We study the consistency of the ladder approximation and the rainbow approximation of the Dyson-Schwinger equation of QCD. By considering the non-Abelian property of QCD, we show that the QED-type Ward-Takahashi identity is not required for the rainbow-ladder approximation of QCD. It indicates that there does not exists any internal inconsistency in the usual rainbow-ladder approximation of QCD. In addition, we propose an modified ladder approximation which guarantees the Slavnov-Taylor identity for the quark-gluon vertex omitting the ghost effect in the approximation.
Norman, Patrick; Bishop, David M.; Jensen, Hans Jørgen Aa;
2001-01-01
Computationally tractable expressions for the evaluation of the linear response function in the multiconfigurational self-consistent field approximation were derived and implemented. The finite lifetime of the electronically excited states was considered and the linear response function was shown...
Spectral Modulation by Rotational Wave Packets
Baertschy, Mark; Hartinger, Klaus
2005-05-01
Periodic rephasing of molecular rotational wave packets can create rapid fluctuations in the optical properties of a molecular gas which can be used to manipulate the temporal phase and spectral content of ultrashort light pulses. We have demonstrated spectral control of a time-delayed ultrafast probe pulse propagating through the rotational wave packet prepared by a pump laser pulse. The spectrum of the probe pulse can be either broadened or compressed, depending on the relative sign of the temporal phase modulation and the initial chirp of the probe pulse. Adjustment of the spectral phase at the output of the interaction region allows controlled temporal pulse streching^1 and compression^2. The degree to which the spectrum of an ultrafast pulse can be modified depends on the strength and shape of the rotational wavepacket. We are studying the optimization of the rotational wave packet excitation with complex, shaped pump laser pulses for the purpose of optimizing probe pulse spectra modulation. ^1 Klaus Hartinger and Randy A. Bartels, Opt. Lett., submitted (2005). ^2 R.A. Bartels, T.C. Weinacht, N. Wagner, M. Baertschy, Chris H. Greene, M.M. Murnane, and H.C. Kapteyn , Phys. Rev. Lett., 88, 013903 (2002). This work was supported by the NSF.
Ignatchenko, V. A.; Polukhin, D. S.; Tsikalov, D. S.
2017-10-01
A new self-consistent approximation proposed earlier, is compared with various existing approximations, as well as with a numerical simulation of solutions of the wave equation for a medium with one-dimensional inhomogeneities. The Green's function, found using the new approach, is the closest to the result obtained by the numerical simulation. The results of the work show that the new approach has undoubted advantages in the study of stochastic problems in media with longwave inhomogeneities. The new self-consistent approximation in some cases has advantages over a numerical method: a more rapid process of calculation and the possibility of consideration of three-dimensional problems.
Self-consistent approximation to the solution of the Bethe-Salpeter equation
Crawford, G.A. (Department of Physics and Astronomy, University of Massachusetts, Amherst, MA (USA)); Thaler, R.M. (Department of Physics, Case Western Reserve University, Cleveland, OH (USA) Los Alamos National Laboratory, Mail Stop B243, Los Alamos, NM (USA))
1990-07-01
A technique for the approximate solution of the Bethe-Salpeter equation is examined. The technique requires the solution of a pair of coupled equations for the relative-momentum and relative-energy dependence of the relativistic {ital T} matrix. The solutions obey a self-consistency requirement as well as the usual elastic-unitarity constraint. It is also shown that the approximate {ital T} matrix is stable under a single iteration in the exact four-dimensional equation at certain kinematic points, including the fully on-shell point. A model problem with an exactly solvable separable interaction is examined and exact, approximate, as well as three-dimensional reduction results are compared. The phase shifts calculated in this self-consistent approximation scheme are found to be in excellent agreement with the exact phase shifts.
Self-consistent approximation to the solution of the Bethe-Salpeter equation
Crawford, G. A.; Thaler, R. M.
1990-07-01
A technique for the approximate solution of the Bethe-Salpeter equation is examined. The technique requires the solution of a pair of coupled equations for the relative-momentum and relative-energy dependence of the relativistic T matrix. The solutions obey a self-consistency requirement as well as the usual elastic-unitarity constraint. It is also shown that the approximate T matrix is stable under a single iteration in the exact four-dimensional equation at certain kinematic points, including the fully on-shell point. A model problem with an exactly solvable separable interaction is examined and exact, approximate, as well as three-dimensional reduction results are compared. The phase shifts calculated in this self-consistent approximation scheme are found to be in excellent agreement with the exact phase shifts.
Azhmyakov, Vadim; Polyakov, Andrey; Poznyak, Alexander
2013-01-01
International audience; This paper is devoted to constructive approximations and an alternative theoretic characterization of some classes of sliding mode control processes. We construct the consistent approximations of the differential inclusions associated with the 1rst order variable structures dynamics and also propose a variational description of the sliding mode control in the framework of an auxiliary Hamiltonian based formalism. A trajectory of the closed-loop systems can be then cons...
Dahlen, NE; Dahlen, Nils Erik
2005-01-01
We have calculated the self-consistent Green's function for a number of atoms and diatomic molecules. This Green's function is obtained from a conserving self-energy approximation, which implies that the observables calculated from the Green's functions agree with the macroscopic conservation laws f
Horowitz, Jordan M., E-mail: jordan.horowitz@umb.edu [Department of Physics, University of Massachusetts at Boston, Boston, Massachusetts 02125 (United States)
2015-07-28
The stochastic thermodynamics of a dilute, well-stirred mixture of chemically reacting species is built on the stochastic trajectories of reaction events obtained from the chemical master equation. However, when the molecular populations are large, the discrete chemical master equation can be approximated with a continuous diffusion process, like the chemical Langevin equation or low noise approximation. In this paper, we investigate to what extent these diffusion approximations inherit the stochastic thermodynamics of the chemical master equation. We find that a stochastic-thermodynamic description is only valid at a detailed-balanced, equilibrium steady state. Away from equilibrium, where there is no consistent stochastic thermodynamics, we show that one can still use the diffusive solutions to approximate the underlying thermodynamics of the chemical master equation.
Horowitz, Jordan M
2015-07-28
The stochastic thermodynamics of a dilute, well-stirred mixture of chemically reacting species is built on the stochastic trajectories of reaction events obtained from the chemical master equation. However, when the molecular populations are large, the discrete chemical master equation can be approximated with a continuous diffusion process, like the chemical Langevin equation or low noise approximation. In this paper, we investigate to what extent these diffusion approximations inherit the stochastic thermodynamics of the chemical master equation. We find that a stochastic-thermodynamic description is only valid at a detailed-balanced, equilibrium steady state. Away from equilibrium, where there is no consistent stochastic thermodynamics, we show that one can still use the diffusive solutions to approximate the underlying thermodynamics of the chemical master equation.
Zhang, Hou-Dao; Yan, YiJing
2015-12-07
The issue of efficient hierarchy truncation is related to many approximate theories. In this paper, we revisit this issue from both the numerical efficiency and quantum mechanics prescription invariance aspects. The latter requires that the truncation approximation made in Schrödinger picture, such as the quantum master equations and their self-consistent-Born-approximation improvements, should be transferable to their Heisenberg-picture correspondences, without further approximations. We address this issue with the dissipaton equation of motion (DEOM), which is a unique theory for the dynamics of not only reduced systems but also hybrid bath environments. We also highlight the DEOM theory is not only about how its dynamical variables evolve in time, but also the underlying dissipaton algebra. We demonstrate this unique feature of DEOM with model systems and report some intriguing nonlinear Fano interferences characteristics that are experimentally measurable.
丛红璐; 唐多昌; 刘雪华; 成爽; 任学藻
2012-01-01
利用全量子理论,在非旋波近似下,对与级联型三能级原子相互作用的二项式光场的光场压缩效应和原子布居几率进行了精确求解.讨论了二项式光场参量η对光场压缩效应的影响,同时也讨论了二项式态光场的最大光子数M对原子布居几率的影响.数值计算结果表明:随着二项式光场参量η的增大,光场压缩效应的持续时间先增大后减小.在非旋波近似下,由于虚光子的影响,光场压缩效应的演化曲线出现了“小锯齿状”的振荡;随着二项式光场的最大光子数M的增大,原子布居几率回复塌缩周期逐渐增大,并且原子布居几率在塌缩区不能完全塌缩,而是出现了“小锯齿状”的振荡.另外文中也讨论了非旋波项对系统量子特性的影响.%The squeezing effect and atomic population of the binomial field interacting with a cascade three level atom are calculated accurately without rotating-wave approximation (without RWA) by using the complete quantum theory. The influences of the binomial state field parameter η on the field squeezing effect and the maximum photon number M of the binomial state field on the atomic population are considered. The results obtained from using the numerical method show that with increase of the binomial state field parameter η, the duration of the squeezing effect increases at first and then decreases. The little indentation oscillation appears in the evolution curves of the field squeezing effect, which is caused by virtual photon without RWA. The period of the revival-collapse increases with the increase of the maximum photon number M, and the atomic population can not collapse completely in the collapse regime, but displays little indentation oscillation. In addition the influence of the without-RWA terms on the quantum properties of the system are discussed.
Jin, Jinshuang, E-mail: jsjin@hznu.edu.cn [Department of Physics, Hangzhou Normal University, Hangzhou 310036 (China); Li, Jun [Department of Physics, Hangzhou Normal University, Hangzhou 310036 (China); College of Physics and Electronic Engineering, Dezhou University, Dezhou 253023 (China); Liu, Yu [State Key Laboratory for Superlattices and Microstructures, Institute of Semiconductors, Chinese Academy of Sciences, Beijing 100083 (China); Li, Xin-Qi, E-mail: lixinqi@bnu.edu.cn [State Key Laboratory for Superlattices and Microstructures, Institute of Semiconductors, Chinese Academy of Sciences, Beijing 100083 (China); Department of Physics, Beijing Normal University, Beijing 100875 (China); Department of Chemistry, Hong Kong University of Science and Technology, Kowloon (Hong Kong); Yan, YiJing, E-mail: yyan@ust.hk [Department of Chemistry, Hong Kong University of Science and Technology, Kowloon (Hong Kong); Hefei National Laboratory for Physical Sciences at the Microscale, University of Science and Technology of China, Hefei, Anhui 230026 (China)
2014-06-28
Beyond the second-order Born approximation, we propose an improved master equation approach to quantum transport under self-consistent Born approximation. The basic idea is to replace the free Green's function in the tunneling self-energy diagram by an effective reduced propagator under the Born approximation. This simple modification has remarkable consequences. It not only recovers the exact results for quantum transport through noninteracting systems under arbitrary voltages, but also predicts the challenging nonequilibrium Kondo effect. Compared to the nonequilibrium Green's function technique that formulates the calculation of specific correlation functions, the master equation approach contains richer dynamical information to allow more efficient studies for such as the shot noise and full counting statistics.
Jin, Jinshuang; Li, Jun; Liu, Yu; Li, Xin-Qi; Yan, YiJing
2014-06-28
Beyond the second-order Born approximation, we propose an improved master equation approach to quantum transport under self-consistent Born approximation. The basic idea is to replace the free Green's function in the tunneling self-energy diagram by an effective reduced propagator under the Born approximation. This simple modification has remarkable consequences. It not only recovers the exact results for quantum transport through noninteracting systems under arbitrary voltages, but also predicts the challenging nonequilibrium Kondo effect. Compared to the nonequilibrium Green's function technique that formulates the calculation of specific correlation functions, the master equation approach contains richer dynamical information to allow more efficient studies for such as the shot noise and full counting statistics.
Self-consistent Ornstein-Zernike approximation for molecules with soft cores.
Høye, J S; Reiner, A
2006-09-14
The self-consistent Ornstein-Zernike approximation (SCOZA) is an accurate liquid state theory. So far it has been tied to interactions composed of hard core repulsion and long-range attraction, whereas real molecules have soft core repulsion at short distances. In the present work, this is taken into account through the introduction of an effective hard core with a diameter that depends upon temperature only. It is found that the contribution to the configurational internal energy due to the repulsive reference fluid is of prime importance and must be included in the thermodynamic self-consistency requirement on which SCOZA is based. An approximate but accurate evaluation of this contribution relies on the virial theorem to gauge the amplitude of the pair distribution function close to the molecular surface. Finally, the SCOZA equation is transformed by which the problem is reformulated in terms of the usual SCOZA with fixed hard core reference system and temperature-dependent interaction.
Calculating beta decay in the deformed self-consistent quasiparticle random phase approximation
Engel, Jonathan, E-mail: engelj@physics.unc.edu [Department of Physics and Astronomy, University of North Carolina, Chapel Hill, NC 27599-3255 (United States); Mustonen, M. T., E-mail: mika.mustonen@yale.edu [Department of Physics and Astronomy, University of North Carolina, Chapel Hill, NC 27599-3255 (United States); Center for Theoretical Physics, Sloane Physics Laboratory, Yale University, New Haven, CT 06052 (United States)
2016-06-21
We discuss a recent global calculation of beta-decay rates in the self-consistent Skyrme quasiparticle random phase approximation (QRPA), with axially symmetric nuclear deformation treated explicitly. The calculation makes makes use of the finite-amplitude method, first proposed by Nakatsukasa and collaborators, to reduce computation time. The results are comparable in quality to those of several other global QRPA calculations. The QRPA may have reached the limit of its accuracy.
Losa, C; Dossing, T; Vigezzi, E; Broglia, R A
2010-01-01
We present a calculation of the properties of vibrational states in deformed, axially--symmetric even--even nuclei, within the framework of a fully self--consistent Quasparticle Random Phase Approximation (QRPA). The same Skyrme energy density and density-dependent pairing functionals are used to calculate the mean field and the residual interaction in the particle-hole and particle-particle channels. We have tested our software in the case of spherical nuclei against fully self consistent calculations published in the literature, finding excellent agreement. We investigate the consequences of neglecting the spin-orbit and Coulomb residual interactions in QRPA. Furthermore we discuss the improvement obtained in the QRPA result associated with the removal of spurious modes. Isoscalar and isovector responses in the deformed ${}^{24}{}^{-}{}^{26}$Mg, ${}^{34}$Mg isotopes are presented and compared to experimental findings.
Dahlen, Nils Erik; van Leeuwen, Robert
2005-04-22
We have calculated the self-consistent Green's function for a number of atoms and diatomic molecules. This Green's function is obtained from a conserving self-energy approximation, which implies that the observables calculated from the Green's functions agree with the macroscopic conservation laws for particle number, momentum, and energy. As a further consequence, the kinetic and potential energies agree with the virial theorem, and the many possible methods for calculating the total energy all give the same result. In these calculations we use the finite temperature formalism and calculate the Green's function on the imaginary time axis. This allows for a simple extension to nonequilibrium systems. We have compared the energies from self-consistent Green's functions to those of nonselfconsistent schemes and also calculated ionization potentials from the Green's functions by using the extended Koopmans' theorem.
Horowitz, Jordan M.
2015-01-01
The stochastic thermodynamics of a dilute, well-stirred mixture of chemically-reacting species is built on the stochastic trajectories of reaction events obtained from the Chemical Master Equation. However, when the molecular populations are large, the discrete Chemical Master Equation can be approximated with a continuous diffusion process, like the Chemical Langevin Equation or Low Noise Approximation. In this paper, we investigate to what extent these diffusion approximations inherit the s...
Zhang, Hou-Dao [Department of Chemistry, Hong Kong University of Science and Technology, Hong Kong (China); Yan, YiJing, E-mail: yyan@ust.hk [Department of Chemistry, Hong Kong University of Science and Technology, Hong Kong (China); iChEM and Hefei National Laboratory for Physical Sciences at the Microscale, University of Science and Technology of China, Hefei 230026 (China)
2015-12-07
The issue of efficient hierarchy truncation is related to many approximate theories. In this paper, we revisit this issue from both the numerical efficiency and quantum mechanics prescription invariance aspects. The latter requires that the truncation approximation made in Schrödinger picture, such as the quantum master equations and their self–consistent–Born–approximation improvements, should be transferable to their Heisenberg–picture correspondences, without further approximations. We address this issue with the dissipaton equation of motion (DEOM), which is a unique theory for the dynamics of not only reduced systems but also hybrid bath environments. We also highlight the DEOM theory is not only about how its dynamical variables evolve in time, but also the underlying dissipaton algebra. We demonstrate this unique feature of DEOM with model systems and report some intriguing nonlinear Fano interferences characteristics that are experimentally measurable.
Herschlag, Gregory J; Mitran, Sorin; Lin, Guang
2015-06-21
We develop a hierarchy of approximations to the master equation for systems that exhibit translational invariance and finite-range spatial correlation. Each approximation within the hierarchy is a set of ordinary differential equations that considers spatial correlations of varying lattice distance; the assumption is that the full system will have finite spatial correlations and thus the behavior of the models within the hierarchy will approach that of the full system. We provide evidence of this convergence in the context of one- and two-dimensional numerical examples. Lower levels within the hierarchy that consider shorter spatial correlations are shown to be up to three orders of magnitude faster than traditional kinetic Monte Carlo methods (KMC) for one-dimensional systems, while predicting similar system dynamics and steady states as KMC methods. We then test the hierarchy on a two-dimensional model for the oxidation of CO on RuO2(110), showing that low-order truncations of the hierarchy efficiently capture the essential system dynamics. By considering sequences of models in the hierarchy that account for longer spatial correlations, successive model predictions may be used to establish empirical approximation of error estimates. The hierarchy may be thought of as a class of generalized phenomenological kinetic models since each element of the hierarchy approximates the master equation and the lowest level in the hierarchy is identical to a simple existing phenomenological kinetic models.
Self-consistent treatment of v-groove quantum wire band structure in no parabolic approximation
Crnjanski Jasna V.
2004-01-01
Full Text Available The self-consistent no parabolic calculation of a V-groove-quantum-wire (VQWR band structure is presented. A comparison with the parabolic flat-band model of VQWR shows that both, the self-consistency and the nonparabolicity shift sub band edges, in some cases even in the opposite directions. These shifts indicate that for an accurate description of inter sub band absorption, both effects have to be taken into the account.
Robert Pincus
2009-06-01
Full Text Available Large-eddy simulation (LES refers to a class of calculations in which the large energy-rich eddies are simulated directly and are insensitive to errors in the modeling of sub-grid scale processes. Flows represented by LES are often driven by radiative heating and therefore require the calculation of radiative transfer along with the fluid-dynamical simulation. Current methods for detailed radiation calculations, even those using simple one-dimensional radiative transfer, are far too expensive for routine use, while popular shortcuts are either of limited applicability or run the risk of introducing errors on time and space scales that might affect the overall simulation. A new approximate method is described that relies on Monte Carlo sampling of the spectral integration in the heating rate calculation and is applicable to any problem. The error introduced when using this method is substantial for individual samples (single columns at single times but is uncorrelated in time and space and so does not bias the statistics of scales that are well resolved by the LES. The method is evaluated through simulation of two test problems; these behave as expected. A scaling analysis shows that the errors introduced by the method diminish as flow features become well resolved. Errors introduced by the approximation increase with decreasing spatial scale but the spurious energy introduced by the approximation is less than the energy expected in the unperturbed flow, i.e. the energy associated with the spectral cascade from the large scale, even on the grid scale.
Rossi, Mariana; Paesani, Francesco; Bowman, Joel; Ceriotti, Michele
2014-01-01
Including quantum mechanical effects on the dynamics of nuclei in the condensed phase is challenging, because the complexity of exact methods grows exponentially with the number of quantum degrees of freedom. Efforts to circumvent these limitations can be traced down to two approaches: methods that treat a small subset of the degrees of freedom with rigorous quantum mechanics, considering the rest of the system as a static or classical environment, and methods that treat the whole system quantum mechanically, but using approximate dynamics. Here we perform a systematic comparison between these two philosophies for the description of quantum effects in vibrational spectroscopy, taking the Embedded Local Monomer (LMon) model and a mixed quantum-classical (MQC) model as representatives of the first family of methods, and centroid molecular dynamics (CMD) and thermostatted ring polymer molecular dynamics (TRPMD) as examples of the latter. We use as benchmarks D$_2$O doped with HOD and pure H$_2$O at three distinc...
Ignatchenko, V. A.; Polukhin, D. S.
2017-07-01
Our previously proposed approximation involving both the first and second terms of the expansion of the vertex function is generalized to the system of two interacting wavefields of different physical nature. A system of self-consistent equations for the matrix Green's function and matrix vertex function is derived. On the basis of this matrix generalization of the new self-consistent approximation, a theory of magnetoelastic resonance is developed for a ferromagnetic model, where the magnetoelastic coupling parameter ɛ(x) is inhomogeneous. Equations for magnetoelastic resonance are analyzed for one-dimensional inhomogeneities of the coupling parameter. The diagonal and off-diagonal elements of the matrix Green's function of the system of coupled spin and elastic waves are calculated with the change in the ratio between the average value ɛ and rms fluctuation Δɛ of the coupling parameter between waves from the homogeneous case (ɛ ≠ 0, Δɛ = 0) to the extremely randomized case (ɛ = 0, Δɛ ≠ 0) at various correlation wavenumbers of inhomogeneities k c. For the limiting case of infinite correlation radius ( k c = 0), in addition to approximate expressions, exact analytical expressions corresponding to the summation of all diagrams of elements of the matrix Green's function are obtained. The results calculated for an arbitrary k c value in the new self-consistent approximation are compared to the results obtained in the standard self-consistent approximation, where only the first term of the expansion of the vertex function is taken into account. It is shown that the new approximation corrects disadvantages of the Green's functions calculated in the standard approximation such as the dome shape of resonances and bends on the sides of resonance peaks. The appearance of a fine structure of the spectrum in the form of a narrow resonance on the Green's function of spin waves and a narrow antiresonance on the Green's function of elastic waves, which was
Korneev, V. G.
2016-11-01
Efficiency of the error control of numerical solutions of partial differential equations entirely depends on the two factors: accuracy of an a posteriori error majorant and the computational cost of its evaluation for some test function/vector-function plus the cost of the latter. In the paper consistency of an a posteriori bound implies that it is the same in the order with the respective unimprovable a priori bound. Therefore, it is the basic characteristic related to the first factor. The paper is dedicated to the elliptic diffusion-reaction equations. We present a guaranteed robust a posteriori error majorant effective at any nonnegative constant reaction coefficient (r.c.). For a wide range of finite element solutions on a quasiuniform meshes the majorant is consistent. For big values of r.c. the majorant coincides with the majorant of Aubin (1972), which, as it is known, for relatively small r.c. (< ch -2 ) is inconsistent and looses its sense at r.c. approaching zero. Our majorant improves also some other majorants derived for the Poisson and reaction-diffusion equations.
Bifurcations of rotating waves in rotating spherical shell convection.
Feudel, F; Tuckerman, L S; Gellert, M; Seehafer, N
2015-11-01
The dynamics and bifurcations of convective waves in rotating and buoyancy-driven spherical Rayleigh-Bénard convection are investigated numerically. The solution branches that arise as rotating waves (RWs) are traced by means of path-following methods, by varying the Rayleigh number as a control parameter for different rotation rates. The dependence of the azimuthal drift frequency of the RWs on the Ekman and Rayleigh numbers is determined and discussed. The influence of the rotation rate on the generation and stability of secondary branches is demonstrated. Multistability is typical in the parameter range considered.
Measurement of the Optical Rotation Angle Using a Rotating-Wave-Plate Stokes Polarimeter
Chang C.C.
2010-06-01
Full Text Available A polarimeter based on Stokes-Mueller formalism and rotating-wave-plate Stokes polarimeter is successfully developed to measure the optical rotation angle in a chiral medium. The average relative error in the measured rotation angles of glucose solutions with concentrations ranging from 0 to 1.2g/dl is determined to be 3.78%. The correlation coefficient between the measured rotation angle and the glucose concentration is found to be 0.9995, while the standard deviation is just 0.00376 degrees. From the sol-gel materials containing C17H17ClO6 with concentrations ranging from 0 to 0.0665g/ml, the average relative error in the measured rotation angles is determined to be 3.63%. Consequently, the developed system is evaluated with a precision of 5.4% approximately in rotation angle measurement.
Lower ground state due to counter-rotating wave interaction in trapped ion system
Liu, T; Feng, M
2007-01-01
We consider a single ion confined in a trap under radiation of two traveling waves of lasers. In the strong-excitation regime and without the restriction of Lamb-Dicke limit, the Hamiltonian of the system is similar to a driving Jaynes-Cummings model without rotating wave approximation (RWA). The approach we developed enables us to present a complete eigensolutions, which makes it available to compare with the solutions under the RWA. We find that, the ground state in our non-RWA solution is energically lower than the counterpart under the RWA. If we have the ion in the ground state, it is equivalent to a spin dependent force on the trapped ion. Discussion is made for the difference between the solutions with and without the RWA, and for the relevant experimental test, as well as for the possible application in quantum information processing.
Pain, J.C. [CEA/DIF, B.P. 12, 91680 Bruyeres-le-Chatel Cedex (France)]. E-mail: jean-christophe.pain@cea.fr; Dejonghe, G. [CEA/DIF, B.P. 12, 91680 Bruyeres-le-Chatel Cedex (France); Blenski, T. [CEA/DSM/DRECAM/SPAM, Centre d' Etudes de Saclay, 91191 Gif-sur-Yvette Cedex (France)
2006-05-15
We propose a thermodynamically consistent model involving detailed screened ions, described by superconfigurations, in plasmas. In the present work, the electrons, bound and free, are treated quantum-mechanically so that resonances are carefully taken into account in the self-consistent calculation of the electronic structure of each superconfiguration. The procedure is in some sense similar to the one used in Inferno code developed by D.A. Liberman; however, here we perform this calculation in the ion-sphere model for each superconfiguration. The superconfiguration approximation allows rapid calculation of necessary averages over all possible configurations representing excited states of bound electrons. The model enables a fully quantum-mechanical self-consistent calculation of the electronic structure of ions and provides the relevant thermodynamic quantities (e.g., internal energy, Helmholtz free energy and pressure), together with an improved treatment of pressure ionization. It should therefore give a better insight into the impact of plasma effects on photoabsorption spectra.
Jemai, M
2004-07-01
In the present thesis we have applied the self consistent random phase approximation (SCRPA) to the Hubbard model with a small number of sites (a chain of 2, 4, 6,... sites). Earlier SCRPA had produced very good results in other models like the pairing model of Richardson. It was therefore interesting to see what kind of results the method is able to produce in the case of a more complex model like the Hubbard model. To our great satisfaction the case of two sites with two electrons (half-filling) is solved exactly by the SCRPA. This may seem a little trivial but the fact is that other respectable approximations like 'GW' or the approach with the Gutzwiller wave function yield results still far from exact. With this promising starting point, the case of 6 sites at half filling was considered next. For that case, evidently, SCRPA does not any longer give exact results. However, they are still excellent for a wide range of values of the coupling constant U, covering for instance the phase transition region towards a state with non zero magnetisation. We consider this as a good success of the theory. Non the less the case of 4 sites (a plaquette), as indeed all cases with 4n sites at half filling, turned out to have a problem because of degeneracies at the Hartree Fock level. A generalisation of the present method, including in addition to the pairs, quadruples of Fermions operators (called second RPA) is proposed to also include exactly the plaquette case in our approach. This is therefore a very interesting perspective of the present work. (author)
Schmidtke, Daniel; Gemmer, Jochen
2016-01-01
Closed quantum systems obey the Schrödinger equation, whereas nonequilibrium behavior of many systems is routinely described in terms of classical, Markovian stochastic processes. Evidently, there are fundamental differences between those two types of behavior. We discuss the conditions under which the unitary dynamics may be mapped onto pertinent classical stochastic processes. This is first principally addressed based on the notions of "consistency" and "Markovianity." Numerical data are presented that show that the above conditions are to good approximation fulfilled for Heisenberg-type spin models comprising 12-20 spins. The accuracy to which these conditions are met increases with system size.
Patrick, Christopher; Thygesen, Kristian Sommer
2016-01-01
In non-self-consistent calculations of the total energy within the random-phase approximation (RPA) for electronic correlation, it is necessary to choose a single-particle Hamiltonian whose solutions are used to construct the electronic density and noninteracting response function. Here we invest...... and qualitatively different from that found from calculations employingU-corrected (semi)local functionals.However we also find that the+U term cannot be used to correct the RPA’s poor description of the heat of formation of NiO....... investigate the effect of including a Hubbard-U term in this single-particle Hamiltonian, to better describe the on-site correlation of 3d electrons in the transitionmetal compounds ZnS, TiO2, and NiO.We find that the RPA lattice constants are essentially independent of U, despite large changes...
N Rahimipour
2015-07-01
Full Text Available The classical J1-J2 Heisenberg model on bipartite lattice exhibits "Neel" order. However if the AF interactions between the next nearest neighbor(nnn are increased with respect to the nearest neighbor(nn, the frustration effect arises. In such situations, new phases such as ordered phases with coplanar or spiral ordering and disordered phases such as spin liquids can arise. In this paper we use the self-consistent Gaussian approximation to study the J1-J2 Heisenberg model in honeycomb and diamond lattices. We find the spin liquid phases such as ring-liquid and pancake-liquid in honeycomb lattice.Also for diamond lattice we show that the degeneracy of ground state can be lifted by thermal fluctuations through the order by disorder mechanism.
Gritsenko, O. V.; Rubio, A.; Balbás, L. C.; Alonso, J. A.
1993-03-01
The model Coulomb pair-correlation functions proposed several years ago by Gritsenko, Bagaturyants, Kazansky, and Zhidomirov are incorporated into the self-consistent local-density approximation (LDA) scheme for electronic systems. Different correlation functions satisfying well-established local boundary conditions and integral conditions have been tested by performing LDA calculations for closed-shell atoms. Those correlation functions contain a single parameter which can be optimized by fitting the atomic correlation energies to empirical data. In this way, a single (universal) value of the parameter is found to give a very good fit for all the atoms studied. The results provide a substantial improvement of calculated correlation energies as compared to the usual LDA functionals and the scheme should be useful for molecular and cluster calculations.
Keiter, E.R.; Kushner, M.J. [Univ. of Illinois, Urbana, IL (United States). Dept. of Electrical and Computer Engineering
1997-12-31
Numerical Modeling of low pressure plasma reactors is subject to numerous time step constraints, and among the most restrictive of these is the dielectric relaxation time. In recent years, semi-implicit flux-correction techniques have allowed plasma modelers to loosen the dielectric relaxation time step restriction. However, since these simulations do solve a form of Poisson`s equation, they still have a restriction on time step based on a modified, albeit less restrictive, dielectric relaxation time. For some parameter spaces this is acceptable, but for very large scale simulations (for example in three dimensions) and for simulations of systems having long time scales, obtaining a longer time step is crucial. Using a generalization of a technique already presented, the authors present a method for obtaining an approximate electrostatic potential which has no dielectric relaxation time restriction. Implementation is of comparable difficulty to that of a conventional Poisson`s equation, and is no more computationally intensive. The module is implemented within a large, self-consistent hybrid plasma equipment model (HPEM). A rearranged continuity equation is solved, and charge neutrality is assumed. A comparison to the HPEM running with Poisson`s equation is presented, for both two and three dimensions, and for electropositive and electronegative gases.
Tailleux, Remi
2010-01-01
In order to help achieve a future better understanding of the role of internal energy in turbulent stratified fluids, a new method is proposed for constructing Boussinesq models that conserve energy exactly, and that are endowed with a fully internally consistent description of thermodynamics.
Takagi, Seiji; Ueda, Tetsuo
2010-06-01
Pattern dynamics plays a fundamental role in biological functions from cell to organ in living systems, and the appearance of rotating waves can lead to pathological situations. Basic dynamics of rotating waves of contraction-relaxation activity under local perturbation is studied in a newly developed protoplasmic droplet of the Physarum plasmodium. A light pulse is applied by irradiating circularly a quarter of the droplet showing a single rotating wave. The oscillation pattern changes abruptly only when the irradiation is applied at a part of the droplet near the maximal contraction. The abrupt changes are as follows: the rotating wave disappears or is displaced when the irradiation area is very close to the center of the rotating wave, while new rotating waves are created when the irradiation area is far from the center of the rotating wave. These results support the hypothesis that the phase response curve has a discontinuous change (type 0 resetting) from delay to advance around the maximal contraction. The significance of the results is discussed in relation to “vulnerability” in excitable media and biological systems in general.
Moussa, Jonathan E
2014-01-07
The random-phase approximation with second-order screened exchange (RPA+SOSEX) is a model of electron correlation energy with two caveats: its accuracy depends on an arbitrary choice of mean field, and it scales as O(n(5)) operations and O(n(3)) memory for n electrons. We derive a new algorithm that reduces its scaling to O(n(3)) operations and O(n(2)) memory using controlled approximations and a new self-consistent field that approximates Brueckner coupled-cluster doubles theory with RPA+SOSEX, referred to as Brueckner RPA theory. The algorithm comparably reduces the scaling of second-order Mo̸ller-Plesset perturbation theory with smaller cost prefactors than RPA+SOSEX. Within a semiempirical model, we study H2 dissociation to test accuracy and Hn rings to verify scaling.
Moussa, Jonathan E., E-mail: godotalgorithm@gmail.com [Sandia National Laboratories, Albuquerque, New Mexico 87185 (United States)
2014-01-07
The random-phase approximation with second-order screened exchange (RPA+SOSEX) is a model of electron correlation energy with two caveats: its accuracy depends on an arbitrary choice of mean field, and it scales as O(n{sup 5}) operations and O(n{sup 3}) memory for n electrons. We derive a new algorithm that reduces its scaling to O(n{sup 3}) operations and O(n{sup 2}) memory using controlled approximations and a new self-consistent field that approximates Brueckner coupled-cluster doubles theory with RPA+SOSEX, referred to as Brueckner RPA theory. The algorithm comparably reduces the scaling of second-order Møller-Plesset perturbation theory with smaller cost prefactors than RPA+SOSEX. Within a semiempirical model, we study H{sub 2} dissociation to test accuracy and H{sub n} rings to verify scaling.
Martini, M; Goriely, S
2014-01-01
The charge-exchange excitations in nuclei are studied within the fully self-consistent proton-neutron quasiparticle random-phase approximation using the finite-range Gogny interaction. No additional parameters beyond those included in the effective nuclear force are included. Axially symmetric deformations are consistently taken into account, both in the description of the ground states and spin-isospin excitations. We focus on the isobaric analog and Gamow-Teller resonances. A comparison of the predicted strength distributions to the existing experimental data is presented and the role of nuclear deformation analyzed. The Gamow-Teller strength is used to estimate the beta-decay half-life of nuclei for which experimental data exist. A satisfactory agreement with experimental half-lives is found and justifies the additional study of the exotic neutron-rich N=82, 126 and 184 isotonic chains of relevance for the r-process nucleosynthesis.
Chang, Yao-Wen; Jin, Bih-Yaw
2012-01-14
Many-body perturbation theory is used to investigate the effect of π-electron correlations on the quasi-particle band structures of conjugated polymers at the level of the Pariser-Parr-Pople model. The self-consistent GW approximation with vertex corrections to both the self-energy and the polarization in Hedin's equations is employed in order to eliminate self-interaction errors and include the effects of electron-hole attraction in screening processes. The dynamic inverse dielectric function is constructed from the generalized plasmon-pole approximation with the static dressed polarization given by the coupled-perturbed Hartree-Fock equation. The bandgaps of trans-polyacetylene, trans-polyphenylenevinylene and poly(para)phenylene are calculated by both the Hartree-Fock and GW approximation, and a lowering of bandgaps due to electron correlations is found. We conclude that both dielectric screening and vertex corrections are important for calculating the quasi-particle bandgaps of conjugated polymers.
Study of Rotating-Wave Electromagnetic Modes for Applications in Space Exploration
Velazco, J. E.
2016-08-01
Rotating waves are circularly polarized electromagnetic wave fields that behave like traveling waves but have discrete resonant frequencies of standing waves. In JPL's Communications Ground Systems Section (333), we are making use of this peculiar type of electromagnetic modes to develop a new generation of devices and instruments for direct applications in space exploration. In this article, we present a straightforward analysis about the phase velocity of these wave modes. A derivation is presented for the azimuthal phase velocity of transverse magnetic rotating modes inside cylindrical cavity resonators. Computer simulations and experimental measurements are also presented that corroborate the theory developed. It is shown that the phase velocity of rotating waves inside cavity resonators increases with radial position within the cavity and decreases when employing higher-order operating modes. The exotic features of rotating modes, once better understood, have the potential to enable the implementation of a plethora of new devices that range from amplifiers and frequency multipliers to electron accelerators and ion thrusters.
Horikawa, Yo
2014-05-01
Transient rotating waves in a ring of sigmoidal neurons with asymmetric bidirectional coupling and self-coupling were studied. When a pair of stable steady states and an unstable traveling wave coexisted, rotating waves propagating in a ring were generated in transients. The pinning (propagation failure) of the traveling wave occurred in the presence of asymmetric coupling and self-coupling, and its conditions were obtained. A kinematical equation for the propagation of wave fronts of the traveling and rotating waves was then derived for a large output gain of neurons. The kinematical equation showed that the duration of transient rotating waves increases exponentially with the number of neurons as that in a ring of unidirectionally coupled neurons (metastable dynamical transients). However, the exponential growth rate depended on the asymmetry of bidirectional coupling and the strength of self-coupling. The rate was equal to the propagation time of the traveling wave (a reciprocal of the propagation speed), and it increased near pinned regions. Then transient rotating waves could show metastable dynamics (extremely long duration) even in a ring of a small number of neurons. Copyright © 2014 Elsevier Ltd. All rights reserved.
Mantič-Lugo, Vladislav; Gallaire, François
2016-12-01
Selective noise amplifiers are characterized by large linear amplification to external perturbations in a particular frequency range despite their global linear stability. Applying a stochastic forcing with increasing amplitude, the response undergoes a strong nonlinear saturation when compared to the linear estimation. Building upon our previous work, we introduce a predictive model that describes this nonlinear dynamics, and we apply it to a canonical example of selective noise amplifiers: the backward-facing step flow. Rewriting conveniently the stochastic forcing and response in the frequency domain, the model consists in a mean flow equation coupled to the linear response to forcing at each frequency. This coupling is attained by the Reynolds stress, which is constructed by the integral in frequency of the independent responses. We generalize the model for a response to a white noise forcing δ -correlated in space and time restricting the flow dynamics to its most energetic patterns calculated from the optimal harmonic forcing and response of the flow. The model estimates accurately the response saturation when compared to direct numerical simulations, and it correctly approximates the structure of the response and the mean flow modification. It also shows that the response undergoes a selective process governed by the nonlinear gain, which promotes a response structure with an approximately single frequency and wavelength in the whole domain. These results suggest that the mean flow modification by the Reynolds stress is the key nonlinearity in the saturation process of the response to white noise.
Agrawal, B K
2004-01-01
We provide for the first time accurate assessments of the consequences of violations of self-consistency in the Hartree-Fock based random phase approximation (RPA) as commonly used to calculate the energy $E_c$ of the nuclear breathing mode. Using several Skyrme interactions we find that the self-consistency violated by ignoring the spin-orbit interaction in the RPA calculation causes a spurious enhancement of the breathing mode energy for spin unsaturated systems. Contrarily, neglecting the Coulomb interaction in the RPA or performing the RPA calculations in the TJ scheme underestimates the breathing mode energy. Surprisingly, our results for the $^{90}$Zr and $^{208}$Pb nuclei for several Skyrme type effective nucleon-nucleon interactions having a wide range of nuclear matter incompressibility ($K_{nm} \\sim 215 - 275$ MeV) and symmetry energy ($J \\sim 27 - 37$ MeV) indicate that the net uncertainty ($\\delta E_c \\sim 0.3$ MeV) is comparable to the experimental one.
Fano-Agarwal couplings and non-rotating wave approximation in single-photon timed-Dicke subradiance
Mirza, Imran M.; Begzjav, Tuguldur
2016-01-01
Recently a new class of single-photon timed-Dicke (TD) subradiant states has been introduced with possible applications in single-photon based quantum information storage and on demand ultrafast retrieval [Scully M. O., Phys. Rev. Lett., 115 (2015) 243602]. However, the influence of any kind of virtual processes on the decay of these new kind of subradiant states has been left as an open question. In the present paper, we focus on this problem in detail. In particular, we investigate how pure...
Park, Hee Su; Sharma, Aditya
2016-12-01
We calculate the operation wavelength range of polarization controllers based on rotating wave plates such as paddle-type optical fiber devices. The coverages over arbitrary polarization conversion or arbitrary birefringence compensation are numerically estimated. The results present the acceptable phase retardation range of polarization controllers composed of two quarter-wave plates or a quarter-half-quarter-wave plate combination, and thereby determines the operation wavelength range of a given design. We further prove that a quarter-quarter-half-wave-plate combination is also an arbitrary birefringence compensator as well as a conventional quarter-half-quarter-wave-plate combination, and show that the two configurations have the identical range of acceptable phase retardance within the uncertainty of our numerical method.
Cavinato, M.; Marangoni, M.; Saruis, A.M.
1988-05-01
Coincidence /sup 16/O(e-arrow-right,e'x) reactions with polarized electrons have been investigated in the one-photon-exchange formalism. Electromagnetic transition amplitudes are decomposed into multipoles. The nuclear energy continuum is obtained in the framework of a self-consistent random-phase approximation theory with a Skyrme III interaction. We focus our attention on the electron kinematics epsilon/sub i/ = 130 MeV, theta = 50/sup 0/, and on the nuclear excitation energies ..omega.. = 21 and 35 MeV. The polarization structure functions W/sub L//sub T//sub '/ are discussed in parallel with angular distributions and asymmetries for the two hole states: 1p/sub 1/2//sup -1/ and 1p/sub 3/2//sup -1/. At 21 MeV we explore the properties of giant multipole resonances, whereas at 35 MeV, we show theoretical predictions for the competing knockout and semidirect reaction mechanisms. The neutron yield predicted in /sup 16/O(e,e'n) reactions is connected with the presence of random-phase approximation correlations in the nuclear energy continuum. Comparison is made between random-phase-approximation--Skyrme-III results and Novosibirsk experimental data.
Diophantine approximation and badly approximable sets
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X....... 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...
Staunstrup, Jørgen
1998-01-01
This paper proposes that Interface Consistency is an important issue for the development of modular designs. Byproviding a precise specification of component interfaces it becomes possible to check that separately developedcomponents use a common interface in a coherent matter thus avoiding a very...... significant source of design errors. Awide range of interface specifications are possible, the simplest form is a syntactical check of parameter types.However, today it is possible to do more sophisticated forms involving semantic checks....
Bordin, Lorenzo; Creminelli, Paolo; Mirbabayi, Mehrdad; Noreña, Jorge
2017-03-01
We argue that isotropic scalar fluctuations in solid inflation are adiabatic in the super-horizon limit. During the solid phase this adiabatic mode has peculiar features: constant energy-density slices and comoving slices do not coincide, and their curvatures, parameterized respectively by ζ and Script R, both evolve in time. The existence of this adiabatic mode implies that Maldacena's squeezed limit consistency relation holds after angular average over the long mode. The correlation functions of a long-wavelength spherical scalar mode with several short scalar or tensor modes is fixed by the scaling behavior of the correlators of short modes, independently of the solid inflation action or dynamics of reheating.
Approximate Representations and Approximate Homomorphisms
Moore, Cristopher
2010-01-01
Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups: functions f:G -> U_d such that Pr[f(xy) = f(x) f(y)] is large, or more generally Exp_{x,y} ||f(xy) - f(x)f(y)||^2$ is small, where x and y are uniformly random elements of the group G and U_d denotes the unitary group of degree d. We bound these quantities in terms of the ratio d / d_min where d_min is the dimension of the smallest nontrivial representation of G. As an application, we bound the extent to which a function f : G -> H can be an approximate homomorphism where H is another finite group. We show that if H's representations are significantly smaller than G's, no such f can be much more homomorphic than a random function. We interpret these results as showing that if G is quasirandom, that is, if d_min is large, then G cannot be embedded in a small number of dimensi...
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...
Diophantine approximation and badly approximable sets
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X...
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.
Explorations into quantum state diffusion beyond the Markov approximation
Broadbent, Curtis J.; Jing, Jun; Yu, Ting; Eberly, Joseph H.
2011-05-01
The non-Markovian quantum state diffusion equation is rapidly becoming a powerful tool for both theoretical and numerical investigations into non-trivial problems in quantum optical QED. It has been used to rederive the exact master equation for quantum Brownian motion, as well as an optical cavity or a two-level atom which is either damped or dephased under the rotating wave approximation. The exact quantum state diffusion equations for the spin-1 system have also been found, and general theorems have now been derived for solving the N-cavity, N-qubit, and N-level systems. Here, we build upon the results of Ref. to explore other problems from quantum optical QED using the non-Markovian quantum state diffusion equation.
Leike, Reimar H
2016-01-01
In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a ranking function that quantifies how "embarrassing" it is to communicate a given approximation. We show that there is only one ranking under the requirements that (1) the best ranked approximation is the non-approximated belief and (2) that the ranking judges approximations only by their predictions for actual outcomes. We find that this ranking is equivalent to the Kullback-Leibler divergence that is frequently used in the literature. However, there seems to be confusion about the correct order in which its functional arguments, the approximated and non-approximated beliefs, should be used. We hope that our elementary derivation settles the apparent confusion. We show for example that when approximating beliefs with Gaussian distributions the optimal approximation is given by moment matching. This is in contrast to many su...
Rašin, Andrija
1994-01-01
We discuss the idea of approximate flavor symmetries. Relations between approximate flavor symmetries and natural flavor conservation and democracy models is explored. Implications for neutrino physics are also discussed.
On Element SDD Approximability
Avron, Haim; Toledo, Sivan
2009-01-01
This short communication shows that in some cases scalar elliptic finite element matrices cannot be approximated well by an SDD matrix. We also give a theoretical analysis of a simple heuristic method for approximating an element by an SDD matrix.
Approximate iterative algorithms
Almudevar, Anthony Louis
2014-01-01
Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a
Approximation of distributed delays
Lu, Hao; Eberard, Damien; Simon, Jean-Pierre
2010-01-01
We address in this paper the approximation problem of distributed delays. Such elements are convolution operators with kernel having bounded support, and appear in the control of time-delay systems. From the rich literature on this topic, we propose a general methodology to achieve such an approximation. For this, we enclose the approximation problem in the graph topology, and work with the norm defined over the convolution Banach algebra. The class of rational approximates is described, and a constructive approximation is proposed. Analysis in time and frequency domains is provided. This methodology is illustrated on the stabilization control problem, for which simulations results show the effectiveness of the proposed methodology.
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...
The Importance of being consistent
Wasserman, Adam; Jiang, Kaili; Kim, Min-Cheol; Sim, Eunji; Burke, Kieron
2016-01-01
We review the role of self-consistency in density functional theory. We apply a recent analysis to both Kohn-Sham and orbital-free DFT, as well as to Partition-DFT, which generalizes all aspects of standard DFT. In each case, the analysis distinguishes between errors in approximate functionals versus errors in the self-consistent density. This yields insights into the origins of many errors in DFT calculations, especially those often attributed to self-interaction or delocalization error. In many classes of problems, errors can be substantially reduced by using `better' densities. We review the history of these approaches, many of their applications, and give simple pedagogical examples.
Chip Multithreaded Consistency Model
Zu-Song Li; Dan-Dan Huan; Wei-Wu Hu; Zhi-Min Tang
2008-01-01
Multithreaded technique is the developing trend of high performance processor. Memory consistency model is essential to the correctness, performance and complexity of multithreaded processor. The chip multithreaded consistency model adapting to multithreaded processor is proposed in this paper. The restriction imposed on memory event ordering by chip multithreaded consistency is presented and formalized. With the idea of critical cycle built by Wei-Wu Hu, we prove that the proposed chip multithreaded consistency model satisfies the criterion of correct execution of sequential consistency model. Chip multithreaded consistency model provides a way of achieving high performance compared with sequential consistency model and ensures the compatibility of software that the execution result in multithreaded processor is the same as the execution result in uniprocessor. The implementation strategy of chip multithreaded consistency model in Godson-2 SMT processor is also proposed. Godson-2 SMT processor supports chip multithreaded consistency model correctly by exception scheme based on the sequential memory access queue of each thread.
Twisted inhomogeneous Diophantine approximation and badly approximable sets
Harrap, Stephen
2010-01-01
For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max {||qx_1||^(-i), ||qx_2||^(-j)} > c(x)/q for all q in N. Building on a result of Kurzweil, a new characterization of the set Bad(i, j) in terms of `well-approximable' vectors in the area of `twisted' inhomogeneous Diophantine approximation is established. In addition, it is shown that Bad^x(i, j), the `twisted' inhomogeneous analogue of Bad(i, j), has full Hausdorff dimension 2 when x is chosen from the set Bad(i, j).
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.
Achieser, N I
2004-01-01
A pioneer of many modern developments in approximation theory, N. I. Achieser designed this graduate-level text from the standpoint of functional analysis. The first two chapters address approximation problems in linear normalized spaces and the ideas of P. L. Tchebysheff. Chapter III examines the elements of harmonic analysis, and Chapter IV, integral transcendental functions of the exponential type. The final two chapters explore the best harmonic approximation of functions and Wiener's theorem on approximation. Professor Achieser concludes this exemplary text with an extensive section of pr
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.
Approximate Modified Policy Iteration
Scherrer, Bruno; Ghavamzadeh, Mohammad; Geist, Matthieu
2012-01-01
Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three approximate MPI (AMPI) algorithms that are extensions of the well-known approximate DP algorithms: fitted-value iteration, fitted-Q iteration, and classification-based policy iteration. We provide an error propagation analysis for AMPI that unifies those for approximate policy and value iteration. We also provide a finite-sample analysis for the classification-based implementation of AMPI (CBMPI), which is more general (and somehow contains) than the analysis of the other presented AMPI algorithms. An interesting observation is that the MPI's parameter allows us to control the balance of errors (in value function approximation and in estimating the greedy policy) in the fina...
Approximate calculation of integrals
Krylov, V I
2006-01-01
A systematic introduction to the principal ideas and results of the contemporary theory of approximate integration, this volume approaches its subject from the viewpoint of functional analysis. In addition, it offers a useful reference for practical computations. Its primary focus lies in the problem of approximate integration of functions of a single variable, rather than the more difficult problem of approximate integration of functions of more than one variable.The three-part treatment begins with concepts and theorems encountered in the theory of quadrature. The second part is devoted to t
Approximate and renormgroup symmetries
Ibragimov, Nail H. [Blekinge Institute of Technology, Karlskrona (Sweden). Dept. of Mathematics Science; Kovalev, Vladimir F. [Russian Academy of Sciences, Moscow (Russian Federation). Inst. of Mathematical Modeling
2009-07-01
''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)
Approximating Stationary Statistical Properties
Xiaoming WANG
2009-01-01
It is well-known that physical laws for large chaotic dynamical systems are revealed statistically. Many times these statistical properties of the system must be approximated numerically. The main contribution of this manuscript is to provide simple and natural criterions on numerical methods (temporal and spatial discretization) that are able to capture the stationary statistical properties of the underlying dissipative chaotic dynamical systems asymptotically. The result on temporal approximation is a recent finding of the author, and the result on spatial approximation is a new one. Applications to the infinite Prandtl number model for convection and the barotropic quasi-geostrophic model are also discussed.
Consistent model driven architecture
Niepostyn, Stanisław J.
2015-09-01
The goal of the MDA is to produce software systems from abstract models in a way where human interaction is restricted to a minimum. These abstract models are based on the UML language. However, the semantics of UML models is defined in a natural language. Subsequently the verification of consistency of these diagrams is needed in order to identify errors in requirements at the early stage of the development process. The verification of consistency is difficult due to a semi-formal nature of UML diagrams. We propose automatic verification of consistency of the series of UML diagrams originating from abstract models implemented with our consistency rules. This Consistent Model Driven Architecture approach enables us to generate automatically complete workflow applications from consistent and complete models developed from abstract models (e.g. Business Context Diagram). Therefore, our method can be used to check practicability (feasibility) of software architecture models.
Malvina Baica
1985-01-01
Full Text Available The author uses a new modification of Jacobi-Perron Algorithm which holds for complex fields of any degree (abbr. ACF, and defines it as Generalized Euclidean Algorithm (abbr. GEA to approximate irrationals.
Approximations in Inspection Planning
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
The Karlqvist approximation revisited
Tannous, C
2015-01-01
The Karlqvist approximation signaling the historical beginning of magnetic recording head theory is reviewed and compared to various approaches progressing from Green, Fourier, Conformal mapping that obeys the Sommerfeld edge condition at angular points and leads to exact results.
Approximations in Inspection Planning
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
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
Approximation Behooves Calibration
da Silva Ribeiro, André Manuel; Poulsen, Rolf
2013-01-01
Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009.......Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....
Maksim Duškin
2015-11-01
Full Text Available Approximation and supposition This article compares exponents of approximation (expressions like Russian около, примерно, приблизительно, более, свыше and the words expressing supposition (for example Russian скорее всего, наверное, возможно. These words are often confused in research, in particular researchers often mention exponents of supposition in case of exponents of approximation. Such approach arouses some objections. The author intends to demonstrate in this article a notional difference between approximation and supposition, therefore the difference between exponents of these two notions. This difference could be described by specifying different attitude of approximation and supposition to the notion of knowledge. Supposition implies speaker’s ignorance of the exact number, while approximation does not mean such ignorance. The article offers examples proving this point of view.
No consistent bimetric gravity?
Deser, S; Waldron, A
2013-01-01
We discuss the prospects for a consistent, nonlinear, partially massless (PM), gauge symmetry of bimetric gravity (BMG). Just as for single metric massive gravity, ultimate consistency of both BMG and the putative PM BMG theory relies crucially on this gauge symmetry. We argue, however, that it does not exist.
Hiscock, S.
1986-07-01
The importance of consistency in coal quality has become of increasing significance recently, with the current trend towards using coal from a range of sources. A significant development has been the swing in responsibilities for coal quality. The increasing demand for consistency in quality has led to a re-examination of where in the trade and transport chain the quality should be assessed and where further upgrading of inspection and preparation facilities are required. Changes are in progress throughout the whole coal transport chain which will improve consistency of delivered coal quality. These include installation of beneficiation plant at coal mines, export terminals, and on the premises of end users. It is suggested that one of the keys to success for the coal industry will be the ability to provide coal of a consistent quality.
Kent, A
1996-01-01
In the consistent histories formulation of quantum theory, the probabilistic predictions and retrodictions made from observed data depend on the choice of a consistent set. We show that this freedom allows the formalism to retrodict several contradictory propositions which correspond to orthogonal commuting projections and which all have probability one. We also show that the formalism makes contradictory probability one predictions when applied to generalised time-symmetric quantum mechanics.
Covariant approximation averaging
Shintani, Eigo; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph
2014-01-01
We present a new class of statistical error reduction techniques for Monte-Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in $N_f=2+1$ lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte-Carlo calculations over conventional methods for the same cost.
Diophantine approximations on fractals
Einsiedler, Manfred; Shapira, Uri
2009-01-01
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the natural measure) contains all finite patterns (hence is well approximable). Similarly, we show that for a variety of fractals in [0,1]^2, possessing some symmetry, almost any point is not Dirichlet improvable (hence is well approximable) and has property C (after Cassels). We then settle by similar methods a conjecture of M. Boshernitzan saying that there are no irrational numbers x in the unit interval such that the continued fraction expansions of {nx mod1 : n is a natural number} are uniformly eventually bounded.
Monotone Boolean approximation
Hulme, B.L.
1982-12-01
This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application for the analysis of noncoherent fault trees and event tree sequences.
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.
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
Norton, Andrew H.
1991-01-01
Local spline approximants offer a means for constructing finite difference formulae for numerical solution of PDEs. These formulae seem particularly well suited to situations in which the use of conventional formulae leads to non-linear computational instability of the time integration. This is explained in terms of frequency responses of the FDF.
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
Approximation by Cylinder Surfaces
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...
Network Consistent Data Association.
Chakraborty, Anirban; Das, Abir; Roy-Chowdhury, Amit K
2016-09-01
Existing data association techniques mostly focus on matching pairs of data-point sets and then repeating this process along space-time to achieve long term correspondences. However, in many problems such as person re-identification, a set of data-points may be observed at multiple spatio-temporal locations and/or by multiple agents in a network and simply combining the local pairwise association results between sets of data-points often leads to inconsistencies over the global space-time horizons. In this paper, we propose a Novel Network Consistent Data Association (NCDA) framework formulated as an optimization problem that not only maintains consistency in association results across the network, but also improves the pairwise data association accuracies. The proposed NCDA can be solved as a binary integer program leading to a globally optimal solution and is capable of handling the challenging data-association scenario where the number of data-points varies across different sets of instances in the network. We also present an online implementation of NCDA method that can dynamically associate new observations to already observed data-points in an iterative fashion, while maintaining network consistency. We have tested both the batch and the online NCDA in two application areas-person re-identification and spatio-temporal cell tracking and observed consistent and highly accurate data association results in all the cases.
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...
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.
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.
Topics in Metric Approximation
Leeb, William Edward
This thesis develops effective approximations of certain metrics that occur frequently in pure and applied mathematics. We show that distances that often arise in applications, such as the Earth Mover's Distance between two probability measures, can be approximated by easily computed formulas for a wide variety of ground distances. We develop simple and easily computed characterizations both of norms measuring a function's regularity -- such as the Lipschitz norm -- and of their duals. We are particularly concerned with the tensor product of metric spaces, where the natural notion of regularity is not the Lipschitz condition but the mixed Lipschitz condition. A theme that runs throughout this thesis is that snowflake metrics (metrics raised to a power less than 1) are often better-behaved than ordinary metrics. For example, we show that snowflake metrics on finite spaces can be approximated by the average of tree metrics with a distortion bounded by intrinsic geometric characteristics of the space and not the number of points. Many of the metrics for which we characterize the Lipschitz space and its dual are snowflake metrics. We also present applications of the characterization of certain regularity norms to the problem of recovering a matrix that has been corrupted by noise. We are able to achieve an optimal rate of recovery for certain families of matrices by exploiting the relationship between mixed-variable regularity conditions and the decay of a function's coefficients in a certain orthonormal basis.
Thomsen, Christa; Nielsen, Anne Ellerup
2006-01-01
of a case study showing that companies use different and not necessarily consistent strategies for reporting on CSR. Finally, the implications for managerial practice are discussed. The chapter concludes by highlighting the value and awareness of the discourse and the discourse types adopted......This chapter first outlines theory and literature on CSR and Stakeholder Relations focusing on the different perspectives and the contextual and dynamic character of the CSR concept. CSR reporting challenges are discussed and a model of analysis is proposed. Next, our paper presents the results...... in the reporting material. By implementing consistent discourse strategies that interact according to a well-defined pattern or order, it is possible to communicate a strong social commitment on the one hand, and to take into consideration the expectations of the shareholders and the other stakeholders...
A Magnetic Consistency Relation
Jain, Rajeev Kumar
2012-01-01
If cosmic magnetic fields are indeed produced during inflation, they are likely to be correlated with the scalar metric perturbations that are responsible for the Cosmic Microwave Background anisotropies and Large Scale Structure. Within an archetypical model of inflationary magnetogenesis, we show that there exists a new simple consistency relation for the non-Gaussian cross correlation function of the scalar metric perturbation with two powers of the magnetic field in the squeezed limit where the momentum of the metric perturbation vanishes. We emphasize that such a consistency relation turns out to be extremely useful to test some recent calculations in the literature. Apart from primordial non-Gaussianity induced by the curvature perturbations, such a cross correlation might provide a new observational probe of inflation and can in principle reveal the primordial nature of cosmic magnetic fields.
Consistency in Distributed Systems
Kemme, Bettina; Ramalingam, Ganesan; Schiper, André; Shapiro, Marc; Vaswani, Kapil
2013-01-01
International audience; In distributed systems, there exists a fundamental trade-off between data consistency, availability, and the ability to tolerate failures. This trade-off has significant implications on the design of the entire distributed computing infrastructure such as storage systems, compilers and runtimes, application development frameworks and programming languages. Unfortunately, it also has significant, and poorly understood, implications for the designers and developers of en...
Geometrically Consistent Mesh Modification
Bonito, A.
2010-01-01
A new paradigm of adaptivity is to execute refinement, coarsening, and smoothing of meshes on manifolds with incomplete information about their geometry and yet preserve position and curvature accuracy. We refer to this collectively as geometrically consistent (GC) mesh modification. We discuss the concept of discrete GC, show the failure of naive approaches, and propose and analyze a simple algorithm that is GC and accuracy preserving. © 2010 Society for Industrial and Applied Mathematics.
Consistent wind Facilitates Vection
Masaki Ogawa
2011-10-01
Full Text Available We examined whether a consistent haptic cue suggesting forward self-motion facilitated vection. We used a fan with no blades (Dyson, AM01 providing a wind of constant strength and direction (wind speed was 6.37 m/s to the subjects' faces with the visual stimuli visible through the fan. We used an optic flow of expansion or contraction created by positioning 16,000 dots at random inside a simulated cube (length 20 m, and moving the observer's viewpoint to simulate forward or backward self-motion of 16 m/s. we tested three conditions for fan operation, which were normal operation, normal operation with the fan reversed (ie, no wind, and no operation (no wind and no sound. Vection was facilitated by the wind (shorter latency, longer duration and larger magnitude values with the expansion stimuli. The fan noise did not facilitate vection. The wind neither facilitated nor inhibited vection with the contraction stimuli, perhaps because a headwind is not consistent with backward self-motion. We speculate that the consistency between multi modalities is a key factor in facilitating vection.
Chalasani, P.; Saias, I. [Los Alamos National Lab., NM (United States); Jha, S. [Carnegie Mellon Univ., Pittsburgh, PA (United States)
1996-04-08
As increasingly large volumes of sophisticated options (called derivative securities) are traded in world financial markets, determining a fair price for these options has become an important and difficult computational problem. Many valuation codes use the binomial pricing model, in which the stock price is driven by a random walk. In this model, the value of an n-period option on a stock is the expected time-discounted value of the future cash flow on an n-period stock price path. Path-dependent options are particularly difficult to value since the future cash flow depends on the entire stock price path rather than on just the final stock price. Currently such options are approximately priced by Monte carlo methods with error bounds that hold only with high probability and which are reduced by increasing the number of simulation runs. In this paper the authors show that pricing an arbitrary path-dependent option is {number_sign}-P hard. They show that certain types f path-dependent options can be valued exactly in polynomial time. Asian options are path-dependent options that are particularly hard to price, and for these they design deterministic polynomial-time approximate algorithms. They show that the value of a perpetual American put option (which can be computed in constant time) is in many cases a good approximation to the value of an otherwise identical n-period American put option. In contrast to Monte Carlo methods, the algorithms have guaranteed error bounds that are polynormally small (and in some cases exponentially small) in the maturity n. For the error analysis they derive large-deviation results for random walks that may be of independent interest.
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
Infanticide and moral consistency.
McMahan, Jeff
2013-05-01
The aim of this essay is to show that there are no easy options for those who are disturbed by the suggestion that infanticide may on occasion be morally permissible. The belief that infanticide is always wrong is doubtfully compatible with a range of widely shared moral beliefs that underlie various commonly accepted practices. Any set of beliefs about the morality of abortion, infanticide and the killing of animals that is internally consistent and even minimally credible will therefore unavoidably contain some beliefs that are counterintuitive.
Serfon, Cedric; The ATLAS collaboration
2016-01-01
One of the biggest challenge with Large scale data management system is to ensure the consistency between the global file catalog and what is physically on all storage elements. To tackle this issue, the Rucio software which is used by the ATLAS Distributed Data Management system has been extended to automatically handle lost or unregistered files (aka Dark Data). This system automatically detects these inconsistencies and take actions like recovery or deletion of unneeded files in a central manner. In this talk, we will present this system, explain the internals and give some results.
When is holography consistent?
McInnes, Brett, E-mail: matmcinn@nus.edu.sg [National University of Singapore (Singapore); Ong, Yen Chin, E-mail: yenchin.ong@nordita.org [Nordita, KTH Royal Institute of Technology and Stockholm University, Roslagstullsbacken 23, SE-106 91 Stockholm (Sweden)
2015-09-15
Holographic duality relates two radically different kinds of theory: one with gravity, one without. The very existence of such an equivalence imposes strong consistency conditions which are, in the nature of the case, hard to satisfy. Recently a particularly deep condition of this kind, relating the minimum of a probe brane action to a gravitational bulk action (in a Euclidean formulation), has been recognized; and the question arises as to the circumstances under which it, and its Lorentzian counterpart, is satisfied. We discuss the fact that there are physically interesting situations in which one or both versions might, in principle, not be satisfied. These arise in two distinct circumstances: first, when the bulk is not an Einstein manifold and, second, in the presence of angular momentum. Focusing on the application of holography to the quark–gluon plasma (of the various forms arising in the early Universe and in heavy-ion collisions), we find that these potential violations never actually occur. This suggests that the consistency condition is a “law of physics” expressing a particular aspect of holography.
Approximate Bayesian computation.
Mikael Sunnåker
Full Text Available Approximate Bayesian computation (ABC constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology.
Consistent quantum measurements
Griffiths, Robert B.
2015-11-01
In response to recent criticisms by Okon and Sudarsky, various aspects of the consistent histories (CH) resolution of the quantum measurement problem(s) are discussed using a simple Stern-Gerlach device, and compared with the alternative approaches to the measurement problem provided by spontaneous localization (GRW), Bohmian mechanics, many worlds, and standard (textbook) quantum mechanics. Among these CH is unique in solving the second measurement problem: inferring from the measurement outcome a property of the measured system at a time before the measurement took place, as is done routinely by experimental physicists. The main respect in which CH differs from other quantum interpretations is in allowing multiple stochastic descriptions of a given measurement situation, from which one (or more) can be selected on the basis of its utility. This requires abandoning a principle (termed unicity), central to classical physics, that at any instant of time there is only a single correct description of the world.
Roy, Swapnoneel; Thakur, Ashok Kumar
2008-01-01
Genome rearrangements have been modelled by a variety of primitives such as reversals, transpositions, block moves and block interchanges. We consider such a genome rearrangement primitive Strip Exchanges. Given a permutation, the challenge is to sort it by using minimum number of strip exchanges. A strip exchanging move interchanges the positions of two chosen strips so that they merge with other strips. The strip exchange problem is to sort a permutation using minimum number of strip exchanges. We present here the first non-trivial 2-approximation algorithm to this problem. We also observe that sorting by strip-exchanges is fixed-parameter-tractable. Lastly we discuss the application of strip exchanges in a different area Optical Character Recognition (OCR) with an example.
Approximation by Cylinder Surfaces
Randrup, Thomas
1997-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....
S-Approximation: A New Approach to Algebraic Approximation
M. R. Hooshmandasl
2014-01-01
Full Text Available We intend to study a new class of algebraic approximations, called S-approximations, and their properties. We have shown that S-approximations can be used for applied problems which cannot be modeled by inclusion based approximations. Also, in this work, we studied a subclass of S-approximations, called Sℳ-approximations, and showed that this subclass preserves most of the properties of inclusion based approximations but is not necessarily inclusionbased. The paper concludes by studying some basic operations on S-approximations and counting the number of S-min functions.
When Is Holography Consistent?
McInnes, Brett
2015-01-01
Holographic duality relates two radically different kinds of theory: one with gravity, one without. The very existence of such an equivalence imposes strong consistency conditions which are, in the nature of the case, hard to satisfy. Recently a particularly deep condition of this kind, relating the minimum of a probe brane action to a gravitational bulk action (in a Euclidean formulation), has been recognised; and the question arises as to the circumstances under which it, and its Lorentzian counterpart, are satisfied. We discuss the fact that there are physically interesting situations in which one or both versions might, in principle, \\emph{not} be satisfied. These arise in two distinct circumstances: first, when the bulk is not an Einstein manifold, and, second, in the presence of angular momentum. Focusing on the application of holography to the quark-gluon plasma (of the various forms arising in the early Universe and in heavy-ion collisions), we find that these potential violations never actually occur...
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.
On surface approximation using developable surfaces
Chen, H. Y.; Lee, I. K.; Leopoldseder, s.
1999-01-01
We introduce a method for approximating a given surface by a developable surface. It will be either a G(1) surface consisting of pieces of cones or cylinders of revolution or a G(r) NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding. (C) 1999 Academic Press....
On surface approximation using developable surfaces
Chen, H. Y.; Lee, I. K.; Leopoldseder, S.
1998-01-01
We introduce a method for approximating a given surface by a developable surface. It will be either a G_1 surface consisting of pieces of cones or cylinders of revolution or a G_r NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding....
Quasiparticle self-consistent GW theory.
van Schilfgaarde, M; Kotani, Takao; Faleev, S
2006-06-09
In past decades the scientific community has been looking for a reliable first-principles method to predict the electronic structure of solids with high accuracy. Here we present an approach which we call the quasiparticle self-consistent approximation. It is based on a kind of self-consistent perturbation theory, where the self-consistency is constructed to minimize the perturbation. We apply it to selections from different classes of materials, including alkali metals, semiconductors, wide band gap insulators, transition metals, transition metal oxides, magnetic insulators, and rare earth compounds. Apart from some mild exceptions, the properties are very well described, particularly in weakly correlated cases. Self-consistency dramatically improves agreement with experiment, and is sometimes essential. Discrepancies with experiment are systematic, and can be explained in terms of approximations made.
Operators of Approximations and Approximate Power Set Spaces
ZHANG Xian-yong; MO Zhi-wen; SHU Lan
2004-01-01
Boundary inner and outer operators are introduced; and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, complement operators, so the rough set theory has been enriched from the operator-oriented and set-oriented views. Approximate power set spaces are defined, and it is proved that the approximation operators are epimorphisms from power set space to approximate power set spaces. Some basic properties of approximate power set space are got by epimorphisms in contrast to power set space.
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...
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.
Nonlinear Approximation Using Gaussian Kernels
Hangelbroek, Thomas
2009-01-01
It is well-known that non-linear approximation has an advantage over linear schemes in the sense that it provides comparable approximation rates to those of the linear schemes, but to a larger class of approximands. This was established for spline approximations and for wavelet approximations, and more recently for homogeneous radial basis function (surface spline) approximations. However, no such results are known for the Gaussian function. The crux of the difficulty lies in the necessity to vary the tension parameter in the Gaussian function spatially according to local information about the approximand: error analysis of Gaussian approximation schemes with varying tension are, by and large, an elusive target for approximators. We introduce and analyze in this paper a new algorithm for approximating functions using translates of Gaussian functions with varying tension parameters. Our scheme is sophisticated to a degree that it employs even locally Gaussians with varying tensions, and that it resolves local ...
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.
Approximation by Multivariate Singular Integrals
Anastassiou, George A
2011-01-01
Approximation by Multivariate Singular Integrals is the first monograph to illustrate the approximation of multivariate singular integrals to the identity-unit operator. The basic approximation properties of the general multivariate singular integral operators is presented quantitatively, particularly special cases such as the multivariate Picard, Gauss-Weierstrass, Poisson-Cauchy and trigonometric singular integral operators are examined thoroughly. This book studies the rate of convergence of these operators to the unit operator as well as the related simultaneous approximation. The last cha
A consistent molecular hydrogen isotope chemistry scheme based on an independent bond approximation
Pieterse, G.; Krol, M.C.; Röckmann, T.
2009-01-01
The isotopic composition of molecular hydrogen (H2) produced by photochemical oxidation of methane (CH4) and Volatile Organic Compounds (VOCs) is a key quantity in the global isotope budget of (H2). The many individual reaction steps involved complicate its investigation. Here we present a simplifie
Approximations of fractional Brownian motion
Li, Yuqiang; 10.3150/10-BEJ319
2012-01-01
Approximations of fractional Brownian motion using Poisson processes whose parameter sets have the same dimensions as the approximated processes have been studied in the literature. In this paper, a special approximation to the one-parameter fractional Brownian motion is constructed using a two-parameter Poisson process. The proof involves the tightness and identification of finite-dimensional distributions.
Approximation by planar elastic curves
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....
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.
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
Self-consistent structure of metallic hydrogen
Straus, D. M.; Ashcroft, N. W.
1977-01-01
A calculation is presented of the total energy of metallic hydrogen for a family of face-centered tetragonal lattices carried out within the self-consistent phonon approximation. The energy of proton motion is large and proper inclusion of proton dynamics alters the structural dependence of the total energy, causing isotropic lattices to become favored. For the dynamic lattice the structural dependence of terms of third and higher order in the electron-proton interaction is greatly reduced from static lattice equivalents.
BDD Minimization for Approximate Computing
Soeken, Mathias; Grosse, Daniel; Chandrasekharan, Arun; Drechsler, Rolf
2016-01-01
We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representation but meets a threshold w.r.t. an error metric. We present operators to derive approximated functions and present algorithms to exactly compute the error metrics directly on the BDD representation. An experimental evaluation demonstrates the app...
Tree wavelet approximations with applications
XU Yuesheng; ZOU Qingsong
2005-01-01
We construct a tree wavelet approximation by using a constructive greedy scheme(CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.
A new insight into the consistency of smoothed particle hydrodynamics
Sigalotti, Leonardo Di G; Klapp, Jaime; Vargas, Carlos A; Campos, Kilver
2016-01-01
In this paper the problem of consistency of smoothed particle hydrodynamics (SPH) is solved. A novel error analysis is developed in $n$-dimensional space using the Poisson summation formula, which enables the treatment of the kernel and particle approximation errors in combined fashion. New consistency integral relations are derived for the particle approximation which correspond to the cosine Fourier transform of the classically known consistency conditions for the kernel approximation. The functional dependence of the error bounds on the SPH interpolation parameters, namely the smoothing length $h$ and the number of particles within the kernel support ${\\cal{N}}$ is demonstrated explicitly from which consistency conditions are seen to follow naturally. As ${\\cal{N}}\\to\\infty$, the particle approximation converges to the kernel approximation independently of $h$ provided that the particle mass scales with $h$ as $m\\propto h^{\\beta}$, with $\\beta >n$. This implies that as $h\\to 0$, the joint limit $m\\to 0$, $...
Diophantine approximation and automorphic spectrum
Ghosh, Anish; Nevo, Amos
2010-01-01
The present paper establishes qunatitative estimates on the rate of diophantine approximation in homogeneous varieties of semisimple algebraic groups. The estimates established generalize and improve previous ones, and are sharp in a number of cases. We show that the rate of diophantine approximation is controlled by the spectrum of the automorphic representation, and is thus subject to the generalised Ramanujan conjectures.
Some results in Diophantine approximation
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...
Beyond the random phase approximation
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...
Uniform approximation by (quantum) polynomials
Drucker, A.; de Wolf, R.
2011-01-01
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectivel
Global approximation of convex functions
Azagra, D
2011-01-01
We show that for every (not necessarily bounded) open convex subset $U$ of $\\R^n$, every (not necessarily Lipschitz or strongly) convex function $f:U\\to\\R$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we provide a technique which transfers results on uniform approximation on bounded sets to results on uniform approximation on unbounded sets, in such a way that not only convexity and $C^k$ smoothness, but also local Lipschitz constants, minimizers, order, and strict or strong convexity, are preserved. This transfer method is quite general and it can also be used to obtain new results on approximation of convex functions defined on Riemannian manifolds or Banach spaces. We also provide a characterization of the class of convex functions which can be uniformly approximated on $\\R^n$ by strongly convex functions.
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.
Approximate circuits for increased reliability
Hamlet, Jason R.; Mayo, Jackson R.
2015-12-22
Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.
Consistency of trace norm minimization
Bach, Francis
2007-01-01
Regularization by the sum of singular values, also referred to as the trace norm, is a popular technique for estimating low rank rectangular matrices. In this paper, we extend some of the consistency results of the Lasso to provide necessary and sufficient conditions for rank consistency of trace norm minimization with the square loss. We also provide an adaptive version that is rank consistent even when the necessary condition for the non adaptive version is not fulfilled.
High SNR Consistent Compressive Sensing
Kallummil, Sreejith; Kalyani, Sheetal
2017-01-01
High signal to noise ratio (SNR) consistency of model selection criteria in linear regression models has attracted a lot of attention recently. However, most of the existing literature on high SNR consistency deals with model order selection. Further, the limited literature available on the high SNR consistency of subset selection procedures (SSPs) is applicable to linear regression with full rank measurement matrices only. Hence, the performance of SSPs used in underdetermined linear models ...
Rytov approximation in electron scattering
Krehl, Jonas; Lubk, Axel
2017-06-01
In this work we introduce the Rytov approximation in the scope of high-energy electron scattering with the motivation of developing better linear models for electron scattering. Such linear models play an important role in tomography and similar reconstruction techniques. Conventional linear models, such as the phase grating approximation, have reached their limits in current and foreseeable applications, most importantly in achieving three-dimensional atomic resolution using electron holographic tomography. The Rytov approximation incorporates propagation effects which are the most pressing limitation of conventional models. While predominately used in the weak-scattering regime of light microscopy, we show that the Rytov approximation can give reasonable results in the inherently strong-scattering regime of transmission electron microscopy.
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
Approximate common divisors via lattices
Cohn, Henry
2011-01-01
We analyze the multivariate generalization of Howgrave-Graham's algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common divisor of size N^beta, this improves the size of the error tolerated from N^(beta^2) to N^(beta^((m+1)/m)), under a commonly used heuristic assumption. This gives a more detailed analysis of the hardness assumption underlying the recent fully homomorphic cryptosystem of van Dijk, Gentry, Halevi, and Vaikuntanathan. While these results do not challenge the suggested parameters, a 2^sqrt(n) approximation algorithm for lattice basis reduction in n dimensions could be used to break these parameters. We have implemented our algorithm, and it performs better in practice than the theoretical analysis suggests. Our results fit into a broader context of analogies between cryptanalysis and coding theory. The multivariate approximate common divisor problem is the number-theoretic analogue of noisy multivariate polynomial interpolation, and we ...
Approximate Implicitization Using Linear Algebra
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.
Binary nucleation beyond capillarity approximation
Kalikmanov, V.I.
2010-01-01
Large discrepancies between binary classical nucleation theory (BCNT) and experiments result from adsorption effects and inability of BCNT, based on the phenomenological capillarity approximation, to treat small clusters. We propose a model aimed at eliminating both of these deficiencies. Adsorption
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.
Nonlinear approximation with redundant dictionaries
Borup, Lasse; Nielsen, M.; Gribonval, R.
2005-01-01
In this paper we study nonlinear approximation and data representation with redundant function dictionaries. In particular, approximation with redundant wavelet bi-frame systems is studied in detail. Several results for orthonormal wavelets are generalized to the redundant case. In general......, for a wavelet bi-frame system the approximation properties are limited by the number of vanishing moments of the system. In some cases this can be overcome by oversampling, but at a price of replacing the canonical expansion by another linear expansion. Moreover, for special non-oversampled wavelet bi-frames we...... can obtain good approximation properties not restricted by the number of vanishing moments, but again without using the canonical expansion....
Mathematical algorithms for approximate reasoning
Murphy, John H.; Chay, Seung C.; Downs, Mary M.
1988-01-01
Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away
Spatial ability explains the male advantage in approximate arithmetic
Wei eWei
2016-03-01
Full Text Available Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former’s advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is highly associated with visuospatial processing and there is a male advantage in visuospatial processing, we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experiment 1 and 554 college students in Experiment 2, we found that males showed better performance in approximate arithmetic. Furthermore, gender differences in approximate were accounted for by gender differences in spatial ability.
Consistency argued students of fluid
Viyanti; Cari; Suparmi; Winarti; Slamet Budiarti, Indah; Handika, Jeffry; Widyastuti, Fatma
2017-01-01
Problem solving for physics concepts through consistency arguments can improve thinking skills of students and it is an important thing in science. The study aims to assess the consistency of the material Fluid student argmentation. The population of this study are College students PGRI Madiun, UIN Sunan Kalijaga Yogyakarta and Lampung University. Samples using cluster random sampling, 145 samples obtained by the number of students. The study used a descriptive survey method. Data obtained through multiple-choice test and interview reasoned. Problem fluid modified from [9] and [1]. The results of the study gained an average consistency argmentation for the right consistency, consistency is wrong, and inconsistent respectively 4.85%; 29.93%; and 65.23%. Data from the study have an impact on the lack of understanding of the fluid material which is ideally in full consistency argued affect the expansion of understanding of the concept. The results of the study as a reference in making improvements in future studies is to obtain a positive change in the consistency of argumentations.
Bootstrap-Based Inference for Cube Root Consistent Estimators
Cattaneo, Matias D.; Jansson, Michael; Nagasawa, Kenichi
This note proposes a consistent bootstrap-based distributional approximation for cube root consistent estimators such as the maximum score estimator of Manski (1975) and the isotonic density estimator of Grenander (1956). In both cases, the standard nonparametric bootstrap is known to be inconsis......This note proposes a consistent bootstrap-based distributional approximation for cube root consistent estimators such as the maximum score estimator of Manski (1975) and the isotonic density estimator of Grenander (1956). In both cases, the standard nonparametric bootstrap is known...
Coordinating user interfaces for consistency
Nielsen, Jakob
2001-01-01
In the years since Jakob Nielsen's classic collection on interface consistency first appeared, much has changed, and much has stayed the same. On the one hand, there's been exponential growth in the opportunities for following or disregarding the principles of interface consistency-more computers, more applications, more users, and of course the vast expanse of the Web. On the other, there are the principles themselves, as persistent and as valuable as ever. In these contributed chapters, you'll find details on many methods for seeking and enforcing consistency, along with bottom-line analys
Consistency of Random Survival Forests.
Ishwaran, Hemant; Kogalur, Udaya B
2010-07-01
We prove uniform consistency of Random Survival Forests (RSF), a newly introduced forest ensemble learner for analysis of right-censored survival data. Consistency is proven under general splitting rules, bootstrapping, and random selection of variables-that is, under true implementation of the methodology. Under this setting we show that the forest ensemble survival function converges uniformly to the true population survival function. To prove this result we make one key assumption regarding the feature space: we assume that all variables are factors. Doing so ensures that the feature space has finite cardinality and enables us to exploit counting process theory and the uniform consistency of the Kaplan-Meier survival function.
Reinforcement Learning via AIXI Approximation
Veness, Joel; Hutter, Marcus; Silver, David
2010-01-01
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian optimality notion for general reinforcement learning agents. Previously, it has been unclear whether the theory of AIXI could motivate the design of practical algorithms. We answer this hitherto open question in the affirmative, by providing the first computationally feasible approximation to the AIXI agent. To develop our approximation, we introduce a Monte Carlo Tree Search algorithm along with an agent-specific extension of the Context Tree Weighting algorithm. Empirically, we present a set of encouraging results on a number of stochastic, unknown, and partially observable domains.
Approximate Matching of Hierarchial Data
Augsten, Nikolaus
The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...
Concept Approximation between Fuzzy Ontologies
无
2006-01-01
Fuzzy ontologies are efficient tools to handle fuzzy and uncertain knowledge on the semantic web; but there are heterogeneity problems when gaining interoperability among different fuzzy ontologies. This paper uses concept approximation between fuzzy ontologies based on instances to solve the heterogeneity problems. It firstly proposes an instance selection technology based on instance clustering and weighting to unify the fuzzy interpretation of different ontologies and reduce the number of instances to increase the efficiency. Then the paper resolves the problem of computing the approximations of concepts into the problem of computing the least upper approximations of atom concepts. It optimizes the search strategies by extending atom concept sets and defining the least upper bounds of concepts to reduce the searching space of the problem. An efficient algorithm for searching the least upper bounds of concept is given.
Approximating Graphic TSP by Matchings
Mömke, Tobias
2011-01-01
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.
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...
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.
Approximate Sparse Regularized Hyperspectral Unmixing
Chengzhi Deng
2014-01-01
Full Text Available Sparse regression based unmixing has been recently proposed to estimate the abundance of materials present in hyperspectral image pixel. In this paper, a novel sparse unmixing optimization model based on approximate sparsity, namely, approximate sparse unmixing (ASU, is firstly proposed to perform the unmixing task for hyperspectral remote sensing imagery. And then, a variable splitting and augmented Lagrangian algorithm is introduced to tackle the optimization problem. In ASU, approximate sparsity is used as a regularizer for sparse unmixing, which is sparser than l1 regularizer and much easier to be solved than l0 regularizer. Three simulated and one real hyperspectral images were used to evaluate the performance of the proposed algorithm in comparison to l1 regularizer. Experimental results demonstrate that the proposed algorithm is more effective and accurate for hyperspectral unmixing than state-of-the-art l1 regularizer.
Process Fairness and Dynamic Consistency
S.T. Trautmann (Stefan); P.P. Wakker (Peter)
2010-01-01
textabstractAbstract: When process fairness deviates from outcome fairness, dynamic inconsistencies can arise as in nonexpected utility. Resolute choice (Machina) can restore dynamic consistency under nonexpected utility without using Strotz's precommitment. It can similarly justify dynamically
Gravitation, Causality, and Quantum Consistency
Hertzberg, Mark P
2016-01-01
We examine the role of consistency with causality and quantum mechanics in determining the properties of gravitation. We begin by constructing two different classes of interacting theories of massless spin 2 particles -- gravitons. One involves coupling the graviton with the lowest number of derivatives to matter, the other involves coupling the graviton with higher derivatives to matter, making use of the linearized Riemann tensor. The first class requires an infinite tower of terms for consistency, which is known to lead uniquely to general relativity. The second class only requires a finite number of terms for consistency, which appears as a new class of theories of massless spin 2. We recap the causal consistency of general relativity and show how this fails in the second class for the special case of coupling to photons, exploiting related calculations in the literature. In an upcoming publication [1] this result is generalized to a much broader set of theories. Then, as a causal modification of general ...
Transfinite Approximation of Hindman's Theorem
Beiglböck, Mathias
2010-01-01
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring of the integers there are arbitrarily long finite sets with the same property. We extend the finite form of Hindman's Theorem to a "transfinite" version for each countable ordinal, and show that Hindman's Theorem is equivalent to the appropriate transfinite approximation holding for every countable ordinal. We then give a proof of Hindman's Theorem by directly proving these transfinite approximations.
Tree wavelet approximations with applications
无
2005-01-01
[1]Baraniuk, R. G., DeVore, R. A., Kyriazis, G., Yu, X. M., Near best tree approximation, Adv. Comput. Math.,2002, 16: 357-373.[2]Cohen, A., Dahmen, W., Daubechies, I., DeVore, R., Tree approximation and optimal encoding, Appl. Comput.Harmonic Anal., 2001, 11: 192-226.[3]Dahmen, W., Schneider, R., Xu, Y., Nonlinear functionals of wavelet expansions-adaptive reconstruction and fast evaluation, Numer. Math., 2000, 86: 49-101.[4]DeVore, R. A., Nonlinear approximation, Acta Numer., 1998, 7: 51-150.[5]Davis, G., Mallat, S., Avellaneda, M., Adaptive greedy approximations, Const. Approx., 1997, 13: 57-98.[6]DeVore, R. A., Temlyakov, V. N., Some remarks on greedy algorithms, Adv. Comput. Math., 1996, 5: 173-187.[7]Kashin, B. S., Temlyakov, V. N., Best m-term approximations and the entropy of sets in the space L1, Mat.Zametki (in Russian), 1994, 56: 57-86.[8]Temlyakov, V. N., The best m-term approximation and greedy algorithms, Adv. Comput. Math., 1998, 8:249-265.[9]Temlyakov, V. N., Greedy algorithm and m-term trigonometric approximation, Constr. Approx., 1998, 14:569-587.[10]Hutchinson, J. E., Fractals and self similarity, Indiana. Univ. Math. J., 1981, 30: 713-747.[11]Binev, P., Dahmen, W., DeVore, R. A., Petruchev, P., Approximation classes for adaptive methods, Serdica Math.J., 2002, 28: 1001-1026.[12]Gilbarg, D., Trudinger, N. S., Elliptic Partial Differential Equations of Second Order, Berlin: Springer-Verlag,1983.[13]Ciarlet, P. G., The Finite Element Method for Elliptic Problems, New York: North Holland, 1978.[14]Birman, M. S., Solomiak, M. Z., Piecewise polynomial approximation of functions of the class Wαp, Math. Sb.,1967, 73: 295-317.[15]DeVore, R. A., Lorentz, G. G., Constructive Approximation, New York: Springer-Verlag, 1993.[16]DeVore, R. A., Popov, V., Interpolation of Besov spaces, Trans. Amer. Math. Soc., 1988, 305: 397-414.[17]Devore, R., Jawerth, B., Popov, V., Compression of wavelet decompositions, Amer. J. Math., 1992, 114: 737-785.[18]Storozhenko, E
Performance of a Distributed Stochastic Approximation Algorithm
Bianchi, Pascal; Hachem, Walid
2012-01-01
In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients: the existence of a Lyapunov function for the mean field in the agreement subspace, and a contraction property of the random matrices of weights in the subspace orthogonal to the agreement subspace. A second order analysis of the algorithm is also performed under the form of a Central Limit Theorem. The Polyak-averaged version of the algorithm is also considered.
Improved Approximation for Orienting Mixed Graphs
Gamzu, Iftah
2012-01-01
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges of the graph so as to maximize the number of pairs that admit a directed source-target path. This problem has recently arisen in the study of biological networks, and it also has applications in communication networks. In this paper, we identify an interesting local-to-global orientation property. This property enables us to modify the best known algorithms for maximum mixed graph orientation and some of its special structured instances, due to Elberfeld et al. (CPM '11), and obtain improved approximation ratios. We further proceed by developing an algorithm that achieves an even better approximation guarantee for the general setting of the problem. Finally, we study several well-motivated variants of this orientation problem.
Time-consistent and market-consistent evaluations
Pelsser, A.; Stadje, M.A.
2014-01-01
We consider evaluation methods for payoffs with an inherent financial risk as encountered for instance for portfolios held by pension funds and insurance companies. Pricing such payoffs in a way consistent to market prices typically involves combining actuarial techniques with methods from mathemati
Spatial ability explains the male advantage in approximate arithmetic
Wei eWei; Chuansheng eChen; Xinlin eZhou
2016-01-01
Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former’s advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is highly associated with visuospatial processing and there is a male advantage in visuospatial processing, we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experim...
Spatial Ability Explains the Male Advantage in Approximate Arithmetic
Wei, Wei; Chen, Chuansheng; Zhou, Xinlin
2016-01-01
© 2016 Wei, Chen and Zhou. Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former's advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is closely associated with visuospatial processing, which shows a male advantage we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experim...
WKB Approximation in Noncommutative Gravity
Maja Buric
2007-12-01
Full Text Available We consider the quasi-commutative approximation to a noncommutative geometry defined as a generalization of the moving frame formalism. The relation which exists between noncommutativity and geometry is used to study the properties of the high-frequency waves on the flat background.
Approximation properties of haplotype tagging
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.
Truthful approximations to range voting
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...
Approximate Reasoning with Fuzzy Booleans
Broek, van den P.M.; Noppen, J.A.R.
2004-01-01
This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp ante
Ultrafast Approximation for Phylogenetic Bootstrap
Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt
2013-01-01
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
On badly approximable complex numbers
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...
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.
Approximation on the complex sphere
Alsaud, Huda; Kushpel, Alexander; Levesley, Jeremy
2012-01-01
We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations. The results obtained is a synthesis of new results on classical orthogonal polynomials, harmonic analysis on manifolds and geometric properties of Euclidean spaces.
On badly approximable complex numbers
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...
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…
Approximation of Surfaces by Cylinders
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...
Approximate Reanalysis in Topology Optimization
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...
Communication Complexity of Approximate Matching in Distributed Graphs
Huang, Zengfeng; Radunović, Božidar; Vojnović, Milan
n this paper we consider the communication complexity of approximation algorithms for maximum matching in a graph in the message-passing model of distributed computation. The input graph consists of n vertices and edges partitioned over a set of k sites. The output is an α - approximate maximum m...
Low Rank Approximation in $G_0W_0$ Approximation
Shao, Meiyue; Yang, Chao; Liu, Fang; da Jornada, Felipe H; Deslippe, Jack; Louie, Steven G
2016-01-01
The single particle energies obtained in a Kohn--Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in transport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green's function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The $G_0W_0$ approximation is a widely used technique in which the self energy is expressed as the convolution of a non-interacting Green's function ($G_0$) and a screened Coulomb interaction ($W_0$) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating $W_0$ at multiple frequencies. In this paper, we discuss how the cos...
Market-consistent actuarial valuation
Wüthrich, Mario V
2016-01-01
This is the third edition of this well-received textbook, presenting powerful methods for measuring insurance liabilities and assets in a consistent way, with detailed mathematical frameworks that lead to market-consistent values for liabilities. Topics covered are stochastic discounting with deflators, valuation portfolio in life and non-life insurance, probability distortions, asset and liability management, financial risks, insurance technical risks, and solvency. Including updates on recent developments and regulatory changes under Solvency II, this new edition of Market-Consistent Actuarial Valuation also elaborates on different risk measures, providing a revised definition of solvency based on industry practice, and presents an adapted valuation framework which takes a dynamic view of non-life insurance reserving risk.
Consistent Histories in Quantum Cosmology
Craig, David A; 10.1007/s10701-010-9422-6
2010-01-01
We illustrate the crucial role played by decoherence (consistency of quantum histories) in extracting consistent quantum probabilities for alternative histories in quantum cosmology. Specifically, within a Wheeler-DeWitt quantization of a flat Friedmann-Robertson-Walker cosmological model sourced with a free massless scalar field, we calculate the probability that the univese is singular in the sense that it assumes zero volume. Classical solutions of this model are a disjoint set of expanding and contracting singular branches. A naive assessment of the behavior of quantum states which are superpositions of expanding and contracting universes may suggest that a "quantum bounce" is possible i.e. that the wave function of the universe may remain peaked on a non-singular classical solution throughout its history. However, a more careful consistent histories analysis shows that for arbitrary states in the physical Hilbert space the probability of this Wheeler-DeWitt quantum universe encountering the big bang/crun...
Consistent supersymmetric decoupling in cosmology
Sousa Sánchez, Kepa
2012-01-01
The present work discusses several problems related to the stability of ground states with broken supersymmetry in supergravity, and to the existence and stability of cosmic strings in various supersymmetric models. In particular we study the necessary conditions to truncate consistently a sector o
Approximate Inference for Wireless Communications
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...... complexity can potentially lead to limited power consumption, which translates into longer battery life-time in the handsets. The scope of the thesis is more specifically to investigate approximate (nearoptimal) detection methods that can reduce the computationally complexity significantly compared...... 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...
Hydrogen Beyond the Classic Approximation
Scivetti, I
2003-01-01
The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position
Validity of the eikonal approximation
Kabat, D
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymptotic behavior of the full amplitude. For spin--2 tensor fields the eikonal captures the leading behavior of each order in perturbation theory, but the sum of eikonal terms is subdominant to graphs neglected by the approximation. We also comment on the eikonal for Yang-Mills vector exchange, where the additional complexities of the non-abelian theory may be absorbed into Regge-type modifications of the gauge boson propagators.
Approximate Privacy: Foundations and Quantification
Feigenbaum, Joan; Schapira, Michael
2009-01-01
Increasing use of computers and networks in business, government, recreation, and almost all aspects of daily life has led to a proliferation of online sensitive data about individuals and organizations. Consequently, concern about the privacy of these data has become a top priority, particularly those data that are created and used in electronic commerce. There have been many formulations of privacy and, unfortunately, many negative results about the feasibility of maintaining privacy of sensitive data in realistic networked environments. We formulate communication-complexity-based definitions, both worst-case and average-case, of a problem's privacy-approximation ratio. We use our definitions to investigate the extent to which approximate privacy is achievable in two standard problems: the second-price Vickrey auction and the millionaires problem of Yao. For both the second-price Vickrey auction and the millionaires problem, we show that not only is perfect privacy impossible or infeasibly costly to achieve...
Validity of the Eikonal Approximation
Kabat, Daniel
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymp...
The Electroweak Sudakov approximation in SHERPA
Thompson, Jennifer M
2016-01-01
As experimental particle physics becomes more and more precise, it is becoming increasingly important for Monte Carlo simulations to improve the precision of their predictions. In terms of the hard matrix element, this means calculating to a higher order in perturbation theory. To be consistent this requires both NNLO QCD corrections and NLO EW corrections to be included. There are also interference effects between these processes that are not simple to handle consistently. For a broad description of the behaviour of NLO EW corrections at high energies, the Sudakov logarithmic approach provides a good approximation, and is much less computationally expensive than the full calculation. The implementation of EW Sudakov logarithms within the SHERPA program are outlined here along with some initial results. As well as this, an overview of the status of full NLO EW computations with SHERPA is presented.
Approximate Counting of Graphical Realizations.
Erdős, Péter L; Kiss, Sándor Z; Miklós, István; Soukup, Lajos
2015-01-01
In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007), for regular directed graphs (by Greenhill, 2011) and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013). Several heuristics on counting the number of possible realizations exist (via sampling processes), and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases) the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS) for counting of all realizations.
Approximate Counting of Graphical Realizations.
Péter L Erdős
Full Text Available In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007, for regular directed graphs (by Greenhill, 2011 and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013. Several heuristics on counting the number of possible realizations exist (via sampling processes, and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS for counting of all realizations.
Many Faces of Boussinesq Approximations
Vladimirov, Vladimir A
2016-01-01
The \\emph{equations of Boussinesq approximation} (EBA) for an incompressible and inhomogeneous in density fluid are analyzed from a viewpoint of the asymptotic theory. A systematic scaling shows that there is an infinite number of related asymptotic models. We have divided them into three classes: `poor', `reasonable' and `good' Boussinesq approximations. Each model can be characterized by two parameters $q$ and $k$, where $q =1, 2, 3, \\dots$ and $k=0, \\pm 1, \\pm 2,\\dots$. Parameter $q$ is related to the `quality' of approximation, while $k$ gives us an infinite set of possible scales of velocity, time, viscosity, \\emph{etc.} Increasing $q$ improves the quality of a model, but narrows the limits of its applicability. Parameter $k$ allows us to vary the scales of time, velocity and viscosity and gives us the possibility to consider any initial and boundary conditions. In general, we discover and classify a rich variety of possibilities and restrictions, which are hidden behind the routine use of the Boussinesq...
Consistence of Network Filtering Rules
SHE Kun; WU Yuancheng; HUANG Juncai; ZHOU Mingtian
2004-01-01
The inconsistence of firewall/VPN(Virtual Private Network) rule makes a huge maintainable cost.With development of Multinational Company,SOHO office,E-government the number of firewalls/VPN will increase rapidly.Rule table in stand-alone or network will be increased in geometric series accordingly.Checking the consistence of rule table manually is inadequate.A formal approach can define semantic consistence,make a theoretic foundation of intelligent management about rule tables.In this paper,a kind of formalization of host rules and network ones for auto rule-validation based on SET theory were proporsed and a rule validation scheme was defined.The analysis results show the superior performance of the methods and demonstrate its potential for the intelligent management based on rule tables.
Self-consistent triaxial models
Sanders, Jason L
2015-01-01
We present self-consistent triaxial stellar systems that have analytic distribution functions (DFs) expressed in terms of the actions. These provide triaxial density profiles with cores or cusps at the centre. They are the first self-consistent triaxial models with analytic DFs suitable for modelling giant ellipticals and dark haloes. Specifically, we study triaxial models that reproduce the Hernquist profile from Williams & Evans (2015), as well as flattened isochrones of the form proposed by Binney (2014). We explore the kinematics and orbital structure of these models in some detail. The models typically become more radially anisotropic on moving outwards, have velocity ellipsoids aligned in Cartesian coordinates in the centre and aligned in spherical polar coordinates in the outer parts. In projection, the ellipticity of the isophotes and the position angle of the major axis of our models generally changes with radius. So, a natural application is to elliptical galaxies that exhibit isophote twisting....
Approximate Graph Edit Distance in Quadratic Time.
Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst
2015-09-14
Graph edit distance is one of the most flexible and general graph matching models available. The major drawback of graph edit distance, however, is its computational complexity that restricts its applicability to graphs of rather small size. Recently the authors of the present paper introduced a general approximation framework for the graph edit distance problem. The basic idea of this specific algorithm is to first compute an optimal assignment of independent local graph structures (including substitutions, deletions, and insertions of nodes and edges). This optimal assignment is complete and consistent with respect to the involved nodes of both graphs and can thus be used to instantly derive an admissible (yet suboptimal) solution for the original graph edit distance problem in O(n3) time. For large scale graphs or graph sets, however, the cubic time complexity may still be too high. Therefore, we propose to use suboptimal algorithms with quadratic rather than cubic time for solving the basic assignment problem. In particular, the present paper introduces five different greedy assignment algorithms in the context of graph edit distance approximation. In an experimental evaluation we show that these methods have great potential for further speeding up the computation of graph edit distance while the approximated distances remain sufficiently accurate for graph based pattern classification.
CMB-lensing beyond the Born approximation
Marozzi, Giovanni; Fanizza, Giuseppe; Di Dio, Enea; Durrer, Ruth
2016-09-01
We investigate the weak lensing corrections to the cosmic microwave background temperature anisotropies considering effects beyond the Born approximation. To this aim, we use the small deflection angle approximation, to connect the lensed and unlensed power spectra, via expressions for the deflection angles up to third order in the gravitational potential. While the small deflection angle approximation has the drawback to be reliable only for multipoles l lesssim 2500, it allows us to consistently take into account the non-Gaussian nature of cosmological perturbation theory beyond the linear level. The contribution to the lensed temperature power spectrum coming from the non-Gaussian nature of the deflection angle at higher order is a new effect which has not been taken into account in the literature so far. It turns out to be the leading contribution among the post-Born lensing corrections. On the other hand, the effect is smaller than corrections coming from non-linearities in the matter power spectrum, and its imprint on CMB lensing is too small to be seen in present experiments.
CMB-lensing beyond the Born approximation
Marozzi, Giovanni; Di Dio, Enea; Durrer, Ruth
2016-01-01
We investigate the weak lensing corrections to the cosmic microwave background temperature anisotropies considering effects beyond the Born approximation. To this aim, we use the small deflection angle approximation, to connect the lensed and unlensed power spectra, via expressions for the deflection angles up to third order in the gravitational potential. While the small deflection angle approximation has the drawback to be reliable only for multipoles $\\ell\\lesssim 2500$, it allows us to consistently take into account the non-Gaussian nature of cosmological perturbation theory beyond the linear level. The contribution to the lensed temperature power spectrum coming from the non-Gaussian nature of the deflection angle at higher order is a new effect which has not been taken into account in the literature so far. It turns out to be the leading contribution among the post-Born lensing corrections. On the other hand, the effect is smaller than corrections coming from non-linearities in the matter power spectrum...
On Modal Refinement and Consistency
Nyman, Ulrik; Larsen, Kim Guldstrand; Wasowski, Andrzej
2007-01-01
Almost 20 years after the original conception, we revisit several fundamental question about modal transition systems. First, we demonstrate the incompleteness of the standard modal refinement using a counterexample due to Hüttel. Deciding any refinement, complete with respect to the standard...... notions of implementation, is shown to be computationally hard (co-NP hard). Second, we consider four forms of consistency (existence of implementations) for modal specifications. We characterize each operationally, giving algorithms for deciding, and for synthesizing implementations, together...
Many-body approximations for atomic binding energies
Schuster, Micah D; Staker, Joshua T
2011-01-01
We benchmark three approximations for the many-body problem -- the Hartree-Fock, projected Hartree-Fock, and random phase approximations -- against full numerical configuration-interaction calculations of the electronic structure of atoms, from Li through to Ne. Each method uses exactly the same input, i.e., the same single-particle basis and Coulomb matrix elements, so any differences are strictly due to the approximation itself. Although it consistently overestimates the ground state binding energy, the random phase approximation has the smallest overall errors; furthermore, we suggest it may be useful as a method for efficient optimization of single-particle basis functions.
An approximation based global optimization strategy for structural synthesis
Sepulveda, A. E.; Schmit, L. A.
1991-01-01
A global optimization strategy for structural synthesis based on approximation concepts is presented. The methodology involves the solution of a sequence of highly accurate approximate problems using a global optimization algorithm. The global optimization algorithm implemented consists of a branch and bound strategy based on the interval evaluation of the objective function and constraint functions, combined with a local feasible directions algorithm. The approximate design optimization problems are constructed using first order approximations of selected intermediate response quantities in terms of intermediate design variables. Some numerical results for example problems are presented to illustrate the efficacy of the design procedure setforth.
Tri-Sasakian consistent reduction
Cassani, Davide
2011-01-01
We establish a universal consistent Kaluza-Klein truncation of M-theory based on seven-dimensional tri-Sasakian structure. The four-dimensional truncated theory is an N=4 gauged supergravity with three vector multiplets and a non-abelian gauge group, containing the compact factor SO(3). Consistency follows from the fact that our truncation takes exactly the same form as a left-invariant reduction on a specific coset manifold, and we show that the same holds for the various universal consistent truncations recently put forward in the literature. We describe how the global symmetry group SL(2,R) x SO(6,3) is embedded in the symmetry group E7(7) of maximally supersymmetric reductions, and make the connection with the approach of Exceptional Generalized Geometry. Vacuum AdS4 solutions spontaneously break the amount of supersymmetry from N=4 to N=3,1 or 0, and the spectrum contains massive modes. We find a subtruncation to minimal N=3 gauged supergravity as well as an N=1 subtruncation to the SO(3)-invariant secto...
Consistency and variability in functional localisers
Duncan, Keith J.; Pattamadilok, Chotiga; Knierim, Iris; Devlin, Joseph T.
2009-01-01
A critical assumption underlying the use of functional localiser scans is that the voxels identified as the functional region-of-interest (fROI) are essentially the same as those activated by the main experimental manipulation. Intra-subject variability in the location of the fROI violates this assumption, reducing the sensitivity of the analysis and biasing the results. Here we investigated consistency and variability in fROIs in a set of 45 volunteers. They performed two functional localiser scans to identify word- and object-sensitive regions of ventral and lateral occipito-temporal cortex, respectively. In the main analyses, fROIs were defined as the category-selective voxels in each region and consistency was measured as the spatial overlap between scans. Consistency was greatest when minimally selective thresholds were used to define “active” voxels (p < 0.05 uncorrected), revealing that approximately 65% of the voxels were commonly activated by both scans. In contrast, highly selective thresholds (p < 10− 4 to 10− 6) yielded the lowest consistency values with less than 25% overlap of the voxels active in both scans. In other words, intra-subject variability was surprisingly high, with between one third and three quarters of the voxels in a given fROI not corresponding to those activated in the main task. This level of variability stands in striking contrast to the consistency seen in retinotopically-defined areas and has important implications for designing robust but efficient functional localiser scans. PMID:19289173
Rollout Sampling Approximate Policy Iteration
Dimitrakakis, Christos
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 supervised learning problem. This paper proposes variants of an improved policy iteration scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine. The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning domains: inverted pendulum and mountain-car.
Approximate Deconvolution Reduced Order Modeling
Xie, Xuping; Wang, Zhu; Iliescu, Traian
2015-01-01
This paper proposes a large eddy simulation reduced order model(LES-ROM) framework for the numerical simulation of realistic flows. In this LES-ROM framework, the proper orthogonal decomposition(POD) is used to define the ROM basis and a POD differential filter is used to define the large ROM structures. An approximate deconvolution(AD) approach is used to solve the ROM closure problem and develop a new AD-ROM. This AD-ROM is tested in the numerical simulation of the one-dimensional Burgers equation with a small diffusion coefficient(10^{-3})
Approximation for Bayesian Ability Estimation.
1987-02-18
posterior pdfs of ande are given by p(-[Y) p(F) F P((y lei’ j)P )d. SiiJ i (4) a r~d p(e Iy) - p(t0) 1 J i P(Yij ei, (5) As shown in Tsutakawa and Lin...inverse A Hessian of the log of (27) with respect to , evaulatedat a Then, under regularity conditions, the marginal posterior pdf of O is...two-way contingency tables. Journal of Educational Statistics, 11, 33-56. Lindley, D.V. (1980). Approximate Bayesian methods. Trabajos Estadistica , 31
Impact of inflow transport approximation on light water reactor analysis
Choi, Sooyoung; Smith, Kord; Lee, Hyun Chul; Lee, Deokjung
2015-10-01
The impact of the inflow transport approximation on light water reactor analysis is investigated, and it is verified that the inflow transport approximation significantly improves the accuracy of the transport and transport/diffusion solutions. A methodology for an inflow transport approximation is implemented in order to generate an accurate transport cross section. The inflow transport approximation is compared to the conventional methods, which are the consistent-PN and the outflow transport approximations. The three transport approximations are implemented in the lattice physics code STREAM, and verification is performed for various verification problems in order to investigate their effects and accuracy. From the verification, it is noted that the consistent-PN and the outflow transport approximations cause significant error in calculating the eigenvalue and the power distribution. The inflow transport approximation shows very accurate and precise results for the verification problems. The inflow transport approximation shows significant improvements not only for the high leakage problem but also for practical large core problem analyses.
Souto-Iglesias, Antonio; González, Leo M; Cercos-Pita, Jose L
2013-01-01
The consistency of Moving Particle Semi-implicit (MPS) method in reproducing the gradient, divergence and Laplacian differential operators is discussed in the present paper. Its relation to the Smoothed Particle Hydrodynamics (SPH) method is rigorously established. The application of the MPS method to solve the Navier-Stokes equations using a fractional step approach is treated, unveiling inconsistency problems when solving the Poisson equation for the pressure. A new corrected MPS method incorporating boundary terms is proposed. Applications to one dimensional boundary value Dirichlet and mixed Neumann-Dirichlet problems and to two-dimensional free-surface flows are presented.
Measuring process and knowledge consistency
Edwards, Kasper; Jensen, Klaes Ladeby; Haug, Anders
2007-01-01
with a 5 point Liker scale and a corresponding scoring system. Process consistency is measured by using a first-person drawing tool with the respondent in the centre. Respondents sketch the sequence of steps and people they contact when configuring a product. The methodology is tested in one company...... for granted; rather the contrary, and attempting to implement a configuration system may easily ignite a political battle. This is because stakes are high in the sense that the rules and processes chosen may only reflect one part of the practice, ignoring a majority of the employees. To avoid this situation...
Plasma Physics Approximations in Ares
Managan, R. A.
2015-01-08
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, F_{n}( μ/θ ), 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.
Rational approximations to fluid properties
Kincaid, J. M.
1990-05-01
The purpose of this report is to summarize some results that were presented at the Spring AIChE meeting in Orlando, Florida (20 March 1990). We report on recent attempts to develop a systematic method, based on the technique of rational approximation, for creating mathematical models of real-fluid equations of state and related properties. Equation-of-state models for real fluids are usually created by selecting a function tilde p(T,rho) that contains a set of parameters (gamma sub i); the (gamma sub i) is chosen such that tilde p(T,rho) provides a good fit to the experimental data. (Here p is the pressure, T the temperature and rho is the density). In most cases, a nonlinear least-squares numerical method is used to determine (gamma sub i). There are several drawbacks to this method: one has essentially to guess what tilde p(T,rho) should be; the critical region is seldom fit very well and nonlinear numerical methods are time consuming and sometimes not very stable. The rational approximation approach we describe may eliminate all of these drawbacks. In particular, it lets the data choose the function tilde p(T,rho) and its numerical implementation involves only linear algorithms.
Energetics of a fluid under the Boussinesq approximation
Maruyama, Kiyoshi
2014-01-01
This paper presents a theory describing the energy budget of a fluid under the Boussinesq approximation: the theory is developed in a manner consistent with the conservation law of mass. It shows that no potential energy is available under the Boussinesq approximation, and also reveals that the work done by the buoyancy force due to changes in temperature corresponds to the conversion between kinetic and internal energy. This energy conversion, however, makes only an ignorable contribution to the distribution of temperature under the approximation. The Boussinesq approximation is, in physical oceanography, extended so that the motion of seawater can be studied. This paper considers this extended approximation as well. Under the extended approximation, the work done by the buoyancy force due to changes in salinity corresponds to the conversion between kinetic and potential energy. It also turns out that the conservation law of mass does not allow the condition $\
Maintaining consistency in distributed systems
Birman, Kenneth P.
1991-01-01
In systems designed as assemblies of independently developed components, concurrent access to data or data structures normally arises within individual programs, and is controlled using mutual exclusion constructs, such as semaphores and monitors. Where data is persistent and/or sets of operation are related to one another, transactions or linearizability may be more appropriate. Systems that incorporate cooperative styles of distributed execution often replicate or distribute data within groups of components. In these cases, group oriented consistency properties must be maintained, and tools based on the virtual synchrony execution model greatly simplify the task confronting an application developer. All three styles of distributed computing are likely to be seen in future systems - often, within the same application. This leads us to propose an integrated approach that permits applications that use virtual synchrony with concurrent objects that respect a linearizability constraint, and vice versa. Transactional subsystems are treated as a special case of linearizability.
Dodgson's Rule Approximations and Absurdity
McCabe-Dansted, John C
2010-01-01
With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe et al., 2003), unlike the traditional Dodgson rule. We call this rule DC and introduce two new related rules (DR and D&). Dodgson did not explicitly propose the "Dodgson rule" (Tideman, 1987); we argue that DC and DR are better realizations of the principle behind the Dodgson rule than the traditional Dodgson rule. These rules, especially D&, are also effective approximations to the traditional Dodgson's rule. We show that, unlike the rules we have considered previously, the DC, DR and D& scores differ from the Dodgson score by no more than a fixed amount given a fixed number of alternatives, and thus these new rules converge to Dodgson under any reasonable assumption on voter behaviour, including the Impartial Anonymous Culture assumption.
Approximation by double Walsh polynomials
Ferenc Móricz
1992-01-01
Full Text Available We study the rate of approximation by rectangular partial sums, Cesàro means, and de la Vallée Poussin means of double Walsh-Fourier series of a function in a homogeneous Banach space X. In particular, X may be Lp(I2, where 1≦p<∞ and I2=[0,1×[0,1, or CW(I2, the latter being the collection of uniformly W-continuous functions on I2. We extend the results by Watari, Fine, Yano, Jastrebova, Bljumin, Esfahanizadeh and Siddiqi from univariate to multivariate cases. As by-products, we deduce sufficient conditions for convergence in Lp(I2-norm and uniform convergence on I2 as well as characterizations of Lipschitz classes of functions. At the end, we raise three problems.
Interplay of approximate planning strategies.
Huys, Quentin J M; Lally, Níall; Faulkner, Paul; Eshel, Neir; Seifritz, Erich; Gershman, Samuel J; Dayan, Peter; Roiser, Jonathan P
2015-03-10
Humans routinely formulate plans in domains so complex that even the most powerful computers are taxed. To do so, they seem to avail themselves of many strategies and heuristics that efficiently simplify, approximate, and hierarchically decompose hard tasks into simpler subtasks. Theoretical and cognitive research has revealed several such strategies; however, little is known about their establishment, interaction, and efficiency. Here, we use model-based behavioral analysis to provide a detailed examination of the performance of human subjects in a moderately deep planning task. We find that subjects exploit the structure of the domain to establish subgoals in a way that achieves a nearly maximal reduction in the cost of computing values of choices, but then combine partial searches with greedy local steps to solve subtasks, and maladaptively prune the decision trees of subtasks in a reflexive manner upon encountering salient losses. Subjects come idiosyncratically to favor particular sequences of actions to achieve subgoals, creating novel complex actions or "options."
Approximate reduction of dynamical systems
Tabuada, Paulo; Julius, Agung; Pappas, George J
2007-01-01
The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with mechanical systems with symmetry--which, unfortunately, limits the type of systems to which it can be applied. The goal of this paper is to consider a more general form of reduction, termed approximate reduction, in order to extend the class of systems that can be reduced. Using notions related to incremental stability, we give conditions on when a dynamical system can be projected to a lower dimensional space while providing hard bounds on the induced errors, i.e., when it is behaviorally similar to a dynamical system on a lower dimensional space. These concepts are illustrated on a series of examples.
Diophantine approximations and Diophantine equations
Schmidt, Wolfgang M
1991-01-01
"This book by a leading researcher and masterly expositor of the subject studies diophantine approximations to algebraic numbers and their applications to diophantine equations. The methods are classical, and the results stressed can be obtained without much background in algebraic geometry. In particular, Thue equations, norm form equations and S-unit equations, with emphasis on recent explicit bounds on the number of solutions, are included. The book will be useful for graduate students and researchers." (L'Enseignement Mathematique) "The rich Bibliography includes more than hundred references. The book is easy to read, it may be a useful piece of reading not only for experts but for students as well." Acta Scientiarum Mathematicarum
Truthful approximations to range voting
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...... maximization in this setting. With m being the number of alternatives, we exhibit a randomized truthful-in-expectation ordinal mechanism implementing an outcome whose expected social welfare is at least an Omega(m^{-3/4}) fraction of the social welfare of the socially optimal alternative. On the other hand, we...... show that for sufficiently many agents and any truthful-in-expectation ordinal mechanism, there is a valuation profile where the mechanism achieves at most an O(m^{-{2/3}) fraction of the optimal social welfare in expectation. We get tighter bounds for the natural special case of m = 3...
Approximation of Surfaces by Cylinders
Randrup, Thomas
1998-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....
Analytical approximations for spiral waves
Löber, Jakob, E-mail: jakob@physik.tu-berlin.de; Engel, Harald [Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstrasse 36, EW 7-1, 10623 Berlin (Germany)
2013-12-15
We propose a non-perturbative attempt to solve the kinematic equations for spiral waves in excitable media. From the eikonal equation for the wave front we derive an implicit analytical relation between rotation frequency Ω and core radius R{sub 0}. For free, rigidly rotating spiral waves our analytical prediction is in good agreement with numerical solutions of the linear eikonal equation not only for very large but also for intermediate and small values of the core radius. An equivalent Ω(R{sub +}) dependence improves the result by Keener and Tyson for spiral waves pinned to a circular defect of radius R{sub +} with Neumann boundaries at the periphery. Simultaneously, analytical approximations for the shape of free and pinned spirals are given. We discuss the reasons why the ansatz fails to correctly describe the dependence of the rotation frequency on the excitability of the medium.
On quantum and approximate privacy
Klauck, H
2001-01-01
This paper studies privacy in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not increased by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain functions computable (almost) privately which are not computable using quantum communication without leakage or using classical communication with leakage. We also give an example of an exponential reduction of the communication complexity of a function by allowing a privacy loss of o(1) instead of privacy loss 0.
IONIS: Approximate atomic photoionization intensities
Heinäsmäki, Sami
2012-02-01
A program to compute relative atomic photoionization cross sections is presented. The code applies the output of the multiconfiguration Dirac-Fock method for atoms in the single active electron scheme, by computing the overlap of the bound electron states in the initial and final states. The contribution from the single-particle ionization matrix elements is assumed to be the same for each final state. This method gives rather accurate relative ionization probabilities provided the single-electron ionization matrix elements do not depend strongly on energy in the region considered. The method is especially suited for open shell atoms where electronic correlation in the ionic states is large. Program summaryProgram title: IONIS Catalogue identifier: AEKK_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKK_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 1149 No. of bytes in distributed program, including test data, etc.: 12 877 Distribution format: tar.gz Programming language: Fortran 95 Computer: Workstations Operating system: GNU/Linux, Unix Classification: 2.2, 2.5 Nature of problem: Photoionization intensities for atoms. Solution method: The code applies the output of the multiconfiguration Dirac-Fock codes Grasp92 [1] or Grasp2K [2], to compute approximate photoionization intensities. The intensity is computed within the one-electron transition approximation and by assuming that the sum of the single-particle ionization probabilities is the same for all final ionic states. Restrictions: The program gives nonzero intensities for those transitions where only one electron is removed from the initial configuration(s). Shake-type many-electron transitions are not computed. The ionized shell must be closed in the initial state. Running time: Few seconds for a
Approximate analytic solutions to the NPDD: Short exposure approximations
Close, Ciara E.; Sheridan, John T.
2014-04-01
There have been many attempts to accurately describe the photochemical processes that take places in photopolymer materials. As the models have become more accurate, solving them has become more numerically intensive and more 'opaque'. Recent models incorporate the major photochemical reactions taking place as well as the diffusion effects resulting from the photo-polymerisation process, and have accurately described these processes in a number of different materials. It is our aim to develop accessible mathematical expressions which provide physical insights and simple quantitative predictions of practical value to material designers and users. In this paper, starting with the Non-Local Photo-Polymerisation Driven Diffusion (NPDD) model coupled integro-differential equations, we first simplify these equations and validate the accuracy of the resulting approximate model. This new set of governing equations are then used to produce accurate analytic solutions (polynomials) describing the evolution of the monomer and polymer concentrations, and the grating refractive index modulation, in the case of short low intensity sinusoidal exposures. The physical significance of the results and their consequences for holographic data storage (HDS) are then discussed.
Decentralized Consistent Updates in SDN
Nguyen, Thanh Dang
2017-04-10
We present ez-Segway, a decentralized mechanism to consistently and quickly update the network state while preventing forwarding anomalies (loops and blackholes) and avoiding link congestion. In our design, the centralized SDN controller only pre-computes information needed by the switches during the update execution. This information is distributed to the switches, which use partial knowledge and direct message passing to efficiently realize the update. This separation of concerns has the key benefit of improving update performance as the communication and computation bottlenecks at the controller are removed. Our evaluations via network emulations and large-scale simulations demonstrate the efficiency of ez-Segway, which compared to a centralized approach, improves network update times by up to 45% and 57% at the median and the 99th percentile, respectively. A deployment of a system prototype in a real OpenFlow switch and an implementation in P4 demonstrate the feasibility and low overhead of implementing simple network update functionality within switches.
The Consistent Vehicle Routing Problem
Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University
2009-01-01
In the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same drivers visit the same customers at roughly the same time on each day that the customers need service. These service requirements, together with traditional constraints on vehicle capacity and route length, define a variant of the classical capacitated vehicle routing problem, which we call the consistent VRP (ConVRP). In this paper, we formulate the problem as a mixed-integer program and develop an algorithm to solve the ConVRP that is based on the record-to-record travel algorithm. We compare the performance of our algorithm to the optimal mixed-integer program solutions for a set of small problems and then apply our algorithm to five simulated data sets with 1,000 customers and a real-world data set with more than 3,700 customers. We provide a technique for generating ConVRP benchmark problems from vehicle routing problem instances given in the literature and provide our solutions to these instances. The solutions produced by our algorithm on all problems do a very good job of meeting customer service objectives with routes that have a low total travel time.
Approximate particle spectra in the pyramid scheme
Banks, Tom; Torres, T. J.
2012-12-01
We construct a minimal model inspired by the general class of pyramid schemes [T. Banks and J.-F. Fortin, J. High Energy Phys. 07 (2009) 046JHEPFG1029-8479], which is consistent with both supersymmetry breaking and electroweak symmetry breaking. In order to do computations, we make unjustified approximations to the low energy Kähler potential. The phenomenological viability of the resultant mass spectrum is then examined and compared with current collider limits. We show that for certain regimes of parameters, the model, and thus generically the pyramid scheme, can accommodate the current collider mass constraints on physics beyond the standard model with a tree-level light Higgs mass near 125 GeV. However, in this regime the model exhibits a little hierarchy problem, and one must permit fine-tunings that are of order 5%.
Approximately isometric lifting in quasidiagonal extensions
FANG XiaoChun; ZHAO YiLe
2009-01-01
Let O→I→A→A/I→O be a short exact sequence of C*-algebras with A unital.Suppose that the extension O→I→A→A/I→O is quasidiagonal,then it is shown that any positive element (projection,partial isometry,unitary element,respectively) in A/I has a lifting with the same form which commutes with some quasicentral approximate unit of I consisting of projections.Furthermore,it is shown that for any given positive number e,two positive elements (projections,As an application,it is shown that for any positive numbers e and (u) in U(A/I)0,there exists u in U(A)0which is a lifting of (u) such that cel(u) ＜ cel(u) +e.
Randomized approximate nearest neighbors algorithm.
Jones, Peter Wilcox; Osipov, Andrei; Rokhlin, Vladimir
2011-09-20
We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {x(j)} in R(d), the algorithm attempts to find k nearest neighbors for each of x(j), where k is a user-specified integer parameter. The algorithm is iterative, and its running time requirements are proportional to T·N·(d·(log d) + k·(d + log k)·(log N)) + N·k(2)·(d + log k), with T the number of iterations performed. The memory requirements of the procedure are of the order N·(d + k). A by-product of the scheme is a data structure, permitting a rapid search for the k nearest neighbors among {x(j)} for an arbitrary point x ∈ R(d). The cost of each such query is proportional to T·(d·(log d) + log(N/k)·k·(d + log k)), and the memory requirements for the requisite data structure are of the order N·(d + k) + T·(d + N). The algorithm utilizes random rotations and a basic divide-and-conquer scheme, followed by a local graph search. We analyze the scheme's behavior for certain types of distributions of {x(j)} and illustrate its performance via several numerical examples.
The cluster bootstrap consistency in generalized estimating equations
Cheng, Guang
2013-03-01
The cluster bootstrap resamples clusters or subjects instead of individual observations in order to preserve the dependence within each cluster or subject. In this paper, we provide a theoretical justification of using the cluster bootstrap for the inferences of the generalized estimating equations (GEE) for clustered/longitudinal data. Under the general exchangeable bootstrap weights, we show that the cluster bootstrap yields a consistent approximation of the distribution of the regression estimate, and a consistent approximation of the confidence sets. We also show that a computationally more efficient one-step version of the cluster bootstrap provides asymptotically equivalent inference. © 2012.
Approximations for strongly-coupled supersymmetric quantum mechanics
Kabat, D; Kabat, Daniel; Lifschytz, Gilad
2000-01-01
We advocate a set of approximations for studying the finite temperature behavior of strongly-coupled theories in 0+1 dimensions. The approximation consists of expanding about a Gaussian action, with the width of the Gaussian determined by a set of gap equations. The approximation can be applied to supersymmetric systems, provided that the gap equations are formulated in superspace. It can be applied to large-N theories, by keeping just the planar contribution to the gap equations. We analyze several models of scalar supersymmetric quantum mechanics, and show that the Gaussian approximation correctly distinguishes between a moduli space, mass gap, and supersymmetry breaking at strong coupling. Then we apply the approximation to a bosonic large-N gauge theory, and argue that a Gross-Witten transition separates the weak-coupling and strong-coupling regimes. A similar transition should occur in a generic large-N gauge theory, in particular in 0-brane quantum mechanics.
Obtaining exact value by approximate computations
Jing-zhong ZHANG; Yong FENG
2007-01-01
Numerical approximate computations can solve large and complex problems fast. They have the advantage of high efficiency. However they only give approximate results, whereas we need exact results in some fields. There is a gap between approximate computations and exact results.In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.
Fuzzy Set Approximations in Fuzzy Formal Contexts
Mingwen Shao; Shiqing Fan
2006-01-01
In this paper, a kind of multi-level formal concept is introduced. Based on the proposed multi-level formal concept, we present a pair of rough fuzzy set approximations within fuzzy formal contexts. By the proposed rough fuzzy set approximations, we can approximate a fuzzy set according to different precision level. We discuss the properties of the proposed approximation operators in detail.
Obtaining exact value by approximate computations
2007-01-01
Numerical approximate computations can solve large and complex problems fast.They have the advantage of high efficiency.However they only give approximate results,whereas we need exact results in some fields.There is a gap between approximate computations and exact results. In this paper,we build a bridge by which exact results can be obtained by numerical approximate computations.
Nonlinear approximation with dictionaries I. Direct estimates
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...... with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...
Nonlinear approximation with dictionaries, I: Direct estimates
Gribonval, Rémi; Nielsen, Morten
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 with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space...
Surface consistent finite frequency phase corrections
Kimman, W. P.
2016-07-01
Static time-delay corrections are frequency independent and ignore velocity variations away from the assumed vertical ray path through the subsurface. There is therefore a clear potential for improvement if the finite frequency nature of wave propagation can be properly accounted for. Such a method is presented here based on the Born approximation, the assumption of surface consistency and the misfit of instantaneous phase. The concept of instantaneous phase lends itself very well for sweep-like signals, hence these are the focus of this study. Analytical sensitivity kernels are derived that accurately predict frequency-dependent phase shifts due to P-wave anomalies in the near surface. They are quick to compute and robust near the source and receivers. An additional correction is presented that re-introduces the nonlinear relation between model perturbation and phase delay, which becomes relevant for stronger velocity anomalies. The phase shift as function of frequency is a slowly varying signal, its computation therefore does not require fine sampling even for broad-band sweeps. The kernels reveal interesting features of the sensitivity of seismic arrivals to the near surface: small anomalies can have a relative large impact resulting from the medium field term that is dominant near the source and receivers. Furthermore, even simple velocity anomalies can produce a distinct frequency-dependent phase behaviour. Unlike statics, the predicted phase corrections are smooth in space. Verification with spectral element simulations shows an excellent match for the predicted phase shifts over the entire seismic frequency band. Applying the phase shift to the reference sweep corrects for wavelet distortion, making the technique akin to surface consistent deconvolution, even though no division in the spectral domain is involved. As long as multiple scattering is mild, surface consistent finite frequency phase corrections outperform traditional statics for moderately large
Consistent lattice Boltzmann equations for phase transitions.
Siebert, D N; Philippi, P C; Mattila, K K
2014-11-01
Unlike conventional computational fluid dynamics methods, the lattice Boltzmann method (LBM) describes the dynamic behavior of fluids in a mesoscopic scale based on discrete forms of kinetic equations. In this scale, complex macroscopic phenomena like the formation and collapse of interfaces can be naturally described as related to source terms incorporated into the kinetic equations. In this context, a novel athermal lattice Boltzmann scheme for the simulation of phase transition is proposed. The continuous kinetic model obtained from the Liouville equation using the mean-field interaction force approach is shown to be consistent with diffuse interface model using the Helmholtz free energy. Density profiles, interface thickness, and surface tension are analytically derived for a plane liquid-vapor interface. A discrete form of the kinetic equation is then obtained by applying the quadrature method based on prescribed abscissas together with a third-order scheme for the discretization of the streaming or advection term in the Boltzmann equation. Spatial derivatives in the source terms are approximated with high-order schemes. The numerical validation of the method is performed by measuring the speed of sound as well as by retrieving the coexistence curve and the interface density profiles. The appearance of spurious currents near the interface is investigated. The simulations are performed with the equations of state of Van der Waals, Redlich-Kwong, Redlich-Kwong-Soave, Peng-Robinson, and Carnahan-Starling.
APPROXIMATE SAMPLING THEOREM FOR BIVARIATE CONTINUOUS FUNCTION
杨守志; 程正兴; 唐远炎
2003-01-01
An approximate solution of the refinement equation was given by its mask, and the approximate sampling theorem for bivariate continuous function was proved by applying the approximate solution. The approximate sampling function defined uniquely by the mask of the refinement equation is the approximate solution of the equation, a piece-wise linear function, and posseses an explicit computation formula. Therefore the mask of the refinement equation is selected according to one' s requirement, so that one may controll the decay speed of the approximate sampling function.
Bernstein-type approximations of smooth functions
Andrea Pallini
2007-10-01
Full Text Available The Bernstein-type approximation for smooth functions is proposed and studied. We propose the Bernstein-type approximation with definitions that directly apply the binomial distribution and the multivariate binomial distribution. The Bernstein-type approximations generalize the corresponding Bernstein polynomials, by considering definitions that depend on a convenient approximation coefficient in linear kernels. In the Bernstein-type approximations, we study the uniform convergence and the degree of approximation. The Bernstein-type estimators of smooth functions of population means are also proposed and studied.
Self-consistent generalized Langevin equation for colloidal mixtures.
Chávez-Rojo, Marco Antonio; Medina-Noyola, Magdaleno
2005-09-01
A self-consistent theory of collective and tracer diffusion in colloidal mixtures is presented. This theory is based on exact results for the partial intermediate scattering functions derived within the framework of the generalized Langevin equation formalism, plus a number of conceptually simple and sensible approximations. The first of these consists of a Vineyard-like approximation between collective and tracer diffusion, which writes the collective dynamics in terms of the memory function related to tracer diffusion. The second consists of interpolating this only unknown memory function between its two exact limits at small and large wave vectors; for this, a phenomenologically determined, but not arbitrary, interpolating function is introduced: a Lorentzian with its inflection point located at the first minimum of the partial static structure factor. The small wave-vector exact limit involves a time-dependent friction function, for which we take a general approximate result, previously derived within the generalized Langevin equation formalism. This general result expresses the time-dependent friction function in terms of the partial intermediate scattering functions, thus closing the system of equations into a fully self-consistent scheme. This extends to mixtures a recently proposed self-consistent theory developed for monodisperse suspensions [Yeomans-Reyna and Medina-Noyola, Phys. Rev. E 64, 066114 (2001)]. As an illustration of its quantitative accuracy, its application to a simple model of a binary dispersion in the absence of hydrodynamic interactions is reported.
Gluon transport equations with condensate in the small angle approximation
Blaizot, Jean-Paul [Institut de Physique Théorique (IPhT), CNRS/URA2306, CEA Saclay, F-91191 Gif-sur-Yvette (France); Liao, Jinfeng [Physics Department and Center for Exploration of Energy and Matter, Indiana University, 2401 N Milo B. Sampson Lane, Bloomington, IN 47408 (United States); RIKEN BNL Research Center, Bldg. 510A, Brookhaven National Laboratory, Upton, NY 11973 (United States)
2016-05-15
We derive the set of kinetic equations that control the evolution of gluons in the presence of a condensate. We show that the dominant singularities remain logarithmic when the scattering involves particles in the condensate. This allows us to define a consistent small angle approximation.
The local potential approximation in the background field formalism
Bridle, I Hamzaan; Morris, Tim R
2013-01-01
Working within the familiar local potential approximation, and concentrating on the example of a single scalar field in three dimensions, we show that the commonly used approximation method of identifying the total and background fields, leads to pathologies in the resulting fixed point structure and the associated spaces of eigenoperators. We then show how a consistent treatment of the background field through the corresponding modified shift Ward identity, can cure these pathologies, restoring universality of physical quantities with respect to the choice of dependence on the background field, even within the local potential approximation. Along the way we point out similarities to what has been previously found in the f(R) approximation in asymptotic safety for gravity.
Generalised quasi-linear approximation of the HMRI
Child, Adam; Marston, Brad; Tobias, Steven
2016-01-01
Motivated by recent advances in Direct Statistical Simulation (DSS) of astrophysical phenomena such as out of equilibrium jets, we perform a Direct Numerical Simulation (DNS) of the helical magnetorotational instability (HMRI) under the generalised quasilinear approximation (GQL). This approximation generalises the quasilinear approximation (QL) to include the self-consistent interaction of large-scale modes, interpolating between fully nonlinear DNS and QL DNS whilst still remaining formally linear in the small scales. In this paper we address whether GQL can more accurately describe low-order statistics of axisymmetric HMRI when compared with QL by performing DNS under various degrees of GQL approximation. We utilise various diagnostics, such as energy spectra in addition to first and second cumulants, for calculations performed for a range of Reynolds and Hartmann numbers (describing rotation and imposed magnetic field strength respectively). We find that GQL performs significantly better than QL in descri...
Applications of Discrepancy Theory in Multiobjective Approximation
Glaßer, Christian; Witek, Maximilian
2011-01-01
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.
Fractal Trigonometric Polynomials for Restricted Range Approximation
Chand, A. K. B.; Navascués, M. A.; Viswanathan, P.; Katiyar, S. K.
2016-05-01
One-sided approximation tackles the problem of approximation of a prescribed function by simple traditional functions such as polynomials or trigonometric functions that lie completely above or below it. In this paper, we use the concept of fractal interpolation function (FIF), precisely of fractal trigonometric polynomials, to construct one-sided uniform approximants for some classes of continuous functions.
Axiomatic Characterizations of IVF Rough Approximation Operators
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.
Some relations between entropy and approximation numbers
郑志明
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.
Nonlinear approximation with dictionaries, I: Direct estimates
Gribonval, Rémi; Nielsen, Morten
$-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space...
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.
Advanced Concepts and Methods of Approximate Reasoning
1989-12-01
and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka, editors, Approximate Reasoning and...190, 1981. [43] E. Trillas and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka
NONLINEAR APPROXIMATION WITH GENERAL WAVE PACKETS
L. Borup; M. Nielsen
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 characterization of the approximation spaces is derived.
Approximate Nearest Neighbor Queries among Parallel Segments
Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias
2010-01-01
We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...
Nonlinear approximation with general wave packets
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...... characterization of the approximation spaces is derived....
Nonlinear approximation with bi-framelets
Borup, Lasse; Nielsen, Morten; Gribonval, Rémi
2005-01-01
We study the approximation in Lebesgue spaces of wavelet bi-frame systems given by translations and dilations of a finite set of generators. A complete characterization of the approximation spaces associated with best m-term approximation of wavelet bi-framelet systems is given...
Approximation properties of fine hyperbolic graphs
Benyin Fu
2016-05-01
In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable discrete metric space. Moreover, we use the techniques of Ozawa’s to prove that a fine hyperbolic graph has the metric invariant translation approximation property.
Ferrighi, Lara; Madsen, Georg Kent Hellerup; Hammer, Bjørk
2011-01-01
are shortened and the adsorption bond strengths of the molecules are greatly improved over the virtually non-interacting results obtained when using a plain GGA exchange-correlation functional. The nucleobases containing oxygen atoms show higher corrugation with adsorption site and orientation than the other...... aromatic molecules considered. The adsorption of pentacene is studied on Au, Ag, and Cu surfaces. In agreement with experiment, the adsorption energies are found to increase with decreasing nobleness, but the dependency is underestimated. We point out how the kinetic energy density can discriminate between...
Stochastic approximation with state-dependent noise
陈翰馥
2000-01-01
The purpose of stochastic approximation (SA) is to find the roots of f(·) or the maximiz-er (minimizer) of L(·) when the unknown function f(·) or L(·) can be observed but with noise. SA is an important tool in dealing with many problems arising from systems and control, whose solutions often rely on convergence of the SA algorithm applied. Here the pathwise convergence of SA algorithms is considered, when the observation noise may depend on state by which we mean those x at which f( x) or L( x) are observed. The conditions imposed on the observation noise are the weakest in comparison with the existing ones. When the algorithm is to find the roots of f(·), the superiority of the condition given in the paper over those used in literature consists in the fact that the present condition is directly verifiable, needless to see the behaviour of the algorithm. When the algorithm is to find the maximizer (minimizer) of L(·), the present conditioin allows the observation noise to depend on the state. The
Stochastic approximation with state-dependent noise
无
2000-01-01
The purpose of stochastic approximation (SA) is to find the roots of f(·) or the maximizer (minimizer) of L(·) when the unknown function f(·) or L(·) can be observed but with noise. SA is an important tool in dealing with many problems arising from systems and control, whose solutions often rely on convergence of the SA algorithm applied. Here the pathwise convergence of SA algorithms is considered, when the observation noise may depend on state by which we mean those x at which f(x) or L(x) are observed. The conditions imposed on the observation noise are the weakest in comparison with the existing ones. When the algorithm is to find the roots of f(·), the superiority of the condition given in the paper over those used in literature consists in the fact that the present condition is directly verifiable, needless to see the behaviour of the algorithm. When the algorithm is to find the maximizer (minimizer) of L(·), the present conditioin allows the observation noise to depend on the state. The conditions imposed on f(·) and L(·) are truly general: f(·) is required to be measurable and locally bounded if the roots of f(·) are sought, and the gradient of L(·) is required to be locally Lipschitz continuous if the maximizer (minimizer) of L(·) is searched.
Gutzwiller approximation in strongly correlated electron systems
Li, Chunhua
Gutzwiller wave function is an important theoretical technique for treating local electron-electron correlations nonperturbatively in condensed matter and materials physics. It is concerned with calculating variationally the ground state wave function by projecting out multi-occupation configurations that are energetically costly. The projection can be carried out analytically in the Gutzwiller approximation that offers an approximate way of calculating expectation values in the Gutzwiller projected wave function. This approach has proven to be very successful in strongly correlated systems such as the high temperature cuprate superconductors, the sodium cobaltates, and the heavy fermion compounds. In recent years, it has become increasingly evident that strongly correlated systems have a strong propensity towards forming inhomogeneous electronic states with spatially periodic superstrutural modulations. A good example is the commonly observed stripes and checkerboard states in high- Tc superconductors under a variety of conditions where superconductivity is weakened. There exists currently a real challenge and demand for new theoretical ideas and approaches that treats strongly correlated inhomogeneous electronic states, which is the subject matter of this thesis. This thesis contains four parts. In the first part of the thesis, the Gutzwiller approach is formulated in the grand canonical ensemble where, for the first time, a spatially (and spin) unrestricted Gutzwiller approximation (SUGA) is developed for studying inhomogeneous (both ordered and disordered) quantum electronic states in strongly correlated electron systems. The second part of the thesis applies the SUGA to the t-J model for doped Mott insulators which led to the discovery of checkerboard-like inhomogeneous electronic states competing with d-wave superconductivity, consistent with experimental observations made on several families of high-Tc superconductors. In the third part of the thesis, new
Resonant-state expansion Born Approximation
Doost, M B
2015-01-01
The Born Approximation is a fundamental formula in Physics, it allows the calculation of weak scattering via the Fourier transform of the scattering potential. I extend the Born Approximation by including in the formula the Fourier transform of a truncated basis of the infinite number of appropriately normalised resonant states. This extension of the Born Approximation is named the Resonant-State Expansion Born Approximation or RSE Born Approximation. The resonant-states of the system can be calculated using the recently discovered RSE perturbation theory for electrodynamics and normalised correctly to appear in spectral Green's functions via the flux volume normalisation.
Canonical Sets of Best L1-Approximation
Dimiter Dryanov
2012-01-01
Full Text Available In mathematics, the term approximation usually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the best approximants via interpolation. It turns out that for some large classes of functions the best approximants with respect to a certain distance can be constructed by interpolation on a point set that does not depend on the choice of the function to be approximated. Such point sets are called canonical sets of best approximation. The present paper summarizes results on canonical sets of best L1-approximation with emphasis on multivariate interpolation and best L1-approximation by blending functions. The best L1-approximants are characterized as transfinite interpolants on canonical sets. The notion of a Haar-Chebyshev system in the multivariate case is discussed also. In this context, it is shown that some multivariate interpolation spaces share properties of univariate Haar-Chebyshev systems. We study also the problem of best one-sided multivariate L1-approximation by sums of univariate functions. Explicit constructions of best one-sided L1-approximants give rise to well-known and new inequalities.
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.
On Gakerkin approximations for the quasigeostrophic equations
Rocha, Cesar B; Grooms, Ian
2015-01-01
We study the representation of approximate solutions of the three-dimensional quasigeostrophic (QG) equations using Galerkin series with standard vertical modes. In particular, we show that standard modes are compatible with nonzero buoyancy at the surfaces and can be used to solve the Eady problem. We extend two existing Galerkin approaches (A and B) and develop a new Galerkin approximation (C). Approximation A, due to Flierl (1978), represents the streamfunction as a truncated Galerkin series and defines the potential vorticity (PV) that satisfies the inversion problem exactly. Approximation B, due to Tulloch and Smith (2009b), represents the PV as a truncated Galerkin series and calculates the streamfunction that satisfies the inversion problem exactly. Approximation C, the true Galerkin approximation for the QG equations, represents both streamfunction and PV as truncated Galerkin series, but does not satisfy the inversion equation exactly. The three approximations are fundamentally different unless the b...
Dispersion properties of the phononic crystal consisting of ellipse-shaped particles
Pavlov, I. S.; Vasiliev, A. A.; Porubov, A. V.
2016-12-01
A two-dimensional model is considered in the form of a phononic crystal having a rectangular lattice with elastically interacting ellipse-shaped particles possessing two translational and one rotational degrees of freedom. The linear differential-difference equations are obtained by the method of structural modeling to describe propagation of longitudinal, transverse and rotational waves in the medium. It is found analytically how the coefficients of the equations depend on the sizes of the particle and on the parameters of interactions between them. The dispersion properties of the model are analyzed. Existence of a backward wave is established. The threshold frequencies of acoustic and rotational waves in some crystalline materials with cubic symmetry are estimated.
Applicability of point dipoles approximation to all-dielectric metamaterials
Kuznetsova, S M; Lavrinenko, A V
2015-01-01
All-dielectric metamaterials consisting of high-dielectric inclusions in a low-dielectric matrix are considered as a low-loss alternative to resonant metal-based metamaterials. In this contribution we investigate the applicability of the point electric and magnetic dipoles approximation to dielectric meta-atoms on the example of a dielectric ring metamaterial. Despite the large electrical size of high-dielectric meta-atoms, the dipole approximation allows for accurate prediction of the metamaterials properties for the rings with diameters up to ~0.8 of the lattice constant. The results provide important guidelines for design and optimization of all-dielectric metamaterials.
Communication Complexity of Approximate Matching in Distributed Graphs
Huang, Zengfeng; Radunović, Božidar; Vojnović, Milan;
n this paper we consider the communication complexity of approximation algorithms for maximum matching in a graph in the message-passing model of distributed computation. The input graph consists of n vertices and edges partitioned over a set of k sites. The output is an α - approximate maximum...... matching in the input graph which has to be reported by one of the sites. We show a lower bound on the communication complexity ofΩ(α2kn) and show that it is tight up to poly-logarithmic factors. This lower bound also applies to other combinatorial problems on graphs in the message-passing computation...
Dynamical nonlocal coherent-potential approximation for itinerant electron magnetism.
Rowlands, D A; Zhang, Yu-Zhong
2014-11-26
A dynamical generalisation of the nonlocal coherent-potential approximation is derived based upon the functional integral approach to the interacting electron problem. The free energy is proven to be variational with respect to the self-energy provided a self-consistency condition on a cluster of sites is satisfied. In the present work, calculations are performed within the static approximation and the effect of the nonlocal physics on the formation of the local moment state in a simple model is investigated. The results reveal the importance of the dynamical correlations.
Fuzzy Approximate Model for Distributed Thermal Solar Collectors Control
Elmetennani, Shahrazed
2014-07-01
This paper deals with the problem of controlling concentrated solar collectors where the objective consists of making the outlet temperature of the collector tracking a desired reference. The performance of the novel approximate model based on fuzzy theory, which has been introduced by the authors in [1], is evaluated comparing to other methods in the literature. The proposed approximation is a low order state representation derived from the physical distributed model. It reproduces the temperature transfer dynamics through the collectors accurately and allows the simplification of the control design. Simulation results show interesting performance of the proposed controller.
Improving biconnectivity approximation via local optimization
Ka Wong Chong; Tak Wah Lam [Univ. of Hong Kong (Hong Kong)
1996-12-31
The problem of finding the minimum biconnected spanning subgraph of an undirected graph is NP-hard. A lot of effort has been made to find biconnected spanning subgraphs that approximate to the minimum one as close as possible. Recently, new polynomial-time (sequential) approximation algorithms have been devised to improve the approximation factor from 2 to 5/3 , then 3/2, while NC algorithms have also been known to achieve 7/4 + {epsilon}. This paper presents a new technique which can be used to further improve parallel approximation factors to 5/3 + {epsilon}. In the sequential context, the technique reveals an algorithm with a factor of {alpha} + 1/5, where a is the approximation factor of any 2-edge connectivity approximation algorithm.
Frankenstein's Glue: Transition functions for approximate solutions
Yunes, N
2006-01-01
Approximations are commonly employed to find approximate solutions to the Einstein equations. These solutions, however, are usually only valid in some specific spacetime region. A global solution can be constructed by gluing approximate solutions together, but this procedure is difficult because discontinuities can arise, leading to large violations of the Einstein equations. In this paper, we provide an attempt to formalize this gluing scheme by studying transition functions that join approximate solutions together. In particular, we propose certain sufficient conditions on these functions and proof that these conditions guarantee that the joined solution still satisfies the Einstein equations to the same order as the approximate ones. An example is also provided for a binary system of non-spinning black holes, where the approximate solutions are taken to be given by a post-Newtonian expansion and a perturbed Schwarzschild solution. For this specific case, we show that if the transition functions satisfy the...
Consistency of Trend Break Point Estimator with Underspecified Break Number
Jingjing Yang
2017-01-01
Full Text Available This paper discusses the consistency of trend break point estimators when the number of breaks is underspecified. The consistency of break point estimators in a simple location model with level shifts has been well documented by researchers under various settings, including extensions such as allowing a time trend in the model. Despite the consistency of break point estimators of level shifts, there are few papers on the consistency of trend shift break point estimators in the presence of an underspecified break number. The simulation study and asymptotic analysis in this paper show that the trend shift break point estimator does not converge to the true break points when the break number is underspecified. In the case of two trend shifts, the inconsistency problem worsens if the magnitudes of the breaks are similar and the breaks are either both positive or both negative. The limiting distribution for the trend break point estimator is developed and closely approximates the finite sample performance.
Floating-Point $L^2$-Approximations
Brisebarre, Nicolas; Hanrot, Guillaume
2007-01-01
International audience; Computing good polynomial approximations to usual functions is an important topic for the computer evaluation of those functions. These approximations can be good under several criteria, the most desirable being probably that the relative error is as small as possible in the $L^{\\infty}$ sense, i.e. everywhere on the interval under study. In the present paper, we investigate a simpler criterion, the $L^2$ case. Though finding a best polynomial $L^2$-approximation with ...
Metric Diophantine approximation on homogeneous varieties
Ghosh, Anish; Nevo, Amos
2012-01-01
We develop the metric theory of Diophantine approximation on homogeneous varieties of semisimple algebraic groups and prove results analogous to the classical Khinchin and Jarnik theorems. In full generality our results establish simultaneous Diophantine approximation with respect to several completions, and Diophantine approximation over general number fields using S-algebraic integers. In several important examples, the metric results we obtain are optimal. The proof uses quantitative equidistribution properties of suitable averaging operators, which are derived from spectral bounds in automorphic representations.
Approximately liner phase IIR digital filter banks
J. D. Ćertić; M. D. Lutovac; L. D. Milić
2013-01-01
In this paper, uniform and nonuniform digital filter banks based on approximately linear phase IIR filters and frequency response masking technique (FRM) are presented. Both filter banks are realized as a connection of an interpolated half-band approximately linear phase IIR filter as a first stage of the FRM design and an appropriate number of masking filters. The masking filters are half-band IIR filters with an approximately linear phase. The resulting IIR filter banks are compared with li...
A Note on Generalized Approximation Property
Antara Bhar
2013-01-01
Full Text Available We introduce a notion of generalized approximation property, which we refer to as --AP possessed by a Banach space , corresponding to an arbitrary Banach sequence space and a convex subset of , the class of bounded linear operators on . This property includes approximation property studied by Grothendieck, -approximation property considered by Sinha and Karn and Delgado et al., and also approximation property studied by Lissitsin et al. We characterize a Banach space having --AP with the help of -compact operators, -nuclear operators, and quasi--nuclear operators. A particular case for ( has also been characterized.
Upper Bounds on Numerical Approximation Errors
Raahauge, Peter
2004-01-01
This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function....... The bounds apply to moregeneral problems than existing bounding methods do. For instance, since strict concavityis not required, linear models and piecewise linear approximations can bedealt with. Despite the generality, the bounds perform well in comparison with existingmethods even when applied...... to approximations of a standard (strictly concave)growth model.KEYWORDS: Numerical approximation errors, Bellman contractions, Error bounds...
TMB: Automatic differentiation and laplace approximation
Kristensen, Kasper; Nielsen, Anders; Berg, Casper Willestofte
2016-01-01
computations. The user defines the joint likelihood for the data and the random effects as a C++ template function, while all the other operations are done in R; e.g., reading in the data. The package evaluates and maximizes the Laplace approximation of the marginal likelihood where the random effects...... are automatically integrated out. This approximation, and its derivatives, are obtained using automatic differentiation (up to order three) of the joint likelihood. The computations are designed to be fast for problems with many random effects (approximate to 10(6)) and parameters (approximate to 10...
Collisionless magnetic reconnection under anisotropic MHD approximation
Hirabayashi, Kota; Hoshino, Masahiro
We study the formation of slow-mode shocks in collisionless magnetic reconnection by using one- and two-dimensional collisionless magneto-hydro-dynamic (MHD) simulations based on the double adiabatic approximation, which is an important step to bridge the gap between the Petschek-type MHD reconnection model accompanied by a pair of slow shocks and the observational evidence of the rare occasion of in-situ slow shock observation. According to our results, a pair of slow shocks does form in the reconnection layer. The resultant shock waves, however, are quite weak compared with those in an isotropic MHD from the point of view of the plasma compression and the amount of the magnetic energy released across the shock. Once the slow shock forms, the downstream plasma are heated in highly anisotropic manner and a firehose-sense (P_{||}>P_{⊥}) pressure anisotropy arises. The maximum anisotropy is limited by the marginal firehose criterion, 1-(P_{||}-P_{⊥})/B(2) =0. In spite of the weakness of the shocks, the resultant reconnection rate is kept at the same level compared with that in the corresponding ordinary MHD simulations. It is also revealed that the sequential order of propagation of the slow shock and the rotational discontinuity, which appears when the guide field component exists, changes depending on the magnitude of the guide field. Especially, when no guide field exists, the rotational discontinuity degenerates with the contact discontinuity remaining at the position of the initial current sheet, while with the slow shock in the isotropic MHD. Our result implies that the slow shock does not necessarily play an important role in the energy conversion in the reconnection system and is consistent with the satellite observation in the Earth's magnetosphere.
Entropy Viscosity Method for High-Order Approximations of Conservation Laws
Guermond, J. L.
2010-09-17
A stabilization technique for conservation laws is presented. It introduces in the governing equations a nonlinear dissipation function of the residual of the associated entropy equation and bounded from above by a first order viscous term. Different two-dimensional test cases are simulated - a 2D Burgers problem, the "KPP rotating wave" and the Euler system - using high order methods: spectral elements or Fourier expansions. Details on the tuning of the parameters controlling the entropy viscosity are given. © 2011 Springer.
Inversion and approximation of Laplace transforms
Lear, W. M.
1980-01-01
A method of inverting Laplace transforms by using a set of orthonormal functions is reported. As a byproduct of the inversion, approximation of complicated Laplace transforms by a transform with a series of simple poles along the left half plane real axis is shown. The inversion and approximation process is simple enough to be put on a programmable hand calculator.
Computing Functions by Approximating the Input
Goldberg, Mayer
2012-01-01
In computing real-valued functions, it is ordinarily assumed that the input to the function is known, and it is the output that we need to approximate. In this work, we take the opposite approach: we show how to compute the values of some transcendental functions by approximating the input to these functions, and obtaining exact answers for their…
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.
Random Attractors of Stochastic Modified Boussinesq Approximation
郭春晓
2011-01-01
The Boussinesq approximation is a reasonable model to describe processes in body interior in planetary physics. We refer to [1] and [2] for a derivation of the Boussinesq approximation, and [3] for some related results of existence and uniqueness of solution.
Approximating a harmonizable isotropic random field
Randall J. Swift
2001-01-01
Full Text Available The class of harmonizable fields is a natural extension of the class of stationary fields. This paper considers a stochastic series approximation of a harmonizable isotropic random field. This approximation is useful for numerical simulation of such a field.
On approximating multi-criteria TSP
Manthey, Bodo; Albers, S.; Marion, J.-Y.
2009-01-01
We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP), whose performances are independent of the number $k$ of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized app
Regression with Sparse Approximations of Data
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 case where BO Approximation breaks down
无
2007-01-01
@@ The Bom-Oppenheimer (BO)Approximation is ubiquitous in molecular physics,quantum physics and quantum chemistry. However, CAS researchers recently observed a breakdown of the Approximation in the reaction of fluorine with deuterium atoms.The result has been published in the August 24 issue of Science.
Two Point Pade Approximants and Duality
Banks, Tom
2013-01-01
We propose the use of two point Pade approximants to find expressions valid uniformly in coupling constant for theories with both weak and strong coupling expansions. In particular, one can use these approximants in models with a strong/weak duality, when the symmetries do not determine exact expressions for some quantity.
Function Approximation Using Probabilistic Fuzzy Systems
J.H. van den Berg (Jan); U. Kaymak (Uzay); R.J. Almeida e Santos Nogueira (Rui Jorge)
2011-01-01
textabstractWe consider function approximation by fuzzy systems. Fuzzy systems are typically used for approximating deterministic functions, in which the stochastic uncertainty is ignored. We propose probabilistic fuzzy systems in which the probabilistic nature of uncertainty is taken into account.
Approximation of the Inverse -Frame Operator
M R Abdollahpour; A Najati
2011-05-01
In this paper, we introduce the concept of (strong) projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we like using finite-dimensional linear algebra.
Nonlinear approximation with dictionaries I. Direct estimates
Gribonval, Rémi; Nielsen, Morten
2004-01-01
with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...
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 use
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…
INVARIANT RANDOM APPROXIMATION IN NONCONVEX DOMAIN
R. Shrivastava
2012-05-01
Full Text Available Random fixed point results in the setup of compact and weakly compact domain of Banach spaces which is not necessary starshaped have been obtained in the present work. Invariant random approximation results have also been determined asits application. In this way, random version of invariant approximation results due toMukherjee and Som [13] and Singh [17] have been given.
Approximability and Parameterized Complexity of Minmax Values
Hansen, Kristoffer Arnsfelt; Hansen, Thomas Dueholm; Miltersen, Peter Bro;
2008-01-01
We consider approximating the minmax value of a multi player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ε log n digits (for any constant ε > 0) is NP-hard, where n is the size of the game. On the other hand...
Hardness of approximation for strip packing
Adamaszek, Anna Maria; Kociumaka, Tomasz; Pilipczuk, Marcin
2017-01-01
[SODA 2016] have recently proposed a (1.4 + ϵ)-approximation algorithm for this variant, thus showing that strip packing with polynomially bounded data can be approximated better than when exponentially large values are allowed in the input. Their result has subsequently been improved to a (4/3 + ϵ...
Approximations for stop-loss reinsurance premiums
Reijnen, Rajko; Albers, Willem; Kallenberg, Wilbert 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 use
Approximations for stop-loss reinsurance premiums
Reijnen, R.; Albers, W.; Kallenberg, W.C.M.
2003-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 use
Lifetime of the Nonlinear Geometric Optics Approximation
Binzer, Knud Andreas
The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations.......The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations....
Simple Lie groups without the approximation property
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...
Consistent Design of Dependable Control Systems
Blanke, M.
1996-01-01
Design of fault handling in control systems is discussed, and a method for consistent design is presented.......Design of fault handling in control systems is discussed, and a method for consistent design is presented....
An improved proximity force approximation for electrostatics
Fosco, C D; Mazzitelli, F D
2012-01-01
A quite straightforward approximation for the electrostatic interaction between two perfectly conducting surfaces suggests itself when the distance between them is much smaller than the characteristic lengths associated to their shapes. Indeed, in the so called "proximity force approximation" the electrostatic force is evaluated by first dividing each surface into a set of small flat patches, and then adding up the forces due two opposite pairs, the contribution of which are approximated as due to pairs of parallel planes. This approximation has been widely and successfully applied to different contexts, ranging from nuclear physics to Casimir effect calculations. We present here an improvement on this approximation, based on a derivative expansion for the electrostatic energy contained between the surfaces. The results obtained could be useful to discuss the geometric dependence of the electrostatic force, and also as a convenient benchmark for numerical analyses of the tip-sample electrostatic interaction i...
Approximate Furthest Neighbor in High Dimensions
Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen;
2015-01-01
Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclid......Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high......-dimensional Euclidean space. We build 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 a variation...
Trajectory averaging for stochastic approximation MCMC algorithms
Liang, Faming
2010-01-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 approximation MCMC algorithms, for example, a stochastic approximation MLE al...
Approximating maximum clique with a Hopfield network.
Jagota, A
1995-01-01
In a graph, a clique is a set of vertices such that every pair is connected by an edge. MAX-CLIQUE is the optimization problem of finding the largest clique in a given graph and is NP-hard, even to approximate well. Several real-world and theory problems can be modeled as MAX-CLIQUE. In this paper, we efficiently approximate MAX-CLIQUE in a special case of the Hopfield network whose stable states are maximal cliques. We present several energy-descent optimizing dynamics; both discrete (deterministic and stochastic) and continuous. One of these emulates, as special cases, two well-known greedy algorithms for approximating MAX-CLIQUE. We report on detailed empirical comparisons on random graphs and on harder ones. Mean-field annealing, an efficient approximation to simulated annealing, and a stochastic dynamics are the narrow but clear winners. All dynamics approximate much better than one which emulates a "naive" greedy heuristic.
Finite-part singular integral approximations in Hilbert spaces
E. G. Ladopoulos
2004-01-01
Full Text Available Some new approximation methods are proposed for the numerical evaluation of the finite-part singular integral equations defined on Hilbert spaces when their singularity consists of a homeomorphism of the integration interval, which is a unit circle, on itself. Therefore, some existence theorems are proved for the solutions of the finite-part singular integral equations, approximated by several systems of linear algebraic equations. The method is further extended for the proof of the existence of solutions for systems of finite-part singular integral equations defined on Hilbert spaces, when their singularity consists of a system of diffeomorphisms of the integration interval, which is a unit circle, on itself.
A systematic sequence of relativistic approximations.
Dyall, Kenneth G
2002-06-01
An approach to the development of a systematic sequence of relativistic approximations is reviewed. The approach depends on the atomically localized nature of relativistic effects, and is based on the normalized elimination of the small component in the matrix modified Dirac equation. Errors in the approximations are assessed relative to four-component Dirac-Hartree-Fock calculations or other reference points. Projection onto the positive energy states of the isolated atoms provides an approximation in which the energy-dependent parts of the matrices can be evaluated in separate atomic calculations and implemented in terms of two sets of contraction coefficients. The errors in this approximation are extremely small, of the order of 0.001 pm in bond lengths and tens of microhartrees in absolute energies. From this approximation it is possible to partition the atoms into relativistic and nonrelativistic groups and to treat the latter with the standard operators of nonrelativistic quantum mechanics. This partitioning is shared with the relativistic effective core potential approximation. For atoms in the second period, errors in the approximation are of the order of a few hundredths of a picometer in bond lengths and less than 1 kJ mol(-1) in dissociation energies; for atoms in the third period, errors are a few tenths of a picometer and a few kilojoule/mole, respectively. A third approximation for scalar relativistic effects replaces the relativistic two-electron integrals with the nonrelativistic integrals evaluated with the atomic Foldy-Wouthuysen coefficients as contraction coefficients. It is similar to the Douglas-Kroll-Hess approximation, and is accurate to about 0.1 pm and a few tenths of a kilojoule/mole. The integrals in all the approximations are no more complicated than the integrals in the full relativistic methods, and their derivatives are correspondingly easy to formulate and evaluate.
Arithmetic Training Does Not Improve Approximate Number System Acuity
Marcus Lindskog; Anders Winman; Leo Poom
2016-01-01
The Approximate Number System (ANS) is thought to support non-symbolic representations of numerical magnitudes in humans. Recently much debate has focused on the causal direction for an observed relation between ANS acuity and arithmetic fluency. Here we investigate if arithmetic training can improve ANS acuity. We show with an experimental training study consisting of six 45-minute training sessions that although feedback during arithmetic training improves arithmetic performance substantial...
Nonlinear Analysis of Clinical Epileptic EEG by Approximate Entropy
LIU Yan-su; XIA Yang; XU Hong-ru; ZHOU Dong; YAO De-zhong
2005-01-01
By the means of computing approximate entropy (ApEn) of video-EEG from some clinical epileptic, ApEn of EEG with epileptiform discharges is found significantly different from that of EEG without epileptiform discharges, (p=0. 002). Meanwhile, dynamic ApEn shows consistent change of EEG signal withdischarges of epileptic waves inside. These results suggest that ApEn may be a useful tool for automatic recognition and detection of epileptic activity and for understanding epileptogenic mechanism.
Approximate Dynamic Programming in Tracking Control of a Robotic Manipulator
Marcin Szuster; Piotr Gierlak
2016-01-01
This article focuses on the implementation of an approximate dynamic programming algorithm in the discrete tracking control system of the three-degrees of freedom Scorbot-ER 4pc robotic manipulator. The controlled system is included in an articulated robots group which uses rotary joints to access their work space. The main part of the control system is a dual heuristic dynamic programming algorithm that consists of two structures designed in the form of neural networks: an actor and a critic...
Frankenstein's glue: transition functions for approximate solutions
Yunes, Nicolás
2007-09-01
Approximations are commonly employed to find approximate solutions to the Einstein equations. These solutions, however, are usually only valid in some specific spacetime region. A global solution can be constructed by gluing approximate solutions together, but this procedure is difficult because discontinuities can arise, leading to large violations of the Einstein equations. In this paper, we provide an attempt to formalize this gluing scheme by studying transition functions that join approximate analytic solutions together. In particular, we propose certain sufficient conditions on these functions and prove that these conditions guarantee that the joined solution still satisfies the Einstein equations analytically to the same order as the approximate ones. An example is also provided for a binary system of non-spinning black holes, where the approximate solutions are taken to be given by a post-Newtonian expansion and a perturbed Schwarzschild solution. For this specific case, we show that if the transition functions satisfy the proposed conditions, then the joined solution does not contain any violations to the Einstein equations larger than those already inherent in the approximations. We further show that if these functions violate the proposed conditions, then the matter content of the spacetime is modified by the introduction of a matter shell, whose stress energy tensor depends on derivatives of these functions.
The tendon approximator device in traumatic injuries.
Forootan, Kamal S; Karimi, Hamid; Forootan, Nazilla-Sadat S
2015-01-01
Precise and tension-free approximation of two tendon endings is the key predictor of outcomes following tendon lacerations and repairs. We evaluate the efficacy of a new tendon approximator device in tendon laceration repairs. In a comparative study, we used our new tendon approximator device in 99 consecutive patients with laceration of 266 tendons who attend a university hospital and evaluated the operative time to repair the tendons, surgeons' satisfaction as well as patient's outcomes in a long-term follow-up. Data were compared with the data of control patients undergoing tendon repair by conventional method. Totally 266 tendons were repaired by approximator device and 199 tendons by conventional technique. 78.7% of patients in first group were male and 21.2% were female. In approximator group 38% of patients had secondary repair of cut tendons and 62% had primary repair. Patients were followed for a mean period of 3years (14-60 months). Time required for repair of each tendon was significantly reduced with the approximator device (2 min vs. 5.5 min, ptendon repair were identical in the two groups and were not significantly different. 1% of tendons in group A and 1.2% in group B had rupture that was not significantly different. The new nerve approximator device is cheap, feasible to use and reduces the time of tendon repair with sustained outcomes comparable to the conventional methods.
Entanglement in the Born-Oppenheimer Approximation
Izmaylov, Artur F
2016-01-01
The role of electron-nuclear entanglement on the validity of the Born-Oppenheimer (BO) approximation is investigated. While nonadiabatic couplings generally lead to entanglement and to a failure of the BO approximation, surprisingly the degree of electron-nuclear entanglement is found to be uncorrelated with the degree of validity of the BO approximation. This is because while the degree of entanglement of BO states is determined by their deviation from the corresponding states in the crude BO approximation, the accuracy of the BO approximation is dictated, instead, by the deviation of the BO states from the exact electron-nuclear states. In fact, in the context of a minimal avoided crossing model, extreme cases are identified where an adequate BO state is seen to be maximally entangled, and where the BO approximation fails but the associated BO state remains approximately unentangled. Further, the BO states are found to not preserve the entanglement properties of the exact electron-nuclear eigenstates, and t...
DIFFERENCE SCHEMES BASING ON COEFFICIENT APPROXIMATION
MOU Zong-ze; LONG Yong-xing; QU Wen-xiao
2005-01-01
In respect of variable coefficient differential equations, the equations of coefficient function approximation were more accurate than the coefficient to be frozen as a constant in every discrete subinterval. Usually, the difference schemes constructed based on Taylor expansion approximation of the solution do not suit the solution with sharp function.Introducing into local bases to be combined with coefficient function approximation, the difference can well depict more complex physical phenomena, for example, boundary layer as well as high oscillatory, with sharp behavior. The numerical test shows the method is more effective than the traditional one.
Approximate equivalence in von Neumann algebras
DING; Huiru; Don; Hadwin
2005-01-01
One formulation of D. Voiculescu's theorem on approximate unitary equivalence is that two unital representations π and ρ of a separable C*-algebra are approximately unitarily equivalent if and only if rank o π = rank o ρ. We study the analog when the ranges of π and ρ are contained in a von Neumann algebra R, the unitaries inducing the approximate equivalence must come from R, and "rank" is replaced with "R-rank" (defined as the Murray-von Neumann equivalence of the range projection).
Approximation of free-discontinuity problems
Braides, Andrea
1998-01-01
Functionals involving both volume and surface energies have a number of applications ranging from Computer Vision to Fracture Mechanics. In order to tackle numerical and dynamical problems linked to such functionals many approximations by functionals defined on smooth functions have been proposed (using high-order singular perturbations, finite-difference or non-local energies, etc.) The purpose of this book is to present a global approach to these approximations using the theory of gamma-convergence and of special functions of bounded variation. The book is directed to PhD students and researchers in calculus of variations, interested in approximation problems with possible applications.
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.
Regression with Sparse Approximations of Data
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...
Orthorhombic rational approximants for decagonal quasicrystals
S Ranganathan; Anandh Subramaniam
2003-10-01
An important exercise in the study of rational approximants is to derive their metric, especially in relation to the corresponding quasicrystal or the underlying clusters. Kuo’s model has been the widely accepted model to calculate the metric of the decagonal approximants. Using an alternate model, the metric of the approximants and other complex structures with the icosahedral cluster are explained elsewhere. In this work a comparison is made between the two models bringing out their equivalence. Further, using the concept of average lattices, a modified model is proposed.
Approximation of the semi-infinite interval
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.
One-particle-irreducible consistency relations for cosmological perturbations
Goldberger, Walter D; Nicolis, Alberto
2013-01-01
We derive consistency relations for correlators of scalar cosmological perturbations which hold in the "squeezed limit" in which one or more of the external momenta become soft. Our results are formulated as relations between suitably defined one-particle irreducible N-point and (N-1)-point functions that follow from residual spatial conformal diffeomorphisms of the unitary gauge Lagrangian. As such, some of these relations are exact to all orders in perturbation theory, and do not rely on approximate deSitter invariance or other dynamical assumptions (e.g., properties of the operator product expansion or the behavior of modes at horizon crossing). The consistency relations apply model-independently to cosmological scenarios where the time evolution is driven by a single scalar field. Besides reproducing the known results for single-field inflation in the slow roll limit, we verify that our consistency relations hold more generally, for instance in ghost condensate models in flat space. We comment on possible...
Approximate nearest neighbors via dictionary learning
Cherian, Anoop; Morellas, Vassilios; Papanikolopoulos, Nikolaos
2011-06-01
Approximate Nearest Neighbors (ANN) in high dimensional vector spaces is a fundamental, yet challenging problem in many areas of computer science, including computer vision, data mining and robotics. In this work, we investigate this problem from the perspective of compressive sensing, especially the dictionary learning aspect. High dimensional feature vectors are seldom seen to be sparse in the feature domain; examples include, but not limited to Scale Invariant Feature Transform (SIFT) descriptors, Histogram Of Gradients, Shape Contexts, etc. Compressive sensing advocates that if a given vector has a dense support in a feature space, then there should exist an alternative high dimensional subspace where the features are sparse. This idea is leveraged by dictionary learning techniques through learning an overcomplete projection from the feature space so that the vectors are sparse in the new space. The learned dictionary aids in refining the search for the nearest neighbors to a query feature vector into the most likely subspace combination indexed by its non-zero active basis elements. Since the size of the dictionary is generally very large, distinct feature vectors are most likely to have distinct non-zero basis. Utilizing this observation, we propose a novel representation of the feature vectors as tuples of non-zero dictionary indices, which then reduces the ANN search problem into hashing the tuples to an index table; thereby dramatically improving the speed of the search. A drawback of this naive approach is that it is very sensitive to feature perturbations. This can be due to two possibilities: (i) the feature vectors are corrupted by noise, (ii) the true data vectors undergo perturbations themselves. Existing dictionary learning methods address the first possibility. In this work we investigate the second possibility and approach it from a robust optimization perspective. This boils down to the problem of learning a dictionary robust to feature
An overview on Approximate Bayesian computation*
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.
Trigonometric Approximations for Some Bessel Functions
Muhammad Taher Abuelma'atti
1999-01-01
Formulas are obtained for approximating the tabulated Bessel functions Jn(x), n = 0–9 in terms of trigonometric functions. These formulas can be easily integrated and differentiated and are convenient for personal computers and pocket calculators.
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; ...
Asynchronous stochastic approximation with differential inclusions
David S. Leslie
2012-01-01
Full Text Available The asymptotic pseudo-trajectory approach to stochastic approximation of Benaïm, Hofbauer and Sorin is extended for asynchronous stochastic approximations with a set-valued mean field. The asynchronicity of the process is incorporated into the mean field to produce convergence results which remain similar to those of an equivalent synchronous process. In addition, this allows many of the restrictive assumptions previously associated with asynchronous stochastic approximation to be removed. The framework is extended for a coupled asynchronous stochastic approximation process with set-valued mean fields. Two-timescales arguments are used here in a similar manner to the original work in this area by Borkar. The applicability of this approach is demonstrated through learning in a Markov decision process.
An approximate Expression for Viscosity of Nanosuspensions
Domostroeva, N G
2009-01-01
We consider liquid suspensions with dispersed nanoparticles. Using two-points Pade approximants and combining results of both hydrodynamic and molecular dynamics methods, we obtain the effective viscosity for any diameters of nanoparticles
On Approximating Four Covering and Packing Problems
Ashley, Mary; Berman, Piotr; Chaovalitwongse, Wanpracha; DasGupta, Bhaskar; Kao, Ming-Yang; 10.1016/j.jcss.2009.01.002
2011-01-01
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from full-sibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their approximability properties differ considerably. Our inapproximability constant for the triangle packing problem improves upon the previous results; this is done by directly transforming the inapproximability gap of Haastad for the problem of maximizing the number of satisfied equations for a set of equations over GF(2) and is interesting in its own right. Our approximability results on the full siblings reconstruction problems answers questions originally posed by Berger-Wolf et al. and our results on the maximum profit coverage problem provides almost matching upper and lower bounds on the approximation ratio, answering a...
Staying thermal with Hartree ensemble approximations
Salle, Mischa E-mail: msalle@science.uva.nl; Smit, Jan E-mail: jsmit@science.uva.nl; Vink, Jeroen C. E-mail: jcvink@science.uva.nl
2002-03-25
We study thermal behavior of a recently introduced Hartree ensemble approximation, which allows for non-perturbative inhomogeneous field configurations as well as for approximate thermalization, in the phi (cursive,open) Greek{sup 4} model in 1+1 dimensions. Using ensembles with a free field thermal distribution as out-of-equilibrium initial conditions we determine thermalization time scales. The time scale for which the system stays in approximate quantum thermal equilibrium is an indication of the time scales for which the approximation method stays reasonable. This time scale turns out to be two orders of magnitude larger than the time scale for thermalization, in the range of couplings and temperatures studied. We also discuss simplifications of our method which are numerically more efficient and make a comparison with classical dynamics.
Approximations of solutions to retarded integrodifferential equations
Dhirendra Bahuguna
2004-11-01
Full Text Available In this paper we consider a retarded integrodifferential equation and prove existence, uniqueness and convergence of approximate solutions. We also give some examples to illustrate the applications of the abstract results.
Approximation methods in gravitational-radiation theory
Will, C. M.
1986-02-01
The observation of gravitational-radiation damping in the binary pulsar PSR 1913+16 and the ongoing experimental search for gravitational waves of extraterrestrial origin have made the theory of gravitational radiation an active branch of classical general relativity. In calculations of gravitational radiation, approximation methods play a crucial role. The author summarizes recent developments in two areas in which approximations are important: (1) the quadrupole approximation, which determines the energy flux and the radiation reaction forces in weak-field, slow-motion, source-within-the-near-zone systems such as the binary pulsar; and (2) the normal modes of oscillation of black holes, where the Wentzel-Kramers-Brillouin approximation gives accurate estimates of the complex frequencies of the modes.
APPROXIMATE DEVELOPMENTS FOR SURFACES OF REVOLUTION
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
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.
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.
Completeness and consistency of renormalisation group flows
Litim, Daniel F; Litim, Daniel F.; Pawlowski, Jan M.
2002-01-01
We study different renormalisation group flows for scale dependent effective actions, including exact and proper-time renormalisation group flows. These flows have a simple one loop structure. They differ in their dependence on the full field-dependent propagator, which is linear for exact flows. We investigate the inherent approximations of flows with a non-linear dependence on the propagator. We check explicitly that standard perturbation theory is not reproduced. We explain the origin of the discrepancy by providing links to exact flows both in closed expressions and in given approximations. We show that proper-time flows are approximations to Callan-Symanzik flows. Within a background field formalism, we provide a generalised proper-time flow, which is exact. Implications of these findings are discussed.
MDCC: Multi-Data Center Consistency
Kraska, Tim; Franklin, Michael J; Madden, Samuel
2012-01-01
Replicating data across multiple data centers not only allows moving the data closer to the user and, thus, reduces latency for applications, but also increases the availability in the event of a data center failure. Therefore, it is not surprising that companies like Google, Yahoo, and Netflix already replicate user data across geographically different regions. However, replication across data centers is expensive. Inter-data center network delays are in the hundreds of milliseconds and vary significantly. Synchronous wide-area replication is therefore considered to be unfeasible with strong consistency and current solutions either settle for asynchronous replication which implies the risk of losing data in the event of failures, restrict consistency to small partitions, or give up consistency entirely. With MDCC (Multi-Data Center Consistency), we describe the first optimistic commit protocol, that does not require a master or partitioning, and is strongly consistent at a cost similar to eventually consiste...
Approximate Flavor Symmetry in Supersymmetric Model
Tao, Zhijian
1998-01-01
We investigate the maximal approximate flavor symmetry in the framework of generic minimal supersymmetric standard model. We consider the low energy effective theory of the flavor physics with all the possible operators included. Spontaneous flavor symmetry breaking leads to the approximate flavor symmetry in Yukawa sector and the supersymmetry breaking sector. Fermion mass and mixing hierachies are the results of the hierachy of the flavor symmetry breaking. It is found that in this theory i...
Pointwise approximation by elementary complete contractions
Magajna, Bojan
2009-01-01
A complete contraction on a C*-algebra A, which preserves all closed two sided ideals J, can be approximated pointwise by elementary complete contractions if and only if the induced map on the tensor product of B with A/J is contractive for every C*-algebra B, ideal J in A and C*-tensor norm on the tensor product. A lifting obstruction for such an approximation is also obtained.
Polynomial approximation of functions in Sobolev spaces
Dupont, T.; Scott, R.
1980-01-01
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomial 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.
Parallel local approximation MCMC for expensive models
Conrad, Patrick; Davis, Andrew; Marzouk, Youssef; Pillai, Natesh; Smith, Aaron
2016-01-01
Performing Bayesian inference via Markov chain Monte Carlo (MCMC) can be exceedingly expensive when posterior evaluations invoke the evaluation of a computationally expensive model, such as a system of partial differential equations. In recent work [Conrad et al. JASA 2015, arXiv:1402.1694] we described a framework for constructing and refining local approximations of such models during an MCMC simulation. These posterior--adapted approximations harness regularity of the model to reduce the c...
The Actinide Transition Revisited by Gutzwiller Approximation
Xu, Wenhu; Lanata, Nicola; Yao, Yongxin; Kotliar, Gabriel
2015-03-01
We revisit the problem of the actinide transition using the Gutzwiller approximation (GA) in combination with the local density approximation (LDA). In particular, we compute the equilibrium volumes of the actinide series and reproduce the abrupt change of density found experimentally near plutonium as a function of the atomic number. We discuss how this behavior relates with the electron correlations in the 5 f states, the lattice structure, and the spin-orbit interaction. Our results are in good agreement with the experiments.
Intuitionistic Fuzzy Automaton for Approximate String Matching
K.M. Ravi
2014-03-01
Full Text Available This paper introduces an intuitionistic fuzzy automaton model for computing the similarity between pairs of strings. The model details the possible edit operations needed to transform any input (observed string into a target (pattern string by providing a membership and non-membership value between them. In the end, an algorithm is given for approximate string matching and the proposed model computes the similarity and dissimilarity between the pair of strings leading to better approximation.
Approximations for the Erlang Loss Function
Mejlbro, Leif
1998-01-01
Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error <1E-2, and methods are indicated for improving this bound.......Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error
Staying Thermal with Hartree Ensemble Approximations
Salle, M; Vink, Jeroen C
2000-01-01
Using Hartree ensemble approximations to compute the real time dynamics of scalar fields in 1+1 dimension, we find that with suitable initial conditions, approximate thermalization is achieved much faster than found in our previous work. At large times, depending on the interaction strength and temperature, the particle distribution slowly changes: the Bose-Einstein distribution of the particle densities develops classical features. We also discuss variations of our method which are numerically more efficient.
Lattice quantum chromodynamics with approximately chiral fermions
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.)
Nonlinear approximation in alpha-modulation spaces
Borup, Lasse; Nielsen, Morten
2006-01-01
The α-modulation spaces are a family of spaces that contain the Besov and modulation spaces as special cases. In this paper we prove that brushlet bases can be constructed to form unconditional and even greedy bases for the α-modulation spaces. We study m -term nonlinear approximation with brushlet...... bases, and give complete characterizations of the associated approximation spaces in terms of α-modulation spaces....
A dual-consistency cache coherence protocol
Ros, Alberto; Jimborean, Alexandra
2015-01-01
Weak memory consistency models can maximize system performance by enabling hardware and compiler optimizations, but increase programming complexity since they do not match programmers’ intuition. The design of an efficient system with an intuitive memory model is an open challenge. This paper proposes SPEL, a dual-consistency cache coherence protocol which simultaneously guarantees the strongest memory consistency model provided by the hardware and yields improvements in both performance and ...
Differential geometry of proteins. Helical approximations.
Louie, A H; Somorjai, R L
1983-07-25
We regard a protein molecule as a geometric object, and in a first approximation represent it as a regular parametrized space curve passing through its alpha-carbon atoms (the backbone). In an earlier paper we argued that the regular patterns of secondary structures of proteins (morphons) correspond to geodesics on minimal surfaces. In this paper we discuss methods of recognizing these morphons on space curves that represent the protein backbone conformation. The mathematical tool we employ is the differential geometry of curves and surfaces. We introduce a natural approximation of backbone space curves in terms of helical approximating elements and present a computer algorithm to implement the approximation. Simple recognition criteria are given for the various morphons of proteins. These are incorporated into our helical approximation algorithm, together with more non-local criteria for the recognition of beta-sheet topologies. The method and the algorithm are illustrated with several examples of representative proteins. Generalizations of the helical approximation method are considered and their possible implications for protein energetics are sketched.
A new approach to hull consistency
Kolev Lubomir
2016-06-01
Full Text Available Hull consistency is a known technique to improve the efficiency of iterative interval methods for solving nonlinear systems describing steady-states in various circuits. Presently, hull consistency is checked in a scalar manner, i.e. successively for each equation of the nonlinear system with respect to a single variable. In the present poster, a new more general approach to implementing hull consistency is suggested which consists in treating simultaneously several equations with respect to the same number of variables.
Sadegh, Payman
1997-01-01
This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...
Ito, K.
1984-01-01
The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.
Ito, K.
1985-01-01
The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A characteristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.
Consistent estimators in random censorship semiparametric models
王启华
1996-01-01
For the fixed design regression modelwhen Y, are randomly censored on the right, the estimators of unknown parameter and regression function g from censored observations are defined in the two cases .where the censored distribution is known and unknown, respectively. Moreover, the sufficient conditions under which these estimators are strongly consistent and pth (p>2) mean consistent are also established.
Student Effort, Consistency, and Online Performance
Patron, Hilde; Lopez, Salvador
2011-01-01
This paper examines how student effort, consistency, motivation, and marginal learning, influence student grades in an online course. We use data from eleven Microeconomics courses taught online for a total of 212 students. Our findings show that consistency, or less time variation, is a statistically significant explanatory variable, whereas…
Consistent truncations with massive modes and holography
Cassani, Davide; Faedo, Anton F
2011-01-01
We review the basic features of some recently found consistent Kaluza-Klein truncations including massive modes. We emphasize the general ideas underlying the reduction procedure, then we focus on type IIB supergravity on 5-dimensional manifolds admitting a Sasaki-Einstein structure, which leads to half-maximal gauged supergravity in five dimensions. Finally, we comment on the holographic picture of consistency.
CONSISTENT AGGREGATION IN FOOD DEMAND SYSTEMS
Levedahl, J. William; Reed, Albert J.; Clark, J. Stephen
2002-01-01
Two aggregation schemes for food demand systems are tested for consistency with the Generalized Composite Commodity Theorem (GCCT). One scheme is based on the standard CES classification of food expenditures. The second scheme is based on the Food Guide Pyramid. Evidence is found that both schemes are consistent with the GCCT.
A Framework of Memory Consistency Models
胡伟武; 施巍松; 等
1998-01-01
Previous descriptions of memory consistency models in shared-memory multiprocessor systems are mainly expressed as constraints on the memory access event ordering and hence are hardware-centric.This paper presents a framework of memory consistency models which describes the memory consistency model on the behavior level.Based on the understanding that the behavior of an execution is determined by the execution order of conflicting accesses,a memory consistency model is defined as an interprocessor synchronization mechanism which orders the execution of operations from different processors.Synchronization order of an execution under certain consistency model is also defined.The synchronization order,together with the program order determines the behavior of an execution.This paper also presents criteria for correct program and correct implementation of consistency models.Regarding an implementation of a consistency model as certain memory event ordering constraints,this paper provides a method to prove the correctness of consistency model implementations,and the correctness of the lock-based cache coherence protocol is proved with this method.
Sticky continuous processes have consistent price systems
Bender, Christian; Pakkanen, Mikko; Sayit, Hasanjan
Under proportional transaction costs, a price process is said to have a consistent price system, if there is a semimartingale with an equivalent martingale measure that evolves within the bid-ask spread. We show that a continuous, multi-asset price process has a consistent price system, under arb...
Testing the visual consistency of web sites
Geest, van der Thea; Loorbach, Nicole
2005-01-01
Consistency in the visual appearance of Web pages is often checked by experts, such as designers or reviewers. This article reports a card sort study conducted to determine whether users rather than experts could distinguish visual (in-)consistency in Web elements and pages. The users proved to agre
Putting Consistent Theories Together in Institutions
应明生
1995-01-01
The problem of putting consistent theories together in institutions is discussed.A general necessary condition for consistency of the resulting theory is carried out,and some sufficient conditions are given for diagrams of theories in which shapes are tree bundles or directed graphs.Moreover,some transformations from complicated cases to simple ones are established.
Back to the Future: Consistency-Based Trajectory Tracking
Kurien, James; Nayak, P. Pandurand; Norvig, Peter (Technical Monitor)
2000-01-01
Given a model of a physical process and a sequence of commands and observations received over time, the task of an autonomous controller is to determine the likely states of the process and the actions required to move the process to a desired configuration. We introduce a representation and algorithms for incrementally generating approximate belief states for a restricted but relevant class of partially observable Markov decision processes with very large state spaces. The algorithm presented incrementally generates, rather than revises, an approximate belief state at any point by abstracting and summarizing segments of the likely trajectories of the process. This enables applications to efficiently maintain a partial belief state when it remains consistent with observations and revisit past assumptions about the process' evolution when the belief state is ruled out. The system presented has been implemented and results on examples from the domain of spacecraft control are presented.
Modeling and Testing Legacy Data Consistency Requirements
Nytun, J. P.; Jensen, Christian Søndergaard
2003-01-01
An increasing number of data sources are available on the Internet, many of which offer semantically overlapping data, but based on different schemas, or models. While it is often of interest to integrate such data sources, the lack of consistency among them makes this integration difficult....... This paper addresses the need for new techniques that enable the modeling and consistency checking for legacy data sources. Specifically, the paper contributes to the development of a framework that enables consistency testing of data coming from different types of data sources. The vehicle is UML and its...... accompanying XMI. The paper presents techniques for modeling consistency requirements using OCL and other UML modeling elements: it studies how models that describe the required consistencies among instances of legacy models can be designed in standard UML tools that support XMI. The paper also considers...
Dynamic self-consistent field theory for unentangled homopolymer fluids
Mihajlovic, Maja; Lo, Tak Shing; Shnidman, Yitzhak
2005-10-01
We present a lattice formulation of a dynamic self-consistent field (DSCF) theory that is capable of resolving interfacial structure, dynamics, and rheology in inhomogeneous, compressible melts and blends of unentangled homopolymer chains. The joint probability distribution of all the Kuhn segments in the fluid, interacting with adjacent segments and walls, is approximated by a product of one-body probabilities for free segments interacting solely with an external potential field that is determined self-consistently. The effect of flow on ideal chain conformations is modeled with finitely extensible, nonlinearly elastic dumbbells in the Peterlin approximation, and related to stepping probabilities in a random walk. Free segment and stepping probabilities generate statistical weights for chain conformations in a self-consistent field, and determine local volume fractions of chain segments. Flux balance across unit lattice cells yields mean field transport equations for the evolution of free segment probabilities and of momentum densities on the Kuhn length scale. Diffusive and viscous contributions to the fluxes arise from segmental hops modeled as a Markov process, with transition rates reflecting changes in segmental interaction, kinetic energy, and entropic contributions to the free energy under flow. We apply the DSCF equations to study both transient and steady-state interfacial structure, flow, and rheology in a sheared planar channel containing either a one-component melt or a phase-separated, two-component blend.
Tree-fold loop approximation of AMD
Ono, Akira [Tohoku Univ., Sendai (Japan). Faculty of Science
1997-05-01
AMD (antisymmetrized molecular dynamics) is a frame work for describing a wave function of nucleon multi-body system by Slater determinant of Gaussian wave flux, and a theory for integrally describing a wide range of nuclear reactions such as intermittent energy heavy ion reaction, nucleon incident reaction and so forth. The aim of this study is induction on approximation equation of expected value, {nu}, in correlation capable of calculation with time proportional A (exp 3) (or lower), and to make AMD applicable to the heavier system such as Au+Au. As it must be avoided to break characteristics of AMD, it needs not to be anxious only by approximating the {nu}-value. However, in order to give this approximation any meaning, error of this approximation will have to be sufficiently small in comparison with bond energy of atomic nucleus and smaller than 1 MeV/nucleon. As the absolute expected value in correlation may be larger than 50 MeV/nucleon, the approximation is required to have a high accuracy within 2 percent. (G.K.)
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.
Approximation of Bivariate Functions via Smooth Extensions
Zhang, Zhihua
2014-01-01
For a smooth bivariate function defined on a general domain with arbitrary shape, it is difficult to do Fourier approximation or wavelet approximation. In order to solve these problems, in this paper, we give an extension of the bivariate function on a general domain with arbitrary shape to a smooth, periodic function in the whole space or to a smooth, compactly supported function in the whole space. These smooth extensions have simple and clear representations which are determined by this bivariate function and some polynomials. After that, we expand the smooth, periodic function into a Fourier series or a periodic wavelet series or we expand the smooth, compactly supported function into a wavelet series. Since our extensions are smooth, the obtained Fourier coefficients or wavelet coefficients decay very fast. Since our extension tools are polynomials, the moment theorem shows that a lot of wavelet coefficients vanish. From this, with the help of well-known approximation theorems, using our extension methods, the Fourier approximation and the wavelet approximation of the bivariate function on the general domain with small error are obtained. PMID:24683316
Approximation Limits of Linear Programs (Beyond Hierarchies)
Braun, Gábor; Pokutta, Sebastian; Steurer, David
2012-01-01
We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n^{1/2-eps})-approximations for CLIQUE require linear programs of size 2^{n^\\Omega(eps)}. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem.) Moreover, we establish a similar result for approximations of semidefinite programs by linear programs. Our main ingredient is a quantitative improvement of Razborov's rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of certain perturbations of the unique disjointness matrix.
Discontinuous Galerkin Methods with Trefftz Approximation
Kretzschmar, Fritz; Tsukerman, Igor; Weiland, Thomas
2013-01-01
We present a novel Discontinuous Galerkin Finite Element Method for wave propagation problems. The method employs space-time Trefftz-type basis functions that satisfy the underlying partial differential equations and the respective interface boundary conditions exactly in an element-wise fashion. The basis functions can be of arbitrary high order, and we demonstrate spectral convergence in the $\\Lebesgue_2$-norm. In this context, spectral convergence is obtained with respect to the approximation error in the entire space-time domain of interest, i.e. in space and time simultaneously. Formulating the approximation in terms of a space-time Trefftz basis makes high order time integration an inherent property of the method and clearly sets it apart from methods, that employ a high order approximation in space only.
Approximating light rays in the Schwarzschild field
Semerak, Oldrich
2014-01-01
A short formula is suggested which approximates photon trajectories in the Schwarzschild field better than other simple prescriptions from the literature. We compare it with various "low-order competitors", namely with those following from exact formulas for small $M$, with one of the results based on pseudo-Newtonian potentials, with a suitably adjusted hyperbola, and with the effective and often employed approximation by Beloborodov. Our main concern is the shape of the photon trajectories at finite radii, yet asymptotic behaviour is also discussed, important for lensing. An example is attached indicating that the newly suggested approximation is usable--and very accurate--for practical solving of the ray-deflection exercise.
On the approximate zero of Newton method
黄正达
2003-01-01
A judgment criterion to guarantee a point to be a Chen' s approximate zero of Newton method for solving nonlinear equation is sought by dominating sequence techniques. The criterion is based on the fact that the dominating function may have only one simple positive zero, assuming that the operator is weak Lipschitz continuous, which is much more relaxed and can be checked much more easily than Lipschitz continuous in practice. It is demonstrated that a Chen' s approximate zero may not be a Smale' s approximate zero. The error estimate obtained indicated the convergent order when we use |f(x) | < ε to stop computation in software.The result can also be applied for solving partial derivative and integration equations.
On the approximate zero of Newton method
黄正达
2003-01-01
A judgment criterion to guarantee a point to be a Chen's approximate zero of Newton method for solving nonlinear equation is sought by dominating sequence techniques. The criterion is based on the fact that the dominating function may have only one simple positive zero, assuming that the operator is weak Lipschitz continuous, which is much more relaxed and can be checked much more easily than Lipschitz continuous in practice. It is demonstrated that a Chen's approximate zero may not be a Smale's approximate zero. The error estimate obtained indicated the convergent order when we use |f(x)|<ε to stop computation in software. The result can also be applied for solving partial derivative and integration equations.
Optical pulse propagation with minimal approximations
Kinsler, Paul
2010-01-01
Propagation equations for optical pulses are needed to assist in describing applications in ever more extreme situations—including those in metamaterials with linear and nonlinear magnetic responses. Here I show how to derive a single first-order propagation equation using a minimum of approximations and a straightforward “factorization” mathematical scheme. The approach generates exact coupled bidirectional equations, after which it is clear that the description can be reduced to a single unidirectional first-order wave equation by means of a simple “slow evolution” approximation, where the optical pulse changes little over the distance of one wavelength. It also allows a direct term-to-term comparison of an exact bidirectional theory with the approximate unidirectional theory.
Rough interfaces beyond the Gaussian approximation
Caselle, M; Gliozzi, F; Hasenbusch, M; Pinn, K; Vinti, S; Caselle, M; Gliozzi, F; Fiore, R; Hasenbusch, M; Pinn, K; Vinti, S
1994-01-01
We compare predictions of the Capillary Wave Model beyond its Gaussian approximation with Monte Carlo results for the energy gap and the surface energy of the 3D Ising model in the scaling region. Our study reveals that the finite size effects of these quantities are well described by the Capillary Wave Model, expanded to two--loop order ( one order beyond the Gaussian approximation). We compare predictions of the Capillary Wave Model with Monte Carlo results for the energy gap and the interface energy of the 3D Ising model in the scaling region. Our study reveals that the finite size effects of these quantities are well described by the Capillary Wave Model, expanded to two-loop order (one order beyond the Gaussian approximation).
Implementing regularization implicitly via approximate eigenvector computation
Mahoney, Michael W
2010-01-01
Regularization is a powerful technique for extracting useful information from noisy data. Typically, it is implemented by adding some sort of norm constraint to an objective function and then exactly optimizing the modified objective function. This procedure typically leads to optimization problems that are computationally more expensive than the original problem, a fact that is clearly problematic if one is interested in large-scale applications. On the other hand, a large body of empirical work has demonstrated that heuristics, and in some cases approximation algorithms, developed to speed up computations sometimes have the side-effect of performing regularization implicitly. Thus, we consider the question: What is the regularized optimization objective that an approximation algorithm is exactly optimizing? We address this question in the context of computing approximations to the smallest nontrivial eigenvector of a graph Laplacian; and we consider three random-walk-based procedures: one based on the heat ...
On approximation of Markov binomial distributions
Xia, Aihua; 10.3150/09-BEJ194
2010-01-01
For a Markov chain $\\mathbf{X}=\\{X_i,i=1,2,...,n\\}$ with the state space $\\{0,1\\}$, the random variable $S:=\\sum_{i=1}^nX_i$ is said to follow a Markov binomial distribution. The exact distribution of $S$, denoted $\\mathcal{L}S$, is very computationally intensive for large $n$ (see Gabriel [Biometrika 46 (1959) 454--460] and Bhat and Lal [Adv. in Appl. Probab. 20 (1988) 677--680]) and this paper concerns suitable approximate distributions for $\\mathcal{L}S$ when $\\mathbf{X}$ is stationary. We conclude that the negative binomial and binomial distributions are appropriate approximations for $\\mathcal{L}S$ when $\\operatorname {Var}S$ is greater than and less than $\\mathbb{E}S$, respectively. Also, due to the unique structure of the distribution, we are able to derive explicit error estimates for these approximations.
Fast wavelet based sparse approximate inverse preconditioner
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.
Numerical approximation of partial differential equations
Bartels, Sören
2016-01-01
Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensible tool in science and technology. This textbook aims at providing a thorough introduction to the construction, analysis, and implementation of finite element methods for model problems arising in continuum mechanics. The first part of the book discusses elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods. The second part is devoted to the optimal adaptive approximation of singularities and the fast iterative solution of linear systems of equations arising from finite element discretizations. In the third part, the mathematical framework for analyzing and discretizing saddle-point problems is formulated, corresponding finte element methods are analyzed, and particular ...
On Born approximation in black hole scattering
Batic, D. [University of West Indies, Department of Mathematics, Kingston (Jamaica); Kelkar, N.G.; Nowakowski, M. [Universidad de los Andes, Departamento de Fisica, Bogota (Colombia)
2011-12-15
A massless field propagating on spherically symmetric black hole metrics such as the Schwarzschild, Reissner-Nordstroem and Reissner-Nordstroem-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. (orig.)
Time Stamps for Fixed-Point Approximation
Damian, Daniela
2001-01-01
Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed-point approximat......Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed......-point approximation algorithm which maintains a single copy of intermediate results. We then prove the correctness of this algorithm....
Approximating hemodynamics of cerebral aneurysms with steady flow simulations.
Geers, A J; Larrabide, I; Morales, H G; Frangi, A F
2014-01-03
Computational fluid dynamics (CFD) simulations can be employed to gain a better understanding of hemodynamics in cerebral aneurysms and improve diagnosis and treatment. However, introduction of CFD techniques into clinical practice would require faster simulation times. The aim of this study was to evaluate the use of computationally inexpensive steady flow simulations to approximate the aneurysm's wall shear stress (WSS) field. Two experiments were conducted. Experiment 1 compared for two cases the time-averaged (TA), peak systole (PS) and end diastole (ED) WSS field between steady and pulsatile flow simulations. The flow rate waveform imposed at the inlet was varied to account for variations in heart rate, pulsatility index, and TA flow rate. Consistently across all flow rate waveforms, steady flow simulations accurately approximated the TA, but not the PS and ED, WSS field. Following up on experiment 1, experiment 2 tested the result for the TA WSS field in a larger population of 20 cases covering a wide range of aneurysm volumes and shapes. Steady flow simulations approximated the space-averaged WSS with a mean error of 4.3%. WSS fields were locally compared by calculating the absolute error per node of the surface mesh. The coefficient of variation of the root-mean-square error over these nodes was on average 7.1%. In conclusion, steady flow simulations can accurately approximate the TA WSS field of an aneurysm. The fast computation time of 6 min per simulation (on 64 processors) could help facilitate the introduction of CFD into clinical practice.
Exponential Approximations Using Fourier Series Partial Sums
Banerjee, Nana S.; Geer, James F.
1997-01-01
The problem of accurately reconstructing a piece-wise smooth, 2(pi)-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. It is conjectured that the locations of the singularities are approximated to within O(N(sup -M-2), and the associated jump of the k(sup th) derivative of f is approximated to within O(N(sup -M-l+k), as N approaches infinity, and the method is robust. These estimates are then used with a class of singular basis functions, which have certain 'built-in' singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M approaches infinity. The technique is illustrated with several examples.
Emergent Dynamics of a Thermodynamically Consistent Particle Model
Ha, Seung-Yeal; Ruggeri, Tommaso
2017-03-01
We present a thermodynamically consistent particle (TCP) model motivated by the theory of multi-temperature mixture of fluids in the case of spatially homogeneous processes. The proposed model incorporates the Cucker-Smale (C-S) type flocking model as its isothermal approximation. However, it is more complex than the C-S model, because the mutual interactions are not only " mechanical" but are also affected by the "temperature effect" as individual particles may exhibit distinct internal energies. We develop a framework for asymptotic weak and strong flocking in the context of the proposed model.
Extending the Eikonal Approximation to Low Energy
Capel, Pierre; Ogata, Kazuyuki
2014-01-01
E-CDCC and DEA, two eikonal-based reaction models are compared to CDCC at low energy (e.g. 20AMeV) to study their behaviour in the regime at which the eikonal approximation is supposed to fail. We confirm that these models lack the Coulomb deflection of the projectile by the target. We show that a hybrid model, built on the CDCC framework at low angular momenta and the eikonal approximation at larger angular momenta gives a perfect agreement with CDCC. An empirical shift in impact parameter can also be used reliably to simulate this missing Coulomb deflection.
Approximately-Balanced Drilling in Daqing Oilfield
Xia Bairu; Zheng Xiuhua; Li Guoqing; Tian Tuo
2004-01-01
The Daqing oilfield is a multilayered heterogeneous oil field where the pressure are different in the same vertical profile causing many troubles to the adjustment well drillings. The approximately-balanced drilling technique has been developed and proved to be efficient and successful in Daqing oilfield. This paper discusses the application of approximately-balanced drilling technique under the condition of multilayered pressure in Daqing oilfield, including the prediction of formation pressure, the pressure discharge technique for the drilling well and the control of the density of drilling fluid.
Faddeev Random Phase Approximation for Molecules
Degroote, Matthias; Barbieri, Carlo
2010-01-01
The Faddeev Random Phase Approximation is a Green's function technique that makes use of Faddeev-equations to couple the motion of a single electron to the two-particle--one-hole and two-hole--one-particle excitations. This method goes beyond the frequently used third-order Algebraic Diagrammatic Construction method: all diagrams involving the exchange of phonons in the particle-hole and particle-particle channel are retained, but the phonons are described at the level of the Random Phase Approximation. This paper presents the first results for diatomic molecules at equilibrium geometry. The behavior of the method in the dissociation limit is also investigated.
An Approximate Bayesian Fundamental Frequency Estimator
Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt
2012-01-01
Joint fundamental frequency and model order estimation is an important problem in several applications such as speech and music processing. In this paper, we develop an approximate estimation algorithm of these quantities using Bayesian inference. The inference about the fundamental frequency...... and the model order is based on a probability model which corresponds to a minimum of prior information. From this probability model, we give the exact posterior distributions on the fundamental frequency and the model order, and we also present analytical approximations of these distributions which lower...
Approximate Controllability of Fractional Integrodifferential Evolution Equations
R. Ganesh
2013-01-01
Full Text Available This paper addresses the issue of approximate controllability for a class of control system which is represented by nonlinear fractional integrodifferential equations with nonlocal conditions. By using semigroup theory, p-mean continuity and fractional calculations, a set of sufficient conditions, are formulated and proved for the nonlinear fractional control systems. More precisely, the results are established under the assumption that the corresponding linear system is approximately controllable and functions satisfy non-Lipschitz conditions. The results generalize and improve some known results.
Excluded-Volume Approximation for Supernova Matter
Yudin, A V
2014-01-01
A general scheme of the excluded-volume approximation as applied to multicomponent systems with an arbitrary degree of degeneracy has been developed. This scheme also admits an allowance for additional interactions between the components of a system. A specific form of the excluded-volume approximation for investigating supernova matter at subnuclear densities has been found from comparison with the hard-sphere model. The possibility of describing the phase transition to uniform nuclear matter in terms of the formalism under consideration is discussed.
Generalized companion matrix for approximate GCD
Boito, Paola
2011-01-01
We study a variant of the univariate approximate GCD problem, where the coe?- cients of one polynomial f(x)are known exactly, whereas the coe?cients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of the matrix which describes the operator of multiplication by gin the quotient ring C[x]=(f). In particular, the structure of the null space of the multiplication matrix contains all the essential information about GCD(f; g). Moreover, the multiplication matrix exhibits a displacement structure that allows us to design a fast algorithm for approximate GCD computation with quadratic complexity w.r.t. polynomial degrees.
An approximate analytical approach to resampling averages
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......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...
Static correlation beyond the random phase approximation
Olsen, Thomas; Thygesen, Kristian Sommer
2014-01-01
We investigate various approximations to the correlation energy of a H2 molecule in the dissociation limit, where the ground state is poorly described by a single Slater determinant. The correlation energies are derived from the density response function and it is shown that response functions...... derived from Hedin's equations (Random Phase Approximation (RPA), Time-dependent Hartree-Fock (TDHF), Bethe-Salpeter equation (BSE), and Time-Dependent GW) all reproduce the correct dissociation limit. We also show that the BSE improves the correlation energies obtained within RPA and TDHF significantly...
Approximate formulas for moderately small eikonal amplitudes
Kisselev, A. V.
2016-08-01
We consider the eikonal approximation for moderately small scattering amplitudes. To find numerical estimates of these approximations, we derive formulas that contain no Bessel functions and consequently no rapidly oscillating integrands. To obtain these formulas, we study improper integrals of the first kind containing products of the Bessel functions J0(z). We generalize the expression with four functions J0(z) and also find expressions for the integrals with the product of five and six Bessel functions. We generalize a known formula for the improper integral with two functions Jυ (az) to the case with noninteger υ and complex a.
The exact renormalization group and approximation solutions
Morris, T R
1994-01-01
We investigate the structure of Polchinski's formulation of the flow equations for the continuum Wilson effective action. Reinterpretations in terms of I.R. cutoff greens functions are given. A promising non-perturbative approximation scheme is derived by carefully taking the sharp cutoff limit and expanding in `irrelevancy' of operators. We illustrate with two simple models of four dimensional $\\lambda \\varphi^4$ theory: the cactus approximation, and a model incorporating the first irrelevant correction to the renormalized coupling. The qualitative and quantitative behaviour give confidence in a fuller use of this method for obtaining accurate results.
Approximating W projection as a separable kernel
Merry, Bruce
2016-02-01
W projection is a commonly used approach to allow interferometric imaging to be accelerated by fast Fourier transforms, but it can require a huge amount of storage for convolution kernels. The kernels are not separable, but we show that they can be closely approximated by separable kernels. The error scales with the fourth power of the field of view, and so is small enough to be ignored at mid- to high frequencies. We also show that hybrid imaging algorithms combining W projection with either faceting, snapshotting, or W stacking allow the error to be made arbitrarily small, making the approximation suitable even for high-resolution wide-field instruments.
BEST APPROXIMATION BY DOWNWARD SETS WITH APPLICATIONS
H.Mohebi; A. M. Rubinov
2006-01-01
We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs (W,x), where x ∈ X and W is a closed downward subset of X.
Local density approximations from finite systems
Entwistle, Mike; Wetherell, Jack; Longstaff, Bradley; Ramsden, James; Godby, Rex
2016-01-01
The local density approximation (LDA) constructed through quantum Monte Carlo calculations of the homogeneous electron gas (HEG) is the most common approximation to the exchange-correlation functional in density functional theory. We introduce an alternative set of LDAs constructed from slab-like systems of one, two and three electrons that resemble the HEG within a finite region, and illustrate the concept in one dimension. Comparing with the exact densities and Kohn-Sham potentials for various test systems, we find that the LDAs give a good account of the self-interaction correction, but are less reliable when correlation is stronger or currents flow.
On the Initial State and Consistency Relations
Berezhiani, Lasha
2014-01-01
We study the effect of the initial state on the consistency conditions for adiabatic perturbations. In order to be consistent with the constraints of General Relativity, the initial state must be diffeomorphism invariant. As a result, we show that initial wavefunctional/density matrix has to satisfy a Slavnov-Taylor identity similar to that of the action. We then investigate the precise ways in which modified initial states can lead to violations of the consistency relations. We find two independent sources of violations: i) the state can include initial non-Gaussianities; ii) even if the initial state is Gaussian, such as a Bogoliubov state, the modified 2-point function can modify the q->0 analyticity properties of the vertex functional and result in violations of the consistency relations.
On the initial state and consistency relations
Berezhiani, Lasha; Khoury, Justin, E-mail: lashaber@sas.upenn.edu, E-mail: jkhoury@sas.upenn.edu [Center for Particle Cosmology, Department of Physics and Astronomy, University of Pennsylvania, 209 South 33rd Street, Philadelphia, PA 19104 (United States)
2014-09-01
We study the effect of the initial state on the consistency conditions for adiabatic perturbations. In order to be consistent with the constraints of General Relativity, the initial state must be diffeomorphism invariant. As a result, we show that initial wavefunctional/density matrix has to satisfy a Slavnov-Taylor identity similar to that of the action. We then investigate the precise ways in which modified initial states can lead to violations of the consistency relations. We find two independent sources of violations: i) the state can include initial non-Gaussianities; ii) even if the initial state is Gaussian, such as a Bogoliubov state, the modified 2-point function can modify the q-vector → 0 analyticity properties of the vertex functional and result in violations of the consistency relations.
Self-Consistent Asset Pricing Models
Malevergne, Y
2006-01-01
We discuss the foundations of factor or regression models in the light of the self-consistency condition that the market portfolio (and more generally the risk factors) is (are) constituted of the assets whose returns it is (they are) supposed to explain. As already reported in several articles, self-consistency implies correlations between the return disturbances. As a consequence, the alpha's and beta's of the factor model are unobservable. Self-consistency leads to renormalized beta's with zero effective alpha's, which are observable with standard OLS regressions. Analytical derivations and numerical simulations show that, for arbitrary choices of the proxy which are different from the true market portfolio, a modified linear regression holds with a non-zero value $\\alpha_i$ at the origin between an asset $i$'s return and the proxy's return. Self-consistency also introduces ``orthogonality'' and ``normality'' conditions linking the beta's, alpha's (as well as the residuals) and the weights of the proxy por...
Consistency in the World Wide Web
Thomsen, Jakob Grauenkjær
Tim Berners-Lee envisioned that computers will behave as agents of humans on the World Wide Web, where they will retrieve, extract, and interact with information from the World Wide Web. A step towards this vision is to make computers capable of extracting this information in a reliable...... and consistent way. In this dissertation we study steps towards this vision by showing techniques for the specication, the verication and the evaluation of the consistency of information in the World Wide Web. We show how to detect certain classes of errors in a specication of information, and we show how...... the World Wide Web, in order to help perform consistent evaluations of web extraction techniques. These contributions are steps towards having computers reliable and consistently extract information from the World Wide Web, which in turn are steps towards achieving Tim Berners-Lee's vision. ii...
Self-consistent kinetic lattice Monte Carlo
Horsfield, A.; Dunham, S.; Fujitani, Hideaki
1999-07-01
The authors present a brief description of a formalism for modeling point defect diffusion in crystalline systems using a Monte Carlo technique. The main approximations required to construct a practical scheme are briefly discussed, with special emphasis on the proper treatment of charged dopants and defects. This is followed by tight binding calculations of the diffusion barrier heights for charged vacancies. Finally, an application of the kinetic lattice Monte Carlo method to vacancy diffusion is presented.
Consistency Relations for Large Field Inflation
Chiba, Takeshi
2014-01-01
Consistency relations for chaotic inflation with a monomial potential and natural inflation and hilltop inflation are given which involve the scalar spectral index $n_s$, the tensor-to-scalar ratio $r$ and the running of the spectral index $\\alpha$. The measurement of $\\alpha$ with $O(10^{-3})$ and the improvement in the measurement of $n_s$ could discriminate monomial model from natural/hilltop inflation models. A consistency region for general large field models is also presented.
Approximated mutual information training for speech recognition using myoelectric signals.
Guo, Hua J; Chan, A D C
2006-01-01
A new training algorithm called the approximated maximum mutual information (AMMI) is proposed to improve the accuracy of myoelectric speech recognition using hidden Markov models (HMMs). Previous studies have demonstrated that automatic speech recognition can be performed using myoelectric signals from articulatory muscles of the face. Classification of facial myoelectric signals can be performed using HMMs that are trained using the maximum likelihood (ML) algorithm; however, this algorithm maximizes the likelihood of the observations in the training sequence, which is not directly associated with optimal classification accuracy. The AMMI training algorithm attempts to maximize the mutual information, thereby training the HMMs to optimize their parameters for discrimination. Our results show that AMMI training consistently reduces the error rates compared to these by the ML training, increasing the accuracy by approximately 3% on average.
Approximately bisimilar symbolic models for incrementally stable switched systems
Girard, Antoine; Tabuada, Paulo
2008-01-01
Switched systems constitute an important modeling paradigm faithfully describing many engineering systems in which software interacts with the physical world. Despite considerable progress on stability and stabilization of switched systems, the constant evolution of technology demands that we make similar progress with respect to different, and perhaps more complex, objectives. This paper describes one particular approach to address these different objectives based on the construction of approximately equivalent (bisimilar) symbolic models for switched systems. The main contribution of this paper consists in showing that under standard assumptions ensuring incremental stability of a switched system (i.e. existence of a common Lyapunov function, or multiple Lyapunov functions with dwell time), it is possible to construct a finite symbolic model that is approximately bisimilar to the original switched system with a precision that can be chosen a priori. To support the computational merits of the proposed approa...
Approximate energy expression for spin-polarized Fermi liquids
Takano, M; Endo, T; Kimura, R
2003-01-01
An approximate energy expression is proposed for arbitrarily spin-polarized Fermi liquids with central two-body forces. It is explicitly expression as a functional of spin-dependent radial distribution functions and can be used conveniently in the variational method. It includes the potential energies completely and the kinetic energies up to main parts of the three-body cluster terms. This approximation is similar to that used previously for spin-unpolarized and fully polarized matter. A notable feature of this expressed is that it guarantees the necessary conditions on arbitrarily spin-polarized structure functions automatically. The Euler-Lagrange equations are derived from this energy expression and are numerically solved for arbitrarily spin-polarized liquid sup 3 He. The results for liquid sup 3 He with the HFDHE2 potential are consistent with the nearly ferromagnetic property. (author)
Approximate representation of optimal strategies from influence diagrams
Jensen, Finn V.
2008-01-01
of the advantages of influence diagrams (IDs) is that for small decision problems, the distinction between phases does not confront the decision maker with a problem; when the problem has been properly specified, the solution algorithms are so efficient that the ID can also be used as an on-line representation......, 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....
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.
Semiclassical approximation to neutron star superfluidity corrected for proximity effects.
Barranco, F.; Broglia, R. A.; Esbensen, H.; Vigezzi, E.; Physics; Univ. of Seville; Univ. of Milan and INFN; Univ. of Copenhagen
1998-08-01
The inner crust of a neutron star is a superfluid and inhomogeneous system, consisting of a lattice of nuclei immersed in a sea of neutrons. We perform a quantum calculation of the associated pairing gap and compare it to the results one obtains in the local density approximation (LDA). It is found that the LDA overestimates the spatial dependence of the gap, and leads to a specific heat of the system which is too large at low temperatures, as compared with the quantal result. This is caused by the neglect of proximity effects and the delocalized character of the single-particle wave functions close to the Fermi energy. It is possible to introduce an alternative, simple semiclassical approximation of the pairing gap which leads to a specific heat that is in good agreement with the quantum calculation.
Approximation methods for the partition functions of anharmonic systems
Lew, P.; Ishida, T.
1979-07-01
The analytical approximations for the classical, quantum mechanical and reduced partition functions of the diatomic molecule oscillating internally under the influence of the Morse potential have been derived and their convergences have been tested numerically. This successful analytical method is used in the treatment of anharmonic systems. Using Schwinger perturbation method in the framework of second quantization formulism, the reduced partition function of polyatomic systems can be put into an expression which consists separately of contributions from the harmonic terms, Morse potential correction terms and interaction terms due to the off-diagonal potential coefficients. The calculated results of the reduced partition function from the approximation method on the 2-D and 3-D model systems agree well with the numerical exact calculations.
Turbulent MHD transport coefficients - An attempt at self-consistency
Chen, H.; Montgomery, D.
1987-01-01
In this paper, some multiple scale perturbation calculations of turbulent MHD transport coefficients begun in earlier papers are first completed. These generalize 'alpha effect' calculations by treating the velocity field and magnetic field on the same footing. Then the problem of rendering such calculations self-consistent is addressed, generalizing an eddy-viscosity hypothesis similar to that of Heisenberg for the Navier-Stokes case. The method also borrows from Kraichnan's direct interaction approximation. The output is a set of integral equations relating the spectra and the turbulent transport coefficients. Previous 'alpha effect' and 'beta effect' coefficients emerge as limiting cases. A treatment of the inertial range can also be given, consistent with a -5/3 energy spectrum power law. In the Navier-Stokes limit, a value of 1.72 is extracted for the Kolmogorov constant. Further applications to MHD are possible.
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 gi
Kravchuk functions for the finite oscillator approximation
Atakishiyev, Natig M.; Wolf, Kurt Bernardo
1995-01-01
Kravchuk orthogonal functions - Kravchuk polynomials multiplied by the square root of the weight function - simplify the inversion algorithm for the analysis of discrete, finite signals in harmonic oscillator components. They can be regarded as the best approximation set. As the number of sampling points increases, the Kravchuk expansion becomes the standard oscillator expansion.
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
Crutchfield, Christopher; Fineman, Jeremy T; Karger, David R; Scott, Jacob
2008-01-01
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes the expected makespan, which is the expected time at which all jobs complete. Lin and Rajaraman gave the first approximations for this NP-hard problem for the special cases of independent jobs, precedence constraints forming disjoint chains, and precedence constraints forming trees. In this paper, we present asymptotically better approximation algorithms. In particular, we give an O(loglog min(m,n))-approximation for indep...
Markov operators, positive semigroups and approximation processes
Altomare, Francesco; Leonessa, Vita; Rasa, Ioan
2015-01-01
In recent years several investigations have been devoted to the study of large classes of (mainly degenerate) initial-boundary value evolution problems in connection with the possibility to obtain a constructive approximation of the associated positive C_0-semigroups. In this research monograph we present the main lines of a theory which finds its root in the above-mentioned research field.
Image Compression Via a Fast DCT Approximation
Bayer, F. M.; Cintra, R. J.
2010-01-01
Discrete transforms play an important role in digital signal processing. In particular, due to its transform domain energy compaction properties, the discrete cosine transform (DCT) is pivotal in many image processing problems. This paper introduces a numerical approximation method for the DCT based
Approximation algorithms for planning and control
Boddy, Mark; Dean, Thomas
1989-01-01
A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions.
Large hierarchies from approximate R symmetries
Kappl, Rolf; Ratz, Michael [Technische Univ. Muenchen, Garching (Germany). Physik Dept. T30; Nilles, Hans Peter [Bonn Univ. (Germany). Bethe Zentrum fuer Theoretische Physik und Physikalisches Inst.; Ramos-Sanchez, Saul; Schmidt-Hoberg, Kai [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Vaudrevange, Patrick K.S. [Ludwig-Maximilians-Univ. Muenchen (Germany). Arnold Sommerfeld Zentrum fuer Theoretische Physik
2008-12-15
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.)
Strong washout approximation to resonant leptogenesis
Garbrecht, Bjoern; Gautier, Florian; Klaric, Juraj [Physik Department T70, James-Franck-Strasse, Techniche Universitaet Muenchen, 85748 Garching (Germany)
2016-07-01
We study resonant Leptogenesis with two sterile neutrinos with masses M{sub 1} and M{sub 2}, Yukawa couplings Y{sub 1} and Y{sub 2}, and a single active flavor. Specifically, we focus on the strong washout regime, where the decay width dominates the mass splitting of the two sterile neutrinos. We show that one can approximate the effective decay asymmetry by it's late time limit ε = X sin(2 φ)/(X{sup 2}+sin{sup 2}φ), where X=8 π Δ/(vertical stroke Y{sub 1} vertical stroke {sup 2}+ vertical stroke Y{sub 2} vertical stroke {sup 2}), Δ=4(M{sub 1}-M{sub 2})/(M{sub 1}+M{sub 2}), and φ=arg(Y{sub 2}/Y{sub 1}), and establish criteria for the validity of this approximation. We compare the approximate results with numerical ones, obtained by solving the mixing and oscillations of the sterile neutrinos. We generalize the formula to the case of several active flavors, and demonstrate how it can be used to calculate the lepton asymmetry in phenomenological scenarios which are in agreement with the neutrino oscillation data. We find that that using the late time limit is an applicable approximation throughout the phenomenologically viable parameter space.
Lower Bound Approximation for Elastic Buckling Loads
Vrouwenvelder, A.; Witteveen, J.
1975-01-01
An approximate method for the elastic buckling analysis of two-dimensional frames is introduced. The method can conveniently be explained with reference to a physical interpretation: In the frame every member is replaced by two new members: - a flexural member without extensional rigidity to transmi
Approximate Equilibrium Problems and Fixed Points
H. Mazaheri
2013-01-01
Full Text Available We find a common element of the set of fixed points of a map and the set of solutions of an approximate equilibrium problem in a Hilbert space. Then, we show that one of the sequences weakly converges. Also we obtain some theorems about equilibrium problems and fixed points.
Approximations in diagnosis: motivations and techniques
Harmelen, van F.A.H.; Teije, A. ten
1995-01-01
We argue that diagnosis should not be seen as solving a problem with a unique definition, but rather that there exists a whole space of reasonable notions of diagnosis. These notions can be seen as mutual approximations. We present a number of reasons for choosing among different notions of diagnos
Eignets for function approximation on manifolds
Mhaskar, H N
2009-01-01
Let $\\XX$ be a compact, smooth, connected, Riemannian manifold without boundary, $G:\\XX\\times\\XX\\to \\RR$ be a kernel. Analogous to a radial basis function network, an eignet is an expression of the form $\\sum_{j=1}^M a_jG(\\circ,y_j)$, where $a_j\\in\\RR$, $y_j\\in\\XX$, $1\\le j\\le M$. We describe a deterministic, universal algorithm for constructing an eignet for approximating functions in $L^p(\\mu;\\XX)$ for a general class of measures $\\mu$ and kernels $G$. Our algorithm yields linear operators. Using the minimal separation amongst the centers $y_j$ as the cost of approximation, we give modulus of smoothness estimates for the degree of approximation by our eignets, and show by means of a converse theorem that these are the best possible for every \\emph{individual function}. We also give estimates on the coefficients $a_j$ in terms of the norm of the eignet. Finally, we demonstrate that if any sequence of eignets satisfies the optimal estimates for the degree of approximation of a smooth function, measured in ter...
Approximations in diagnosis: motivations and techniques
Harmelen, van F.A.H.; Teije, A. ten
1995-01-01
We argue that diagnosis should not be seen as solving a problem with a unique definition, but rather that there exists a whole space of reasonable notions of diagnosis. These notions can be seen as mutual approximations. We present a number of reasons for choosing among different notions of
Empirical progress and nomic truth approximation revisited
Kuipers, Theodorus
2014-01-01
In my From Instrumentalism to Constructive Realism (2000) I have shown how an instrumentalist account of empirical progress can be related to nomic truth approximation. However, it was assumed that a strong notion of nomic theories was needed for that analysis. In this paper it is shown, in terms of
Faddeev Random Phase Approximation applied to molecules
Degroote, Matthias
2012-01-01
This Ph.D. thesis derives the equations of the Faddeev Random Phase Approximation (FRPA) and applies the method to a set of small atoms and molecules. The occurence of RPA instabilities in the dissociation limit is addressed in molecules and by the study of the Hubbard molecule as a test system with reduced dimensionality.
Auction analysis by normal form game approximation
Kaisers, Michael; Tuyls, Karl; Thuijsman, Frank; Parsons, Simon
2008-01-01
Auctions are pervasive in todaypsilas society and provide a variety of real markets. This article facilitates a strategic choice between a set of available trading strategies by introducing a methodology to approximate heuristic payoff tables by normal form games. An example from the auction domain
Fostering Formal Commutativity Knowledge with Approximate Arithmetic.
Sonja Maria Hansen
Full Text Available How can we enhance the understanding of abstract mathematical principles in elementary school? Different studies found out that nonsymbolic estimation could foster subsequent exact number processing and simple arithmetic. Taking the commutativity principle as a test case, we investigated if the approximate calculation of symbolic commutative quantities can also alter the access to procedural and conceptual knowledge of a more abstract arithmetic principle. Experiment 1 tested first graders who had not been instructed about commutativity in school yet. Approximate calculation with symbolic quantities positively influenced the use of commutativity-based shortcuts in formal arithmetic. We replicated this finding with older first graders (Experiment 2 and third graders (Experiment 3. Despite the positive effect of approximation on the spontaneous application of commutativity-based shortcuts in arithmetic problems, we found no comparable impact on the application of conceptual knowledge of the commutativity principle. Overall, our results show that the usage of a specific arithmetic principle can benefit from approximation. However, the findings also suggest that the correct use of certain procedures does not always imply conceptual understanding. Rather, the conceptual understanding of commutativity seems to lag behind procedural proficiency during elementary school.
Approximate fixed point of Reich operator
M. Saha
2013-01-01
Full Text Available In the present paper, we study the existence of approximate fixed pointfor Reich operator together with the property that the ε-fixed points are concentrated in a set with the diameter tends to zero if ε $to$ > 0.
Approximation of Aggregate Losses Using Simulation
Mohamed A. Mohamed
2010-01-01
Full Text Available Problem statement: The modeling of aggregate losses is one of the main objectives in actuarial theory and practice, especially in the process of making important business decisions regarding various aspects of insurance contracts. The aggregate losses over a fixed time period is often modeled by mixing the distributions of loss frequency and severity, whereby the distribution resulted from this approach is called a compound distribution. However, in many cases, realistic probability distributions for loss frequency and severity cannot be combined mathematically to derive the compound distribution of aggregate losses. Approach: This study aimed to approximate the aggregate loss distribution using simulation approach. In particular, the approximation of aggregate losses was based on a compound Poisson-Pareto distribution. The effects of deductible and policy limit on the individual loss as well as the aggregate losses were also investigated. Results: Based on the results, the approximation of compound Poisson-Pareto distribution via simulation approach agreed with the theoretical mean and variance of each of the loss frequency, loss severity and aggregate losses. Conclusion: This study approximated the compound distribution of aggregate losses using simulation approach. The investigation on retained losses and insurance claims allowed an insured or a company to select an insurance contract that fulfills its requirement. In particular, if a company wants to have an additional risk reduction, it can compare alternative policies by considering the worthiness of the additional expected total cost which can be estimated via simulation approach.
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.
Approximations in the PE-method
Arranz, Marta Galindo
1996-01-01
Two differenct sources of errors may occur in the implementation of the PE methods; a phase error introduced in the approximation of a pseudo-differential operator and an amplitude error generated from the starting field. First, the inherent phase errors introduced in the solution are analyzed...
Approximating the DGP of China's Quarterly GDP
Ph.H.B.F. Franses (Philip Hans); H. Mees (Heleen)
2010-01-01
textabstractWe demonstrate that the data generating process (DGP) of China’s cumulated quarterly Gross Domestic Product (GDP, current prices), as it is reported by the National Bureau of Statistics of China, can be (very closely) approximated by a simple rule. This rule is that annual growth in any
OPTICAL QUANTIFICATION OF APPROXIMAL CARIES INVITRO
VANDERIJKE, JW; HERKSTROTER, FM; TENBOSCH, JJ
1991-01-01
A fluorescent dye was applied to extracted premolars with either early artificial lesions or natural white-spot lesions. The teeth were placed in an approximal geometry, and with a specially designed fibre-optic probe the fluorescence of the dye was measured in the lesions. The same fibre-optic
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 a
An Approximation of Ultra-Parabolic Equations
Allaberen Ashyralyev
2012-01-01
Full Text Available The first and second order of accuracy difference schemes for the approximate solution of the initial boundary value problem for ultra-parabolic equations are presented. Stability of these difference schemes is established. Theoretical results are supported by the result of numerical examples.
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 a
Approximating the DGP of China's Quarterly GDP
Ph.H.B.F. Franses (Philip Hans); H. Mees (Heleen)
2010-01-01
textabstractWe demonstrate that the data generating process (DGP) of China’s cumulated quarterly Gross Domestic Product (GDP, current prices), as it is reported by the National Bureau of Statistics of China, can be (very closely) approximated by a simple rule. This rule is that annual growth in any
$\\Phi$-derivable approximations in gauge theories
Arrizabalaga, A
2003-01-01
We discuss the method of $\\Phi$-derivable approximations in gauge theories. There, two complications arise, namely the violation of Bose symmetry in correlation functions and the gauge dependence. For the latter we argue that the error introduced by the gauge dependent terms is controlled, therefore not invalidating the method.
Approximations of Two-Attribute Utility Functions
1976-09-01
Introduction to Approximation Theory, McGraw-Hill, New York, 1966. Faber, G., Uber die interpolatorische Darstellung stetiger Funktionen, Deutsche...Management Review 14 (1972b) 37-50. Keeney, R. L., A decision analysis with multiple objectives: the Mexico City airport, Bell Journal of Economics
Approximate Furthest Neighbor in High Dimensions
Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen
2015-01-01
-dimensional Euclidean space. We build 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 a variation...
Virial expansion coefficients in the harmonic approximation
R. Armstrong, J.; Zinner, Nikolaj Thomas; V. Fedorov, D.
2012-01-01
The virial expansion method is applied within a harmonic approximation to an interacting N-body system of identical fermions. We compute the canonical partition functions for two and three particles to get the two lowest orders in the expansion. The energy spectrum is carefully interpolated...
Nonlinear approximation with dictionaries,.. II: Inverse estimates
Gribonval, Rémi; Nielsen, Morten
In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for separated decomposable dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually...
Intrinsic Diophantine approximation on general polynomial surfaces
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...
Turbo Equalization Using Partial Gaussian Approximation
Zhang, Chuanzong; Wang, Zhongyong; Manchón, Carles Navarro
2016-01-01
returned by the equalizer by using a partial Gaussian approximation (PGA). We exploit the specific structure of the ISI channel model to compute the latter messages from the beliefs obtained using a Kalman smoother/equalizer. Doing so leads to a significant complexity reduction compared to the initial PGA...
Subset Selection by Local Convex Approximation
Øjelund, Henrik; Sadegh, Payman; Madsen, Henrik
1999-01-01
least squares criterion. We propose an optimization technique for the posed probelm based on a modified version of the Newton-Raphson iterations, combined with a backward elimination type algorithm. THe Newton-Raphson modification concerns iterative approximations to the non-convex cost function...
Nonlinear approximation with dictionaries. II. Inverse Estimates
Gribonval, Rémi; Nielsen, Morten
2006-01-01
In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal...
Counting independent sets using the Bethe approximation
Chertkov, Michael [Los Alamos National Laboratory; Chandrasekaran, V [MIT; Gamarmik, D [MIT; Shah, D [MIT; Sin, J [MIT
2009-01-01
The authors consider the problem of counting the number of independent sets or the partition function of a hard-core model in a graph. The problem in general is computationally hard (P hard). They study the quality of the approximation provided by the Bethe free energy. Belief propagation (BP) is a message-passing algorithm can be used to compute fixed points of the Bethe approximation; however, BP is not always guarantee to converge. As the first result, they propose a simple message-passing algorithm that converges to a BP fixed pont for any grapy. They find that their algorithm converges within a multiplicative error 1 + {var_epsilon} of a fixed point in {Omicron}(n{sup 2}E{sup -4} log{sup 3}(nE{sup -1})) iterations for any bounded degree graph of n nodes. In a nutshell, the algorithm can be thought of as a modification of BP with 'time-varying' message-passing. Next, they analyze the resulting error to the number of independent sets provided by such a fixed point of the Bethe approximation. Using the recently developed loop calculus approach by Vhertkov and Chernyak, they establish that for any bounded graph with large enough girth, the error is {Omicron}(n{sup -{gamma}}) for some {gamma} > 0. As an application, they find that for random 3-regular graph, Bethe approximation of log-partition function (log of the number of independent sets) is within o(1) of corret log-partition - this is quite surprising as previous physics-based predictions were expecting an error of o(n). In sum, their results provide a systematic way to find Bethe fixed points for any graph quickly and allow for estimating error in Bethe approximation using novel combinatorial techniques.
Hybrid diffusion approximation in highly absorbing media and its effects of source approximation
Huijuan Tian; Ying Liu; Lijun Wang; Yuhui Zhang; Lifeng Xiao
2009-01-01
A modified diffusion approximation model called the hybrid diffusion approximation that can be used for highly absorbing media is investigated.The analytic solution of the hybrid diffusion approximation for reflectance in two-source approximation and steady-state case with extrapolated boundary is obtained.The effects of source approximation on the analytic solution are investigated,and it is validated that two-source approximation in highly absorbing media to describe the optical properties of biological tissue is necessary.Monte Carlo simulation of recovering optical parameters from reflectant data is done with the use of this model.The errors of recovering μa and μ's are smaller than 15% for the reduced albedo between 0.77 and 0.5 with the source-detector separation of 0.4-3 ram.
Breakdown of the dipole approximation for large quantum dot emitters coupled to an interface
Stobbe, Søren; Johansen, Jeppe; Löffler, A.
2008-01-01
We measured time-resolved photoluminescence from large quantum dots near a semiconductor-air interface. Far from the interface our data are consistent with dipole theory, but near the interface they question the validity of the dipole approximation.......We measured time-resolved photoluminescence from large quantum dots near a semiconductor-air interface. Far from the interface our data are consistent with dipole theory, but near the interface they question the validity of the dipole approximation....
Entropy-based consistent model driven architecture
Niepostyn, Stanisław Jerzy
2016-09-01
A description of software architecture is a plan of the IT system construction, therefore any architecture gaps affect the overall success of an entire project. The definitions mostly describe software architecture as a set of views which are mutually unrelated, hence potentially inconsistent. Software architecture completeness is also often described in an ambiguous way. As a result most methods of IT systems building comprise many gaps and ambiguities, thus presenting obstacles for software building automation. In this article the consistency and completeness of software architecture are mathematically defined based on calculation of entropy of the architecture description. Following this approach, in this paper we also propose our method of automatic verification of consistency and completeness of the software architecture development method presented in our previous article as Consistent Model Driven Architecture (CMDA). The proposed FBS (Functionality-Behaviour-Structure) entropy-based metric applied in our CMDA approach enables IT architects to decide whether the modelling process is complete and consistent. With this metric, software architects could assess the readiness of undergoing modelling work for the start of IT system building. It even allows them to assess objectively whether the designed software architecture of the IT system could be implemented at all. The overall benefit of such an approach is that it facilitates the preparation of complete and consistent software architecture more effectively as well as it enables assessing and monitoring of the ongoing modelling development status. We demonstrate this with a few industry examples of IT system designs.
The self consistent expansion applied to the factorial function
Cohen, Alon; Bialy, Shmuel; Schwartz, Moshe
2016-12-01
Most of the interesting systems in statistical physics can be described as nonlinear stochastic field theories. A common feature in the theoretical study of such systems is that ordinary perturbation theory seldom works. On the other hand, there exists a useful tool for the study of systems of that generic nature. That tool, the Self Consistent Expansion (SCE) is technically similar to the ordinary perturbation expansion, in the sense that it is an expansion around a solvable problem. The key point which distinguishes the SCE from an ordinary perturbation expansion, is that the small parameter of the expansion is adjustable and determined inherently by optimization of the expansion. Therefore, it allows the adaptive SCE to remain accurate relative to the inflexible ordinary expansion. The goal of the present paper is to present the SCE by applying it to a well-known zero dimensional problem. We choose the evaluation of the factorial function, x!, as the test case for the SCE, because the Stirling approximation for that function is one of the best known asymptotic expansions, with a very wide use in statistical physics. We show that the SCE approximation holds for small and even negative arguments of the factorial function, where the Stirling expansion fails miserably. It does so without paying any penalty at high values of the argument, where the Stirling formula is excellent. We present numerical as well as analytic SCE approximations of the factorial function.
Self-consistent GW calculations for semiconductors and insulators
Shishkin, M.; Kresse, G.
2007-06-01
We present GW calculations for small and large gap systems comprising typical semiconductors (Si, SiC, GaAs, GaN, ZnO, ZnS, CdS, and AlP), small gap semiconductors (PbS, PbSe, and PbTe), insulators (C, BN, MgO, and LiF), and noble gas solids (Ar and Ne). It is shown that the G0W0 approximation always yields too small band gaps. To improve agreement with experiment, the eigenvalues in the Green’s function G (GW0) and in the Green’s function and the dielectric matrix (GW) are updated until self-consistency is reached. The first approximation leads to excellent agreement with experiment, whereas an update of the eigenvalues in G and W gives too large band gaps for virtually all materials. From a pragmatic point of view, the GW0 approximation thus seems to be an accurate and still reasonably fast method for predicting quasiparticle energies in simple sp -bonded systems. We furthermore observe that the band gaps in materials with shallow d states (GaAs, GaN, and ZnO) are systematically underestimated. We propose that an inaccurate description of the static dielectric properties of these materials is responsible for the underestimation of the band gaps in GW0 , which is itself a result of the incomplete cancellation of the Hartree self-energy within the d shell by local or gradient corrected density functionals.
Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
De Marchi, Stefano
2011-01-01
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, $K=D\\times [-1,1]$, with $D$ the unit disk. The nodes used for these processes are the {\\it Approximate Fekete Points} (AFP) and the {\\it Discrete Leja Points} (DLP) extracted from suitable {\\it Weakly Admissible Meshes} (WAMs) of the cylinder. From the analysis of the growth of the Lebesgue constants, approximation and cubature errors, we show that the AFP and the DLP extracted from WAM are good points for polynomial approximation and numerical integration of functions defined on the cylinder.
On a Unification of Bias Reduction and Numerical Approximation.
In this paper it is shown that the problem of numerical approximation and bias reduction are basically the same problem and that many of the classical numerical methods are equivalent to the so-called jackknife method. In particular it is shown that Simpson’s rule, Romberg integration, Newton-Cotes methods, Lagrange interpolation, the epsilon-algorithm, G-transforms, and others are simply special cases of the generalized jackknife. These observations are then used to obtain a new consistent estimator for the spectral density function . (Author)
Relativistic quasiparticle random phase approximation in deformed nuclei
Pena Arteaga, D.
2007-06-25
Covariant density functional theory is used to study the influence of electromagnetic radiation on deformed superfluid nuclei. The relativistic Hartree-Bogolyubov equations and the resulting diagonalization problem of the quasiparticle random phase approximation are solved for axially symmetric systems in a fully self-consistent way by a newly developed parallel code. Three different kinds of high precision energy functionals are investigated and special care is taken for the decoupling of the Goldstone modes. This allows the microscopic investigation of Pygmy and scissor resonances in electric and magnetic dipole fields. Excellent agreement with recent experiments is found and new types of modes are predicted for deformed systems with large neutron excess. (orig.)
Consistency and Derangements in Brane Tilings
Hanany, Amihay; Ramgoolam, Sanjaye; Seong, Rak-Kyeong
2015-01-01
Brane tilings describe Lagrangians (vector multiplets, chiral multiplets, and the superpotential) of four dimensional $\\mathcal{N}=1$ supersymmetric gauge theories. These theories, written in terms of a bipartite graph on a torus, correspond to worldvolume theories on $N$ D$3$-branes probing a toric Calabi-Yau threefold singularity. A pair of permutations compactly encapsulates the data necessary to specify a brane tiling. We show that geometric consistency for brane tilings, which ensures that the corresponding quantum field theories are well behaved, imposes constraints on the pair of permutations, restricting certain products constructed from the pair to have no one-cycles. Permutations without one-cycles are known as derangements. We illustrate this formulation of consistency with known brane tilings. Counting formulas for consistent brane tilings with an arbitrary number of chiral bifundamental fields are written down in terms of delta functions over symmetric groups.
Quantifying the consistency of scientific databases
Šubelj, Lovro; Boshkoska, Biljana Mileva; Kastrin, Andrej; Levnajić, Zoran
2015-01-01
Science is a social process with far-reaching impact on our modern society. In the recent years, for the first time we are able to scientifically study the science itself. This is enabled by massive amounts of data on scientific publications that is increasingly becoming available. The data is contained in several databases such as Web of Science or PubMed, maintained by various public and private entities. Unfortunately, these databases are not always consistent, which considerably hinders this study. Relying on the powerful framework of complex networks, we conduct a systematic analysis of the consistency among six major scientific databases. We found that identifying a single "best" database is far from easy. Nevertheless, our results indicate appreciable differences in mutual consistency of different databases, which we interpret as recipes for future bibliometric studies.
Self-consistent Green's function approaches
Barbieri, Carlo
2016-01-01
We present the fundamental techniques and working equations of many-body Green's function theory for calculating ground state properties and the spectral strength. Green's function methods closely relate to other polynomial scaling approaches discussed in chapters~8 and ~10. However, here we aim directly at a global view of the many-fermion structure. We derive the working equations for calculating many-body propagators, using both the Algebraic Diagrammatic Construction technique and the self-consistent formalism at finite temperature. Their implementation is discussed, as well as the the inclusion of three-nucleon interactions. The self-consistency feature is essential to guarantee thermodynamic consistency. The paring and neutron matter models introduced in previous chapters are solved and compared with the other methods in this book.
Personalized recommendation based on unbiased consistence
Zhu, Xuzhen; Tian, Hui; Zhang, Ping; Hu, Zheng; Zhou, Tao
2015-08-01
Recently, in physical dynamics, mass-diffusion-based recommendation algorithms on bipartite network provide an efficient solution by automatically pushing possible relevant items to users according to their past preferences. However, traditional mass-diffusion-based algorithms just focus on unidirectional mass diffusion from objects having been collected to those which should be recommended, resulting in a biased causal similarity estimation and not-so-good performance. In this letter, we argue that in many cases, a user's interests are stable, and thus bidirectional mass diffusion abilities, no matter originated from objects having been collected or from those which should be recommended, should be consistently powerful, showing unbiased consistence. We further propose a consistence-based mass diffusion algorithm via bidirectional diffusion against biased causality, outperforming the state-of-the-art recommendation algorithms in disparate real data sets, including Netflix, MovieLens, Amazon and Rate Your Music.
A Revisit to Probability - Possibility Consistency Principles
Mamoni Dhar
2013-03-01
Full Text Available In this article, our main intention is to highlight the fact that the probable links between probability and possibility which were established by different authors at different point of time on the basis of some well known consistency principles cannot provide the desired result. That is why the paper discussed some prominent works for transformations between probability and possibility and finally aimed to suggest a new principle because none of the existing principles because none of them found the unique transformation. The new consistency principle which is suggested hereby would in turn replace all others that exist in the literature references by providing a reliable estimate of consistency between the two.Furthermore some properties of entropy of fuzzy numbers are also presented in this article.
Consistent matter couplings for Plebanski gravity
Tennie, Felix
2010-01-01
We develop a scheme for the minimal coupling of all standard types of tensor and spinor field matter to Plebanski gravity. This theory is a geometric reformulation of vacuum general relativity in terms of two-form frames and connection one-forms, and provides a covariant basis for various quantization approaches. Using the spinor formalism we prove the consistency of the newly proposed matter coupling by demonstrating the full equivalence of Plebanski gravity plus matter to Einstein--Cartan gravity. As a byproduct we also show the consistency of some previous suggestions for matter actions.
Consistent matter couplings for Plebanski gravity
Tennie, Felix; Wohlfarth, Mattias N. R.
2010-11-01
We develop a scheme for the minimal coupling of all standard types of tensor and spinor field matter to Plebanski gravity. This theory is a geometric reformulation of vacuum general relativity in terms of two-form frames and connection one-forms, and provides a covariant basis for various quantization approaches. Using the spinor formalism we prove the consistency of the newly proposed matter coupling by demonstrating the full equivalence of Plebanski gravity plus matter to Einstein-Cartan gravity. As a by-product we also show the consistency of some previous suggestions for matter actions.
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 inverse preconditioners for general sparse matrices
Chow, E.; Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)
1994-12-31
Preconditioned Krylov subspace methods are often very efficient in solving sparse linear matrices that arise from the discretization of elliptic partial differential equations. However, for general sparse indifinite matrices, the usual ILU preconditioners fail, often because of the fact that the resulting factors L and U give rise to unstable forward and backward sweeps. In such cases, alternative preconditioners based on approximate inverses may be attractive. We are currently developing a number of such preconditioners based on iterating on each column to get the approximate inverse. For this approach to be efficient, the iteration must be done in sparse mode, i.e., we must use sparse-matrix by sparse-vector type operatoins. We will discuss a few options and compare their performance on standard problems from the Harwell-Boeing collection.
Approximate Lesion Localization in Dermoscopy Images
Celebi, M Emre; Schaefer, Gerald; Stoecker, William V; 10.1111/j.1600-0846.2009.00357.x
2010-01-01
Background: Dermoscopy is one of the major imaging modalities used in the diagnosis of melanoma and other pigmented skin lesions. Due to the difficulty and subjectivity of human interpretation, automated analysis of dermoscopy images has become an important research area. Border detection is often the first step in this analysis. Methods: In this article, we present an approximate lesion localization method that serves as a preprocessing step for detecting borders in dermoscopy images. In this method, first the black frame around the image is removed using an iterative algorithm. The approximate location of the lesion is then determined using an ensemble of thresholding algorithms. Results: The method is tested on a set of 428 dermoscopy images. The localization error is quantified by a metric that uses dermatologist determined borders as the ground truth. Conclusion: The results demonstrate that the method presented here achieves both fast and accurate localization of lesions in dermoscopy images.
Approximate gauge symemtry of composite vector bosons
Suzuki, Mahiko
2010-06-01
It can be shown in a solvable field theory model that the couplings of the composite vector mesons made of a fermion pair approach the gauge couplings in the limit of strong binding. Although this phenomenon may appear accidental and special to the vector bosons made of a fermion pair, we extend it to the case of bosons being constituents and find that the same phenomenon occurs in more an intriguing way. The functional formalism not only facilitates computation but also provides us with a better insight into the generating mechanism of approximate gauge symmetry, in particular, how the strong binding and global current conservation conspire to generate such an approximate symmetry. Remarks are made on its possible relevance or irrelevance to electroweak and higher symmetries.
Quasi-chemical approximation for polyatomic mixtures
Dávila, M V; Matoz-Fernandez, D A; Ramirez-Pastor, A J
2016-01-01
The statistical thermodynamics of binary mixtures of polyatomic species was developed on a generalization in the spirit of the lattice-gas model and the quasi-chemical approximation (QCA). The new theoretical framework is obtained by combining: (i) the exact analytical expression for the partition function of non-interacting mixtures of linear $k$-mers and $l$-mers (species occupying $k$ sites and $l$ sites, respectively) adsorbed in one dimension, and its extension to higher dimensions; and (ii) a generalization of the classical QCA for multicomponent adsorbates and multisite-occupancy adsorption. The process is analyzed through the partial adsorption isotherms corresponding to both species of the mixture. Comparisons with analytical data from Bragg-Williams approximation (BWA) and Monte Carlo simulations are performed in order to test the validity of the theoretical model. Even though a good fitting is obtained from BWA, it is found that QCA provides a more accurate description of the phenomenon of adsorpti...
Improved Approximations for Some Polymer Extension Models
Petrosyan, Rafayel
2016-01-01
We propose approximations for force-extension dependencies for the freely jointed chain (FJC) and worm-like chain (WLC) models as well as for extension-force dependence for the WLC model. Proposed expressions show less than 1% relative error in the useful range of the corresponding variables. These results can be applied for fitting force-extension curves obtained in molecular force spectroscopy experiments. Particularly they can be useful for cases where one has geometries of springs in series and/or in parallel where particular combination of expressions should be used for fitting the data. All approximations have been obtained following the same procedure of determining the asymptotes and then reducing the relative error of that expression by adding an appropriate term obtained from fitting its absolute error.
Regularized Laplacian Estimation and Fast Eigenvector Approximation
Perry, Patrick O
2011-01-01
Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick \\emph{approximation} to the first nontrivial eigenvector of a data graph Laplacian \\emph{exactly} solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistical interpretation of their approximation procedure. Our interpretation will be analogous to the manner in which $\\ell_2$-regularized or $\\ell_1$-regularized $\\ell_2$-regression (often called Ridge regression and Lasso regression, respectively) can be interpreted in terms of a Gaussian prior or a Laplace prior, respectively, on the coefficient vector of the regression problem. Our framework will imply that the solutions to the Mahoney-Orecchia regularized SDP can be interpreted as regularized estimates of the pseudoinverse of the graph Laplacian. Conversely, it will imply that the solution to this regularized estimation problem can be computed very quickly by running, e.g., the fast diffusion-base...
On approximative solutions of multistopping problems
Faller, Andreas; 10.1214/10-AAP747
2012-01-01
In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed to be independent not to be identically distributed. The basic assumption is convergence of a related imbedded point process to a continuous time Poisson process in the plane, which serves as a limiting model for the stopping problem. The optimal $m$-stopping curves for this limiting model are determined by differential equations of first order. A general approximation result is established which ensures convergence of the finite discrete time $m$-stopping problem to that in the limit model. This allows the construction of approximative solutions of the discrete time $m$-stopping problem. In detail, the case of i.i.d. sequences with discount and observation costs is discussed and explicit results are obtained.
Numerical and approximate solutions for plume rise
Krishnamurthy, Ramesh; Gordon Hall, J.
Numerical and approximate analytical solutions are compared for turbulent plume rise in a crosswind. The numerical solutions were calculated using the plume rise model of Hoult, Fay and Forney (1969, J. Air Pollut. Control Ass.19, 585-590), over a wide range of pertinent parameters. Some wind shear and elevated inversion effects are included. The numerical solutions are seen to agree with the approximate solutions over a fairly wide range of the parameters. For the conditions considered in the study, wind shear effects are seen to be quite small. A limited study was made of the penetration of elevated inversions by plumes. The results indicate the adequacy of a simple criterion proposed by Briggs (1969, AEC Critical Review Series, USAEC Division of Technical Information extension, Oak Ridge, Tennesse).
Approximated solutions to Born-Infeld dynamics
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.
SOME CONVERSE RESULTS ON ONESIDED APPROXIMATION: JUSTIFICATIONS
Wang Jianli; Zhou Songping
2003-01-01
The present paper deals with best onesided approximation rate in Lp spaces ～En (f)Lp of f ∈ C2π. Although it is clear that the estimate ～En(f)Lp≤C ‖f‖ Lp cannot be correct for all f ∈ Lp2π in case p＜∞, the question whether ～En (f)Lp ≤Cω (f, n-1 )Lp or ～En(f)Lp ≤CEn(f)Lp holds for f ∈ C2π remains totally untouched.Therefore it forms a basic problem to justify onesided approximation. The present paper will provide an answer to settle down the basis.
An Origami Approximation to the Cosmic Web
Neyrinck, Mark C
2014-01-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 ...
Flow past a porous approximate spherical shell
Srinivasacharya, D.
2007-07-01
In this paper, the creeping flow of an incompressible viscous liquid past a porous approximate spherical shell is considered. The flow in the free fluid region outside the shell and in the cavity region of the shell is governed by the Navier Stokes equation. The flow within the porous annulus region of the shell is governed by Darcy’s Law. The boundary conditions used at the interface are continuity of the normal velocity, continuity of the pressure and Beavers and Joseph slip condition. An exact solution for the problem is obtained. An expression for the drag on the porous approximate spherical shell is obtained. The drag experienced by the shell is evaluated numerically for several values of the parameters governing the flow.