Generalized Gradient Approximation Made Simple
Perdew, J.P.; Burke, K.; Ernzerhof, M.
1996-01-01
Generalized gradient approximations (GGA close-quote s) for the exchange-correlation energy improve upon the local spin density (LSD) description of atoms, molecules, and solids. We present a simple derivation of a simple GGA, in which all parameters (other than those in LSD) are fundamental constants. Only general features of the detailed construction underlying the Perdew-Wang 1991 (PW91) GGA are invoked. Improvements over PW91 include an accurate description of the linear response of the uniform electron gas, correct behavior under uniform scaling, and a smoother potential. copyright 1996 The American Physical Society
The generalized gradient approximation in solids and molecules
Haas, P.
2010-01-01
Today, most methods are based on theoretical calculations of the electronic structure of molecules, surfaces and solids on density functional theory (DFT) and the resulting Kohn-Sham equations. Unfortunately, the exact analytical expression for the exchange-correlation functional is not known and has to be approximated. The reliability of such a Kohn-Sham calculation depends i) from the numerical accuracy and ii) from the used approximation for the exchange-correlation energy. To solve the Kohn-Sham equations, the WIEN2k code, which is one of the most accurate methods for solid-state calculations, is used. The search for better approximations for the exchange-correlation energy is an intense field of research in chemistry and physics. The main objectives of the dissertation is the development, implementation and testing of advanced exchange-correlation functionals and the analysis of existing functionals. The focus of this work are GGA - functionals. Such GGA functionals are still the most widely used functionals, in particular because they are easy to implement and require little computational effort. Several recent studies have shown that an improvement of the GGA should be possible. A detailed analysis of the results will allow us to understand why a particular GGA approximation for a class of elements (compounds) works better than for another. (Kancsar) [de
Śmiga, Szymon; Fabiano, Eduardo; Laricchia, Savio; Constantin, Lucian A; Della Sala, Fabio
2015-04-21
We analyze the methodology and the performance of subsystem density functional theory (DFT) with meta-generalized gradient approximation (meta-GGA) exchange-correlation functionals for non-bonded molecular systems. Meta-GGA functionals depend on the Kohn-Sham kinetic energy density (KED), which is not known as an explicit functional of the density. Therefore, they cannot be directly applied in subsystem DFT calculations. We propose a Laplacian-level approximation to the KED which overcomes this limitation and provides a simple and accurate way to apply meta-GGA exchange-correlation functionals in subsystem DFT calculations. The so obtained density and energy errors, with respect to the corresponding supermolecular calculations, are comparable with conventional approaches, depending almost exclusively on the approximations in the non-additive kinetic embedding term. An embedding energy error decomposition explains the accuracy of our method.
Electronic and Optical Properties of TiS_2 Determined from Generalized Gradient Approximation Study
El-Kouch, Hamza; Farh, Larbi El; Sayah, Jamal; Challioui, Allal
2015-01-01
The electronic and optical properties of TiS_2 are studied by using an ab-initio calculation within the frame of density functional theory. A linearized and augmented plane wave basis set with the generalized gradient approximation as proposed by Perdew et al. is used for the energy exchange-correlation determination. The results show a metallic character of TiS_2, and the plots of total and partial densities of states of TiS_2 show the metallic character of the bonds and a strong hybridization between the states d of Ti and p of S below the Fermi energy. The optical properties of the material such as real and imaginary parts of dielectric constant (ϵ(ω) = ϵ_1(ω) + iϵ_2(ω)), refractive index n(ω), optical reflectivity R(ω), for E//x and E//z are performed for the energy range of 0–14 eV. (paper)
Mejia-Rodriguez, Daniel; Trickey, S. B.
2017-11-01
We explore the simplification of widely used meta-generalized-gradient approximation (mGGA) exchange-correlation functionals to the Laplacian level of refinement by use of approximate kinetic-energy density functionals (KEDFs). Such deorbitalization is motivated by the prospect of reducing computational cost while recovering a strictly Kohn-Sham local potential framework (rather than the usual generalized Kohn-Sham treatment of mGGAs). A KEDF that has been rather successful in solid simulations proves to be inadequate for deorbitalization, but we produce other forms which, with parametrization to Kohn-Sham results (not experimental data) on a small training set, yield rather good results on standard molecular test sets when used to deorbitalize the meta-GGA made very simple, Tao-Perdew-Staroverov-Scuseria, and strongly constrained and appropriately normed functionals. We also study the difference between high-fidelity and best-performing deorbitalizations and discuss possible implications for use in ab initio molecular dynamics simulations of complicated condensed phase systems.
Kohut, Sviataslau V; Staroverov, Viktor N
2013-10-28
The exchange-correlation potential of Kohn-Sham density-functional theory, vXC(r), can be thought of as an electrostatic potential produced by the static charge distribution qXC(r) = -(1∕4π)∇(2)vXC(r). The total exchange-correlation charge, QXC = ∫qXC(r) dr, determines the rate of the asymptotic decay of vXC(r). If QXC ≠ 0, the potential falls off as QXC∕r; if QXC = 0, the decay is faster than coulombic. According to this rule, exchange-correlation potentials derived from standard generalized gradient approximations (GGAs) should have QXC = 0, but accurate numerical calculations give QXC ≠ 0. We resolve this paradox by showing that the charge density qXC(r) associated with every GGA consists of two types of contributions: a continuous distribution and point charges arising from the singularities of vXC(r) at each nucleus. Numerical integration of qXC(r) accounts for the continuous charge but misses the point charges. When the point-charge contributions are included, one obtains the correct QXC value. These findings provide an important caveat for attempts to devise asymptotically correct Kohn-Sham potentials by modeling the distribution qXC(r).
Li, Shaohong L; Truhlar, Donald G
2015-07-14
Time-dependent density functional theory (TDDFT) with conventional local and hybrid functionals such as the local and hybrid generalized gradient approximations (GGA) seriously underestimates the excitation energies of Rydberg states, which limits its usefulness for applications such as spectroscopy and photochemistry. We present here a scheme that modifies the exchange-enhancement factor to improve GGA functionals for Rydberg excitations within the TDDFT framework while retaining their accuracy for valence excitations and for the thermochemical energetics calculated by ground-state density functional theory. The scheme is applied to a popular hybrid GGA functional and tested on data sets of valence and Rydberg excitations and atomization energies, and the results are encouraging. The scheme is simple and flexible. It can be used to correct existing functionals, and it can also be used as a strategy for the development of new functionals.
Potvin, Guy
2015-10-01
We examine how the Rytov approximation describing log-amplitude and phase fluctuations of a wave propagating through weak uniform turbulence can be generalized to the case of turbulence with a large-scale nonuniform component. We show how the large-scale refractive index field creates Fermat rays using the path integral formulation for paraxial propagation. We then show how the second-order derivatives of the Fermat ray action affect the Rytov approximation, and we discuss how a numerical algorithm would model the general Rytov approximation.
Approximate error conjugation gradient minimization methods
Kallman, Jeffrey S
2013-05-21
In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.
Sato, Shunsuke A. [Graduate School of Pure and Applied Sciences, University of Tsukuba, Tsukuba 305-8571 (Japan); Taniguchi, Yasutaka [Center for Computational Science, University of Tsukuba, Tsukuba 305-8571 (Japan); Department of Medical and General Sciences, Nihon Institute of Medical Science, 1276 Shimogawara, Moroyama-Machi, Iruma-Gun, Saitama 350-0435 (Japan); Shinohara, Yasushi [Max Planck Institute of Microstructure Physics, 06120 Halle (Germany); Yabana, Kazuhiro [Graduate School of Pure and Applied Sciences, University of Tsukuba, Tsukuba 305-8571 (Japan); Center for Computational Science, University of Tsukuba, Tsukuba 305-8571 (Japan)
2015-12-14
We develop methods to calculate electron dynamics in crystalline solids in real-time time-dependent density functional theory employing exchange-correlation potentials which reproduce band gap energies of dielectrics; a meta-generalized gradient approximation was proposed by Tran and Blaha [Phys. Rev. Lett. 102, 226401 (2009)] (TBm-BJ) and a hybrid functional was proposed by Heyd, Scuseria, and Ernzerhof [J. Chem. Phys. 118, 8207 (2003)] (HSE). In time evolution calculations employing the TB-mBJ potential, we have found it necessary to adopt the predictor-corrector step for a stable time evolution. We have developed a method to evaluate electronic excitation energy without referring to the energy functional which is unknown for the TB-mBJ potential. For the HSE functional, we have developed a method for the operation of the Fock-like term in Fourier space to facilitate efficient use of massive parallel computers equipped with graphic processing units. We compare electronic excitations in silicon and germanium induced by femtosecond laser pulses using the TB-mBJ, HSE, and a simple local density approximation (LDA). At low laser intensities, electronic excitations are found to be sensitive to the band gap energy: they are close to each other using TB-mBJ and HSE and are much smaller in LDA. At high laser intensities close to the damage threshold, electronic excitation energies do not differ much among the three cases.
Approximated Function Based Spectral Gradient Algorithm for Sparse Signal Recovery
Weifeng Wang
2014-02-01
Full Text Available Numerical algorithms for the l0-norm regularized non-smooth non-convex minimization problems have recently became a topic of great interest within signal processing, compressive sensing, statistics, and machine learning. Nevertheless, the l0-norm makes the problem combinatorial and generally computationally intractable. In this paper, we construct a new surrogate function to approximate l0-norm regularization, and subsequently make the discrete optimization problem continuous and smooth. Then we use the well-known spectral gradient algorithm to solve the resulting smooth optimization problem. Experiments are provided which illustrate this method is very promising.
Sadegh, Payman; Spall, J. C.
1998-01-01
simultaneous perturbation approximation to the gradient based on loss function measurements. SPSA is based on picking a simultaneous perturbation (random) vector in a Monte Carlo fashion as part of generating the approximation to the gradient. This paper derives the optimal distribution for the Monte Carlo...
Sadegh, Payman
1997-01-01
This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...... of the optimization parameters. It is shown that, under application of the projection algorithm, the parameter iterate converges almost surely to a Kuhn-Tucker point, The procedure is illustrated by a numerical example, (C) 1997 Elsevier Science Ltd....
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...
RATIONAL APPROXIMATIONS TO GENERALIZED HYPERGEOMETRIC FUNCTIONS.
Under weak restrictions on the various free parameters, general theorems for rational representations of the generalized hypergeometric functions...and certain Meijer G-functions are developed. Upon specialization, these theorems yield a sequency of rational approximations which converge to the
A gradient approximation for calculating Debye temperatures from pairwise interatomic potentials
Jackson, D.P.
1975-09-01
A simple gradient approximation is given for calculating the effective Debye temperature of a cubic crystal from central pairwise interatomic potentials. For examples of the Morse potential applied to cubic metals the results are in generally good agreement with experiment. (author)
MPPT for PM wind generator using gradient approximation
Hong, Y.-Y.; Lu, S.-D.; Chiou, C.-S.
2009-01-01
This paper applies new maximum-power-point tracking (MPPT) algorithms to a wind-turbine generator system (WTGS). In this paper, the WTGS is a direct-drive system and includes the wind-turbine, permanent-magnet (PM) synchronous generator, three-phase full bridge rectifier, buck-boost converter and load. The new MPPT method uses gradient approximation (GA) algorithm. Three methods based on GA for achieving MPPT are discussed in this paper: (1) full-sensor control with anemometer and tachometer, (2) rule-based method and (3) adaptive duty cycle method. The third method has merits of no PID parameters, proportional constant, anemometer, tachometer and characteristics of WTGS required. This method enables the permanent-magnet synchronous generator (PMSG) to operate at variable speeds to achieve good performance. Simulation results show that the tip-speed ratio (TSR) and power coefficient obtained by the adaptive duty cycle method with GA can be almost identical to the optimal values
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...
MPPT for PM wind generator using gradient approximation
Hong, Ying-Yi; Lu, Shiue-Der; Chiou, Ching-Sheng [Department of Electrical Engineering, Chung Yuan Christian University, 200, Chung-Pei Road, Chung Li 320 (China)
2009-01-15
This paper applies new maximum-power-point tracking (MPPT) algorithms to a wind-turbine generator system (WTGS). In this paper, the WTGS is a direct-drive system and includes the wind-turbine, permanent-magnet (PM) synchronous generator, three-phase full bridge rectifier, buck-boost converter and load. The new MPPT method uses gradient approximation (GA) algorithm. Three methods based on GA for achieving MPPT are discussed in this paper: (1) full-sensor control with anemometer and tachometer, (2) rule-based method and (3) adaptive duty cycle method. The third method has merits of no PID parameters, proportional constant, anemometer, tachometer and characteristics of WTGS required. This method enables the permanent-magnet synchronous generator (PMSG) to operate at variable speeds to achieve good performance. Simulation results show that the tip-speed ratio (TSR) and power coefficient obtained by the adaptive duty cycle method with GA can be almost identical to the optimal values. (author)
Weak field approximation of new general relativity
Fukui, Masayasu; Masukawa, Junnichi
1985-01-01
In the weak field approximation, gravitational field equations of new general relativity with arbitrary parameters are examined. Assuming a conservation law delta sup(μ)T sub(μν) = 0 of the energy-momentum tensor T sub(μν) for matter fields in addition to the usual one delta sup(ν)T sub(μν) = 0, we show that the linearized gravitational field equations are decomposed into equations for a Lorentz scalar field and symmetric and antisymmetric Lorentz tensor fields. (author)
Kaschner, R.; Graefenstein, J.; Ziesche, P.
1988-12-01
From the local momentum balance using density functional theory an expression for the local quantum-mechanical stress tensor (or stress field) σ(r) of non-relativistic Coulomb systems is found out within the Thomas-Fermi approximation and its generalizations including gradient expansion method. As an illustration the stress field σ(r) is calculated for the jellium model of the interface K-Cs, containing especially the adhesive force between the two half-space jellia. (author). 23 refs, 1 fig
Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
Benzi, M.; Cullum, J. K.; Tůma, Miroslav
2000-01-01
Roč. 22, č. 4 (2000), s. 1318-1332 ISSN 1064-8275 R&D Projects: GA AV ČR IAA2030706; GA AV ČR IAA2030801 Institutional research plan: AV0Z1030915 Subject RIV: BA - General Mathematics Impact factor: 1.421, year: 2000
Approximations of the Generalized Wilks' Distribution
Raats, V.M.
2004-01-01
Wilks' lambda and the corresponding Wilks' distribution are well known concepts in testing in multivariate regression models.The topic of this paper is a generalization of the Wilks distribution.This generalized Wilks' distribution is relevant for testing in multivariate regression models with
Geometrical-optics approximation of forward scattering by gradient-index spheres.
Li, Xiangzhen; Han, Xiang'e; Li, Renxian; Jiang, Huifen
2007-08-01
By means of geometrical optics we present an approximation method for acceleration of the computation of the scattering intensity distribution within a forward angular range (0-60 degrees ) for gradient-index spheres illuminated by a plane wave. The incident angle of reflected light is determined by the scattering angle, thus improving the approximation accuracy. The scattering angle and the optical path length are numerically integrated by a general-purpose integrator. With some special index models, the scattering angle and the optical path length can be expressed by a unique function and the calculation is faster. This method is proved effective for transparent particles with size parameters greater than 50. It fails to give good approximation results at scattering angles whose refractive rays are in the backward direction. For different index models, the geometrical-optics approximation is effective only for forward angles, typically those less than 60 degrees or when the refractive-index difference of a particle is less than a certain value.
Structure of the optimized effective Kohn-Sham exchange potential and its gradient approximations
Gritsenko, O.; Van Leeuwen, R.; Baerends, E.J.
1996-01-01
An analysis of the structure of the optimized effective Kohn-Sham exchange potential v, and its gradient approximations is presented. The potential is decomposed into the Slater potential v s and the response of v s to density variations, v resp . The latter exhibits peaks that reflect the atomic shell structure. Kohn-Sham exchange potentials derived from current gradient approaches for the exchange energy are shown to be quite reasonable for the Slater potential, but they fail to approximate the response part, which leads to poor overall potentials. Improved potentials are constructed by a direct fit of v x with a gradient-dependent Pade approximant form. The potentials obtained possess proper asymptotic and scaling properties and reproduce the shell structure of the exact v x . 44 refs., 7 figs., 4 tabs
Zhang, Zhendong; Schuster, Gerard T.; Liu, Yike; Hanafy, Sherif M.; Li, Jing
2016-01-01
We present a surface-wave inversion method that inverts for the S-wave velocity from the Rayleigh wave dispersion curve using a difference approximation to the gradient of the misfit function. We call this wave equation inversion of skeletonized
Bozkaya, Uğur; Sherrill, C. David
2016-01-01
An efficient implementation is presented for analytic gradients of the coupled-cluster singles and doubles (CCSD) method with the density-fitting approximation, denoted DF-CCSD. Frozen core terms are also included. When applied to a set of alkanes, the DF-CCSD analytic gradients are significantly accelerated compared to conventional CCSD for larger molecules. The efficiency of our DF-CCSD algorithm arises from the acceleration of several different terms, which are designated as the “gradient terms”: computation of particle density matrices (PDMs), generalized Fock-matrix (GFM), solution of the Z-vector equation, formation of the relaxed PDMs and GFM, back-transformation of PDMs and GFM to the atomic orbital (AO) basis, and evaluation of gradients in the AO basis. For the largest member of the alkane set (C 10 H 22 ), the computational times for the gradient terms (with the cc-pVTZ basis set) are 2582.6 (CCSD) and 310.7 (DF-CCSD) min, respectively, a speed up of more than 8-folds. For gradient related terms, the DF approach avoids the usage of four-index electron repulsion integrals. Based on our previous study [U. Bozkaya, J. Chem. Phys. 141, 124108 (2014)], our formalism completely avoids construction or storage of the 4-index two-particle density matrix (TPDM), using instead 2- and 3-index TPDMs. The DF approach introduces negligible errors for equilibrium bond lengths and harmonic vibrational frequencies.
The κ-Generalizations of Stirling Approximation and Multinominal Coefficients
Tatsuaki Wada
2013-11-01
Full Text Available Stirling approximation of the factorials and multinominal coefficients are generalized based on the κ-generalized functions introduced by Kaniadakis. We have related the κ-generalized multinominal coefficients to the κ-entropy by introducing a new κ-product operation, which exists only when κ ≠ 0.
The generalized Mayer theorem in the approximating hamiltonian method
Bakulev, A.P.; Bogoliubov, N.N. Jr.; Kurbatov, A.M.
1982-07-01
With the help of the generalized Mayer theorem we obtain the improved inequality for free energies of model and approximating systems, where only ''connected parts'' over the approximating hamiltonian are taken into account. For the concrete system we discuss the problem of convergency of appropriate series of ''connected parts''. (author)
The generalized approximation method and nonlinear heat transfer equations
Rahmat Khan
2009-01-01
Full Text Available Generalized approximation technique for a solution of one-dimensional steady state heat transfer problem in a slab made of a material with temperature dependent thermal conductivity, is developed. The results obtained by the generalized approximation method (GAM are compared with those studied via homotopy perturbation method (HPM. For this problem, the results obtained by the GAM are more accurate as compared to the HPM. Moreover, our (GAM generate a sequence of solutions of linear problems that converges monotonically and rapidly to a solution of the original nonlinear problem. Each approximate solution is obtained as the solution of a linear problem. We present numerical simulations to illustrate and confirm the theoretical results.
Approximation solutions for indifference pricing under general utility functions
Chen, An; Pelsser, Antoon; Vellekoop, M.H.
2008-01-01
With the aid of Taylor-based approximations, this paper presents results for pricing insurance contracts by using indifference pricing under general utility functions. We discuss the connection between the resulting "theoretical" indifference prices and the pricing rule-of-thumb that practitioners
Approximate Solutions for Indifference Pricing under General Utility Functions
Chen, A.; Pelsser, A.; Vellekoop, M.
2007-01-01
With the aid of Taylor-based approximations, this paper presents results for pricing insurance contracts by using indifference pricing under general utility functions. We discuss the connection between the resulting "theoretical" indifference prices and the pricing rule-of-thumb that practitioners
Approximate Solution of Nonlinear Klein-Gordon Equation Using Sobolev Gradients
Nauman Raza
2016-01-01
Full Text Available The nonlinear Klein-Gordon equation (KGE models many nonlinear phenomena. In this paper, we propose a scheme for numerical approximation of solutions of the one-dimensional nonlinear KGE. A common approach to find a solution of a nonlinear system is to first linearize the equations by successive substitution or the Newton iteration method and then solve a linear least squares problem. Here, we show that it can be advantageous to form a sum of squared residuals of the nonlinear problem and then find a zero of the gradient. Our scheme is based on the Sobolev gradient method for solving a nonlinear least square problem directly. The numerical results are compared with Lattice Boltzmann Method (LBM. The L2, L∞, and Root-Mean-Square (RMS values indicate better accuracy of the proposed method with less computational effort.
A Poisson process approximation for generalized K-5 confidence regions
Arsham, H.; Miller, D. R.
1982-01-01
One-sided confidence regions for continuous cumulative distribution functions are constructed using empirical cumulative distribution functions and the generalized Kolmogorov-Smirnov distance. The band width of such regions becomes narrower in the right or left tail of the distribution. To avoid tedious computation of confidence levels and critical values, an approximation based on the Poisson process is introduced. This aproximation provides a conservative confidence region; moreover, the approximation error decreases monotonically to 0 as sample size increases. Critical values necessary for implementation are given. Applications are made to the areas of risk analysis, investment modeling, reliability assessment, and analysis of fault tolerant systems.
Gradient descent learning algorithm overview: a general dynamical systems perspective.
Baldi, P
1995-01-01
Gives a unified treatment of gradient descent learning algorithms for neural networks using a general framework of dynamical systems. This general approach organizes and simplifies all the known algorithms and results which have been originally derived for different problems (fixed point/trajectory learning), for different models (discrete/continuous), for different architectures (forward/recurrent), and using different techniques (backpropagation, variational calculus, adjoint methods, etc.). The general approach can also be applied to derive new algorithms. The author then briefly examines some of the complexity issues and limitations intrinsic to gradient descent learning. Throughout the paper, the author focuses on the problem of trajectory learning.
S-AMP: Approximate Message Passing for General Matrix Ensembles
Cakmak, Burak; Winther, Ole; Fleury, Bernard H.
2014-01-01
the approximate message-passing (AMP) algorithm to general matrix ensembles with a well-defined large system size limit. The generalization is based on the S-transform (in free probability) of the spectrum of the measurement matrix. Furthermore, we show that the optimality of S-AMP follows directly from its......We propose a novel iterative estimation algorithm for linear observation models called S-AMP. The fixed points of S-AMP are the stationary points of the exact Gibbs free energy under a set of (first- and second-) moment consistency constraints in the large system limit. S-AMP extends...
Shu, Yu-Chen, E-mail: ycshu@mail.ncku.edu.tw [Department of Mathematics, National Cheng Kung University, Tainan 701, Taiwan (China); Mathematics Division, National Center for Theoretical Sciences (South), Tainan 701, Taiwan (China); Chern, I-Liang, E-mail: chern@math.ntu.edu.tw [Department of Applied Mathematics, National Chiao Tung University, Hsin Chu 300, Taiwan (China); Department of Mathematics, National Taiwan University, Taipei 106, Taiwan (China); Mathematics Division, National Center for Theoretical Sciences (Taipei Office), Taipei 106, Taiwan (China); Chang, Chien C., E-mail: mechang@iam.ntu.edu.tw [Institute of Applied Mechanics, National Taiwan University, Taipei 106, Taiwan (China); Department of Mathematics, National Taiwan University, Taipei 106, Taiwan (China)
2014-10-15
Most elliptic interface solvers become complicated for complex interface problems at those “exceptional points” where there are not enough neighboring interior points for high order interpolation. Such complication increases especially in three dimensions. Usually, the solvers are thus reduced to low order accuracy. In this paper, we classify these exceptional points and propose two recipes to maintain order of accuracy there, aiming at improving the previous coupling interface method [26]. Yet the idea is also applicable to other interface solvers. The main idea is to have at least first order approximations for second order derivatives at those exceptional points. Recipe 1 is to use the finite difference approximation for the second order derivatives at a nearby interior grid point, whenever this is possible. Recipe 2 is to flip domain signatures and introduce a ghost state so that a second-order method can be applied. This ghost state is a smooth extension of the solution at the exceptional point from the other side of the interface. The original state is recovered by a post-processing using nearby states and jump conditions. The choice of recipes is determined by a classification scheme of the exceptional points. The method renders the solution and its gradient uniformly second-order accurate in the entire computed domain. Numerical examples are provided to illustrate the second order accuracy of the presently proposed method in approximating the gradients of the original states for some complex interfaces which we had tested previous in two and three dimensions, and a real molecule ( (1D63)) which is double-helix shape and composed of hundreds of atoms.
Zhang, Zhendong
2016-07-26
We present a surface-wave inversion method that inverts for the S-wave velocity from the Rayleigh wave dispersion curve using a difference approximation to the gradient of the misfit function. We call this wave equation inversion of skeletonized surface waves because the skeletonized dispersion curve for the fundamental-mode Rayleigh wave is inverted using finite-difference solutions to the multi-dimensional elastic wave equation. The best match between the predicted and observed dispersion curves provides the optimal S-wave velocity model. Our method can invert for lateral velocity variations and also can mitigate the local minimum problem in full waveform inversion with a reasonable computation cost for simple models. Results with synthetic and field data illustrate the benefits and limitations of this method. © 2016 Elsevier B.V.
Gradient-based adaptation of general gaussian kernels.
Glasmachers, Tobias; Igel, Christian
2005-10-01
Gradient-based optimizing of gaussian kernel functions is considered. The gradient for the adaptation of scaling and rotation of the input space is computed to achieve invariance against linear transformations. This is done by using the exponential map as a parameterization of the kernel parameter manifold. By restricting the optimization to a constant trace subspace, the kernel size can be controlled. This is, for example, useful to prevent overfitting when minimizing radius-margin generalization performance measures. The concepts are demonstrated by training hard margin support vector machines on toy data.
Generalized synthetic kernel approximation for elastic moderation of fast neutrons
Yamamoto, Koji; Sekiya, Tamotsu; Yamamura, Yasunori.
1975-01-01
A method of synthetic kernel approximation is examined in some detail with a view to simplifying the treatment of the elastic moderation of fast neutrons. A sequence of unified kernel (fsub(N)) is introduced, which is then divided into two subsequences (Wsub(n)) and (Gsub(n)) according to whether N is odd (Wsub(n)=fsub(2n-1), n=1,2, ...) or even (Gsub(n)=fsub(2n), n=0,1, ...). The W 1 and G 1 kernels correspond to the usual Wigner and GG kernels, respectively, and the Wsub(n) and Gsub(n) kernels for n>=2 represent generalizations thereof. It is shown that the Wsub(n) kernel solution with a relatively small n (>=2) is superior on the whole to the Gsub(n) kernel solution for the same index n, while both converge to the exact values with increasing n. To evaluate the collision density numerically and rapidly, a simple recurrence formula is derived. In the asymptotic region (except near resonances), this recurrence formula allows calculation with a relatively coarse mesh width whenever hsub(a)<=0.05 at least. For calculations in the transient lethargy region, a mesh width of order epsilon/10 is small enough to evaluate the approximate collision density psisub(N) with an accuracy comparable to that obtained analytically. It is shown that, with the present method, an order of approximation of about n=7 should yield a practically correct solution diviating not more than 1% in collision density. (auth.)
Markov Jump Processes Approximating a Non-Symmetric Generalized Diffusion
Limić, Nedžad
2011-01-01
Consider a non-symmetric generalized diffusion X(⋅) in ℝ d determined by the differential operator A(x) = -Σ ij ∂ i a ij (x)∂ j + Σ i b i (x)∂ i . In this paper the diffusion process is approximated by Markov jump processes X n (⋅), in homogeneous and isotropic grids G n ⊂ℝ d , which converge in distribution in the Skorokhod space D([0,∞),ℝ d ) to the diffusion X(⋅). The generators of X n (⋅) are constructed explicitly. Due to the homogeneity and isotropy of grids, the proposed method for d≥3 can be applied to processes for which the diffusion tensor {a ij (x)} 11 dd fulfills an additional condition. The proposed construction offers a simple method for simulation of sample paths of non-symmetric generalized diffusion. Simulations are carried out in terms of jump processes X n (⋅). For piece-wise constant functions a ij on ℝ d and piece-wise continuous functions a ij on ℝ 2 the construction and principal algorithm are described enabling an easy implementation into a computer code.
Kaporin, I. E.
2012-02-01
In order to precondition a sparse symmetric positive definite matrix, its approximate inverse is examined, which is represented as the product of two sparse mutually adjoint triangular matrices. In this way, the solution of the corresponding system of linear algebraic equations (SLAE) by applying the preconditioned conjugate gradient method (CGM) is reduced to performing only elementary vector operations and calculating sparse matrix-vector products. A method for constructing the above preconditioner is described and analyzed. The triangular factor has a fixed sparsity pattern and is optimal in the sense that the preconditioned matrix has a minimum K-condition number. The use of polynomial preconditioning based on Chebyshev polynomials makes it possible to considerably reduce the amount of scalar product operations (at the cost of an insignificant increase in the total number of arithmetic operations). The possibility of an efficient massively parallel implementation of the resulting method for solving SLAEs is discussed. For a sequential version of this method, the results obtained by solving 56 test problems from the Florida sparse matrix collection (which are large-scale and ill-conditioned) are presented. These results show that the method is highly reliable and has low computational costs.
Gradients of fear: How perception influences fear generalization.
Struyf, Dieter; Zaman, Jonas; Hermans, Dirk; Vervliet, Bram
2017-06-01
The current experiment investigated whether overgeneralization of fear could be due to an inability to perceptually discriminate the initial fear-evoking stimulus from similar stimuli, as fear learning-induced perceptual impairments have been reported but their influence on generalization gradients remain to be elucidated. Three hundred and sixty-eight healthy volunteers participated in a differential fear conditioning paradigm with circles of different sizes as conditioned stimuli (CS), of which one was paired to an aversive IAPS picture. During generalization, each subject was presented with one of 10 different sized circles including the CSs, and were asked to categorize the stimulus as either a CS or as novel after fear responses were recorded. Linear mixed models were used to investigate differences in fear generalization gradients depending on the participant's perception of the test stimulus. We found that the incorrect perception of a novel stimulus as the initial fear-evoking stimulus strongly boosted fear responses. The current findings demonstrate that a significant number of novel stimuli used to assess generalization are incorrectly identified as the initial fear-evoking stimulus, providing a perceptual account for the observed overgeneralization in panic and anxiety disorders. Accordingly, enhancing perceptual processing may be a promising treatment for targeting excessive fear generalization. Copyright © 2017 The Authors. Published by Elsevier Ltd.. All rights reserved.
Kutzler, F.W.; Painter, G.S.
1992-01-01
A fully self-consistent series of nonlocal (gradient) density-functional calculations has been carried out using the augmented-Gaussian-orbital method to determine the magnitude of gradient corrections to the potential-energy curves of the first-row diatomics, Li 2 through F 2 . Both the Langreth-Mehl-Hu and the Perdew-Wang gradient-density functionals were used in calculations of the binding energy, bond length, and vibrational frequency for each dimer. Comparison with results obtained in the local-spin-density approximation (LSDA) using the Vosko-Wilk-Nusair functional, and with experiment, reveals that bond lengths and vibrational frequencies are rather insensitive to details of the gradient functionals, including self-consistency effects, but the gradient corrections reduce the overbinding commonly observed in the LSDA calculations of first-row diatomics (with the exception of Li 2 , the gradient-functional binding-energy error is only 50--12 % of the LSDA error). The improved binding energies result from a large differential energy lowering, which occurs in open-shell atoms relative to the diatomics. The stabilization of the atom arises from the use of nonspherical charge and spin densities in the gradient-functional calculations. This stabilization is negligibly small in LSDA calculations performed with nonspherical densities
Analytical approximations of diving-wave imaging in constant-gradient medium
Stovas, Alexey; Alkhalifah, Tariq Ali
2014-01-01
behavior and traveltime in a constant-gradient medium to develop insights into the traveltime moveout of diving waves and the image (model) point dispersal (residual) when the wrong velocity is used. The explicit formulations that describe these phenomena
Current Density Functional Theory Using Meta-Generalized Gradient Exchange-Correlation Functionals.
Furness, James W; Verbeke, Joachim; Tellgren, Erik I; Stopkowicz, Stella; Ekström, Ulf; Helgaker, Trygve; Teale, Andrew M
2015-09-08
We present the self-consistent implementation of current-dependent (hybrid) meta-generalized gradient approximation (mGGA) density functionals using London atomic orbitals. A previously proposed generalized kinetic energy density is utilized to implement mGGAs in the framework of Kohn-Sham current density functional theory (KS-CDFT). A unique feature of the nonperturbative implementation of these functionals is the ability to seamlessly explore a wide range of magnetic fields up to 1 au (∼235 kT) in strength. CDFT functionals based on the TPSS and B98 forms are investigated, and their performance is assessed by comparison with accurate coupled-cluster singles, doubles, and perturbative triples (CCSD(T)) data. In the weak field regime, magnetic properties such as magnetizabilities and nuclear magnetic resonance shielding constants show modest but systematic improvements over generalized gradient approximations (GGA). However, in the strong field regime, the mGGA-based forms lead to a significantly improved description of the recently proposed perpendicular paramagnetic bonding mechanism, comparing well with CCSD(T) data. In contrast to functionals based on the vorticity, these forms are found to be numerically stable, and their accuracy at high field suggests that the extension of mGGAs to CDFT via the generalized kinetic energy density should provide a useful starting point for further development of CDFT approximations.
Hongyang Lu
2016-06-01
Full Text Available Because of the contradiction between the spatial and temporal resolution of remote sensing images (RSI and quality loss in the process of acquisition, it is of great significance to reconstruct RSI in remote sensing applications. Recent studies have demonstrated that reference image-based reconstruction methods have great potential for higher reconstruction performance, while lacking accuracy and quality of reconstruction. For this application, a new compressed sensing objective function incorporating a reference image as prior information is developed. We resort to the reference prior information inherent in interior and exterior data simultaneously to build a new generalized nonconvex low-rank approximation framework for RSI reconstruction. Specifically, the innovation of this paper consists of the following three respects: (1 we propose a nonconvex low-rank approximation for reconstructing RSI; (2 we inject reference prior information to overcome over smoothed edges and texture detail losses; (3 on this basis, we combine conjugate gradient algorithms and a single-value threshold (SVT simultaneously to solve the proposed algorithm. The performance of the algorithm is evaluated both qualitatively and quantitatively. Experimental results demonstrate that the proposed algorithm improves several dBs in terms of peak signal to noise ratio (PSNR and preserves image details significantly compared to most of the current approaches without reference images as priors. In addition, the generalized nonconvex low-rank approximation of our approach is naturally robust to noise, and therefore, the proposed algorithm can handle low resolution with noisy inputs in a more unified framework.
A Gradient Weighted Moving Finite-Element Method with Polynomial Approximation of Any Degree
Ali R. Soheili
2009-01-01
Full Text Available A gradient weighted moving finite element method (GWMFE based on piecewise polynomial of any degree is developed to solve time-dependent problems in two space dimensions. Numerical experiments are employed to test the accuracy and effciency of the proposed method with nonlinear Burger equation.
Generalized shift-invariant systems and approximately dual frames
Benavente, Ana; Christensen, Ole; Zakowicz, Maria I.
2017-01-01
Dual pairs of frames yield a procedure for obtaining perfect reconstruction of elements in the underlying Hilbert space in terms of superpositions of the frame elements. However, practical constraints often force us to apply sequences that do not exactly form dual frames. In this article, we...... consider the important case of generalized shift-invariant systems and provide various ways of estimating the deviation from perfect reconstruction that occur when the systems do not form dual frames. The deviation from being dual frames will be measured either in terms of a perturbation condition...
Analytical approximations of diving-wave imaging in constant-gradient medium
Stovas, Alexey
2014-06-24
Full-waveform inversion (FWI) in practical applications is currently used to invert the direct arrivals (diving waves, no reflections) using relatively long offsets. This is driven mainly by the high nonlinearity introduced to the inversion problem when reflection data are included, which in some cases require extremely low frequency for convergence. However, analytical insights into diving waves have lagged behind this sudden interest. We use analytical formulas that describe the diving wave’s behavior and traveltime in a constant-gradient medium to develop insights into the traveltime moveout of diving waves and the image (model) point dispersal (residual) when the wrong velocity is used. The explicit formulations that describe these phenomena reveal the high dependence of diving-wave imaging on the gradient and the initial velocity. The analytical image point residual equation can be further used to scan for the best-fit linear velocity model, which is now becoming a common sight as an initial velocity model for FWI. We determined the accuracy and versatility of these analytical formulas through numerical tests.
Sergeev, A.; Alharbi, F. H.; Jovanovic, R.; Kais, S.
2016-04-01
The gradient expansion of the kinetic energy density functional, when applied to atoms or finite systems, usually grossly overestimates the energy in the fourth order and generally diverges in the sixth order. We avoid the divergence of the integral by replacing the asymptotic series including the sixth order term in the integrand by a rational function. Padé approximants show moderate improvements in accuracy in comparison with partial sums of the series. The results are discussed for atoms and Hooke’s law model for two-electron atoms.
Chen, Weitian; Sica, Christopher T; Meyer, Craig H
2008-11-01
Off-resonance effects can cause image blurring in spiral scanning and various forms of image degradation in other MRI methods. Off-resonance effects can be caused by both B0 inhomogeneity and concomitant gradient fields. Previously developed off-resonance correction methods focus on the correction of a single source of off-resonance. This work introduces a computationally efficient method of correcting for B0 inhomogeneity and concomitant gradients simultaneously. The method is a fast alternative to conjugate phase reconstruction, with the off-resonance phase term approximated by Chebyshev polynomials. The proposed algorithm is well suited for semiautomatic off-resonance correction, which works well even with an inaccurate or low-resolution field map. The proposed algorithm is demonstrated using phantom and in vivo data sets acquired by spiral scanning. Semiautomatic off-resonance correction alone is shown to provide a moderate amount of correction for concomitant gradient field effects, in addition to B0 imhomogeneity effects. However, better correction is provided by the proposed combined method. The best results were produced using the semiautomatic version of the proposed combined method.
Variational approach to coarse-graining of generalized gradient flows
Duong, M.H.; Lamacz, A.; Peletier, M.A.; Sharma, U.
2017-01-01
In this paper we present a variational technique that handles coarse-graining and passing to a limit in a unified manner. The technique is based on a duality structure, which is present in many gradient flows and other variational evolutions, and which often arises from a large-deviations principle.
Bozkaya, Uğur
2018-03-15
Efficient implementations of analytic gradients for the orbital-optimized MP3 and MP2.5 and their standard versions with the density-fitting approximation, which are denoted as DF-MP3, DF-MP2.5, DF-OMP3, and DF-OMP2.5, are presented. The DF-MP3, DF-MP2.5, DF-OMP3, and DF-OMP2.5 methods are applied to a set of alkanes and noncovalent interaction complexes to compare the computational cost with the conventional MP3, MP2.5, OMP3, and OMP2.5. Our results demonstrate that density-fitted perturbation theory (DF-MP) methods considered substantially reduce the computational cost compared to conventional MP methods. The efficiency of our DF-MP methods arise from the reduced input/output (I/O) time and the acceleration of gradient related terms, such as computations of particle density and generalized Fock matrices (PDMs and GFM), solution of the Z-vector equation, back-transformations of PDMs and GFM, and evaluation of analytic gradients in the atomic orbital basis. Further, application results show that errors introduced by the DF approach are negligible. Mean absolute errors for bond lengths of a molecular set, with the cc-pCVQZ basis set, is 0.0001-0.0002 Å. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.
A general approach for cache-oblivious range reporting and approximate range counting
Afshani, Peyman; Hamilton, Chris; Zeh, Norbert
2010-01-01
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for constructing cache-oblivious data structures that provide relative (1+ε)-approximations for a general class of range c...
Chen, G.S.
1997-01-01
We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used. TFQMR (transpose free quasi-minimal residual algorithm), CGS (conjuage gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These sub-routines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. (author)
Approximate solution of generalized Ginzburg-Landau-Higgs system via homotopy perturbation method
Lu Juhong [School of Physics and Electromechanical Engineering, Shaoguan Univ., Guangdong (China); Dept. of Information Engineering, Coll. of Lishui Professional Tech., Zhejiang (China); Zheng Chunlong [School of Physics and Electromechanical Engineering, Shaoguan Univ., Guangdong (China); Shanghai Inst. of Applied Mathematics and Mechanics, Shanghai Univ., SH (China)
2010-04-15
Using the homotopy perturbation method, a class of nonlinear generalized Ginzburg-Landau-Higgs systems (GGLH) is considered. Firstly, by introducing a homotopic transformation, the nonlinear problem is changed into a system of linear equations. Secondly, by selecting a suitable initial approximation, the approximate solution with arbitrary degree accuracy to the generalized Ginzburg-Landau-Higgs system is derived. Finally, another type of homotopic transformation to the generalized Ginzburg-Landau-Higgs system reported in previous literature is briefly discussed. (orig.)
Generalized frameworks for first-order evolution inclusions based on Yosida approximations
Ram U. Verma
2011-04-01
Full Text Available First, general frameworks for the first-order evolution inclusions are developed based on the A-maximal relaxed monotonicity, and then using the Yosida approximation the solvability of a general class of first-order nonlinear evolution inclusions is investigated. The role the A-maximal relaxed monotonicity is significant in the sense that it not only empowers the first-order nonlinear evolution inclusions but also generalizes the existing Yosida approximations and its characterizations in the current literature.
Discrete-Time Stable Generalized Self-Learning Optimal Control With Approximation Errors.
Wei, Qinglai; Li, Benkai; Song, Ruizhuo
2018-04-01
In this paper, a generalized policy iteration (GPI) algorithm with approximation errors is developed for solving infinite horizon optimal control problems for nonlinear systems. The developed stable GPI algorithm provides a general structure of discrete-time iterative adaptive dynamic programming algorithms, by which most of the discrete-time reinforcement learning algorithms can be described using the GPI structure. It is for the first time that approximation errors are explicitly considered in the GPI algorithm. The properties of the stable GPI algorithm with approximation errors are analyzed. The admissibility of the approximate iterative control law can be guaranteed if the approximation errors satisfy the admissibility criteria. The convergence of the developed algorithm is established, which shows that the iterative value function is convergent to a finite neighborhood of the optimal performance index function, if the approximate errors satisfy the convergence criterion. Finally, numerical examples and comparisons are presented.
Analytical approximate solutions for a general class of nonlinear delay differential equations.
Căruntu, Bogdan; Bota, Constantin
2014-01-01
We use the polynomial least squares method (PLSM), which allows us to compute analytical approximate polynomial solutions for a very general class of strongly nonlinear delay differential equations. The method is tested by computing approximate solutions for several applications including the pantograph equations and a nonlinear time-delay model from biology. The accuracy of the method is illustrated by a comparison with approximate solutions previously computed using other methods.
Virus purification by CsCl density gradient using general centrifugation.
Nasukawa, Tadahiro; Uchiyama, Jumpei; Taharaguchi, Satoshi; Ota, Sumire; Ujihara, Takako; Matsuzaki, Shigenobu; Murakami, Hironobu; Mizukami, Keijirou; Sakaguchi, Masahiro
2017-11-01
Virus purification by cesium chloride (CsCl) density gradient, which generally requires an expensive ultracentrifuge, is an essential technique in virology. Here, we optimized virus purification by CsCl density gradient using general centrifugation (40,000 × g, 2 h, 4 °C), which showed almost the same purification ability as conventional CsCl density gradient ultracentrifugation (100,000 × g, 1 h, 4 °C) using phages S13' and φEF24C. Moreover, adenovirus strain JM1/1 was also successfully purified by this method. We suggest that general centrifugation can become a less costly alternative to ultracentrifugation for virus purification by CsCl densiy gradient and will thus encourage research in virology.
Characterization of Generalized Young Measures Generated by Symmetric Gradients
De Philippis, Guido; Rindler, Filip
2017-06-01
This work establishes a characterization theorem for (generalized) Young measures generated by symmetric derivatives of functions of bounded deformation (BD) in the spirit of the classical Kinderlehrer-Pedregal theorem. Our result places such Young measures in duality with symmetric-quasiconvex functions with linear growth. The "local" proof strategy combines blow-up arguments with the singular structure theorem in BD (the analogue of Alberti's rank-one theorem in BV), which was recently proved by the authors. As an application of our characterization theorem we show how an atomic part in a BD-Young measure can be split off in generating sequences.
Kushwaha, Jitendra Kumar
2013-01-01
Approximation theory is a very important field which has various applications in pure and applied mathematics. The present study deals with a new theorem on the approximation of functions of Lipschitz class by using Euler's mean of conjugate series of Fourier series. In this paper, the degree of approximation by using Euler's means of conjugate of functions belonging to Lip (ξ(t), p) class has been obtained. Lipα and Lip (α, p) classes are the particular cases of Lip (ξ(t), p) class. The main result of this paper generalizes some well-known results in this direction. PMID:24379744
Generalized Yosida Approximations Based on Relatively A-Maximal m-Relaxed Monotonicity Frameworks
Heng-you Lan
2013-01-01
Full Text Available We introduce and study a new notion of relatively A-maximal m-relaxed monotonicity framework and discuss some properties of a new class of generalized relatively resolvent operator associated with the relatively A-maximal m-relaxed monotone operator and the new generalized Yosida approximations based on relatively A-maximal m-relaxed monotonicity framework. Furthermore, we give some remarks to show that the theory of the new generalized relatively resolvent operator and Yosida approximations associated with relatively A-maximal m-relaxed monotone operators generalizes most of the existing notions on (relatively maximal monotone mappings in Hilbert as well as Banach space and can be applied to study variational inclusion problems and first-order evolution equations as well as evolution inclusions.
Chen, G.S.; Yang, D.Y.
1998-01-01
We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used: TFQMR (transpose free quasi-minimal residual algorithm) CGS (conjugate gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These subroutines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. The reasons to choose the generalized conjugate gradient methods are that the methods have better residual (equivalent to error) control procedures in the computation and have better convergent rate. The pointwise incomplete LU factorization ILU, modified pointwise incomplete LU factorization MILU, block incomplete factorization BILU and modified blockwise incomplete LU factorization MBILU are the preconditioning techniques used in the several testing problems. In Bi-CGSTAB, CGS, TFQMR and QMRCGSTAB method, we find that either CGS or Bi-CGSTAB method combined with preconditioner MBILU is the most efficient algorithm in these methods in the several testing problems. The numerical solution of flux by preconditioned CGS and Bi-CGSTAB methods has the same result as those from Cray computer, obtained by either the point successive relaxation method or the line successive relaxation method combined with Gaussian elimination
Variational P1 approximations of general-geometry multigroup transport problems
Rulko, R.P.; Tomasevic, D.; Larsen, E.W.
1995-01-01
A variational approximation is developed for general-geometry multigroup transport problems with arbitrary anisotropic scattering. The variational principle is based on a functional that approximates a reaction rate in a subdomain of the system. In principle, approximations that result from this functional ''optimally'' determine such reaction rates. The functional contains an arbitrary parameter α and requires the approximate solutions of a forward and an adjoint transport problem. If the basis functions for the forward and adjoint solutions are chosen to be linear functions of the angular variable Ω, the functional yields the familiar multigroup P 1 equations for all values of α. However, the boundary conditions that result from the functional depend on α. In particular, for problems with vacuum boundaries, one obtains the conventional mixed boundary condition, but with an extrapolation distance that depends continuously on α. The choice α = 0 yields a generalization of boundary conditions derived earlier by Federighi and Pomraning for a more limited class of problems. The choice α = 1 yields a generalization of boundary conditions derived previously by Davis for monoenergetic problems. Other boundary conditions are obtained by choosing different values of α. The authors discuss this indeterminancy of α in conjunction with numerical experiments
Critique of the Brownian approximation to the generalized Langevin equation in lattice dynamics
Diestler, D.J.; Riley, M.E.
1985-01-01
We consider the classical motion of a harmonic lattice in which only those atoms in a certain subset of the lattice (primary zone) may interact with an external force. The formally exact generalized Langevin equation (GLE) for the primary zone is an appropriate description of the dynamics. We examine a previously proposed Brownian, or frictional damping, approximation that reduces the GLE to a set of coupled ordinary Langevin equations for the primary atoms. It is shown that the solution of these equations can contain undamped motion if there is more than one atom in the primary zone. Such motion is explicitly demonstrated for a model that has been used to describe energy transfer in atom--surface collisions. The inability of the standard Brownian approximation to yield an acceptable, physically meaningful result for primary zones comprising more than one atom suggests that the Brownian approximation may introduce other spurious dynamical effects. Further work on damping of correlated motion in lattices is needed
Ma, Yuan-Zhuo; Li, Hong-Shuang; Yao, Wei-Xing
2018-05-01
The evaluation of the probabilistic constraints in reliability-based design optimization (RBDO) problems has always been significant and challenging work, which strongly affects the performance of RBDO methods. This article deals with RBDO problems using a recently developed generalized subset simulation (GSS) method and a posterior approximation approach. The posterior approximation approach is used to transform all the probabilistic constraints into ordinary constraints as in deterministic optimization. The assessment of multiple failure probabilities required by the posterior approximation approach is achieved by GSS in a single run at all supporting points, which are selected by a proper experimental design scheme combining Sobol' sequences and Bucher's design. Sequentially, the transformed deterministic design optimization problem can be solved by optimization algorithms, for example, the sequential quadratic programming method. Three optimization problems are used to demonstrate the efficiency and accuracy of the proposed method.
Newtonian and post-Newtonian approximations are asymptotic to general relativity
Futamase, T.; Schutz, B.F.
1983-01-01
A precise definition of the Newtonian and post-Newtonian hierarchy of approximations to general relativity is given by studying a C/sup infinity/ sequence of solutions to Einstein's equations that is defined by initial data having the Newtonian scaling property: v/sup i/approx.epsilon, rhoapprox.epsilon 2 , papprox.epsilon 4 , where epsilon is the parameter along the sequence. We map one solution in the sequence to another by identifying them at constant spatial position x/sup i/ and Newtonian dynamical time tau = epsilont. This mapping defines a congruence parametrized by epsilon, and the various post-Newtonian approximations emerge as derivatives of the relativistic solutions along this congruence. We thereby show for the first time that the approximations are genuine asymptotic approximations to general relativity. The proof is given in detail up to first post-Newtonian order, but is easily extended. The results will be applied in the following paper to radiation reaction in binary star systems, to give a proof of the validity of the ''quadrupole formula'' free from any divergences
Hartree-Fock-Bogolubov approximation in the models with general four-fermion interaction
Bogolubov, N.N. Jr.; Soldatov, A.V.
1995-12-01
The foundation of this work was established by the lectures of Prof. N.N. Bogolubov (senior) written in the beginning of 1990. We should like to develop some of his ideas connected with Hartree-Fock-Bogolubov method and to show how this approximation works in connection with general equations for Green's functions with source terms for sufficiently general model Hamiltonian of four-fermion interaction type and how, for example, to get some results of superconductivity theory by means of this method. (author). 5 refs
Lee, M.W.; Bigeleisen, J.
1978-01-01
The MINIMAX finite polynomial approximation to an arbitrary function has been generalized to include a weighting function (WINIMAX). It is suggested that an exponential is a reasonable weighting function for the logarithm of the reduced partition function of a harmonic oscillator. Comparison of the error function for finite orthogonal polynomial (FOP), MINIMAX, and WINIMAX expansions of the logarithm of the reduced vibrational partition function show WINIMAX to be the best of the three approximations. A condensed table of WINIMAX coefficients is presented. The FOP, MINIMAX, and WINIMAX approximations are compared with exact calculations of the logarithm of the reduced partition function ratios for isotopic substitution in H 2 O, CH 4 , CH 2 O, C 2 H 4 , and C 2 H 6 at 300 0 K. Both deuterium and heavy atom isotope substitution are studied. Except for a third order expansion involving deuterium substitution, the WINIMAX method is superior to FOP and MINIMAX. At the level of a second order expansion WINIMAX approximations to ln(s/s')f are good to 2.5% and 6.5% for deuterium and heavy atom substitution, respectively
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.
New generalized conjugate gradient methods for the non-quadratic model in unconstrained optimization
Al-Bayati, A.
2001-01-01
This paper present two new conjugate gradient algorithms which use the non-quadratic model in unconstrained optimization. The first is a new generalized self-scaling variable metric algorithm based on the sloboda generalized conjugate gradient method which is invariant to a nonlinear scaling of a stricity convex quadratic function; the second is an interleaving between the generalized sloboda method and the first algorithm; all these algorithm use exact line searches. Numerical comparisons over twenty test functions show that the interleaving algorithm is best overall and requires only about half the function evaluations of the Sloboda method: interleaving algorithms are likely to be preferred when the dimensionality of the problem is increased. (author). 29 refs., 1 tab
Barrett, John W.; Garcke, Harald; Nürnberg, Robert
2017-01-01
A finite element method for the evolution of a two-phase membrane in a sharp interface formulation is introduced. The evolution equations are given as an $L^2$--gradient flow of an energy involving an elastic bending energy and a line energy. In the two phases Helfrich-type evolution equations are prescribed, and on the interface, an evolving curve on an evolving surface, highly nonlinear boundary conditions have to hold. Here we consider both $C^0$-- and $C^1$--matching conditions for the su...
Xia, Ya-Rong; Zhang, Shun-Li; Xin, Xiang-Peng
2018-03-01
In this paper, we propose the concept of the perturbed invariant subspaces (PISs), and study the approximate generalized functional variable separation solution for the nonlinear diffusion-convection equation with weak source by the approximate generalized conditional symmetries (AGCSs) related to the PISs. Complete classification of the perturbed equations which admit the approximate generalized functional separable solutions (AGFSSs) is obtained. As a consequence, some AGFSSs to the resulting equations are explicitly constructed by way of examples.
Collective excitations in the Penson-Kolb model: A generalized random-phase-approximation study
Roy, G.K.; Bhattacharyya, B.
1997-01-01
The evolution of the superconducting ground state of the half-filled Penson-Kolb model is examined as a function of the coupling constant using a mean-field approach and the generalized random phase approximation (RPA) in two and three dimensions. On-site singlet pairs hop to compete against single-particle motion in this model, giving the coupling constant a strong momentum dependence. There is a pronounced bandwidth enhancement effect that converges smoothly to a finite value in the strong-coupling (Bose) regime. The low-lying collective excitations evaluated in generalized RPA show a linear dispersion and a gradual crossover from the weak-coupling (BCS) limit to the Bose regime; the mode velocity increases monotonically in sharp contrast to the attractive Hubbard model. Analytical results are derived in the asymptotic limits. copyright 1997 The American Physical Society
Coherent states, quantum gravity, and the Born-Oppenheimer approximation. I. General considerations
Stottmeister, Alexander; Thiemann, Thomas
2016-01-01
This article, as the first of three, aims at establishing the (time-dependent) Born-Oppenheimer approximation, in the sense of space adiabatic perturbation theory, for quantum systems constructed by techniques of the loop quantum gravity framework, especially the canonical formulation of the latter. The analysis presented here fits into a rather general framework and offers a solution to the problem of applying the usual Born-Oppenheimer ansatz for molecular (or structurally analogous) systems to more general quantum systems (e.g., spin-orbit models) by means of space adiabatic perturbation theory. The proposed solution is applied to a simple, finite dimensional model of interacting spin systems, which serves as a non-trivial, minimal model of the aforesaid problem. Furthermore, it is explained how the content of this article and its companion affect the possible extraction of quantum field theory on curved spacetime from loop quantum gravity (including matter fields).
Mustafa Bayram
2017-01-01
Full Text Available In this study, we have applied a generalized successive numerical technique to solve the elasticity problem of based on the elastic ground with variable coefficient. In the first stage, we have calculated the generalized successive approximation of being given BVP and in the second stage we have transformed it into Padé series. At the end of study a test problem has been given to clarify the method.
The contribution of general cognitive abilities and approximate number system to early mathematics.
Passolunghi, Maria Chiara; Cargnelutti, Elisa; Pastore, Massimiliano
2014-12-01
Math learning is a complex process that entails a wide range of cognitive abilities to be fulfilled. There is sufficient evidence that both general and specific cognitive skills assume a fundamental role, despite the absence of shared consensus about the relative extent of their involvement. Moreover, regarding general abilities, there is no agreement about the recruitment of the different memory components or of intelligence. In relation to specific factors, great debate subsists regarding the role of the approximate number system (ANS). Starting from these considerations, we wanted to conduct a wide assessment of memory components and ANS, by controlling for the effects associated with intelligence and also exploring possible relationships between all precursors. To achieve this purpose, a sample of 157 children was tested at both beginning and end of their Grade 1. Both general (memory and intelligence) and specific (ANS) precursors were evaluated by a wide battery of tests and put in relation to concurrent and subsequent math skills. Memory was explored in passive and active aspects involving both verbal and visuo-spatial components. Path analysis results demonstrated that memory, and especially the more active processes, and intelligence were the strongest precursors in both assessment times. ANS had a milder role which lost significance by the end of the school year. Memory and ANS seemed to influence early mathematics almost independently. Both general and specific precursors seemed to have a crucial role in early math competences, despite the lower involvement of ANS. © 2014 The British Psychological Society.
Moradian, Rostam
2006-01-01
We develop a generalized real-space effective medium super-cell approximation (EMSCA) method to treat the electronic states of interacting disordered systems. This method is general and allows randomness both in the on-site energies and in the hopping integrals. For a non-interacting disordered system, in the special case of randomness in the on-site energies, this method is equivalent to the non-local coherent potential approximation (NLCPA) derived previously. Also, for an interacting system the EMSCA method leads to the real-space derivation of the generalized dynamical cluster approximation (DCA) for a general lattice structure. We found that the original DCA and the NLCPA are two simple cases of this technique, so the EMSCA is equivalent to the generalized DCA where there is included interaction and randomness in the on-site energies and in the hopping integrals. All of the equations of this formalism are derived by using the effective medium theory in real space
Approximation in generalized Hardy classes and resolution of inverse problems for tokamaks
Fisher, Y.
2011-11-01
This thesis concerns both the theoretical and constructive resolution of inverse problems for isotropic diffusion equation in planar domains, simply and doubly connected. From partial Cauchy boundary data (potential, flux), we look for those quantities on the remaining part of the boundary, where no information is available, as well as inside the domain. The proposed approach proceeds by considering solutions to the diffusion equation as real parts of complex valued solutions to some conjugated Beltrami equation. These particular generalized analytic functions allow to introduce Hardy classes, where the inverse problem is stated as a best constrained approximation issue (bounded extrema problem), and thereby is regularized. Hence, existence and smoothness properties, together with density results of traces on the boundary, ensure well-posedness. An application is studied, to a free boundary problem for a magnetically confined plasma in the tokamak Tore Supra (CEA Cadarache France). The resolution of the approximation problem on a suitable basis of functions (toroidal harmonics) leads to a qualification criterion for the estimated plasma boundary. A descent algorithm makes it decrease, and refines the estimations. The method does not require any integration of the solution in the overall domain. It furnishes very accurate numerical results, and could be extended to other devices, like JET or ITER. (author)
Mookerjee, A.; Prasad, R.
1993-09-01
We present a method for calculating the electronic structure of disordered alloys with short range order (SRO) which guarantees positive density of states for all values of the SRO parameter. The method is based on the generalized augmented space theorem which is valid for alloys with SRO. This theorem is applied to alloys with SRO in the tight-binding linear muffin-tin orbital (TB-LMTO) framework. This is done by using the augmented space formulation of Mookerjee and cluster coherent potential approximation. As an illustration, the method is applied to a single band mode TB-LMTO Hamiltonian. We find that the SRO can induce substantial changes in the density of states. (author). 22 refs, 2 figs
On the thermal stability of a radiating gas under general differential approximation
Bestman, A.R.
1988-02-01
The thermal stability of a radiating gas in a semi-infinite space is studied under a general differential approximation. The fluid is bounded on the axis z'=0 by a horizontal infinite wall maintained at a temperature T 0 which is high enough for radiative heat transfer to be significant. At z'=∞, the fluid is at uniform temperature T ∞ such that T 0 >T ∞ . The equations of motion under small perturbation theory reduce to a set of linear homogeneous equations with a variable coefficient subject to homogeneous boundary conditions when the unperturbed temperature is adopted as the independent variable. The solution is effected via a finite difference scheme and the Rayleigh number is determined by Newton's iterative method. (author). 8 refs
Daleu, C. L.; Plant, R. S.; Woolnough, S. J.
2017-10-01
Two single-column models are fully coupled via the weak-temperature gradient approach. The coupled-SCM is used to simulate the transition from suppressed to active convection under the influence of an interactive large-scale circulation. The sensitivity of this transition to the value of mixing entrainment within the convective parameterization is explored. The results from these simulations are compared with those from equivalent simulations using coupled cloud-resolving models. Coupled-column simulations over nonuniform surface forcing are used to initialize the simulations of the transition, in which the column with suppressed convection is forced to undergo a transition to active convection by changing the local and/or remote surface forcings. The direct contributions from the changes in surface forcing are to induce a weakening of the large-scale circulation which systematically modulates the transition. In the SCM, the contributions from the large-scale circulation are dominated by the heating effects, while in the CRM the heating and moistening effects are about equally divided. A transition time is defined as the time when the rain rate in the dry column is halfway to the value at equilibrium after the transition. For the control value of entrainment, the order of the transition times is identical to that obtained in the CRM, but the transition times are markedly faster. The locally forced transition is strongly delayed by a higher entrainment. A consequence is that for a 50% higher entrainment the transition times are reordered. The remotely forced transition remains fast while the locally forced transition becomes slow, compared to the CRM.
Löve, Jesper; Hensing, Gunnel; Holmgren, Kristina; Torén, Kjell
2013-06-05
Some previous studies have proposed potential explanatory factors for the social gradient in sickness absence. Yet, this research area is still in its infancy and in order to comprise the full range of socioeconomic positions there is a need for studies conducted on random population samples. The main aim of the present study was to investigate if somatic and mental symptoms, mental wellbeing, job strain, and physical work environment could explain the association between low socioeconomic position and belonging to a sample of new cases of sick-listed employees. This study was conducted on one random working population sample (n = 2763) and one sample of newly sick-listed cases of employees (n = 3044), drawn from the same random general population in western Sweden. Explanatory factors were self-rated 'Somatic and mental symptoms', 'Mental well-being', 'job strain', and 'physical work conditions' (i.e. heavy lifting and awkward work postures). Multiple logistic regression analyses were used. Somatic and mental symptoms, mental well-being, and job strain, could not explain the association between socioeconomic position and sickness absence in both women and men. However, physical work conditions explained the total association in women and much of this association in men. In men the gradient between Non-skilled manual OR 1.76 (1.24;2.48) and Skilled manual OR 1.59 (1.10;2.20), both in relation to Higher non-manual, remained unexplained. The present study strengthens the scientific evidence that social differences in physical work conditions seem to comprise a key element of the social gradient in sickness absence, particularly in women. Future studies should try to identify further predictors for this gradient in men.
An approximate JKR solution for a general contact, including rough contacts
Ciavarella, M.
2018-05-01
In the present note, we suggest a simple closed form approximate solution to the adhesive contact problem under the so-called JKR regime. The derivation is based on generalizing the original JKR energetic derivation assuming calculation of the strain energy in adhesiveless contact, and unloading at constant contact area. The underlying assumption is that the contact area distributions are the same as under adhesiveless conditions (for an appropriately increased normal load), so that in general the stress intensity factors will not be exactly equal at all contact edges. The solution is simply that the indentation is δ =δ1 -√{ 2 wA‧ /P″ } where w is surface energy, δ1 is the adhesiveless indentation, A‧ is the first derivative of contact area and P‧‧ the second derivative of the load with respect to δ1. The solution only requires macroscopic quantities, and not very elaborate local distributions, and is exact in many configurations like axisymmetric contacts, but also sinusoidal waves contact and correctly predicts some features of an ideal asperity model used as a test case and not as a real description of a rough contact problem. The solution permits therefore an estimate of the full solution for elastic rough solids with Gaussian multiple scales of roughness, which so far was lacking, using known adhesiveless simple results. The result turns out to depend only on rms amplitude and slopes of the surface, and as in the fractal limit, slopes would grow without limit, tends to the adhesiveless result - although in this limit the JKR model is inappropriate. The solution would also go to adhesiveless result for large rms amplitude of roughness hrms, irrespective of the small scale details, and in agreement with common sense, well known experiments and previous models by the author.
Zhou, Chenyi; Guo, Hong
2017-01-01
We report a diagrammatic method to solve the general problem of calculating configurationally averaged Green's function correlators that appear in quantum transport theory for nanostructures containing disorder. The theory treats both equilibrium and nonequilibrium quantum statistics on an equal footing. Since random impurity scattering is a problem that cannot be solved exactly in a perturbative approach, we combine our diagrammatic method with the coherent potential approximation (CPA) so that a reliable closed-form solution can be obtained. Our theory not only ensures the internal consistency of the diagrams derived at different levels of the correlators but also satisfies a set of Ward-like identities that corroborate the conserving consistency of transport calculations within the formalism. The theory is applied to calculate the quantum transport properties such as average ac conductance and transmission moments of a disordered tight-binding model, and results are numerically verified to high precision by comparing to the exact solutions obtained from enumerating all possible disorder configurations. Our formalism can be employed to predict transport properties of a wide variety of physical systems where disorder scattering is important.
Quantum theory of anharmonic oscillators - a variational and systematic general approximation method
Yamazaki, K.; Kyoto Univ.
1984-01-01
The paper investigates the energy levels and wavefunctions of an anharmonic oscillator characterised by the potential 1/2ω 2 q 2 +lambdaq 4 . As a lowest-order approximation an extremely simple formula for energy levels, Esub(i)sup(0) = (i+1/2)1/4(3/αsub(i)+αsub(i)), is derived (i being the quantum number of the energy level). This formula reproduces the exact energy levels within an error of about 1%. Systematically higher orders of the present perturbation theory are developed. The present second-order perturbation theory reduces the errors of the lowest-order results by a factor of about 1/5 in general. Various ranges (large, intermediate, small) of (i, lambda) are investigated and compared with the exact values obtained by other workers. For i = 0, 1, even the fourth-order perturbation calculation can be elaborated explicitly, which reduces the error to about 0.01% for any lambda. For small lambda it gives correct numerical coefficients up to lambda 4 terms, as it should. (author)
Kuroda, Takami; Kotake, Kei [Division of Theoretical Astronomy, National Astronomical Observatory of Japan, 2-21-1, Osawa, Mitaka, Tokyo 181-8588 (Japan); Takiwaki, Tomoya [Center for Computational Astrophysics, National Astronomical Observatory of Japan, 2-21-1, Osawa, Mitaka, Tokyo 181-8588 (Japan)
2012-08-10
We present results from the first generation of multi-dimensional hydrodynamic core-collapse simulations in full general relativity (GR) that include an approximate treatment of neutrino transport. Using an M1 closure scheme with an analytic variable Eddington factor, we solve the energy-independent set of radiation energy and momentum based on the Thorne's momentum formalism. Our newly developed code is designed to evolve the Einstein field equation together with the GR radiation hydrodynamic equations. We follow the dynamics starting from the onset of gravitational core collapse of a 15 M{sub Sun} star, through bounce, up to about 100 ms postbounce in this study. By computing four models that differ according to 1D to 3D and by switching from special relativistic (SR) to GR hydrodynamics, we study how the spacial multi-dimensionality and GR would affect the dynamics in the early postbounce phase. Our 3D results support the anticipation in previous 1D results that the neutrino luminosity and average neutrino energy of any neutrino flavor in the postbounce phase increase when switching from SR to GR hydrodynamics. This is because the deeper gravitational well of GR produces more compact core structures, and thus hotter neutrino spheres at smaller radii. By analyzing the residency timescale to the neutrino-heating timescale in the gain region, we show that the criterion to initiate neutrino-driven explosions can be most easily satisfied in 3D models, irrespective of SR or GR hydrodynamics. Our results suggest that the combination of GR and 3D hydrodynamics provides the most favorable condition to drive a robust neutrino-driven explosion.
Csiba, Dominik
2017-09-09
In this paper we introduce two novel generalizations of the theory for gradient descent type methods in the proximal setting. First, we introduce the proportion function, which we further use to analyze all known (and many new) block-selection rules for block coordinate descent methods under a single framework. This framework includes randomized methods with uniform, non-uniform or even adaptive sampling strategies, as well as deterministic methods with batch, greedy or cyclic selection rules. Second, the theory of strongly-convex optimization was recently generalized to a specific class of non-convex functions satisfying the so-called Polyak-{\\\\L}ojasiewicz condition. To mirror this generalization in the weakly convex case, we introduce the Weak Polyak-{\\\\L}ojasiewicz condition, using which we give global convergence guarantees for a class of non-convex functions previously not considered in theory. Additionally, we establish (necessarily somewhat weaker) convergence guarantees for an even larger class of non-convex functions satisfying a certain smoothness assumption only. By combining the two abovementioned generalizations we recover the state-of-the-art convergence guarantees for a large class of previously known methods and setups as special cases of our general framework. Moreover, our frameworks allows for the derivation of new guarantees for many new combinations of methods and setups, as well as a large class of novel non-convex objectives. The flexibility of our approach offers a lot of potential for future research, as a new block selection procedure will have a convergence guarantee for all objectives considered in our framework, while a new objective analyzed under our approach will have a whole fleet of block selection rules with convergence guarantees readily available.
Csiba, Dominik; Richtarik, Peter
2017-01-01
In this paper we introduce two novel generalizations of the theory for gradient descent type methods in the proximal setting. First, we introduce the proportion function, which we further use to analyze all known (and many new) block-selection rules for block coordinate descent methods under a single framework. This framework includes randomized methods with uniform, non-uniform or even adaptive sampling strategies, as well as deterministic methods with batch, greedy or cyclic selection rules. Second, the theory of strongly-convex optimization was recently generalized to a specific class of non-convex functions satisfying the so-called Polyak-{\\L}ojasiewicz condition. To mirror this generalization in the weakly convex case, we introduce the Weak Polyak-{\\L}ojasiewicz condition, using which we give global convergence guarantees for a class of non-convex functions previously not considered in theory. Additionally, we establish (necessarily somewhat weaker) convergence guarantees for an even larger class of non-convex functions satisfying a certain smoothness assumption only. By combining the two abovementioned generalizations we recover the state-of-the-art convergence guarantees for a large class of previously known methods and setups as special cases of our general framework. Moreover, our frameworks allows for the derivation of new guarantees for many new combinations of methods and setups, as well as a large class of novel non-convex objectives. The flexibility of our approach offers a lot of potential for future research, as a new block selection procedure will have a convergence guarantee for all objectives considered in our framework, while a new objective analyzed under our approach will have a whole fleet of block selection rules with convergence guarantees readily available.
The Contribution of General Cognitive Abilities and Approximate Number System to Early Mathematics
Passolunghi, Maria Chiara; Cargnelutti, Elisa; Pastore, Massimiliano
2014-01-01
Background: Math learning is a complex process that entails a wide range of cognitive abilities to be fulfilled. There is sufficient evidence that both general and specific cognitive skills assume a fundamental role, despite the absence of shared consensus about the relative extent of their involvement. Moreover, regarding general abilities, there…
Exner, Pavel; Post, O.
2013-01-01
Roč. 322, č. 1 (2013), s. 207-227 ISSN 0010-3616 R&D Projects: GA ČR GAP203/11/0701; GA MŠk LC06002 Institutional support: RVO:61389005 Keywords : quantum graph * vertex coupling * tubular network * approximation Subject RIV: BE - Theoretical Physics Impact factor: 1.901, year: 2013 http://download.springer.com/static/pdf/685/art%253A10.1007%252Fs00220-013-1699-9.pdf?auth66=1379859821_26f2df9c1c7e0997b290a90ec2fdfc7e&ext=.pdf
Wiese, Steffen; Teutenberg, Thorsten; Schmidt, Torsten C
2011-09-28
In the present work it is shown that the linear elution strength (LES) model which was adapted from temperature-programming gas chromatography (GC) can also be employed to predict retention times for segmented-temperature gradients based on temperature-gradient input data in liquid chromatography (LC) with high accuracy. The LES model assumes that retention times for isothermal separations can be predicted based on two temperature gradients and is employed to calculate the retention factor of an analyte when changing the start temperature of the temperature gradient. In this study it was investigated whether this approach can also be employed in LC. It was shown that this approximation cannot be transferred to temperature-programmed LC where a temperature range from 60°C up to 180°C is investigated. Major relative errors up to 169.6% were observed for isothermal retention factor predictions. In order to predict retention times for temperature gradients with different start temperatures in LC, another relationship is required to describe the influence of temperature on retention. Therefore, retention times for isothermal separations based on isothermal input runs were predicted using a plot of the natural logarithm of the retention factor vs. the inverse temperature and a plot of the natural logarithm of the retention factor vs. temperature. It could be shown that a plot of lnk vs. T yields more reliable isothermal/isocratic retention time predictions than a plot of lnk vs. 1/T which is usually employed. Hence, in order to predict retention times for temperature-gradients with different start temperatures in LC, two temperature gradient and two isothermal measurements have been employed. In this case, retention times can be predicted with a maximal relative error of 5.5% (average relative error: 2.9%). In comparison, if the start temperature of the simulated temperature gradient is equal to the start temperature of the input data, only two temperature-gradient
Generalized conjugate-gradient methods for the Navier-Stokes equations
Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing
1991-01-01
A generalized conjugate-gradient method is used to solve the two-dimensional, compressible Navier-Stokes equations of fluid flow. The equations are discretized with an implicit, upwind finite-volume formulation. Preconditioning techniques are incorporated into the new solver to accelerate convergence of the overall iterative method. The superiority of the new solver is demonstrated by comparisons with a conventional line Gauss-Siedel Relaxation solver. Computational test results for transonic flow (trailing edge flow in a transonic turbine cascade) and hypersonic flow (M = 6.0 shock-on-shock phenoena on a cylindrical leading edge) are presented. When applied to the transonic cascade case, the new solver is 4.4 times faster in terms of number of iterations and 3.1 times faster in terms of CPU time than the Relaxation solver. For the hypersonic shock case, the new solver is 3.0 times faster in terms of number of iterations and 2.2 times faster in terms of CPU time than the Relaxation solver.
Ferrighi, Lara; Madsen, Georg Kent Hellerup; Hammer, Bjørk
2011-01-01
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...
Bonsignori, K.; Allaart, K.; Egmond, A. van
1983-01-01
A broken-pair study of Sn nuclei is reported in which the model space includes two broken pair states. It is shown that for even Sn nuclei, with a rather simple Gaussian interaction and with single-particle-energies derived from data on odd nuclei, the main features of the excitation spectra up to about 3.5 MeV may be reproduced in this way. The idea of the generalized seniority scheme, that the composition of S-pair operator and that of the D-pair operator may be independent of the total number of pairs, is confirmed by the pair structures which result from energy minimization and diagonalization for each number of pairs separately. A general procedure is described to derive IBA parameters when the valence orbits are nondegenerate. Numerical results for Sn nuclei are given. (U.K.)
Wetting of flat gradient surfaces.
Bormashenko, Edward
2018-04-01
Gradient, chemically modified, flat surfaces enable directed transport of droplets. Calculation of apparent contact angles inherent for gradient surfaces is challenging even for atomically flat ones. Wetting of gradient, flat solid surfaces is treated within the variational approach, under which the contact line is free to move along the substrate. Transversality conditions of the variational problem give rise to the generalized Young equation valid for gradient solid surfaces. The apparent (equilibrium) contact angle of a droplet, placed on a gradient surface depends on the radius of the contact line and the values of derivatives of interfacial tensions. The linear approximation of the problem is considered. It is demonstrated that the contact angle hysteresis is inevitable on gradient surfaces. Electrowetting of gradient surfaces is discussed. Copyright © 2018 Elsevier Inc. All rights reserved.
General approach for solving the density gradient theory in the interfacial tension calculations
Liang, Xiaodong; Michelsen, Michael Locht
2017-01-01
Within the framework of the density gradient theory, the interfacial tension can be calculated by finding the density profiles that minimize an integral of two terms over the system of infinite width. It is found that the two integrands exhibit a constant difference along the interface for a finite...... property evaluations compared to other methods. The performance of the algorithm with recommended parameters is analyzed for various systems, and the efficiency is further compared with the geometric-mean density gradient theory, which only needs to solve nonlinear algebraic equations. The results show...... that the algorithm is only 5-10 times less efficient than solving the geometric-mean density gradient theory....
Wang Yajun
2008-12-01
Full Text Available In order to address the complex uncertainties caused by interfacing between the fuzziness and randomness of the safety problem for embankment engineering projects, and to evaluate the safety of embankment engineering projects more scientifically and reasonably, this study presents the fuzzy logic modeling of the stochastic finite element method (SFEM based on the harmonious finite element (HFE technique using a first-order approximation theorem. Fuzzy mathematical models of safety repertories were introduced into the SFEM to analyze the stability of embankments and foundations in order to describe the fuzzy failure procedure for the random safety performance function. The fuzzy models were developed with membership functions with half depressed gamma distribution, half depressed normal distribution, and half depressed echelon distribution. The fuzzy stochastic mathematical algorithm was used to comprehensively study the local failure mechanism of the main embankment section near Jingnan in the Yangtze River in terms of numerical analysis for the probability integration of reliability on the random field affected by three fuzzy factors. The result shows that the middle region of the embankment is the principal zone of concentrated failure due to local fractures. There is also some local shear failure on the embankment crust. This study provides a referential method for solving complex multi-uncertainty problems in engineering safety analysis.
Kleinsmith, P E [Carnegie-Mellon Univ., Pittsburgh, Pa. (USA)
1976-04-01
Multiple spatial scaling is incorporated in a modified form of the Bogoliubov plasma cluster expansion; then this proposed reformulation of the plasma weak-coupling approximation is used to derive, from the BBGKY Hierarchy, a decoupled set of equations for the one-and two-particle distribution functions in the limit as the plasma parameter goes to zero. Because the reformulated cluster expansion permits retention of essential two-particle collisional information in the limiting equations, while simultaneously retaining the well-established Debye-scale relative ordering of the correlation functions, decoupling of the Hierarchy is accomplished without introduction of the divergence problems encountered in the Bogoliubov theory, as is indicated by an exact solution of the limiting equations for the equilibrium case. To establish additional links with existing plasma equilibrium theories, the two-particle equilibrium correlation function is used to calculate the interaction energy and the equation of state. The limiting equation for the equilibrium three-particle correlation function is then developed, and a formal solution is obtained.
General Relativistic Radiant Shock Waves in the Post-Quasistatic Approximation
H, Jorge A Rueda [Centro de Fisica Fundamental, Universidad de Los Andes, Merida 5101, Venezuela Escuela de Fisica, Universidad Industrial de Santander, A.A. 678, Bucaramanga (Colombia); Nunez, L A [Centro de Fisica Fundamental, Universidad de Los Andes, Merida 5101, Venezuela Centro Nacional de Calculo Cientifico, Universidad de Los Andes, CeCalCULA, Corporacion Parque Tecnologico de Merida, Merida 5101, Venezuela (Venezuela)
2007-05-15
An evolution of radiant shock wave front is considered in the framework of a recently presented method to study self-gravitating relativistic spheres, whose rationale becomes intelligible and finds full justification within the context of a suitable definition of the post-quasistatic approximation. The spherical matter configuration is divided into two regions by the shock and each side of the interface having a different equation of state and anisotropic phase. In order to simulate dissipation effects due to the transfer of photons and/or neutrinos within the matter configuration, we introduce the flux factor, the variable Eddington factor and a closure relation between them. As we expected the strong of the shock increases the speed of the fluid to relativistic ones and for some critical values is larger than light speed. In addition, we find that energy conditions are very sensible to the anisotropy, specially the strong energy condition. As a special feature of the model, we find that the contribution of the matter and radiation to the radial pressure are the same order of magnitude as in the mant as in the core, moreover, in the core radiation pressure is larger than matter pressure.
General Relativistic Radiant Shock Waves in the Post-Quasistatic Approximation
H, Jorge A Rueda; Nunez, L A
2007-01-01
An evolution of radiant shock wave front is considered in the framework of a recently presented method to study self-gravitating relativistic spheres, whose rationale becomes intelligible and finds full justification within the context of a suitable definition of the post-quasistatic approximation. The spherical matter configuration is divided into two regions by the shock and each side of the interface having a different equation of state and anisotropic phase. In order to simulate dissipation effects due to the transfer of photons and/or neutrinos within the matter configuration, we introduce the flux factor, the variable Eddington factor and a closure relation between them. As we expected the strong of the shock increases the speed of the fluid to relativistic ones and for some critical values is larger than light speed. In addition, we find that energy conditions are very sensible to the anisotropy, specially the strong energy condition. As a special feature of the model, we find that the contribution of the matter and radiation to the radial pressure are the same order of magnitude as in the mant as in the core, moreover, in the core radiation pressure is larger than matter pressure
Iterative approximation of a solution of a general variational-like inclusion in Banach spaces
Chidume, C.E.; Kazmi, K.R.; Zegeye, H.
2002-07-01
In this paper, we introduce a class of η-accretive mappings in a real Banach space, and show that the η-proximal point mapping for η-m-accretive mapping is Lipschitz continuous. Further we develop an iterative algorithm for a class of general variational-like inclusions involving η-accretive mappings in real Banach space, and discuss its convergence criteria. The class of η-accretive mappings includes several important classes of operators that have been studied by various authors. (author)
Discrete cosine and sine transforms general properties, fast algorithms and integer approximations
Britanak, Vladimir; Rao, K R; Rao, K R
2006-01-01
The Discrete Cosine Transform (DCT) is used in many applications by the scientific, engineering and research communities and in data compression in particular. Fast algorithms and applications of the DCT Type II (DCT-II) have become the heart of many established international image/video coding standards. Since then other forms of the DCT and Discrete Sine Transform (DST) have been investigated in detail. This new edition presents the complete set of DCT and DST discrete trigonometric transforms, including their definitions, general mathematical properties, and relations to the optimal Karhune
Chan, C.K.; Hoffman, D.K.; Evans, J.W.
1985-01-01
Local, i.e., multiplicative, operators satisfy well-known linear factorization relations wherein matrix elements (between states associated with a complete set of wave functions) can be obtained as a linear combination of those out of the ground state (the input data). Analytic derivation of factorization relations for general state input data results in singular integral expressions for the coefficients, which can, however, be regularized using consistency conditions between matrix elements out of a single (nonground) state. Similar results hold for suitable ''symmetry class'' averaged matrix elements where the symmetry class projection operators are ''complete.'' In several cases where the wave functions or projection operators incorporate orthogonal polynomial dependence, we show that the ground state factorization relations have a simplified structure allowing an alternative derivation of the general factorization relations via an infinite matrix inversion procedure. This form is shown to have some advantages over previous versions. In addition, this matrix inversion procedure obtains all consistency conditions (which is not always the case from regularization of singular integrals)
A temporal subtraction method for thoracic CT images based on generalized gradient vector flow
Miyake, Noriaki; Kim, H.; Maeda, Shinya; Itai, Yoshinori; Tan, J.K.; Ishikawa, Seiji; Katsuragawa, Shigehiko
2010-01-01
A temporal subtraction image, which is obtained by subtraction of a previous image from a current one, can be used for enhancing interval changes (such as formation of new lesions and changes in existing abnormalities) on medical images by removing most of the normal structures. If image registration is incorrect, not only the interval changes but also the normal structures would be appeared as some artifacts on the temporal subtraction image. In a temporal subtraction technique for 2-D X-ray image, the effectiveness is shown through a lot of clinical evaluation experiments, and practical use is advancing. Moreover, the MDCT (Multi-Detector row Computed Tomography) can easily introduced on medical field, the development of a temporal subtraction for thoracic CT Images is expected. In our study, a temporal subtraction technique for thoracic CT Images is developed. As the technique, the vector fields are described by use of GGVF (Generalized Gradient Vector Flow) from the previous and current CT images. Afterwards, VOI (Volume of Interest) are set up on the previous and current CT image pairs. The shift vectors are calculated by using nearest neighbor matching of the vector fields in these VOIs. The search kernel on previous CT image is set up from the obtained shift vector. The previous CT voxel which resemble standard the current voxel is detected by voxel value and vector of the GGVF in the kernel. And, the previous CT image is transformed to the same coordinate of standard voxel. Finally, temporal subtraction image is made by subtraction of a warping image from a current one. To verify the proposal method, the result of application to 7 cases and the effectiveness are described. (author)
Calibration of groundwater vulnerability mapping using the generalized reduced gradient method.
Elçi, Alper
2017-12-01
Groundwater vulnerability assessment studies are essential in water resources management. Overlay-and-index methods such as DRASTIC are widely used for mapping of groundwater vulnerability, however, these methods mainly suffer from a subjective selection of model parameters. The objective of this study is to introduce a calibration procedure that results in a more accurate assessment of groundwater vulnerability. The improvement of the assessment is formulated as a parameter optimization problem using an objective function that is based on the correlation between actual groundwater contamination and vulnerability index values. The non-linear optimization problem is solved with the generalized-reduced-gradient (GRG) method, which is numerical algorithm based optimization method. To demonstrate the applicability of the procedure, a vulnerability map for the Tahtali stream basin is calibrated using nitrate concentration data. The calibration procedure is easy to implement and aims the maximization of correlation between observed pollutant concentrations and groundwater vulnerability index values. The influence of each vulnerability parameter in the calculation of the vulnerability index is assessed by performing a single-parameter sensitivity analysis. Results of the sensitivity analysis show that all factors are effective on the final vulnerability index. Calibration of the vulnerability map improves the correlation between index values and measured nitrate concentrations by 19%. The regression coefficient increases from 0.280 to 0.485. It is evident that the spatial distribution and the proportions of vulnerability class areas are significantly altered with the calibration process. Although the applicability of the calibration method is demonstrated on the DRASTIC model, the applicability of the approach is not specific to a certain model and can also be easily applied to other overlay-and-index methods. Copyright © 2017 Elsevier B.V. All rights reserved.
Zhang, Yu-Yu
2016-01-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\\"{o}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...
Aspects of the motion of extended bodies in the post-Newtonian approximation to general relativity
Racine, Etienne
We give a surface integral derivation of post-1-Newtonian translational equations of motion for a system of arbitrarily structured bodies, including the coupling to all the bodies' mass and current multipole moments. The explicit form of these translational equations of motion has not been previously derived. The derivation requires only that the post-1-Newtonian vacuum field equations are satisfied in weak-field regions between the bodies; the bodies' internal gravity can be arbitrarily strong. In particular black holes are not excluded. The derivation extends previous results due to Damour, Soffel and Xu (DSX) for weakly self-gravitating bodies in which the post-1- Newtonian field equations are satisfied everywhere. We also give a surface integral derivation of the leading-order evolution equations for the spin and energy of a relativistic body interacting with other bodies in the post-Newtonian expansion. As part of the computational method, new explicit expansions of general solutions of post-2-Newtonian vacuum field equations are derived. These expansions can serve as foundation for future work in a number of directions, including for example conserved quantities at post- 2-Newtonian order, definitions of angular momentum and studies of gauge invariance of tidal heating. As an astrophysical application of the translational equations of motion, we study gravitomagnetic resonant tidal excitations of r -modes in neutron star binary coalescence. We show that the effect of the resonance on the phase of the binary can be parametrized by a single number. We compute this number explicitly and discuss the detectability of this effect from its imprint on the gravitational wave signal emitted by the binary.
New applications of a generalized Hooke’s law for second gradient materials
K. Enakoutsa
2015-05-01
Full Text Available We provide analytical solutions to the problems of a circular bending of a beam in plane strain and the torsion of a non-circular cross-section beam, the beams obeying a second-gradient elasticity law proposed by the author, following a previous suggestion of Dell’Isola et al. (2009. The motivation was to find benchmark analytical solutions that can serve to grasp the physical foundations of second gradient elasticity laws for heterogeneous materials. The analytical solution of the circular beam problem presents the additional advantage to establish some nice properties on the unknown second gradient elastic moduli introduced by Enakoutsa (2014 model and the classical elasticity constants for both incompressible and compressible heterogeneous elastic materials. A framework to find the elastic moduli of the new model is also proposed.
Gutknecht, M. H.; Rozložník, Miroslav
2002-01-01
Roč. 41, - (2002), s. 7-22 ISSN 0168-9274 R&D Projects: GA AV ČR IAA1030103; GA ČR GA101/00/1035 Institutional research plan: AV0Z1030915 Keywords : sparse linear systems * Krylov space method * orthogonal residual method * minimal residual method * conjugate gradient method * residual smoothing * CG * CGNE * CGNR * CR * FOM * GMRES * PRES Subject RIV: BA - General Mathematics Impact factor: 0.504, year: 2002
Bolotin, Yu.L.; Gonchar, V.Yu.; Chekanov, N.A.
1985-01-01
Coulomb excitation of rotational states induced in heavyion collisions is treated in the framework of the generalized semiclassical approximation. The Hamiltonian of the system under consideration involves not only Coulomb forces (monopole, quadrupole, and hexadecapole) but as well a real nuclear potential in the form of the deformed Woods-Saxon potential. Strong dependence of the excitation probability on the interference between the Coulomb and nuclear interactions is shown. Calculations are carried out for the reaction 40 Ar+ 162 Dy at E=148.6 MeV. The calculated Coulomb excitation probabilities agree satisfactory with the corresponding experimental values
Uhm, Jesik; Lee, Jinuk; Eun, Changsun; Lee, Sangyoub
2006-08-07
We generalize the Wilemski-Fixman-Weiss decoupling approximation to calculate the transient rate of absorption of point particles into multiple sinks of different sizes, shapes, and reactivities. As an application we consider the case involving two spherical sinks. We obtain a Laplace-transform expression for the transient rate that is in excellent agreement with computer simulations. The long-time steady-state rate has a relatively simple expression, which clearly shows the dependence on the diffusion constant of the particles and on the sizes and reactivities of sinks, and its numerical result is in good agreement with the known exact result that is given in terms of recursion relations.
Cho, Yumi
2018-05-01
We study nonlinear elliptic problems with nonstandard growth and ellipticity related to an N-function. We establish global Calderón-Zygmund estimates of the weak solutions in the framework of Orlicz spaces over bounded non-smooth domains. Moreover, we prove a global regularity result for asymptotically regular problems which are getting close to the regular problems considered, when the gradient variable goes to infinity.
Zhi-Gang Zhao
Full Text Available Abundance and visitation of pollinator assemblages tend to decrease with altitude, leading to an increase in pollen limitation. Thus increased competition for pollinators may generate stronger selection on attractive traits of flowers at high elevations and cause floral adaptive evolution. Few studies have related geographically variable selection from pollinators and intraspecific floral differentiation. We investigated the variation of Trollius ranunculoides flowers and its pollinators along an altitudinal gradient on the eastern Qinghai-Tibet Plateau, and measured phenotypic selection by pollinators on floral traits across populations. The results showed significant decline of visitation rate of bees along altitudinal gradients, while flies was unchanged. When fitness is estimated by the visitation rate rather than the seed number per plant, phenotypic selection on the sepal length and width shows a significant correlation between the selection strength and the altitude, with stronger selection at higher altitudes. However, significant decreases in the sepal length and width of T. ranunculoides along the altitudinal gradient did not correspond to stronger selection of pollinators. In contrast to the pollinator visitation, mean annual precipitation negatively affected the sepal length and width, and contributed more to geographical variation in measured floral traits than the visitation rate of pollinators. Therefore, the sepal size may have been influenced by conflicting selection pressures from biotic and abiotic selective agents. This study supports the hypothesis that lower pollinator availability at high altitude can intensify selection on flower attractive traits, but abiotic selection is preventing a response to selection from pollinators.
Reza Barati, Mohammad
2017-09-01
For the first time, a vibrating porous double-nanoplate system under in-plane periodic loads is modeled via the generalized nonlocal strain gradient theory (NSGT). Based on the proposed theory, one can examine both stiffness-softening and stiffness-hardening effects for a more accurate analysis of nanoplates. Nanopores or nanovoids are incorporated to the model based on a modified rule of mixture. Modeling of porous double-layered nanoplate is conducted according to a refined four-variable plate theory with fewer field variables than first-order plate theory. The governing equations and related classical and nonclassical boundary conditions are derived based on Hamilton's principle. These equations are solved for hinged nanoplates via Galerkin's method. It is shown that porosities, nonlocal parameter, strain gradient parameter, material gradation, interlayer stiffness, elastic foundation, side-to-thickness and aspect ratios have a notable impact on the vibration behavior of nanoporous materials.
New hybrid conjugate gradient methods with the generalized Wolfe line search.
Xu, Xiao; Kong, Fan-Yu
2016-01-01
The conjugate gradient method was an efficient technique for solving the unconstrained optimization problem. In this paper, we made a linear combination with parameters β k of the DY method and the HS method, and putted forward the hybrid method of DY and HS. We also proposed the hybrid of FR and PRP by the same mean. Additionally, to present the two hybrid methods, we promoted the Wolfe line search respectively to compute the step size α k of the two hybrid methods. With the new Wolfe line search, the two hybrid methods had descent property and global convergence property of the two hybrid methods that can also be proved.
Dominique Brun-Battistini
2017-10-01
Full Text Available Richard C. Tolman analyzed the relation between a temperature gradient and a gravitational field in an equilibrium situation. In 2012, Tolman’s law was generalized to a non-equilibrium situation for a simple dilute relativistic fluid. The result in that scenario, obtained by introducing the gravitational force through the molecular acceleration, couples the heat flux with the metric coefficients and the gradients of the state variables. In the present paper it is shown, by explicitly describing the single particle orbits as geodesics in Boltzmann’s equation, that a gravitational field drives a heat flux in this type of system. The calculation is devoted solely to the gravitational field contribution to this heat flux in which a Newtonian limit to the Schwarzschild metric is assumed. The corresponding transport coefficient, which is obtained within a relaxation approximation, corresponds to the dilute fluid in a weak gravitational field. The effect is negligible in the non-relativistic regime, as evidenced by the direct evaluation of the corresponding limit.
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.
Pozdnyakov, Yu.A.; Terenetskij, K.O.
1981-01-01
The approximate method for solution of the inverse scattering problem (ISP) at fixed energy for complex spherically symmetric potentials decreasing faster 1/r is considered. The method is based on using a generalized WKB approximation. For the designed potential V(r) a sufficiently ''close'' reference potential V(r) has been chosen. For both potentials S-matrix elements (ME) have been calculated and inversion procedure has been carried out. S-ME have been calculated for integral-valued and intermediate angular moment values. S-ME are presented in a graphical form for being restored reference, and restored potentials for proton scattering with Esub(p)=49.48 MeV energy on 12 C nuclei. The restoration is the better the ''closer'' the sought-for potential to the reference one. This allows to specify the potential by means of iterations: the restored potential can be used as a reference one, etc. The operation of a restored potential smoothing before the following iteration is introduced. Drawbacks and advantages of the ISP solution method under consideration are pointed out. The method application is strongly limited by the requirement that the energy should be higher than a certain ''critical'' one. The method is applicable in a wider region of particle energies (in the low-energies direction) than the ordinary WKB method. The method is more simple in realization conformably to complex potentials. The investigations carried out of the proposed ISP solution method at fixed energy for complex spherically-symmetric potentials allow to conclude that the method can be successFully applied to specify the central part of interaction of nucleons, α-particles and heavy ions of average and high energies with atomic nuclei [ru
Bardhan, Jaydeep P
2008-10-14
The importance of molecular electrostatic interactions in aqueous solution has motivated extensive research into physical models and numerical methods for their estimation. The computational costs associated with simulations that include many explicit water molecules have driven the development of implicit-solvent models, with generalized-Born (GB) models among the most popular of these. In this paper, we analyze a boundary-integral equation interpretation for the Coulomb-field approximation (CFA), which plays a central role in most GB models. This interpretation offers new insights into the nature of the CFA, which traditionally has been assessed using only a single point charge in the solute. The boundary-integral interpretation of the CFA allows the use of multiple point charges, or even continuous charge distributions, leading naturally to methods that eliminate the interpolation inaccuracies associated with the Still equation. This approach, which we call boundary-integral-based electrostatic estimation by the CFA (BIBEE/CFA), is most accurate when the molecular charge distribution generates a smooth normal displacement field at the solute-solvent boundary, and CFA-based GB methods perform similarly. Conversely, both methods are least accurate for charge distributions that give rise to rapidly varying or highly localized normal displacement fields. Supporting this analysis are comparisons of the reaction-potential matrices calculated using GB methods and boundary-element-method (BEM) simulations. An approximation similar to BIBEE/CFA exhibits complementary behavior, with superior accuracy for charge distributions that generate rapidly varying normal fields and poorer accuracy for distributions that produce smooth fields. This approximation, BIBEE by preconditioning (BIBEE/P), essentially generates initial guesses for preconditioned Krylov-subspace iterative BEMs. Thus, iterative refinement of the BIBEE/P results recovers the BEM solution; excellent agreement
Socioeconomic gradients in general and oral health of primary school children in Shiraz, Iran
Golkari, Ali; Sabokseir, Aira; Sheiham, Aubrey; Watt, Richard G.
2016-01-01
Background: Health status is largely determined by socio-economic status. The general health of individuals at higher social hierarchy is better than people in lower levels. Likewise, people with higher socio-economic status have better oral health than lower socio-economic groups. There has not been much work regarding the influence of socio-economic status on the health conditions of children in developing countries, particularly in Iran. The aim of this study was to compare the oral and ge...
Mounet, Nicolas Frank; CERN. Geneva. ATS Department
2015-01-01
This note provides general and approximate formulas for the electromagnetic fields created by a passing beam in an axisymmetric infinitely thick resistive pipe made of a single homogeneous layer. The full derivations and their resulting approximate expressions at low and intermediate frequencies are given here, as well as the conditions under which those approximations are valid. Beam-coupling impedances are also computed, and examples are shown.
Socioeconomic gradients in general and oral health of primary school children in Shiraz, Iran.
Golkari, Ali; Sabokseir, Aira; Sheiham, Aubrey; Watt, Richard G
2016-01-01
Health status is largely determined by socio-economic status. The general health of individuals at higher social hierarchy is better than people in lower levels. Likewise, people with higher socio-economic status have better oral health than lower socio-economic groups. There has not been much work regarding the influence of socio-economic status on the health conditions of children in developing countries, particularly in Iran. The aim of this study was to compare the oral and general health conditions of primary school children of three different socio-economic areas in the city of Shiraz, Iran. This cross-sectional study was conducted on 335, 8- to 11-year-old primary schoolchildren in Shiraz. The children were selected by a three-stage cluster sampling method from three socio-economically different areas. Tools and methods used by the United Kingdom's Medical Research Council were used to obtain anthropometric variables as indicators of general health. The Decay, Missing, Filled Teeth (DMFT) Index for permanent teeth, dmft Index for primary teeth, the Modified Developmental Defects of Enamel (DDE) Index, the Gingival Index (GI) and the Debris Index-Simplified (DI-S) were used for oral health assessment. Height (Poral health status of the primary schoolchildren of Shiraz. The influence of socio-economic status on health condition means children have different life chances based on their socio-economic conditions. These findings emphasize the significance of interventions for tackling socio-economic inequalities in order to improve the health status of children in lower socio-economic areas.
Optimization of Candu fuel management with gradient methods using generalized perturbation theory
Chambon, R.; Varin, E.; Rozon, D.
2005-01-01
CANDU fuel management problems are solved using time-average representation of the core. Optimization problems based on this representation have been defined in the early nineties. The mathematical programming using the generalized perturbation theory (GPT) that was developed has been implemented in the reactor code DONJON. The use of the augmented Lagrangian (AL) method is presented and evaluated in this paper. This approach is mandatory for new constraint problems. Combined with the classical Lemke method, it proves to be very efficient to reach optimal solution in a very limited number of iterations. (authors)
Xhevat Z. Krasniqi
2015-11-01
Full Text Available In this paper, using rest bounded variation sequences and head bounded variation sequences, some new results on approximation of functions (signals by almost generalized Nörlund means of their Fourier series are obtained. To our best knowledge this the first time to use such classes of sequences on approximations of the type treated in this paper. In addition, several corollaries are derived from our results as well as those obtained previously by others.
Quasistatic nonlinear viscoelasticity and gradient flows
Ball, John M.; Şengül, Yasemin
2014-01-01
We consider the equation of motion for one-dimensional nonlinear viscoelasticity of strain-rate type under the assumption that the stored-energy function is λ-convex, which allows for solid phase transformations. We formulate this problem as a gradient flow, leading to existence and uniqueness of solutions. By approximating general initial data by those in which the deformation gradient takes only finitely many values, we show that under suitable hypotheses on the stored-energy function the d...
Bozkaya, Uğur, E-mail: ugur.bozkaya@atauni.edu.tr [Department of Chemistry, Atatürk University, Erzurum 25240, Turkey and Department of Chemistry, Middle East Technical University, Ankara 06800 (Turkey)
2014-09-28
General analytic gradient expressions (with the frozen-core approximation) are presented for density-fitted post-HF methods. An efficient implementation of frozen-core analytic gradients for the second-order Møller–Plesset perturbation theory (MP2) with the density-fitting (DF) approximation (applying to both reference and correlation energies), which is denoted as DF-MP2, is reported. The DF-MP2 method is applied to a set of alkanes, conjugated dienes, and noncovalent interaction complexes to compare the computational cost of single point analytic gradients with MP2 with the resolution of the identity approach (RI-MP2) [F. Weigend and M. Häser, Theor. Chem. Acc. 97, 331 (1997); R. A. Distasio, R. P. Steele, Y. M. Rhee, Y. Shao, and M. Head-Gordon, J. Comput. Chem. 28, 839 (2007)]. In the RI-MP2 method, the DF approach is used only for the correlation energy. Our results demonstrate that the DF-MP2 method substantially accelerate the RI-MP2 method for analytic gradient computations due to the reduced input/output (I/O) time. Because in the DF-MP2 method the DF approach is used for both reference and correlation energies, the storage of 4-index electron repulsion integrals (ERIs) are avoided, 3-index ERI tensors are employed instead. Further, as in case of integrals, our gradient equation is completely avoid construction or storage of the 4-index two-particle density matrix (TPDM), instead we use 2- and 3-index TPDMs. Hence, the I/O bottleneck of a gradient computation is significantly overcome. Therefore, the cost of the generalized-Fock matrix (GFM), TPDM, solution of Z-vector equations, the back transformation of TPDM, and integral derivatives are substantially reduced when the DF approach is used for the entire energy expression. Further application results show that the DF approach introduce negligible errors for closed-shell reaction energies and equilibrium bond lengths.
Breuer, R.A.; Rudolph, E.
1982-01-01
The force between two well-separated bodies is calculated in a fully dynamic system of two extended bodies up to and including the second post-Newtonian approximation (PNA). The iteration procedure as formulated by Anderson and Decanio is used in a version whose divergences have been pushed to the third PNA. The following are shown: (i) The force law assumes the ''Newtonian form'' if a second approximation in 1/(separation of the bodies) is made; (ii) the mass terms appearing in the force law are the (Tolman) masses of the individual bodies expanded up the second PNA; the internal masses equal the (passive and active) gravitational masses of the bodies in order considered; they are all constants of the motion; (iii) the self-fields of the bodies vanish in the second PNA; hence there is no Nordvedt effect in the second PNA; (iv) the compactness of the bodies, i.e., (gravitational radius)/(body size), does not appear in the force law; only the relation between mass and the matter variables is changed in the PNA as compared with the corresponding Newtonian result. (author)
Schmidt, Wolfgang M
1980-01-01
"In 1970, at the U. of Colorado, the author delivered a course of lectures on his famous generalization, then just established, relating to Roth's theorem on rational approxi- mations to algebraic numbers. The present volume is an ex- panded and up-dated version of the original mimeographed notes on the course. As an introduction to the author's own remarkable achievements relating to the Thue-Siegel-Roth theory, the text can hardly be bettered and the tract can already be regarded as a classic in its field."(Bull.LMS) "Schmidt's work on approximations by algebraic numbers belongs to the deepest and most satisfactory parts of number theory. These notes give the best accessible way to learn the subject. ... this book is highly recommended." (Mededelingen van het Wiskundig Genootschap)
Smooth function approximation using neural networks.
Ferrari, Silvia; Stengel, Robert F
2005-01-01
An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.
Tao, Shengzhen; Weavers, Paul T; Trzasko, Joshua D; Shu, Yunhong; Huston, John; Lee, Seung-Kyun; Frigo, Louis M; Bernstein, Matt A
2017-06-01
To develop a gradient pre-emphasis scheme that prospectively counteracts the effects of the first-order concomitant fields for any arbitrary gradient waveform played on asymmetric gradient systems, and to demonstrate the effectiveness of this approach using a real-time implementation on a compact gradient system. After reviewing the first-order concomitant fields that are present on asymmetric gradients, we developed a generalized gradient pre-emphasis model assuming arbitrary gradient waveforms to counteract their effects. A numerically straightforward, easily implemented approximate solution to this pre-emphasis problem was derived that was compatible with the current hardware infrastructure of conventional MRI scanners for eddy current compensation. The proposed method was implemented on the gradient driver subsystem, and its real-time use was tested using a series of phantom and in vivo data acquired from two-dimensional Cartesian phase-difference, echo-planar imaging, and spiral acquisitions. The phantom and in vivo results demonstrated that unless accounted for, first-order concomitant fields introduce considerable phase estimation error into the measured data and result in images with spatially dependent blurring/distortion. The resulting artifacts were effectively prevented using the proposed gradient pre-emphasis. We have developed an efficient and effective gradient pre-emphasis framework to counteract the effects of first-order concomitant fields of asymmetric gradient systems. Magn Reson Med 77:2250-2262, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.
Approximate Inverse Preconditioners with Adaptive Dropping
Kopal, J.; Rozložník, Miroslav; Tůma, Miroslav
2015-01-01
Roč. 84, June (2015), s. 13-20 ISSN 0965-9978 R&D Projects: GA ČR(CZ) GAP108/11/0853; GA ČR GA13-06684S Institutional support: RVO:67985807 Keywords : approximate inverse * Gram-Schmidt orthogonalization * incomplete decomposition * preconditioned conjugate gradient method * algebraic preconditioning * pivoting Subject RIV: BA - General Mathematics Impact factor: 1.673, year: 2015
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....
Ma, Jin-Gang; Zhang, Cai-Rong; Gong, Ji-Jun; Wu, You-Zhi; Kou, Sheng-Zhong; Yang, Hua; Chen, Yu-Hong; Liu, Zi-Jiang; Chen, Hong-Shan
2015-08-24
Alkaline-earth metallic dopant can improve the performance of anatase TiO2 in photocatalysis and solar cells. Aiming to understand doping mechanisms, the dopant formation energies, electronic structures, and optical properties for Be, Mg, Ca, Sr, and Ba doped anatase TiO2 are investigated by using density functional theory calculations with the HSE06 and PBE functionals. By combining our results with those of previous studies, the HSE06 functional provides a better description of electronic structures. The calculated formation energies indicate that the substitution of a lattice Ti with an AEM atom is energetically favorable under O-rich growth conditions. The electronic structures suggest that, AEM dopants shift the valence bands (VBs) to higher energy, and the dopant-state energies for the cases of Ca, Sr, and Ba are quite higher than Fermi levels, while the Be and Mg dopants result into the spin polarized gap states near the top of VBs. The components of VBs and dopant-states support that the AEM dopants are active in inter-band transitions with lower energy excitations. As to optical properties, Ca/Sr/Ba are more effective than Be/Mg to enhance absorbance in visible region, but the Be/Mg are superior to Ca/Sr/Ba for the absorbance improvement in near-IR region.
Jin-Gang Ma
2015-08-01
Full Text Available Alkaline-earth metallic dopant can improve the performance of anatase TiO2 in photocatalysis and solar cells. Aiming to understand doping mechanisms, the dopant formation energies, electronic structures, and optical properties for Be, Mg, Ca, Sr, and Ba doped anatase TiO2 are investigated by using density functional theory calculations with the HSE06 and PBE functionals. By combining our results with those of previous studies, the HSE06 functional provides a better description of electronic structures. The calculated formation energies indicate that the substitution of a lattice Ti with an AEM atom is energetically favorable under O-rich growth conditions. The electronic structures suggest that, AEM dopants shift the valence bands (VBs to higher energy, and the dopant-state energies for the cases of Ca, Sr, and Ba are quite higher than Fermi levels, while the Be and Mg dopants result into the spin polarized gap states near the top of VBs. The components of VBs and dopant-states support that the AEM dopants are active in inter-band transitions with lower energy excitations. As to optical properties, Ca/Sr/Ba are more effective than Be/Mg to enhance absorbance in visible region, but the Be/Mg are superior to Ca/Sr/Ba for the absorbance improvement in near-IR region.
Bull, Rebecca; Marschark, Marc; Nordmann, Emily; Sapere, Patricia; Skene, Wendy A
2018-06-01
Many children with hearing loss (CHL) show a delay in mathematical achievement compared to children with normal hearing (CNH). This study examined whether there are differences in acuity of the approximate number system (ANS) between CHL and CNH, and whether ANS acuity is related to math achievement. Working memory (WM), short-term memory (STM), and inhibition were considered as mediators of any relationship between ANS acuity and math achievement. Seventy-five CHL were compared with 75 age- and gender-matched CNH. ANS acuity, mathematical reasoning, WM, and STM of CHL were significantly poorer compared to CNH. Group differences in math ability were no longer significant when ANS acuity, WM, or STM was controlled. For CNH, WM and STM fully mediated the relationship of ANS acuity to math ability; for CHL, WM and STM only partially mediated this relationship. ANS acuity, WM, and STM are significant contributors to hearing status differences in math achievement, and to individual differences within the group of CHL. Statement of contribution What is already known on this subject? Children with hearing loss often perform poorly on measures of math achievement, although there have been few studies focusing on basic numerical cognition in these children. In typically developing children, the approximate number system predicts math skills concurrently and longitudinally, although there have been some contradictory findings. Recent studies suggest that domain-general skills, such as inhibition, may account for the relationship found between the approximate number system and math achievement. What does this study adds? This is the first robust examination of the approximate number system in children with hearing loss, and the findings suggest poorer acuity of the approximate number system in these children compared to hearing children. The study addresses recent issues regarding the contradictory findings of the relationship of the approximate number system to math ability
A look inside the theory of the linear approximation
Bel, Ll.
2006-01-01
We introduce in the framework of the linear approximation of General relativity a natural distinction between General gauge transformations generated by any vector field and those Special ones for which this vector field is a gradient. This allows to introduce geometrical objects that are not invariant under General gauge transformations but they are under Special ones. We develop then a formalism that strengthens the analogy of the formalisms of the electromagnetic and the gravitational theo...
Exchange energy in the local Airy gas approximation
Vitos, Levente; Johansson, B.; Kollár, J.
2000-01-01
The Airy gas model of the edge electron gas is used to construct an exchange-energy functional that is an alternative to those obtained in the local-density and generalized-gradient approximations. Test calculations for rare-gas atoms, molecules, solids, and surfaces show that the Airy gas...
1982-02-01
r AAI1Z 608 YALE UNIV NEW HAVEN CT C OWLES FOUNDATION FOR RESEARC --ETC F/G 513 APPROXIMATE CORES 6F A GENERAL CLASS OF ECONOMIES. PART It. SET--ETC(U...theoretic models of the economy in strategic form are institutional. Markets and firms and even money are assumed to exist. Cooperative game theory can be...groups. Alternatively we can define firms and firms- in-being, specify the manner of trade in the markets , define what is meant by entry and exit and
Seung Oh Lee
2013-10-01
Full Text Available Collection and investigation of flood information are essential to understand the nature of floods, but this has proved difficult in data-poor environments, or in developing or under-developed countries due to economic and technological limitations. The development of remote sensing data, GIS, and modeling techniques have, therefore, proved to be useful tools in the analysis of the nature of floods. Accordingly, this study attempts to estimate a flood discharge using the generalized likelihood uncertainty estimation (GLUE methodology and a 1D hydraulic model, with remote sensing data and topographic data, under the assumed condition that there is no gauge station in the Missouri river, Nebraska, and Wabash River, Indiana, in the United States. The results show that the use of Landsat leads to a better discharge approximation on a large-scale reach than on a small-scale. Discharge approximation using the GLUE depended on the selection of likelihood measures. Consideration of physical conditions in study reaches could, therefore, contribute to an appropriate selection of informal likely measurements. The river discharge assessed by using Landsat image and the GLUE Methodology could be useful in supplementing flood information for flood risk management at a planning level in ungauged basins. However, it should be noted that this approach to the real-time application might be difficult due to the GLUE procedure.
Costa, Patrícia; Dórea, Antônio; Mariano-Neto, Eduardo; Barros, Francisco
2015-12-01
Species distribution and structural patterns of mangrove fringe forests along three tropical estuaries were evaluated in northeast of Brazil. Interstitial water salinity, percentage of fine sediments and organic matter content were investigated as explanatory variables. In all estuaries (Jaguaripe, Paraguaçu and Subaé estuaries), it was observed similar distribution patterns of four mangrove species and these patterns were mostly related with interstitial water salinity. Rhizophora mangle and Avicennia schaueriana tended to dominate sites under greater marine influence (lower estuary), while Avicennia germinans and Laguncularia racemosa dominated areas under greater freshwater influence (upper estuary), although the latter showed a wider distribution over these tropical estuarine gradients. Organic matter best explained canopy height and mean height. At higher salinities, there was practically no correlation between organic matter and density, but at lower salinity, organic matter was related to decreases in abundances. The described patterns can be related to interspecific differences in salt tolerance and competitive abilities and they are likely to be found at other tropical Atlantic estuaries. Future studies should investigate anthropic influences and causal processes in order to further improve the design of monitoring and restoration projects.
Ono, Shunsuke
2017-04-01
Minimizing L 0 gradient, the number of the non-zero gradients of an image, together with a quadratic data-fidelity to an input image has been recognized as a powerful edge-preserving filtering method. However, the L 0 gradient minimization has an inherent difficulty: a user-given parameter controlling the degree of flatness does not have a physical meaning since the parameter just balances the relative importance of the L 0 gradient term to the quadratic data-fidelity term. As a result, the setting of the parameter is a troublesome work in the L 0 gradient minimization. To circumvent the difficulty, we propose a new edge-preserving filtering method with a novel use of the L 0 gradient. Our method is formulated as the minimization of the quadratic data-fidelity subject to the hard constraint that the L 0 gradient is less than a user-given parameter α . This strategy is much more intuitive than the L 0 gradient minimization because the parameter α has a clear meaning: the L 0 gradient value of the output image itself, so that one can directly impose a desired degree of flatness by α . We also provide an efficient algorithm based on the so-called alternating direction method of multipliers for computing an approximate solution of the nonconvex problem, where we decompose it into two subproblems and derive closed-form solutions to them. The advantages of our method are demonstrated through extensive experiments.
CONTRIBUTIONS TO RATIONAL APPROXIMATION,
Some of the key results of linear Chebyshev approximation theory are extended to generalized rational functions. Prominent among these is Haar’s...linear theorem which yields necessary and sufficient conditions for uniqueness. Some new results in the classic field of rational function Chebyshev...Furthermore a Weierstrass type theorem is proven for rational Chebyshev approximation. A characterization theorem for rational trigonometric Chebyshev approximation in terms of sign alternation is developed. (Author)
Yan, Yiming; Su, Nan; Zhao, Chunhui; Wang, Liguo
2017-09-19
In this paper, a novel framework of the 3D reconstruction of buildings is proposed, focusing on remote sensing super-generalized stereo-pairs (SGSPs). As we all know, 3D reconstruction cannot be well performed using nonstandard stereo pairs, since reliable stereo matching could not be achieved when the image-pairs are collected at a great difference of views, and we always failed to obtain dense 3D points for regions of buildings, and cannot do further 3D shape reconstruction. We defined SGSPs as two or more optical images collected in less constrained views but covering the same buildings. It is even more difficult to reconstruct the 3D shape of a building by SGSPs using traditional frameworks. As a result, a dynamic multi-projection-contour approximating (DMPCA) framework was introduced for SGSP-based 3D reconstruction. The key idea is that we do an optimization to find a group of parameters of a simulated 3D model and use a binary feature-image that minimizes the total differences between projection-contours of the building in the SGSPs and that in the simulated 3D model. Then, the simulated 3D model, defined by the group of parameters, could approximate the actual 3D shape of the building. Certain parameterized 3D basic-unit-models of typical buildings were designed, and a simulated projection system was established to obtain a simulated projection-contour in different views. Moreover, the artificial bee colony algorithm was employed to solve the optimization. With SGSPs collected by the satellite and our unmanned aerial vehicle, the DMPCA framework was verified by a group of experiments, which demonstrated the reliability and advantages of this work.
Tomitaka, Shinichiro; Kawasaki, Yohei; Ide, Kazuki; Akutagawa, Maiko; Yamada, Hiroshi; Furukawa, Toshiaki A; Ono, Yutaka
2016-01-01
Previously, we proposed a model for ordinal scale scoring in which individual thresholds for each item constitute a distribution by each item. This lead us to hypothesize that the boundary curves of each depressive symptom score in the distribution of total depressive symptom scores follow a common mathematical model, which is expressed as the product of the frequency of the total depressive symptom scores and the probability of the cumulative distribution function of each item threshold. To verify this hypothesis, we investigated the boundary curves of the distribution of total depressive symptom scores in a general population. Data collected from 21,040 subjects who had completed the Center for Epidemiologic Studies Depression Scale (CES-D) questionnaire as part of a national Japanese survey were analyzed. The CES-D consists of 20 items (16 negative items and four positive items). The boundary curves of adjacent item scores in the distribution of total depressive symptom scores for the 16 negative items were analyzed using log-normal scales and curve fitting. The boundary curves of adjacent item scores for a given symptom approximated a common linear pattern on a log normal scale. Curve fitting showed that an exponential fit had a markedly higher coefficient of determination than either linear or quadratic fits. With negative affect items, the gap between the total score curve and boundary curve continuously increased with increasing total depressive symptom scores on a log-normal scale, whereas the boundary curves of positive affect items, which are not considered manifest variables of the latent trait, did not exhibit such increases in this gap. The results of the present study support the hypothesis that the boundary curves of each depressive symptom score in the distribution of total depressive symptom scores commonly follow the predicted mathematical model, which was verified to approximate an exponential mathematical pattern.
Shinichiro Tomitaka
2016-10-01
Full Text Available Background Previously, we proposed a model for ordinal scale scoring in which individual thresholds for each item constitute a distribution by each item. This lead us to hypothesize that the boundary curves of each depressive symptom score in the distribution of total depressive symptom scores follow a common mathematical model, which is expressed as the product of the frequency of the total depressive symptom scores and the probability of the cumulative distribution function of each item threshold. To verify this hypothesis, we investigated the boundary curves of the distribution of total depressive symptom scores in a general population. Methods Data collected from 21,040 subjects who had completed the Center for Epidemiologic Studies Depression Scale (CES-D questionnaire as part of a national Japanese survey were analyzed. The CES-D consists of 20 items (16 negative items and four positive items. The boundary curves of adjacent item scores in the distribution of total depressive symptom scores for the 16 negative items were analyzed using log-normal scales and curve fitting. Results The boundary curves of adjacent item scores for a given symptom approximated a common linear pattern on a log normal scale. Curve fitting showed that an exponential fit had a markedly higher coefficient of determination than either linear or quadratic fits. With negative affect items, the gap between the total score curve and boundary curve continuously increased with increasing total depressive symptom scores on a log-normal scale, whereas the boundary curves of positive affect items, which are not considered manifest variables of the latent trait, did not exhibit such increases in this gap. Discussion The results of the present study support the hypothesis that the boundary curves of each depressive symptom score in the distribution of total depressive symptom scores commonly follow the predicted mathematical model, which was verified to approximate an
Du, C M; Valko, K; Bevan, C; Reynolds, D; Abraham, M H
2000-11-01
Retention data for a set of 69 compounds using rapid gradient elution are obtained on a wide range of reversed-phase stationary phases and organic modifiers. The chromatographic stationary phases studied are Inertsil (IN)-ODS, pentafluorophenyl, fluoro-octyl, n-propylcyano, Polymer (PLRP-S 100), and hexylphenyl. The organic solvent modifiers are 2,2,2-trifluoroethanol (TFE); 1,1,1,3,3,3-hexafluoropropan-2-ol (HFIP); isopropanol; methanol (MeOH); acetonitrile (AcN); tetrahydrofuran; 1,4-dioxane; N,N-dimethylformamide; and mixed solvents of dimethylsulfoxide (DMSO) with AcN and DMSO with MeOH (1:1). A total of 25 chromatographic systems are analyzed using a solvation equation. In general, most of the systems give reasonable statistics. The selectivity of the reversed phase-high-performance liquid chromatographic (HPLC) systems with respect to the solute's dipolarity-polarity, hydrogen-bond acidity, and basicity are reflected in correspondingly large coefficients in the solvation equation. We wanted to find the most orthogonal HPLC systems, showing the highest possible selectivity difference in order to derive molecular descriptors using the gradient retention times of a compound. We selected eight chromatographic systems that have a large range of coefficients of interest (s, a, and b) similar to those found in water-solvent partitions used previously to derive molecular descriptors. The systems selected are IN-ODS phases with AcN, MeOH, TFE, and HFIP as mobile phase, PLRP-S 100 phase with AcN, propylcyano phase with AcN and MeOH, and fluorooctyl phase with TFE. Using the retention data obtained for a compound in the selected chromatographic systems, we can estimate the molecular descriptors with the faster and simpler gradient elution method.
Primordial vorticity and gradient expansion
Giovannini, Massimo
2012-01-01
The evolution equations of the vorticities of the electrons, ions and photons in a pre-decoupling plasma are derived, in a fully inhomogeneous geometry, by combining the general relativistic gradient expansion and the drift approximation within the Adler-Misner-Deser decomposition. The vorticity transfer between the different species is discussed in this novel framework and a set of general conservation laws, connecting the vorticities of the three-component plasma with the magnetic field intensity, is derived. After demonstrating that a source of large-scale vorticity resides in the spatial gradients of the geometry and of the electromagnetic sources, the total vorticity is estimated to lowest order in the spatial gradients and by enforcing the validity of the momentum constraint. By acknowledging the current bounds on the tensor to scalar ratio in the (minimal) tensor extension of the $\\Lambda$CDM paradigm the maximal comoving magnetic field induced by the total vorticity turns out to be, at most, of the or...
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...
Approximating distributions from moments
Pawula, R. F.
1987-11-01
A method based upon Pearson-type approximations from statistics is developed for approximating a symmetric probability density function from its moments. The extended Fokker-Planck equation for non-Markov processes is shown to be the underlying foundation for the approximations. The approximation is shown to be exact for the beta probability density function. The applicability of the general method is illustrated by numerous pithy examples from linear and nonlinear filtering of both Markov and non-Markov dichotomous noise. New approximations are given for the probability density function in two cases in which exact solutions are unavailable, those of (i) the filter-limiter-filter problem and (ii) second-order Butterworth filtering of the random telegraph signal. The approximate results are compared with previously published Monte Carlo simulations in these two cases.
Approximate symmetries of Hamiltonians
Chubb, Christopher T.; Flammia, Steven T.
2017-08-01
We explore the relationship between approximate symmetries of a gapped Hamiltonian and the structure of its ground space. We start by considering approximate symmetry operators, defined as unitary operators whose commutators with the Hamiltonian have norms that are sufficiently small. We show that when approximate symmetry operators can be restricted to the ground space while approximately preserving certain mutual commutation relations. We generalize the Stone-von Neumann theorem to matrices that approximately satisfy the canonical (Heisenberg-Weyl-type) commutation relations and use this to show that approximate symmetry operators can certify the degeneracy of the ground space even though they only approximately form a group. Importantly, the notions of "approximate" and "small" are all independent of the dimension of the ambient Hilbert space and depend only on the degeneracy in the ground space. Our analysis additionally holds for any gapped band of sufficiently small width in the excited spectrum of the Hamiltonian, and we discuss applications of these ideas to topological quantum phases of matter and topological quantum error correcting codes. Finally, in our analysis, we also provide an exponential improvement upon bounds concerning the existence of shared approximate eigenvectors of approximately commuting operators under an added normality constraint, which may be of independent interest.
Inversion gradients for acoustic VTI wavefield tomography
Li, Vladimir; Wang, Hui; Tsvankin, Ilya; Dí az, Esteban; Alkhalifah, Tariq Ali
2017-01-01
Wavefield tomography can handle complex subsurface geology better than ray-based techniques and, ultimately, provide a higher resolution. Here, we implement forward and adjoint wavefield extrapolation for VTI (transversely isotropic with a vertical symmetry axis) media using a generalized pseudospectral operator based on a separable approximation for the P-wave dispersion relation. This operator is employed to derive the gradients of the differential semblance optimization (DSO) and modified image-power objective functions. We also obtain the gradient expressions for a data-domain objective function that can more easily incorporate borehole information necessary for stable VTI velocity analysis. These gradients are similar to the ones obtained with a space-time finite-difference (FD) scheme for a system of coupled wave equations but the pseudospectral method is not hampered by the imprint of the shear-wave artifact. Numerical examples also show the potential advantages of the modified image-power objective function in estimating the anellipticity parameter η.
Inversion gradients for acoustic VTI wavefield tomography
Li, Vladimir
2017-03-21
Wavefield tomography can handle complex subsurface geology better than ray-based techniques and, ultimately, provide a higher resolution. Here, we implement forward and adjoint wavefield extrapolation for VTI (transversely isotropic with a vertical symmetry axis) media using a generalized pseudospectral operator based on a separable approximation for the P-wave dispersion relation. This operator is employed to derive the gradients of the differential semblance optimization (DSO) and modified image-power objective functions. We also obtain the gradient expressions for a data-domain objective function that can more easily incorporate borehole information necessary for stable VTI velocity analysis. These gradients are similar to the ones obtained with a space-time finite-difference (FD) scheme for a system of coupled wave equations but the pseudospectral method is not hampered by the imprint of the shear-wave artifact. Numerical examples also show the potential advantages of the modified image-power objective function in estimating the anellipticity parameter η.
An Adaptive Multilevel Factorized Sparse Approximate Inverse Preconditioning
Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav
2017-01-01
Roč. 113, November (2017), s. 19-24 ISSN 0965-9978 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverse * Gram–Schmidt orthogonalization * incomplete factorization * multilevel methods * preconditioned conjugate gradient method Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 3.000, year: 2016
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
Benzi, M.; Tůma, Miroslav
1998-01-01
Roč. 19, č. 3 (1998), s. 968-994 ISSN 1064-8275 R&D Projects: GA ČR GA201/93/0067; GA AV ČR IAA230401 Keywords : large sparse systems * interative methods * preconditioning * approximate inverse * sparse linear systems * sparse matrices * incomplete factorizations * conjugate gradient -type methods Subject RIV: BA - General Mathematics Impact factor: 1.378, year: 1998
Gradient algorithm applied to laboratory quantum control
Roslund, Jonathan; Rabitz, Herschel
2009-01-01
The exploration of a quantum control landscape, which is the physical observable as a function of the control variables, is fundamental for understanding the ability to perform observable optimization in the laboratory. For high control variable dimensions, trajectory-based methods provide a means for performing such systematic explorations by exploiting the measured gradient of the observable with respect to the control variables. This paper presents a practical, robust, easily implemented statistical method for obtaining the gradient on a general quantum control landscape in the presence of noise. In order to demonstrate the method's utility, the experimentally measured gradient is utilized as input in steepest-ascent trajectories on the landscapes of three model quantum control problems: spectrally filtered and integrated second harmonic generation as well as excitation of atomic rubidium. The gradient algorithm achieves efficiency gains of up to approximately three times that of the standard genetic algorithm and, as such, is a promising tool for meeting quantum control optimization goals as well as landscape analyses. The landscape trajectories directed by the gradient should aid in the continued investigation and understanding of controlled quantum phenomena.
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.
Self-similar factor approximants
Gluzman, S.; Yukalov, V.I.; Sornette, D.
2003-01-01
The problem of reconstructing functions from their asymptotic expansions in powers of a small variable is addressed by deriving an improved type of approximants. The derivation is based on the self-similar approximation theory, which presents the passage from one approximant to another as the motion realized by a dynamical system with the property of group self-similarity. The derived approximants, because of their form, are called self-similar factor approximants. These complement the obtained earlier self-similar exponential approximants and self-similar root approximants. The specific feature of self-similar factor approximants is that their control functions, providing convergence of the computational algorithm, are completely defined from the accuracy-through-order conditions. These approximants contain the Pade approximants as a particular case, and in some limit they can be reduced to the self-similar exponential approximants previously introduced by two of us. It is proved that the self-similar factor approximants are able to reproduce exactly a wide class of functions, which include a variety of nonalgebraic functions. For other functions, not pertaining to this exactly reproducible class, the factor approximants provide very accurate approximations, whose accuracy surpasses significantly that of the most accurate Pade approximants. This is illustrated by a number of examples showing the generality and accuracy of the factor approximants even when conventional techniques meet serious difficulties
Sanchez, Richard.
1975-04-01
For the one-dimensional geometries, the transport equation with linearly anisotropic scattering can be reduced to a single integral equation; this is a singular-kernel FREDHOLM equation of the second kind. When applying a conventional projective method that of GALERKIN, to the solution of this equation the well-known collision probability algorithm is obtained. Piecewise polynomial expansions are used to represent the flux. In the ANILINE code, the flux is supposed to be linear in plane geometry and parabolic in both cylindrical and spherical geometries. An integral relationship was found between the one-dimensional isotropic and anisotropic kernels; this allows to reduce the new matrix elements (issuing from the anisotropic kernel) to classic collision probabilities of the isotropic scattering equation. For cylindrical and spherical geometries used an approximate representation of the current was used to avoid an additional numerical integration. Reflective boundary conditions were considered; in plane geometry the reflection is supposed specular, for the other geometries the isotropic reflection hypothesis has been adopted. Further, the ANILINE code enables to deal with an incoming isotropic current. Numerous checks were performed in monokinetic theory. Critical radii and albedos were calculated for homogeneous slabs, cylinders and spheres. For heterogeneous media, the thermal utilization factor obtained by this method was compared with the theoretical result based upon a formula by BENOIST. Finally, ANILINE was incorporated into the multigroup APOLLO code, which enabled to analyse the MINERVA experimental reactor in transport theory with 99 groups. The ANILINE method is particularly suited to the treatment of strongly anisotropic media with considerable flux gradients. It is also well adapted to the calculation of reflectors, and in general, to the exact analysis of anisotropic effects in large-sized media [fr
Approximating Preemptive Stochastic Scheduling
Megow Nicole; Vredeveld Tjark
2009-01-01
We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as their analysis apply also to the recently introduced more general model of stochastic online scheduling. The performance guarantee we give matches the best result known for the corresponding determinist...
STOCHASTIC GRADIENT METHODS FOR UNCONSTRAINED OPTIMIZATION
Nataša Krejić
2014-12-01
Full Text Available This papers presents an overview of gradient based methods for minimization of noisy functions. It is assumed that the objective functions is either given with error terms of stochastic nature or given as the mathematical expectation. Such problems arise in the context of simulation based optimization. The focus of this presentation is on the gradient based Stochastic Approximation and Sample Average Approximation methods. The concept of stochastic gradient approximation of the true gradient can be successfully extended to deterministic problems. Methods of this kind are presented for the data fitting and machine learning problems.
Yang Yang
2011-01-01
Full Text Available We propose a general continuous-time risk model with a constant interest rate. In this model, claims arrive according to an arbitrary counting process, while their sizes have dominantly varying tails and fulfill an extended negative dependence structure. We obtain an asymptotic formula for the finite-time ruin probability, which extends a corresponding result of Wang (2008.
Diophantine approximation and badly approximable sets
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
. The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...
Giovannini, Massimo
2015-01-01
Cosmological singularities are often discussed by means of a gradient expansion that can also describe, during a quasi-de Sitter phase, the progressive suppression of curvature inhomogeneities. While the inflationary event horizon is being formed the two mentioned regimes coexist and a uniform expansion can be conceived and applied to the evolution of spatial gradients across the protoinflationary boundary. It is argued that conventional arguments addressing the preinflationary initial conditions are necessary but generally not sufficient to guarantee a homogeneous onset of the conventional inflationary stage.
Ozarslan, Evren; Shemesh, Noam; Basser, Peter J
2009-03-14
Based on a description introduced by Robertson, Grebenkov recently introduced a powerful formalism to represent the diffusion-attenuated NMR signal for simple pore geometries such as slabs, cylinders, and spheres analytically. In this work, we extend this multiple correlation function formalism by allowing for possible variations in the direction of the magnetic field gradient waveform. This extension is necessary, for example, to incorporate the effects of imaging gradients in diffusion-weighted NMR imaging scans and in characterizing anisotropy at different length scales via double pulsed field gradient (PFG) experiments. In cylindrical and spherical pores, respectively, two- and three-dimensional vector operators are employed whose form is deduced from Grebenkov's results via elementary operator algebra for the case of cylinders and the Wigner-Eckart theorem for the case of spheres. The theory was validated by comparison with known findings and with experimental double-PFG data obtained from water-filled microcapillaries.
Özarslan, Evren; Shemesh, Noam; Basser, Peter J.
2009-03-01
Based on a description introduced by Robertson, Grebenkov recently introduced a powerful formalism to represent the diffusion-attenuated NMR signal for simple pore geometries such as slabs, cylinders, and spheres analytically. In this work, we extend this multiple correlation function formalism by allowing for possible variations in the direction of the magnetic field gradient waveform. This extension is necessary, for example, to incorporate the effects of imaging gradients in diffusion-weighted NMR imaging scans and in characterizing anisotropy at different length scales via double pulsed field gradient (PFG) experiments. In cylindrical and spherical pores, respectively, two- and three-dimensional vector operators are employed whose form is deduced from Grebenkov's results via elementary operator algebra for the case of cylinders and the Wigner-Eckart theorem for the case of spheres. The theory was validated by comparison with known findings and with experimental double-PFG data obtained from water-filled microcapillaries.
Characterization of gradient control systems
Cortés, Jorge; van der Schaft, Arjan; Crouch, Peter E.
2005-01-01
Given a general nonlinear affine control system with outputs and a torsion-free affine connection defined on its state space, we investigate the gradient realization problem: we give necessary and sufficient conditions under which the control system can be written as a gradient control system
Characterization of Gradient Control Systems
Cortés, Jorge; Schaft, Arjan van der; Crouch, Peter E.
2005-01-01
Given a general nonlinear affine control system with outputs and a torsion-free affine connection defined on its state space, we investigate the gradient realization problem: we give necessary and sufficient conditions under which the control system can be written as a gradient control system
Chudnovsky, A.; Dolgopolsky, A.; Kachanov, M.
1987-01-01
The elastic interactions of a two-dimensional configuration consisting of a crack with an array of microcracks located near the tip are studied. The general form of the solution is based on the potential representations and approximations of tractions on the microcracks by polynomials. In the second part, the technique is applied to two simple two-dimensional configurations involving one and two microcracks. The problems of stress shielding and stress amplification (the reduction or increase of the effective stress intensity factor due to the presence of microcracks) are discussed, and the refinements introduced by higher order polynomial approximations are illustrated.
Lyakhovich Leonid
2017-01-01
Full Text Available This paper is devoted to formulation and general principles of approximation of multipoint boundary problem of static analysis of deep beam with the use of combined application of finite element method (FEM discrete-continual finite element method (DCFEM. The field of application of DCFEM comprises structures with regular physical and geometrical parameters in some dimension (“basic” dimension. DCFEM presupposes finite element approximation for non-basic dimension while in the basic dimension problem remains continual. DCFEM is based on analytical solutions of resulting multipoint boundary problems for systems of ordinary differential equations with piecewise-constant coefficients.
Chang, J.; Sandler, S.I.
1995-01-01
We have extended the Wertheim integral equation theory to mixtures of hard spheres with two attraction sites in order to model homonuclear hard-sphere chain fluids, and then solved these equations with the polymer-Percus--Yevick closure and the ideal chain approximation to obtain the average intermolecular and overall radial distribution functions. We obtain explicit expressions for the contact values of these distribution functions and a set of one-dimensional integral equations from which the distribution functions can be calculated without iteration or numerical Fourier transformation. We compare the resulting predictions for the distribution functions with Monte Carlo simulation results we report here for five selected binary mixtures. It is found that the accuracy of the prediction of the structure is the best for dimer mixtures and declines with increasing chain length and chain-length asymmetry. For the equation of state, we have extended the dimer version of the thermodynamic perturbation theory to the hard-sphere chain mixture by introducing the dimer mixture as an intermediate reference system. The Helmholtz free energy of chain fluids is then expressed in terms of the free energy of the hard-sphere mixture and the contact values of the correlation functions of monomer and dimer mixtures. We compared with the simulation results, the resulting equation of state is found to be the most accurate among existing theories with a relative average error of 1.79% for 4-mer/8-mer mixtures, which is the worst case studied in this work. copyright 1995 American Institute of Physics
Ward, G.J.; Heckbert, P.S.; Technische Hogeschool Delft
1992-04-01
A new method for improving the accuracy of a diffuse interreflection calculation is introduced in a ray tracing context. The information from a hemispherical sampling of the luminous environment is interpreted in a new way to predict the change in irradiance as a function of position and surface orientation. The additional computation involved is modest and the benefit is substantial. An improved interpolation of irradiance resulting from the gradient calculation produces smoother, more accurate renderings. This result is achieved through better utilization of ray samples rather than additional samples or alternate sampling strategies. Thus, the technique is applicable to a variety of global illumination algorithms that use hemicubes or Monte Carlo sampling techniques
An improved saddlepoint approximation.
Gillespie, Colin S; Renshaw, Eric
2007-08-01
Given a set of third- or higher-order moments, not only is the saddlepoint approximation the only realistic 'family-free' technique available for constructing an associated probability distribution, but it is 'optimal' in the sense that it is based on the highly efficient numerical method of steepest descents. However, it suffers from the problem of not always yielding full support, and whilst [S. Wang, General saddlepoint approximations in the bootstrap, Prob. Stat. Lett. 27 (1992) 61.] neat scaling approach provides a solution to this hurdle, it leads to potentially inaccurate and aberrant results. We therefore propose several new ways of surmounting such difficulties, including: extending the inversion of the cumulant generating function to second-order; selecting an appropriate probability structure for higher-order cumulants (the standard moment closure procedure takes them to be zero); and, making subtle changes to the target cumulants and then optimising via the simplex algorithm.
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...
Bigravity from gradient expansion
Yamashita, Yasuho; Tanaka, Takahiro
2016-01-01
We discuss how the ghost-free bigravity coupled with a single scalar field can be derived from a braneworld setup. We consider DGP two-brane model without radion stabilization. The bulk configuration is solved for given boundary metrics, and it is substituted back into the action to obtain the effective four-dimensional action. In order to obtain the ghost-free bigravity, we consider the gradient expansion in which the brane separation is supposed to be sufficiently small so that two boundary metrics are almost identical. The obtained effective theory is shown to be ghost free as expected, however, the interaction between two gravitons takes the Fierz-Pauli form at the leading order of the gradient expansion, even though we do not use the approximation of linear perturbation. We also find that the radion remains as a scalar field in the four-dimensional effective theory, but its coupling to the metrics is non-trivial.
El Sawi, M.
1983-07-01
A simple approach employing properties of solutions of differential equations is adopted to derive an appropriate extension of the WKBJ method. Some of the earlier techniques that are commonly in use are unified, whereby the general approximate solution to a second-order homogeneous linear differential equation is presented in a standard form that is valid for all orders. In comparison to other methods, the present one is shown to be leading in the order of iteration, and thus possibly has the ability of accelerating the convergence of the solution. The method is also extended for the solution of inhomogeneous equations. (author)
Spheroidal Integral Equations for Geodetic Inversion of Geopotential Gradients
Novák, Pavel; Šprlák, Michal
2018-03-01
The static Earth's gravitational field has traditionally been described in geodesy and geophysics by the gravitational potential (geopotential for short), a scalar function of 3-D position. Although not directly observable, geopotential functionals such as its first- and second-order gradients are routinely measured by ground, airborne and/or satellite sensors. In geodesy, these observables are often used for recovery of the static geopotential at some simple reference surface approximating the actual Earth's surface. A generalized mathematical model is represented by a surface integral equation which originates in solving Dirichlet's boundary-value problem of the potential theory defined for the harmonic geopotential, spheroidal boundary and globally distributed gradient data. The mathematical model can be used for combining various geopotential gradients without necessity of their re-sampling or prior continuation in space. The model extends the apparatus of integral equations which results from solving boundary-value problems of the potential theory to all geopotential gradients observed by current ground, airborne and satellite sensors. Differences between spherical and spheroidal formulations of integral kernel functions of Green's kind are investigated. Estimated differences reach relative values at the level of 3% which demonstrates the significance of spheroidal approximation for flattened bodies such as the Earth. The observation model can be used for combined inversion of currently available geopotential gradients while exploring their spectral and stochastic characteristics. The model would be even more relevant to gravitational field modelling of other bodies in space with more pronounced spheroidal geometry than that of the Earth.
P. A. Chaizy
Full Text Available Three main physical processes (and associated properties are currently used to describe the flux and anisotropy time profiles of solar energetic par- ticle events, called SEP profiles. They are (1 the particle scattering (due to magnetic waves, (2 the particle focusing (due to the decrease of the amplitude of the interplanetary magnetic field (IMF with the radial distance to the Sun and (3 the finite injection profile at the source. If their features change from one field line to another, i.e. if there is a cross IMF gradient (CFG, then the shape of the SEP profiles will depend, at onset time, on the relative position of the spacecraft to the IMF and might vary significantly on small distance scale (e.g. 10^{6} km. One type of CFG is studied here. It is called intensity CFG and considers variations, at the solar surface, only of the intensity of the event. It is shown here that drops of about two orders of magnitude over distances of ~10^{4} km at the Sun (1° of angular distance can influence dramatically the SEP profiles at 1 AU. This CFG can lead to either an under or overestimation of both the parallel mean free path and of the injection parameters by factor up to, at least, ~2-3 and 18, respectively. Multi-spacecraft analysis can be used to identify CFG. Three basic requirements are proposed to identify, from the observation, the type of the CFG being measured.
Key words: Solar physics, astrophysics, and astronomy (energetic particles; flares and mass ejections - Space plasma physics (transport processes
Gradient remediability in linear distributed parabolic systems ...
The aim of this paper is the introduction of a new concept that concerned the analysis of a large class of distributed parabolic systems. It is the general concept of gradient remediability. More precisely, we study with respect to the gradient observation, the existence of an input operator (gradient efficient actuators) ensuring ...
Sarkar, Bidyut K; Shahab, Lion; Arora, Monika; Ahluwalia, Jasjit S; Reddy, K Srinath; West, Robert
2017-11-07
The existence of a social gradient in tobacco use has been clearly established in a number of countries with people with lower socioeconomic status being more likely to use tobacco. It is not clear how far this gradient is evident within severely deprived communities. This study assessed the association between occupation as a marker of socioeconomic status and use of smoked and smokeless tobacco within "slum" areas of Delhi, India. A census survey of 11 888 households, comprising 30 655 adults from 28 low-income communities (14 government-authorized and 14 unauthorized settlements called "Jhuggi-Jhopri/JJ" clusters) was conducted in 2012. The survey assessed age, sex, household size, occupational group, and current tobacco use. Independent associations with tobacco use were conducted using complex samples regression analysis, stratified by gender. A quarter of participants (24.3%, 95% confidence interval [CI] 21.5-27.5) used any tobacco. Slightly more people used smoked (14.6%, 95% CI 12.9-16.3) than smokeless (12.6%, 95% CI 10.7-14.8) tobacco, with a small minority being dual users (2.7%, 95% CI 2.1-3.5). Prevalence of any tobacco use was highest in unskilled (45.13%, 95% CI 42.4-47.9) and skilled (46.2%, 95% CI 41.1-51.4) manual occupations and lower in nonmanual (30.3%, 95% CI 26.2-34.7) occupations and those who were unemployed (29.0%, 95% CI 25.3-33.0). This was confirmed in adjusted analysis in men but associations were more complex in women. Use of smoked and smokeless tobacco in low-income urban communities in India has a complex association with occupational status with both nonmanual occupation and unemployment being associated with lower prevalence of smoked and smokeless tobacco in men. Tobacco use in high-income countries shows a strong inverse relationship with social grade, income, and deprivation such that use is much more common among those who can least afford it. This study is the first to look at this social gradient in the context of low
The geomagnetic field gradient tensor
Kotsiaros, Stavros; Olsen, Nils
2012-01-01
We develop the general mathematical basis for space magnetic gradiometry in spherical coordinates. The magnetic gradient tensor is a second rank tensor consisting of 3 × 3 = 9 spatial derivatives. Since the geomagnetic field vector B is always solenoidal (∇ · B = 0) there are only eight independent...... tensor elements. Furthermore, in current free regions the magnetic gradient tensor becomes symmetric, further reducing the number of independent elements to five. In that case B is a Laplacian potential field and the gradient tensor can be expressed in series of spherical harmonics. We present properties...... of the magnetic gradient tensor and provide explicit expressions of its elements in terms of spherical harmonics. Finally we discuss the benefit of using gradient measurements for exploring the Earth’s magnetic field from space, in particular the advantage of the various tensor elements for a better determination...
Instabilities in power law gradient hardening materials
Niordson, Christian Frithiof; Tvergaard, Viggo
2005-01-01
Tension and compression instabilities are investigated for specimens with dimensions in the micron range. A finite strain generalization of a higher order strain gradient plasticity theory is implemented in a finite element scheme capable of modeling power law hardening materials. Effects...... of gradient hardening are found to delay the onset of localization under plane strain tension, and significantly reduce strain gradients in the localized zone. For plane strain compression gradient hardening is found to increase the load-carrying capacity significantly....
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.
Sobolev gradients and differential equations
Neuberger, J W
2010-01-01
A Sobolev gradient of a real-valued functional on a Hilbert space is a gradient of that functional taken relative to an underlying Sobolev norm. This book shows how descent methods using such gradients allow a unified treatment of a wide variety of problems in differential equations. For discrete versions of partial differential equations, corresponding Sobolev gradients are seen to be vastly more efficient than ordinary gradients. In fact, descent methods with these gradients generally scale linearly with the number of grid points, in sharp contrast with the use of ordinary gradients. Aside from the first edition of this work, this is the only known account of Sobolev gradients in book form. Most of the applications in this book have emerged since the first edition was published some twelve years ago. What remains of the first edition has been extensively revised. There are a number of plots of results from calculations and a sample MatLab code is included for a simple problem. Those working through a fair p...
The quasilocalized charge approximation
Kalman, G J; Golden, K I; Donko, Z; Hartmann, P
2005-01-01
The quasilocalized charge approximation (QLCA) has been used for some time as a formalism for the calculation of the dielectric response and for determining the collective mode dispersion in strongly coupled Coulomb and Yukawa liquids. The approach is based on a microscopic model in which the charges are quasilocalized on a short-time scale in local potential fluctuations. We review the conceptual basis and theoretical structure of the QLC approach and together with recent results from molecular dynamics simulations that corroborate and quantify the theoretical concepts. We also summarize the major applications of the QLCA to various physical systems, combined with the corresponding results of the molecular dynamics simulations and point out the general agreement and instances of disagreement between the two
Benzi, M.; Kouhia, R.; Tůma, Miroslav
2001-01-01
Roč. 190, - (2001), s. 6533-6554 ISSN 0045-7825 R&D Projects: GA AV ČR IAA2030801; GA ČR GA201/00/0080 Institutional research plan: AV0Z1030915 Keywords : preconditioning * conjugate gradient * factorized sparse approximate inverse * block algorithms * finite elements * shells Subject RIV: BA - General Mathematics Impact factor: 0.913, year: 2001
Ginsburg, C.A.
1980-01-01
In many problems, a desired property A of a function f(x) is determined by the behaviour of f(x) approximately equal to g(x,A) as x→xsup(*). In this letter, a method for resuming the power series in x of f(x) and approximating A (modulated Pade approximant) is presented. This new approximant is an extension of a resumation method for f(x) in terms of rational functions. (author)
Creasy, Arch; Lomino, Joseph; Barker, Gregory; Khetan, Anurag; Carta, Giorgio
2018-04-27
Protein retention in hydrophobic interaction chromatography is described by the solvophobic theory as a function of the kosmostropic salt concentration. In general, an increase in salt concentration drives protein partitioning to the hydrophobic surface while a decrease reduces it. In some cases, however, protein retention also increases at low salt concentrations resulting in a U-shaped retention factor curve. During gradient elution the salt concentration is gradually decreased from a high value thereby reducing the retention factor and increasing the protein chromatographic velocity. For these conditions, a steep gradient can overtake the protein in the column, causing it to rebind. Two dynamic models, one based on the local equilibrium theory and the other based on the linear driving force approximation, are presented. We show that the normalized gradient slope determines whether the protein elutes in the gradient, partially elutes, or is trapped in the column. Experimental results are presented for two different monoclonal antibodies and for lysozyme on Capto Phenyl (High Sub) resin. One of the mAbs and lysozyme exhibit U-shaped retention factor curves and for each, we determine the critical gradient slope beyond which 100% recovery is no longer possible. Elution with a reverse gradient is also demonstrated at low salt concentrations for these proteins. Understanding this behavior has implications in the design of gradient elution since the gradient slope impacts protein recovery. Copyright © 2018 Elsevier B.V. All rights reserved.
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...
Tearing modes with pressure gradient effect in pair plasmas
Cai Huishan; Li Ding; Zheng Jian
2009-01-01
The general dispersion relation of tearing mode with pressure gradient effect in pair plasmas is derived analytically. If the pressure gradients of positron and electron are not identical in pair plasmas, the pressure gradient has significant influence at tearing mode in both collisionless and collisional regimes. In collisionless regime, the effects of pressure gradient depend on its magnitude. For small pressure gradient, the growth rate of tearing mode is enhanced by pressure gradient. For large pressure gradient, the growth rate is reduced by pressure gradient. The tearing mode can even be stabilized if pressure gradient is large enough. In collisional regime, the growth rate of tearing mode is reduced by the pressure gradient. While the positron and electron have equal pressure gradient, tearing mode is not affected by pressure gradient in pair plasmas.
Approximate quantum Markov chains
Sutter, David
2018-01-01
This book is an introduction to quantum Markov chains and explains how this concept is connected to the question of how well a lost quantum mechanical system can be recovered from a correlated subsystem. To achieve this goal, we strengthen the data-processing inequality such that it reveals a statement about the reconstruction of lost information. The main difficulty in order to understand the behavior of quantum Markov chains arises from the fact that quantum mechanical operators do not commute in general. As a result we start by explaining two techniques of how to deal with non-commuting matrices: the spectral pinching method and complex interpolation theory. Once the reader is familiar with these techniques a novel inequality is presented that extends the celebrated Golden-Thompson inequality to arbitrarily many matrices. This inequality is the key ingredient in understanding approximate quantum Markov chains and it answers a question from matrix analysis that was open since 1973, i.e., if Lieb's triple ma...
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...
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.
Graded/Gradient Porous Biomaterials
Xigeng Miao
2009-12-01
Full Text Available Biomaterials include bioceramics, biometals, biopolymers and biocomposites and they play important roles in the replacement and regeneration of human tissues. However, dense bioceramics and dense biometals pose the problem of stress shielding due to their high Young’s moduli compared to those of bones. On the other hand, porous biomaterials exhibit the potential of bone ingrowth, which will depend on porous parameters such as pore size, pore interconnectivity, and porosity. Unfortunately, a highly porous biomaterial results in poor mechanical properties. To optimise the mechanical and the biological properties, porous biomaterials with graded/gradient porosity, pores size, and/or composition have been developed. Graded/gradient porous biomaterials have many advantages over graded/gradient dense biomaterials and uniform or homogenous porous biomaterials. The internal pore surfaces of graded/gradient porous biomaterials can be modified with organic, inorganic, or biological coatings and the internal pores themselves can also be filled with biocompatible and biodegradable materials or living cells. However, graded/gradient porous biomaterials are generally more difficult to fabricate than uniform or homogenous porous biomaterials. With the development of cost-effective processing techniques, graded/gradient porous biomaterials can find wide applications in bone defect filling, implant fixation, bone replacement, drug delivery, and tissue engineering.
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
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.
Clavel, Marie-Annick; Magne, Julien; Pibarot, Philippe
2016-09-07
An important proportion of patients with aortic stenosis (AS) have a 'low-gradient' AS, i.e. a small aortic valve area (AVA gradient (gradient discrepancy raises uncertainty about the actual stenosis severity and thus about the indication for aortic valve replacement (AVR) if the patient has symptoms and/or left ventricular (LV) systolic dysfunction. The most frequent cause of low-gradient (LG) AS is the presence of a low LV outflow state, which may occur with reduced left ventricular ejection fraction (LVEF), i.e. classical low-flow, low-gradient (LF-LG), or preserved LVEF, i.e. paradoxical LF-LG. Furthermore, a substantial proportion of patients with AS may have a normal-flow, low-gradient (NF-LG) AS: i.e. a small AVA-low-gradient combination but with a normal flow. One of the most important clinical challenges in these three categories of patients with LG AS (classical LF-LG, paradoxical LF-LG, and NF-LG) is to differentiate a true-severe AS that generally benefits from AVR vs. a pseudo-severe AS that should be managed conservatively. A low-dose dobutamine stress echocardiography may be used for this purpose in patients with classical LF-LG AS, whereas aortic valve calcium scoring by multi-detector computed tomography is the preferred modality in those with paradoxical LF-LG or NF-LG AS. Although patients with LF-LG severe AS have worse outcomes than those with high-gradient AS following AVR, they nonetheless display an important survival benefit with this intervention. Some studies suggest that transcatheter AVR may be superior to surgical AVR in patients with LF-LG AS. Published on behalf of the European Society of Cardiology. All rights reserved. © The Author 2016. For permissions please email: journals.permissions@oup.com.
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...
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.
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...
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.)
Approximate and renormgroup symmetries
Ibragimov, Nail H.; Kovalev, Vladimir F.
2009-01-01
''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)
Approximations of Fuzzy Systems
Vinai K. Singh
2013-03-01
Full Text Available A fuzzy system can uniformly approximate any real continuous function on a compact domain to any degree of accuracy. Such results can be viewed as an existence of optimal fuzzy systems. Li-Xin Wang discussed a similar problem using Gaussian membership function and Stone-Weierstrass Theorem. He established that fuzzy systems, with product inference, centroid defuzzification and Gaussian functions are capable of approximating any real continuous function on a compact set to arbitrary accuracy. In this paper we study a similar approximation problem by using exponential membership functions
Geometric approximation algorithms
Har-Peled, Sariel
2011-01-01
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.
Knobloch, A.F.
1980-01-01
A simplified cost approximation for INTOR parameter sets in a narrow parameter range is shown. Plausible constraints permit the evaluation of the consequences of parameter variations on overall cost. (orig.) [de
Bykov, Dmytro; Kristensen, Kasper; Kjærgaard, Thomas [Department of Chemistry, qLeap Center for Theoretical Chemistry, University of Aarhus, DK-8000 Århus C (Denmark)
2016-07-14
We report an implementation of the molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory (DEC-RI-MP2). The new DEC-RI-MP2 gradient method combines the precision control as well as the linear-scaling and massively parallel features of the DEC scheme with efficient evaluations of the gradient contributions using the RI approximation. We further demonstrate that the DEC-RI-MP2 gradient method is capable of calculating molecular gradients for very large molecular systems. A test set of supramolecular complexes containing up to 158 atoms and 1960 contracted basis functions has been employed to demonstrate the general applicability of the DEC-RI-MP2 method and to analyze the errors of the DEC approximation. Moreover, the test set contains molecules of complicated electronic structures and is thus deliberately chosen to stress test the DEC-RI-MP2 gradient implementation. Additionally, as a showcase example the full molecular gradient for insulin (787 atoms and 7604 contracted basis functions) has been evaluated.
Bykov, Dmytro; Kristensen, Kasper; Kjærgaard, Thomas
2016-01-01
We report an implementation of the molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory (DEC-RI-MP2). The new DEC-RI-MP2 gradient method combines the precision control as well as the linear-scaling and massively parallel features of the DEC scheme with efficient evaluations of the gradient contributions using the RI approximation. We further demonstrate that the DEC-RI-MP2 gradient method is capable of calculating molecular gradients for very large molecular systems. A test set of supramolecular complexes containing up to 158 atoms and 1960 contracted basis functions has been employed to demonstrate the general applicability of the DEC-RI-MP2 method and to analyze the errors of the DEC approximation. Moreover, the test set contains molecules of complicated electronic structures and is thus deliberately chosen to stress test the DEC-RI-MP2 gradient implementation. Additionally, as a showcase example the full molecular gradient for insulin (787 atoms and 7604 contracted basis functions) has been evaluated.
Gautschi, Walter; Rassias, Themistocles M
2011-01-01
Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg
Approximate kernel competitive learning.
Wu, Jian-Sheng; Zheng, Wei-Shi; Lai, Jian-Huang
2015-03-01
Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches. Copyright © 2014 Elsevier Ltd. All rights reserved.
Unambiguous results from variational matrix Pade approximants
Pindor, Maciej.
1979-10-01
Variational Matrix Pade Approximants are studied as a nonlinear variational problem. It is shown that although a stationary value of the Schwinger functional is a stationary value of VMPA, the latter has also another stationary value. It is therefore proposed that instead of looking for a stationary point of VMPA, one minimizes some non-negative functional and then one calculates VMPA at the point where the former has the absolute minimum. This approach, which we call the Method of the Variational Gradient (MVG) gives unambiguous results and is also shown to minimize a distance between the approximate and the exact stationary values of the Schwinger functional
On Covering Approximation Subspaces
Xun Ge
2009-06-01
Full Text Available Let (U';C' be a subspace of a covering approximation space (U;C and X⊂U'. In this paper, we show that and B'(X⊂B(X∩U'. Also, iff (U;C has Property Multiplication. Furthermore, some connections between outer (resp. inner definable subsets in (U;C and outer (resp. inner definable subsets in (U';C' are established. These results answer a question on covering approximation subspace posed by J. Li, and are helpful to obtain further applications of Pawlak rough set theory in pattern recognition and artificial intelligence.
Isobe, H; Shoji, M; Yamanaka, S; Mino, H; Umena, Y; Kawakami, K; Kamiya, N; Shen, J-R; Yamaguchi, K
2014-06-28
Full geometry optimizations followed by the vibrational analysis were performed for eight spin configurations of the CaMn4O4X(H2O)3Y (X = O, OH; Y = H2O, OH) cluster in the S1 and S3 states of the oxygen evolution complex (OEC) of photosystem II (PSII). The energy gaps among these configurations obtained by vertical, adiabatic and adiabatic plus zero-point-energy (ZPE) correction procedures have been used for computation of the effective exchange integrals (J) in the spin Hamiltonian model. The J values are calculated by the (1) analytical method and the (2) generalized approximate spin projection (AP) method that eliminates the spin contamination errors of UB3LYP solutions. Using J values derived from these methods, exact diagonalization of the spin Hamiltonian matrix was carried out, yielding excitation energies and spin densities of the ground and lower-excited states of the cluster. The obtained results for the right (R)- and left (L)-opened structures in the S1 and S3 states are found to be consistent with available optical and magnetic experimental results. Implications of the computational results are discussed in relation to (a) the necessity of the exact diagonalization for computations of reliable energy levels, (b) magneto-structural correlations in the CaMn4O5 cluster of the OEC of PSII, (c) structural symmetry breaking in the S1 and S3 states, and (d) the right- and left-handed scenarios for the O-O bond formation for water oxidation.
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Prestack wavefield approximations
Alkhalifah, Tariq
2013-01-01
The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.
Madsen, Rasmus Elsborg
2005-01-01
The Dirichlet compound multinomial (DCM), which has recently been shown to be well suited for modeling for word burstiness in documents, is here investigated. A number of conceptual explanations that account for these recent results, are provided. An exponential family approximation of the DCM...
Approximation by Cylinder Surfaces
Randrup, Thomas
1997-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...
Prestack wavefield approximations
Alkhalifah, Tariq
2013-09-01
The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.
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.
Tolman temperature gradients in a gravitational field
Santiago, Jessica; Visser, Matt
2018-01-01
Tolman's relation for the temperature gradient in an equilibrium self-gravitating general relativistic fluid is broadly accepted within the general relativity community. However, the concept of temperature gradients in thermal equilibrium continues to cause confusion in other branches of physics, since it contradicts naive versions of the laws of classical thermodynamics. In this paper we discuss the crucial role of the universality of free fall, and how thermodynamics emphasises the great di...
Capelle, K.; Gross, E.
1997-01-01
It is shown that the exchange-correlation functional of spin-density functional theory is identical, on a certain set of densities, with the exchange-correlation functional of current-density functional theory. This rigorous connection is used to construct new approximations of the exchange-correlation functionals. These include a conceptually new generalized-gradient spin-density functional and a nonlocal current-density functional. copyright 1997 The American Physical Society
Traveltime approximations for transversely isotropic media with an inhomogeneous background
Alkhalifah, Tariq
2011-05-01
A transversely isotropic (TI) model with a tilted symmetry axis is regarded as one of the most effective approximations to the Earth subsurface, especially for imaging purposes. However, we commonly utilize this model by setting the axis of symmetry normal to the reflector. This assumption may be accurate in many places, but deviations from this assumption will cause errors in the wavefield description. Using perturbation theory and Taylor\\'s series, I expand the solutions of the eikonal equation for 2D TI media with respect to the independent parameter θ, the angle the tilt of the axis of symmetry makes with the vertical, in a generally inhomogeneous TI background with a vertical axis of symmetry. I do an additional expansion in terms of the independent (anellipticity) parameter in a generally inhomogeneous elliptically anisotropic background medium. These new TI traveltime solutions are given by expansions in and θ with coefficients extracted from solving linear first-order partial differential equations. Pade approximations are used to enhance the accuracy of the representation by predicting the behavior of the higher-order terms of the expansion. A simplification of the expansion for homogenous media provides nonhyperbolic moveout descriptions of the traveltime for TI models that are more accurate than other recently derived approximations. In addition, for 3D media, I develop traveltime approximations using Taylor\\'s series type of expansions in the azimuth of the axis of symmetry. The coefficients of all these expansions can also provide us with the medium sensitivity gradients (Jacobian) for nonlinear tomographic-based inversion for the tilt in the symmetry axis. © 2011 Society of Exploration Geophysicists.
Traveltime approximations for transversely isotropic media with an inhomogeneous background
Alkhalifah, Tariq
2011-01-01
A transversely isotropic (TI) model with a tilted symmetry axis is regarded as one of the most effective approximations to the Earth subsurface, especially for imaging purposes. However, we commonly utilize this model by setting the axis of symmetry normal to the reflector. This assumption may be accurate in many places, but deviations from this assumption will cause errors in the wavefield description. Using perturbation theory and Taylor's series, I expand the solutions of the eikonal equation for 2D TI media with respect to the independent parameter θ, the angle the tilt of the axis of symmetry makes with the vertical, in a generally inhomogeneous TI background with a vertical axis of symmetry. I do an additional expansion in terms of the independent (anellipticity) parameter in a generally inhomogeneous elliptically anisotropic background medium. These new TI traveltime solutions are given by expansions in and θ with coefficients extracted from solving linear first-order partial differential equations. Pade approximations are used to enhance the accuracy of the representation by predicting the behavior of the higher-order terms of the expansion. A simplification of the expansion for homogenous media provides nonhyperbolic moveout descriptions of the traveltime for TI models that are more accurate than other recently derived approximations. In addition, for 3D media, I develop traveltime approximations using Taylor's series type of expansions in the azimuth of the axis of symmetry. The coefficients of all these expansions can also provide us with the medium sensitivity gradients (Jacobian) for nonlinear tomographic-based inversion for the tilt in the symmetry axis. © 2011 Society of Exploration Geophysicists.
Approximate Bayesian recursive estimation
Kárný, Miroslav
2014-01-01
Roč. 285, č. 1 (2014), s. 100-111 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf
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.
Du, Shouqiang; Chen, Miao
2018-01-01
We consider a kind of nonsmooth optimization problems with [Formula: see text]-norm minimization, which has many applications in compressed sensing, signal reconstruction, and the related engineering problems. Using smoothing approximate techniques, this kind of nonsmooth optimization problem can be transformed into a general unconstrained optimization problem, which can be solved by the proposed smoothing modified three-term conjugate gradient method. The smoothing modified three-term conjugate gradient method is based on Polak-Ribière-Polyak conjugate gradient method. For the Polak-Ribière-Polyak conjugate gradient method has good numerical properties, the proposed method possesses the sufficient descent property without any line searches, and it is also proved to be globally convergent. Finally, the numerical experiments show the efficiency of the proposed method.
Mapping moveout approximations in TI media
Stovas, Alexey; Alkhalifah, Tariq Ali
2013-01-01
Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.
Analytical approximation of neutron physics data
Badikov, S.A.; Vinogradov, V.A.; Gaj, E.V.; Rabotnov, N.S.
1984-01-01
The method for experimental neutron-physical data analytical approximation by rational functions based on the Pade approximation is suggested. It is shown that the existence of the Pade approximation specific properties in polar zones is an extremely favourable analytical property essentially extending the convergence range and increasing its rate as compared with polynomial approximation. The Pade approximation is the particularly natural instrument for resonance curve processing as the resonances conform to the complex poles of the approximant. But even in a general case analytical representation of the data in this form is convenient and compact. Thus representation of the data on the neutron threshold reaction cross sections (BOSPOR constant library) in the form of rational functions lead to approximately twenty fold reduction of the storaged numerical information as compared with the by-point calculation at the same accWracy
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.
Approximate solutions to Mathieu's equation
Wilkinson, Samuel A.; Vogt, Nicolas; Golubev, Dmitry S.; Cole, Jared H.
2018-06-01
Mathieu's equation has many applications throughout theoretical physics. It is especially important to the theory of Josephson junctions, where it is equivalent to Schrödinger's equation. Mathieu's equation can be easily solved numerically, however there exists no closed-form analytic solution. Here we collect various approximations which appear throughout the physics and mathematics literature and examine their accuracy and regimes of applicability. Particular attention is paid to quantities relevant to the physics of Josephson junctions, but the arguments and notation are kept general so as to be of use to the broader physics community.
Cyclic approximation to stasis
Stewart D. Johnson
2009-06-01
Full Text Available Neighborhoods of points in $mathbb{R}^n$ where a positive linear combination of $C^1$ vector fields sum to zero contain, generically, cyclic trajectories that switch between the vector fields. Such points are called stasis points, and the approximating switching cycle can be chosen so that the timing of the switches exactly matches the positive linear weighting. In the case of two vector fields, the stasis points form one-dimensional $C^1$ manifolds containing nearby families of two-cycles. The generic case of two flows in $mathbb{R}^3$ can be diffeomorphed to a standard form with cubic curves as trajectories.
The relaxation time approximation
Gairola, R.P.; Indu, B.D.
1991-01-01
A plausible approximation has been made to estimate the relaxation time from a knowledge of the transition probability of phonons from one state (r vector, q vector) to other state (r' vector, q' vector), as a result of collision. The relaxation time, thus obtained, shows a strong dependence on temperature and weak dependence on the wave vector. In view of this dependence, relaxation time has been expressed in terms of a temperature Taylor's series in the first Brillouin zone. Consequently, a simple model for estimating the thermal conductivity is suggested. the calculations become much easier than the Callaway model. (author). 14 refs
Polynomial approximation on polytopes
Totik, Vilmos
2014-01-01
Polynomial approximation on convex polytopes in \\mathbf{R}^d is considered in uniform and L^p-norms. For an appropriate modulus of smoothness matching direct and converse estimates are proven. In the L^p-case so called strong direct and converse results are also verified. The equivalence of the moduli of smoothness with an appropriate K-functional follows as a consequence. The results solve a problem that was left open since the mid 1980s when some of the present findings were established for special, so-called simple polytopes.
Finite elements and approximation
Zienkiewicz, O C
2006-01-01
A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o
Full Gradient Solution to Adaptive Hybrid Control
Bean, Jacob; Schiller, Noah H.; Fuller, Chris
2017-01-01
This paper focuses on the adaptation mechanisms in adaptive hybrid controllers. Most adaptive hybrid controllers update two filters individually according to the filtered reference least mean squares (FxLMS) algorithm. Because this algorithm was derived for feedforward control, it does not take into account the presence of a feedback loop in the gradient calculation. This paper provides a derivation of the proper weight vector gradient for hybrid (or feedback) controllers that takes into account the presence of feedback. In this formulation, a single weight vector is updated rather than two individually. An internal model structure is assumed for the feedback part of the controller. The full gradient is equivalent to that used in the standard FxLMS algorithm with the addition of a recursive term that is a function of the modeling error. Some simulations are provided to highlight the advantages of using the full gradient in the weight vector update rather than the approximation.
Paolucci, S.
1982-12-01
An approximation leading to anelastic equations capable of describing thermal convection in a compressible fluid is given. These equations are more general than the Oberbeck-Boussinesq equations and different than the standard anelastic equations in that they can be used for the computation of convection in a fluid with large density gradients present. We show that the equations do not contain acoustic waves, while at the same time they can still describe the propagation of internal waves. Throughout we show that the filtering of acoustic waves, within the limits of the approximation, does not appreciably alter the description of the physics.
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.
Ion temperature gradient instability
1989-01-01
Anomalous ion thermal conductivity remains an open physics issue for the present generation of high temperature Tokamaks. It is generally believed to be due to Ion Temperature Gradient Instability (η i mode). However, it has been difficult, if not impossible to identify this instability and study the anomalous transport due to it, directly. Therefore the production and identification of the mode is pursued in the simpler and experimentally convenient configuration of the Columbia Linear Machine (CLM). CLM is a steady state machine which already has all the appropriate parameters, except η i . This parameter is being increased to the appropriate value of the order of 1 by 'feathering' a tungsten screen located between the plasma source and the experimental cell to flatten the density profile and appropriate redesign of heating antennas to steepen the ion temperature profile. Once the instability is produced and identified, a thorough study of the characteristics of the mode can be done via a wide range of variation of all the critical parameters: η i , parallel wavelength, etc
Simultaneous perturbation stochastic approximation for tidal models
Altaf, M.U.
2011-05-12
The Dutch continental shelf model (DCSM) is a shallow sea model of entire continental shelf which is used operationally in the Netherlands to forecast the storm surges in the North Sea. The forecasts are necessary to support the decision of the timely closure of the moveable storm surge barriers to protect the land. In this study, an automated model calibration method, simultaneous perturbation stochastic approximation (SPSA) is implemented for tidal calibration of the DCSM. The method uses objective function evaluations to obtain the gradient approximations. The gradient approximation for the central difference method uses only two objective function evaluation independent of the number of parameters being optimized. The calibration parameter in this study is the model bathymetry. A number of calibration experiments is performed. The effectiveness of the algorithm is evaluated in terms of the accuracy of the final results as well as the computational costs required to produce these results. In doing so, comparison is made with a traditional steepest descent method and also with a newly developed proper orthogonal decompositionbased calibration method. The main findings are: (1) The SPSA method gives comparable results to steepest descent method with little computational cost. (2) The SPSA method with little computational cost can be used to estimate large number of parameters.
Simultaneous perturbation stochastic approximation for tidal models
Altaf, M.U.; Heemink, A.W.; Verlaan, M.; Hoteit, Ibrahim
2011-01-01
The Dutch continental shelf model (DCSM) is a shallow sea model of entire continental shelf which is used operationally in the Netherlands to forecast the storm surges in the North Sea. The forecasts are necessary to support the decision of the timely closure of the moveable storm surge barriers to protect the land. In this study, an automated model calibration method, simultaneous perturbation stochastic approximation (SPSA) is implemented for tidal calibration of the DCSM. The method uses objective function evaluations to obtain the gradient approximations. The gradient approximation for the central difference method uses only two objective function evaluation independent of the number of parameters being optimized. The calibration parameter in this study is the model bathymetry. A number of calibration experiments is performed. The effectiveness of the algorithm is evaluated in terms of the accuracy of the final results as well as the computational costs required to produce these results. In doing so, comparison is made with a traditional steepest descent method and also with a newly developed proper orthogonal decompositionbased calibration method. The main findings are: (1) The SPSA method gives comparable results to steepest descent method with little computational cost. (2) The SPSA method with little computational cost can be used to estimate large number of parameters.
Gravity gradient preprocessing at the GOCE HPF
Bouman, J.; Rispens, S.; Gruber, T.; Schrama, E.; Visser, P.; Tscherning, C. C.; Veicherts, M.
2009-04-01
One of the products derived from the GOCE observations are the gravity gradients. These gravity gradients are provided in the Gradiometer Reference Frame (GRF) and are calibrated in-flight using satellite shaking and star sensor data. In order to use these gravity gradients for application in Earth sciences and gravity field analysis, additional pre-processing needs to be done, including corrections for temporal gravity field signals to isolate the static gravity field part, screening for outliers, calibration by comparison with existing external gravity field information and error assessment. The temporal gravity gradient corrections consist of tidal and non-tidal corrections. These are all generally below the gravity gradient error level, which is predicted to show a 1/f behaviour for low frequencies. In the outlier detection the 1/f error is compensated for by subtracting a local median from the data, while the data error is assessed using the median absolute deviation. The local median acts as a high-pass filter and it is robust as is the median absolute deviation. Three different methods have been implemented for the calibration of the gravity gradients. All three methods use a high-pass filter to compensate for the 1/f gravity gradient error. The baseline method uses state-of-the-art global gravity field models and the most accurate results are obtained if star sensor misalignments are estimated along with the calibration parameters. A second calibration method uses GOCE GPS data to estimate a low degree gravity field model as well as gravity gradient scale factors. Both methods allow to estimate gravity gradient scale factors down to the 10-3 level. The third calibration method uses high accurate terrestrial gravity data in selected regions to validate the gravity gradient scale factors, focussing on the measurement band. Gravity gradient scale factors may be estimated down to the 10-2 level with this method.
39 (APPROXIMATE ANALYTICAL SOLUTION)
Rotating machines like motors, turbines, compressors etc. are generally subjected to periodic forces and the system parameters remain more or less constant. ... parameters change and, consequently, the natural frequencies too, due to reasons of changing gyroscopic moments, centrifugal forces, bearing characteristics,.
The random phase approximation
Schuck, P.
1985-01-01
RPA is the adequate theory to describe vibrations of the nucleus of very small amplitudes. These vibrations can either be forced by an external electromagnetic field or can be eigenmodes of the nucleus. In a one dimensional analogue the potential corresponding to such eigenmodes of very small amplitude should be rather stiff otherwise the motion risks to be a large amplitude one and to enter a region where the approximation is not valid. This means that nuclei which are supposedly well described by RPA must have a very stable groundstate configuration (must e.g. be very stiff against deformation). This is usually the case for doubly magic nuclei or close to magic nuclei which are in the middle of proton and neutron shells which develop a very stable groundstate deformation; we take the deformation as an example but there are many other possible degrees of freedom as, for example, compression modes, isovector degrees of freedom, spin degrees of freedom, and many more
Stability of Gradient Field Corrections for Quantitative Diffusion MRI
Rogers, Baxter P.; Blaber, Justin; Welch, E. Brian; Ding, Zhaohua; Anderson, Adam W.; Landman, Bennett A.
2017-01-01
In magnetic resonance diffusion imaging, gradient nonlinearity causes significant bias in the estimation of quantitative diffusion parameters such as diffusivity, anisotropy, and diffusion direction in areas away from the magnet isocenter. This bias can be substantially reduced if the scanner- and coil-specific gradient field nonlinearities are known. Using a set of field map calibration scans on a large (29 cm diameter) phantom combined with a solid harmonic approximation of the gradient fie...
On fracture in finite strain gradient plasticity
Martínez Pañeda, Emilio; Niordson, Christian Frithiof
2016-01-01
In this work a general framework for damage and fracture assessment including the effect of strain gradients is provided. Both mechanism-based and phenomenological strain gradient plasticity (SGP) theories are implemented numerically using finite deformation theory and crack tip fields are invest......In this work a general framework for damage and fracture assessment including the effect of strain gradients is provided. Both mechanism-based and phenomenological strain gradient plasticity (SGP) theories are implemented numerically using finite deformation theory and crack tip fields...... are investigated. Differences and similarities between the two approaches within continuum SGP modeling are highlighted and discussed. Local strain hardening promoted by geometrically necessary dislocations (GNDs) in the vicinity of the crack leads to much higher stresses, relative to classical plasticity...... in the multiple parameter version of the phenomenological SGP theory. Since this also dominates the mechanics of indentation testing, results suggest that length parameters characteristic of mode I fracture should be inferred from nanoindentation....
Gradients estimation from random points with volumetric tensor in turbulence
Watanabe, Tomoaki; Nagata, Koji
2017-12-01
We present an estimation method of fully-resolved/coarse-grained gradients from randomly distributed points in turbulence. The method is based on a linear approximation of spatial gradients expressed with the volumetric tensor, which is a 3 × 3 matrix determined by a geometric distribution of the points. The coarse grained gradient can be considered as a low pass filtered gradient, whose cutoff is estimated with the eigenvalues of the volumetric tensor. The present method, the volumetric tensor approximation, is tested for velocity and passive scalar gradients in incompressible planar jet and mixing layer. Comparison with a finite difference approximation on a Cartesian grid shows that the volumetric tensor approximation computes the coarse grained gradients fairly well at a moderate computational cost under various conditions of spatial distributions of points. We also show that imposing the solenoidal condition improves the accuracy of the present method for solenoidal vectors, such as a velocity vector in incompressible flows, especially when the number of the points is not large. The volumetric tensor approximation with 4 points poorly estimates the gradient because of anisotropic distribution of the points. Increasing the number of points from 4 significantly improves the accuracy. Although the coarse grained gradient changes with the cutoff length, the volumetric tensor approximation yields the coarse grained gradient whose magnitude is close to the one obtained by the finite difference. We also show that the velocity gradient estimated with the present method well captures the turbulence characteristics such as local flow topology, amplification of enstrophy and strain, and energy transfer across scales.
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
Abstract. The general theme of this note is illustrated by the following theorem: Theorem 1. Suppose K is a compact set in the complex plane and 0 belongs to the boundary ∂K. Let A(K) denote the space of all functions f on K such that f is holo- morphic in a neighborhood of K and f(0) = 0. Also for any given positive integer ...
Travelling gradient thermocouple calibration
Broomfield, G.H.
1975-01-01
A short discussion of the origins of the thermocouple EMF is used to re-introduce the idea that the Peltier and Thompson effects are indistinguishable from one another. Thermocouples may be viewed as devices which generate an EMF at junctions or as integrators of EMF's developed in thermal gradients. The thermal gradient view is considered the more appropriate, because of its better accord with theory and behaviour, the correct approach to calibration, and investigation of service effects is immediately obvious. Inhomogeneities arise in thermocouples during manufacture and in service. The results of travelling gradient measurements are used to show that such effects are revealed with a resolution which depends on the length of the gradient although they may be masked during simple immersion calibration. Proposed tests on thermocouples irradiated in a nuclear reactor are discussed
Quaternion Gradient and Hessian
Xu, Dongpo; Mandic, Danilo P.
2014-01-01
The optimization of real scalar functions of quaternion variables, such as the mean square error or array output power, underpins many practical applications. Solutions typically require the calculation of the gradient and Hessian. However, real functions of quaternion variables are essentially nonanalytic, which are prohibitive to the development of quaternion-valued learning systems. To address this issue, we propose new definitions of quaternion gradient and Hessian, based on the novel gen...
Solving large mixed linear models using preconditioned conjugate gradient iteration.
Strandén, I; Lidauer, M
1999-12-01
Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.
Gradient Alloy for Optical Packaging
National Aeronautics and Space Administration — Advances in additive manufacturing, such as Laser Engineered Net Shaping (LENS), enables the fabrication of compositionally gradient microstructures, i.e. gradient...
Microgravimetry and the Measurement and Application of Gravity Gradients,
1980-06-01
Neumann, R., 1972, High precision gravimetry--recent develop- ments: Report to Paris Commission of E.A.E.G., Compagnie Generale de Geophysique , Massy...experimentation on vertical gradient: Compagnie Generale de Geophysique , Massy, France. 12. Fajklewicz, Z. J., 1976, Gravity vertical gradient
Destabilization of drift waves due to nonuniform density gradient
Hirose, A.; Ishihara, O.
1985-01-01
It is shown that the conventional mode differential equation for low frequency electrostatic waves in a tokamak does not contain full ion dynamics. Both electrons and ions contribute to the ballooning term, which is subject to finite ion Larmor radius effects. Also, both fluid ion approximation and kinetic ion model yield the same correction. Reexamined are the density gradient universal mode and ion temperature gradient instability employing the lowest order Pearlstein-Berk type radial eigenfunctions. No unstable, bounded, energy outgoing eigenfunctions have been found. In particular, a large ion temperature gradient (eta/sub i/) tends to further stabilize the temperature gradient driven mode
Approximative solutions of stochastic optimization problem
Lachout, Petr
2010-01-01
Roč. 46, č. 3 (2010), s. 513-523 ISSN 0023-5954 R&D Projects: GA ČR GA201/08/0539 Institutional research plan: CEZ:AV0Z10750506 Keywords : Stochastic optimization problem * sensitivity * approximative solution Subject RIV: BA - General Mathematics Impact factor: 0.461, year: 2010 http://library.utia.cas.cz/separaty/2010/SI/lachout-approximative solutions of stochastic optimization problem.pdf
Stochastic quantization and mean field approximation
Jengo, R.; Parga, N.
1983-09-01
In the context of the stochastic quantization we propose factorized approximate solutions for the Fokker-Planck equation for the XY and Zsub(N) spin systems in D dimensions. The resulting differential equation for a factor can be solved and it is found to give in the limit of t→infinity the mean field or, in the more general case, the Bethe-Peierls approximation. (author)
Polynomial approximation of functions in Sobolev spaces
Dupont, T.; Scott, R.
1980-01-01
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomical plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces
Analysis of expansion phase experiments with improved approximation schemes
Foit, J.J.
1987-05-01
A steady-state flow of a single-phase and incompressible fluid across a singularity is studied. Based on these theoretical considerations new approximation methods for the pressure gradient term in the SIMMER-II momentum equations are proposed which give a satisfactory pressure change in flows across singularities. The expansion phase experiments with a dipplate performed by SRI-International are evaluated to examine the quality of the proposed approximation schemes. (orig.) [de
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...
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.
Stability of gradient semigroups under perturbations
Aragão-Costa, E. R.; Caraballo, T.; Carvalho, A. N.; Langa, J. A.
2011-07-01
In this paper we prove that gradient-like semigroups (in the sense of Carvalho and Langa (2009 J. Diff. Eqns 246 2646-68)) are gradient semigroups (possess a Lyapunov function). This is primarily done to provide conditions under which gradient semigroups, in a general metric space, are stable under perturbation exploiting the known fact (see Carvalho and Langa (2009 J. Diff. Eqns 246 2646-68)) that gradient-like semigroups are stable under perturbation. The results presented here were motivated by the work carried out in Conley (1978 Isolated Invariant Sets and the Morse Index (CBMS Regional Conference Series in Mathematics vol 38) (RI: American Mathematical Society Providence)) for groups in compact metric spaces (see also Rybakowski (1987 The Homotopy Index and Partial Differential Equations (Universitext) (Berlin: Springer)) for the Morse decomposition of an invariant set for a semigroup on a compact metric space).
Stability of gradient semigroups under perturbations
Aragão-Costa, E R; Carvalho, A N; Caraballo, T; Langa, J A
2011-01-01
In this paper we prove that gradient-like semigroups (in the sense of Carvalho and Langa (2009 J. Diff. Eqns 246 2646–68)) are gradient semigroups (possess a Lyapunov function). This is primarily done to provide conditions under which gradient semigroups, in a general metric space, are stable under perturbation exploiting the known fact (see Carvalho and Langa (2009 J. Diff. Eqns 246 2646–68)) that gradient-like semigroups are stable under perturbation. The results presented here were motivated by the work carried out in Conley (1978 Isolated Invariant Sets and the Morse Index (CBMS Regional Conference Series in Mathematics vol 38) (RI: American Mathematical Society Providence)) for groups in compact metric spaces (see also Rybakowski (1987 The Homotopy Index and Partial Differential Equations (Universitext) (Berlin: Springer)) for the Morse decomposition of an invariant set for a semigroup on a compact metric 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...
High Gradient Accelerator Research
Temkin, Richard
2016-01-01
The goal of the MIT program of research on high gradient acceleration is the development of advanced acceleration concepts that lead to a practical and affordable next generation linear collider at the TeV energy level. Other applications, which are more near-term, include accelerators for materials processing; medicine; defense; mining; security; and inspection. The specific goals of the MIT program are: • Pioneering theoretical research on advanced structures for high gradient acceleration, including photonic structures and metamaterial structures; evaluation of the wakefields in these advanced structures • Experimental research to demonstrate the properties of advanced structures both in low-power microwave cold test and high-power, high-gradient test at megawatt power levels • Experimental research on microwave breakdown at high gradient including studies of breakdown phenomena induced by RF electric fields and RF magnetic fields; development of new diagnostics of the breakdown process • Theoretical research on the physics and engineering features of RF vacuum breakdown • Maintaining and improving the Haimson / MIT 17 GHz accelerator, the highest frequency operational accelerator in the world, a unique facility for accelerator research • Providing the Haimson / MIT 17 GHz accelerator facility as a facility for outside users • Active participation in the US DOE program of High Gradient Collaboration, including joint work with SLAC and with Los Alamos National Laboratory; participation of MIT students in research at the national laboratories • Training the next generation of Ph. D. students in the field of accelerator physics.
Vertical gradients of sunspot magnetic fields
Hagyard, M. J.; Teuber, D.; West, E. A.; Tandberg-Hanssen, E.; Henze, W., Jr.; Beckers, J. M.; Bruner, M.; Hyder, C. L.; Woodgate, B. E.
1983-01-01
The results of a Solar Maximum Mission (SMM) guest investigation to determine the vertical gradients of sunspot magnetic fields for the first time from coordinated observations of photospheric and transition-region fields are described. Descriptions are given of both the photospheric vector field of a sunspot, derived from observations using the NASA Marshall Space Flight Center vector magnetograph, and of the line-of-sight component in the transition region, obtained from the SMM Ultraviolet Spectrometer and Polarimeter instrument. On the basis of these data, vertical gradients of the line-of-sight magnetic field component are calculated using three methods. It is found that the vertical gradient of Bz is lower than values from previous studies and that the transition-region field occurs at a height of approximately 4000-6000 km above the photosphere.
A novel single neuron perceptron with universal approximation and XOR computation properties.
Lotfi, Ehsan; Akbarzadeh-T, M-R
2014-01-01
We propose a biologically motivated brain-inspired single neuron perceptron (SNP) with universal approximation and XOR computation properties. This computational model extends the input pattern and is based on the excitatory and inhibitory learning rules inspired from neural connections in the human brain's nervous system. The resulting architecture of SNP can be trained by supervised excitatory and inhibitory online learning rules. The main features of proposed single layer perceptron are universal approximation property and low computational complexity. The method is tested on 6 UCI (University of California, Irvine) pattern recognition and classification datasets. Various comparisons with multilayer perceptron (MLP) with gradient decent backpropagation (GDBP) learning algorithm indicate the superiority of the approach in terms of higher accuracy, lower time, and spatial complexity, as well as faster training. Hence, we believe the proposed approach can be generally applicable to various problems such as in pattern recognition and classification.
Hierarchical low-rank approximation for high dimensional approximation
Nouy, Anthony
2016-01-01
Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.
Hierarchical low-rank approximation for high dimensional approximation
Nouy, Anthony
2016-01-07
Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.
High gradient superconducting quadrupoles
Lundy, R.A.; Brown, B.C.; Carson, J.A.; Fisk, H.E.; Hanft, R.H.; Mantsch, P.M.; McInturff, A.D.; Remsbottom, R.H.
1987-07-01
Prototype superconducting quadrupoles with a 5 cm aperture and gradient of 16 kG/cm have been built and tested as candidate magnets for the final focus at SLC. The magnets are made from NbTi Tevatron style cable with 10 inner and 14 outer turns per quadrant. Quench performance and multipole data are presented. Design and data for a low current, high gradient quadrupole, similar in cross section but wound with a cable consisting of five insulated conductors are also discussed
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.
Gaze, Eric C.
2005-01-01
We introduce a cooperative learning, group lab for a Calculus III course to facilitate comprehension of the gradient vector and directional derivative concepts. The lab is a hands-on experience allowing students to manipulate a tangent plane and empirically measure the effect of partial derivatives on the direction of optimal ascent. (Contains 7…
PET regularization by envelope guided conjugate gradients
Kaufman, L.; Neumaier, A.
1996-01-01
The authors propose a new way to iteratively solve large scale ill-posed problems and in particular the image reconstruction problem in positron emission tomography by exploiting the relation between Tikhonov regularization and multiobjective optimization to obtain iteratively approximations to the Tikhonov L-curve and its corner. Monitoring the change of the approximate L-curves allows us to adjust the regularization parameter adaptively during a preconditioned conjugate gradient iteration, so that the desired solution can be reconstructed with a small number of iterations
Exact constants in approximation theory
Korneichuk, N
1991-01-01
This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base
International Conference Approximation Theory XIV
Schumaker, Larry
2014-01-01
This volume developed from papers presented at the international conference Approximation Theory XIV, held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.
Modified semiclassical approximation for trapped Bose gases
Yukalov, V.I.
2005-01-01
A generalization of the semiclassical approximation is suggested allowing for an essential extension of its region of applicability. In particular, it becomes possible to describe Bose-Einstein condensation of a trapped gas in low-dimensional traps and in traps of low confining dimensions, for which the standard semiclassical approximation is not applicable. The result of the modified approach is shown to coincide with purely quantum-mechanical calculations for harmonic traps, including the one-dimensional harmonic trap. The advantage of the semiclassical approximation is in its simplicity and generality. Power-law potentials of arbitrary powers are considered. The effective thermodynamic limit is defined for any confining dimension. The behavior of the specific heat, isothermal compressibility, and density fluctuations is analyzed, with an emphasis on low confining dimensions, where the usual semiclassical method fails. The peculiarities of the thermodynamic characteristics in the effective thermodynamic limit are discussed
Function approximation with polynomial regression slines
Urbanski, P.
1996-01-01
Principles of the polynomial regression splines as well as algorithms and programs for their computation are presented. The programs prepared using software package MATLAB are generally intended for approximation of the X-ray spectra and can be applied in the multivariate calibration of radiometric gauges. (author)
Uniform semiclassical approximation for absorptive scattering systems
Hussein, M.S.; Pato, M.P.
1987-07-01
The uniform semiclassical approximation of the elastic scattering amplitude is generalized to absorptive systems. An integral equation is derived which connects the absorption modified amplitude to the absorption free one. Division of the amplitude into a diffractive and refractive components is then made possible. (Author) [pt
Mass balance gradients and climatic change
Oerlemans, J.; Hoogendoorn, N.C.
1989-01-01
It is generally assumed that the mass-balance gradient on glaciers is more or less conserved under climatic change. In studies of the dynamic response of glaciers to climatic change, one of the following assumptions is normally made: (i) the mass-balance perturbation is independent of altitude
Estimation of the magnetic field gradient tensor using the Swarm constellation
Kotsiaros, Stavros; Finlay, Chris; Olsen, Nils
2014-01-01
For the first time, part of the magnetic field gradient tensor is estimated in space by the Swarm mission. We investigate the possibility of a more complete estimation of the gradient tensor exploiting the Swarm constellation. The East-West gradients can be approximated by observations from...... deviations compared to conventional vector observations at almost all latitudes. Analytical and numerical analysis of the spectral properties of the gradient tensor shows that specific combinations of the East-West and North-South gradients have almost identical signal content to the radial gradient...
CdS_xTe_1_-_x ternary semiconductors band gaps calculation using ground state and GW approximations
Kheloufi, Nawal; Bouzid, Abderrazak
2016-01-01
We present band gap calculations of zinc-blende ternary CdS_xTe_1_-_x semiconductors within the standard DFT and quasiparticle calculations employing pseudopotential method. The DFT, the local density approximation (LDA) and the Generalized Gradient Approximation (GGA) based calculations have given very poor results compared to experimental data. The quasiparticle calculations have been investigated via the one-shot GW approximation. The present paper discuses and confirms the effect of inclusion of the semicore states in the cadmium (Cd) pseudopotential. The obtained GW quasiparticle band gap using Cd"+"2"0 pseudopotential has been improved compared to the obtained results from the available pseudopotential without the treatment of semicore states. Our DFT and quasiparticle band gap results are discussed and compared to the available theoretical calculations and experimental data. - Graphical abstract: Band gaps improvement concerning the binary and ternary alloys using the GW approximation and Cd"2"0"+ pseudopotential with others levels of approximations (the LDA and GGA approximation employing the Cd"1"2"+ and the LDA within Cd"2"0"+ pseudopotential). - Highlights: • The direct Γ- Γ and indirect Γ- X and Γ- L bands gaps show a nonlinear behavior when S content is enhanced. • The quasiparticle band gap result for the investigated semiconductors is improved using the GW approximation. • All CdS_xTe_1_-_x compounds in all compositions range from 0 to 1 are direct band gap semiconductors.
Some results in Diophantine approximation
Pedersen, Steffen Højris
the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered......This thesis consists of three papers in Diophantine approximation, a subbranch of number theory. Preceding these papers is an introduction to various aspects of Diophantine approximation and formal Laurent series over Fq and a summary of each of the three papers. The introduction introduces...
Limitations of shallow nets approximation.
Lin, Shao-Bo
2017-10-01
In this paper, we aim at analyzing the approximation abilities of shallow networks in reproducing kernel Hilbert spaces (RKHSs). We prove that there is a probability measure such that the achievable lower bound for approximating by shallow nets can be realized for all functions in balls of reproducing kernel Hilbert space with high probability, which is different with the classical minimax approximation error estimates. This result together with the existing approximation results for deep nets shows the limitations for shallow nets and provides a theoretical explanation on why deep nets perform better than shallow nets. Copyright © 2017 Elsevier Ltd. All rights reserved.
How a High-Gradient Magnetic Field Could Affect Cell Life
Zablotskii, Vitalii; Polyakova, Tatyana; Lunov, Oleg; Dejneka, Alexandr
2016-01-01
The biological effects of high-gradient magnetic fields (HGMFs) have steadily gained the increased attention of researchers from different disciplines, such as cell biology, cell therapy, targeted stem cell delivery and nanomedicine. We present a theoretical framework towards a fundamental understanding of the effects of HGMFs on intracellular processes, highlighting new directions for the study of living cell machinery: changing the probability of ion-channel on/off switching events by membrane magneto-mechanical stress, suppression of cell growth by magnetic pressure, magnetically induced cell division and cell reprograming, and forced migration of membrane receptor proteins. By deriving a generalized form for the Nernst equation, we find that a relatively small magnetic field (approximately 1 T) with a large gradient (up to 1 GT/m) can significantly change the membrane potential of the cell and thus have a significant impact on not only the properties and biological functionality of cells but also cell fate. PMID:27857227
How a High-Gradient Magnetic Field Could Affect Cell Life
Zablotskii, Vitalii; Polyakova, Tatyana; Lunov, Oleg; Dejneka, Alexandr
2016-11-01
The biological effects of high-gradient magnetic fields (HGMFs) have steadily gained the increased attention of researchers from different disciplines, such as cell biology, cell therapy, targeted stem cell delivery and nanomedicine. We present a theoretical framework towards a fundamental understanding of the effects of HGMFs on intracellular processes, highlighting new directions for the study of living cell machinery: changing the probability of ion-channel on/off switching events by membrane magneto-mechanical stress, suppression of cell growth by magnetic pressure, magnetically induced cell division and cell reprograming, and forced migration of membrane receptor proteins. By deriving a generalized form for the Nernst equation, we find that a relatively small magnetic field (approximately 1 T) with a large gradient (up to 1 GT/m) can significantly change the membrane potential of the cell and thus have a significant impact on not only the properties and biological functionality of cells but also cell fate.
Policy Gradient Adaptive Dynamic Programming for Data-Based Optimal Control.
Luo, Biao; Liu, Derong; Wu, Huai-Ning; Wang, Ding; Lewis, Frank L
2017-10-01
The model-free optimal control problem of general discrete-time nonlinear systems is considered in this paper, and a data-based policy gradient adaptive dynamic programming (PGADP) algorithm is developed to design an adaptive optimal controller method. By using offline and online data rather than the mathematical system model, the PGADP algorithm improves control policy with a gradient descent scheme. The convergence of the PGADP algorithm is proved by demonstrating that the constructed Q -function sequence converges to the optimal Q -function. Based on the PGADP algorithm, the adaptive control method is developed with an actor-critic structure and the method of weighted residuals. Its convergence properties are analyzed, where the approximate Q -function converges to its optimum. Computer simulation results demonstrate the effectiveness of the PGADP-based adaptive control method.
2010-03-31
nonimaging design capabilities to incorporate 1. REPORT DATE (DD-MM-YYYY) 4. TITLE AND SUBTITLE 12-04-2011 13. SUPPLEMENTARY NOTES The views, opinions...Box 12211 Research Triangle Park, NC 27709-2211 15. SUBJECT TERMS Imaging Optics, Nonimaging Optics, Gradient Index Optics, Camera, Concentrator...imaging and nonimaging design capabilities to incorporate manufacturable GRIN lenses can provide imaging lens systems that are compact and
Large Airborne Full Tensor Gradient Data Inversion Based on a Non-Monotone Gradient Method
Sun, Yong; Meng, Zhaohai; Li, Fengting
2018-03-01
Following the development of gravity gradiometer instrument technology, the full tensor gravity (FTG) data can be acquired on airborne and marine platforms. Large-scale geophysical data can be obtained using these methods, making such data sets a number of the "big data" category. Therefore, a fast and effective inversion method is developed to solve the large-scale FTG data inversion problem. Many algorithms are available to accelerate the FTG data inversion, such as conjugate gradient method. However, the conventional conjugate gradient method takes a long time to complete data processing. Thus, a fast and effective iterative algorithm is necessary to improve the utilization of FTG data. Generally, inversion processing is formulated by incorporating regularizing constraints, followed by the introduction of a non-monotone gradient-descent method to accelerate the convergence rate of FTG data inversion. Compared with the conventional gradient method, the steepest descent gradient algorithm, and the conjugate gradient algorithm, there are clear advantages of the non-monotone iterative gradient-descent algorithm. Simulated and field FTG data were applied to show the application value of this new fast inversion method.
A density gradient theory based method for surface tension calculations
Liang, Xiaodong; Michelsen, Michael Locht; Kontogeorgis, Georgios
2016-01-01
The density gradient theory has been becoming a widely used framework for calculating surface tension, within which the same equation of state is used for the interface and bulk phases, because it is a theoretically sound, consistent and computationally affordable approach. Based on the observation...... that the optimal density path from the geometric mean density gradient theory passes the saddle point of the tangent plane distance to the bulk phases, we propose to estimate surface tension with an approximate density path profile that goes through this saddle point. The linear density gradient theory, which...... assumes linearly distributed densities between the two bulk phases, has also been investigated. Numerical problems do not occur with these density path profiles. These two approximation methods together with the full density gradient theory have been used to calculate the surface tension of various...
Adaptive Regularization of Neural Networks Using Conjugate Gradient
Goutte, Cyril; Larsen, Jan
1998-01-01
Andersen et al. (1997) and Larsen et al. (1996, 1997) suggested a regularization scheme which iteratively adapts regularization parameters by minimizing validation error using simple gradient descent. In this contribution we present an improved algorithm based on the conjugate gradient technique........ Numerical experiments with feedforward neural networks successfully demonstrate improved generalization ability and lower computational cost...
New preconditioned conjugate gradient algorithms for nonlinear unconstrained optimization problems
Al-Bayati, A.; Al-Asadi, N.
1997-01-01
This paper presents two new predilection conjugate gradient algorithms for nonlinear unconstrained optimization problems and examines their computational performance. Computational experience shows that the new proposed algorithms generally imp lone the efficiency of Nazareth's [13] preconditioned conjugate gradient algorithm. (authors). 16 refs., 1 tab
Perturbation expansions generated by an approximate propagator
Znojil, M.
1987-01-01
Starting from a knowledge of an approximate propagator R at some trial energy guess E 0 , a new perturbative prescription for p-plet of bound states and of their energies is proposed. It generalizes the Rayleigh-Schroedinger (RS) degenerate perturbation theory to the nondiagonal operators R (eliminates a RS need of their diagnolisation) and defines an approximate Hamiltonian T by mere inversion. The deviation V of T from the exact Hamiltonian H is assumed small only after a substraction of a further auxiliary Hartree-Fock-like separable ''selfconsistent'' potential U of rank p. The convergence is illustrated numerically on the anharmonic oscillator example
Spherical Approximation on Unit Sphere
Eman Samir Bhaya
2018-01-01
Full Text Available In this paper we introduce a Jackson type theorem for functions in LP spaces on sphere And study on best approximation of functions in spaces defined on unit sphere. our central problem is to describe the approximation behavior of functions in spaces for by modulus of smoothness of functions.
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.
Consolidation by Prefabricated Vertical Drains with a Threshold Gradient
Xiao Guo; Kang-He Xie; Yue-Bao Deng
2014-01-01
This paper shows the development of an approximate analytical solution of radial consolidation by prefabricated vertical drains with a threshold gradient. To understand the effect of the threshold gradient on consolidation, a parametric analysis was performed using the present solution. The applicability of the present solution was demonstrated in two cases, wherein the comparisons with Hansbo’s results and observed data were conducted. It was found that (1) the flow with the threshold gradie...
Odic, Darko; Lisboa, Juan Valle; Eisinger, Robert; Olivera, Magdalena Gonzalez; Maiche, Alejandro; Halberda, Justin
2016-01-01
What is the relationship between our intuitive sense of number (e.g., when estimating how many marbles are in a jar), and our intuitive sense of other quantities, including time (e.g., when estimating how long it has been since we last ate breakfast)? Recent work in cognitive, developmental, comparative psychology, and computational neuroscience has suggested that our representations of approximate number, time, and spatial extent are fundamentally linked and constitute a "generalized magnitude system". But, the shared behavioral and neural signatures between number, time, and space may alternatively be due to similar encoding and decision-making processes, rather than due to shared domain-general representations. In this study, we investigate the relationship between approximate number and time in a large sample of 6-8 year-old children in Uruguay by examining how individual differences in the precision of number and time estimation correlate with school mathematics performance. Over four testing days, each child completed an approximate number discrimination task, an approximate time discrimination task, a digit span task, and a large battery of symbolic math tests. We replicate previous reports showing that symbolic math abilities correlate with approximate number precision and extend those findings by showing that math abilities also correlate with approximate time precision. But, contrary to approximate number and time sharing common representations, we find that each of these dimensions uniquely correlates with formal math: approximate number correlates more strongly with formal math compared to time and continues to correlate with math even when precision in time and individual differences in working memory are controlled for. These results suggest that there are important differences in the mental representations of approximate number and approximate time and further clarify the relationship between quantity representations and mathematics. Copyright
Approximate Dynamic Programming: Combining Regional and Local State Following Approximations.
Deptula, Patryk; Rosenfeld, Joel A; Kamalapurkar, Rushikesh; Dixon, Warren E
2018-06-01
An infinite-horizon optimal regulation problem for a control-affine deterministic system is solved online using a local state following (StaF) kernel and a regional model-based reinforcement learning (R-MBRL) method to approximate the value function. Unlike traditional methods such as R-MBRL that aim to approximate the value function over a large compact set, the StaF kernel approach aims to approximate the value function in a local neighborhood of the state that travels within a compact set. In this paper, the value function is approximated using a state-dependent convex combination of the StaF-based and the R-MBRL-based approximations. As the state enters a neighborhood containing the origin, the value function transitions from being approximated by the StaF approach to the R-MBRL approach. Semiglobal uniformly ultimately bounded (SGUUB) convergence of the system states to the origin is established using a Lyapunov-based analysis. Simulation results are provided for two, three, six, and ten-state dynamical systems to demonstrate the scalability and performance of the developed method.
Gradient computation for VTI acoustic wavefield tomography
Li, Vladimir
2016-09-06
Wavefield tomography can handle complex subsurface geology better than ray-based techniques and, ultimately, provide a higher resolution. Here, we implement forward and adjoint wavefield extrapolation for VTI (transversely isotropic with a vertical symmetry axis) media using a pseudospectral operator that employes a separable approximation of the P-wave dispersion relation. This operator is employed to derive the gradients of the differential semblance optimization (DSO) and modified stack-power objective functions. We also obtain the gradient expressions for the data-domain objective function, which can incorporate borehole information necessary for stable VTI velocity analysis. These gradients are compared to the ones obtained with a space-time finite-difference (FD) scheme for a system of coupled wave equations. Whereas the kernels computed with the two wave-equation operators are similar, the pseudospectral method is not hampered by the imprint of the shear-wave artifact. Numerical examples also show that the modified stack-power objective function produces cleaner gradients than the more conventional DSO operator.
Pawlak algebra and approximate structure on fuzzy lattice.
Zhuang, Ying; Liu, Wenqi; Wu, Chin-Chia; Li, Jinhai
2014-01-01
The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties.
On transparent potentials: a Born approximation study
Coudray, C.
1980-01-01
In the frame of the scattering inverse problem at fixed energy, a class of potentials transparent in Born approximation is obtained. All these potentials are spherically symmetric and are oscillating functions of the reduced radial variable. Amongst them, the Born approximation of the transparent potential of the Newton-Sabatier method is found. In the same class, quasi-transparent potentials are exhibited. Very general features of potentials transparent in Born approximation are then stated. And bounds are given for the exact scattering amplitudes corresponding to most of the potentials previously exhibited. These bounds, obtained at fixed energy, and for large values of the angular momentum, are found to be independent on the energy
Resummation of perturbative QCD by pade approximants
Gardi, E.
1997-01-01
In this lecture I present some of the new developments concerning the use of Pade Approximants (PA's) for resuming perturbative series in QCD. It is shown that PA's tend to reduce the renormalization scale and scheme dependence as compared to truncated series. In particular it is proven that in the limit where the β function is dominated by the 1-loop contribution, there is an exact symmetry that guarantees invariance of diagonal PA's under changing the renormalization scale. In addition it is shown that in the large β 0 approximation diagonal PA's can be interpreted as a systematic method for approximating the flow of momentum in Feynman diagrams. This corresponds to a new multiple scale generalization of the Brodsky-Lepage-Mackenzie (BLM) method to higher orders. I illustrate the method with the Bjorken sum rule and the vacuum polarization function. (author)
Fast wavelet based sparse approximate inverse preconditioner
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.
Approximation theorems by Meyer-Koenig and Zeller type operators
Ali Ozarslan, M.; Duman, Oktay
2009-01-01
This paper is mainly connected with the approximation properties of Meyer-Koenig and Zeller (MKZ) type operators. We first introduce a general sequence of MKZ operators based on q-integers and then obtain a Korovkin-type approximation theorem for these operators. We also compute their rates of convergence by means of modulus of continuity and the elements of Lipschitz class functionals. Furthermore, we give an rth order generalization of our operators in order to get some explicit approximation results.
Upper bounds on minimum cardinality of exact and approximate reducts
Chikalov, Igor
2010-01-01
In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.
The efficiency of Flory approximation
Obukhov, S.P.
1984-01-01
The Flory approximation for the self-avoiding chain problem is compared with a conventional perturbation theory expansion. While in perturbation theory each term is averaged over the unperturbed set of configurations, the Flory approximation is equivalent to the perturbation theory with the averaging over the stretched set of configurations. This imposes restrictions on the integration domain in higher order terms and they can be treated self-consistently. The accuracy δν/ν of Flory approximation for self-avoiding chain problems is estimated to be 2-5% for 1 < d < 4. (orig.)
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.
Rollout sampling approximate policy iteration
Dimitrakakis, C.; Lagoudakis, M.G.
2008-01-01
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a
Weighted approximation with varying weight
Totik, Vilmos
1994-01-01
A new construction is given for approximating a logarithmic potential by a discrete one. This yields a new approach to approximation with weighted polynomials of the form w"n"(" "= uppercase)P"n"(" "= uppercase). The new technique settles several open problems, and it leads to a simple proof for the strong asymptotics on some L p(uppercase) extremal problems on the real line with exponential weights, which, for the case p=2, are equivalent to power- type asymptotics for the leading coefficients of the corresponding orthogonal polynomials. The method is also modified toyield (in a sense) uniformly good approximation on the whole support. This allows one to deduce strong asymptotics in some L p(uppercase) extremal problems with varying weights. Applications are given, relating to fast decreasing polynomials, asymptotic behavior of orthogonal polynomials and multipoint Pade approximation. The approach is potential-theoretic, but the text is self-contained.
Framework for sequential approximate optimization
Jacobs, J.H.; Etman, L.F.P.; Keulen, van F.; Rooda, J.E.
2004-01-01
An object-oriented framework for Sequential Approximate Optimization (SAO) isproposed. The framework aims to provide an open environment for thespecification and implementation of SAO strategies. The framework is based onthe Python programming language and contains a toolbox of Python
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.
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.
On approximation of functions by product operators
Hare Krishna Nigam
2013-12-01
Full Text Available In the present paper, two quite new reults on the degree of approximation of a function f belonging to the class Lip(α,r, 1≤ r <∞ and the weighted class W(Lr,ξ(t, 1≤ r <∞ by (C,2(E,1 product operators have been obtained. The results obtained in the present paper generalize various known results on single operators.
Factorized Approximate Inverses With Adaptive Dropping
Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav
2016-01-01
Roč. 38, č. 3 (2016), A1807-A1820 ISSN 1064-8275 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverses * incomplete factorization * Gram–Schmidt orthogonalization * preconditioned iterative methods Subject RIV: BA - General Mathematics Impact factor: 2.195, year: 2016
Approximation for limit cycles and their isochrons.
Demongeot, Jacques; Françoise, Jean-Pierre
2006-12-01
Local analysis of trajectories of dynamical systems near an attractive periodic orbit displays the notion of asymptotic phase and isochrons. These notions are quite useful in applications to biosciences. In this note, we give an expression for the first approximation of equations of isochrons in the setting of perturbations of polynomial Hamiltonian systems. This method can be generalized to perturbations of systems that have a polynomial integral factor (like the Lotka-Volterra equation).
An analytical approximation for resonance integral
Magalhaes, C.G. de; Martinez, A.S.
1985-01-01
It is developed a method which allows to obtain an analytical solution for the resonance integral. The problem formulation is completely theoretical and based in concepts of physics of general character. The analytical expression for integral does not involve any empiric correlation or parameter. Results of approximation are compared with pattern values for each individual resonance and for sum of all resonances. (M.C.K.) [pt
Győrffy, Werner; Knizia, Gerald; Werner, Hans-Joachim
2017-12-01
We present the theory and algorithms for computing analytical energy gradients for explicitly correlated second-order Møller-Plesset perturbation theory (MP2-F12). The main difficulty in F12 gradient theory arises from the large number of two-electron integrals for which effective two-body density matrices and integral derivatives need to be calculated. For efficiency, the density fitting approximation is used for evaluating all two-electron integrals and their derivatives. The accuracies of various previously proposed MP2-F12 approximations [3C, 3C(HY1), 3*C(HY1), and 3*A] are demonstrated by computing equilibrium geometries for a set of molecules containing first- and second-row elements, using double-ζ to quintuple-ζ basis sets. Generally, the convergence of the bond lengths and angles with respect to the basis set size is strongly improved by the F12 treatment, and augmented triple-ζ basis sets are sufficient to closely approach the basis set limit. The results obtained with the different approximations differ only very slightly. This paper is the first step towards analytical gradients for coupled-cluster singles and doubles with perturbative treatment of triple excitations, which will be presented in the second part of this series.
Effects of scattering anisotropy approximation in multigroup radiation shielding calculations
Altiparmakov, D.
1983-01-01
Expansion of the scattering cross sections into Legendre series is the usual way of solving neutron transport problems. Because of the large space gradients of the neutron flux, the effects of that approximation become especially remarkable in the radiation shielding calculations. In this paper, a method taking into account the scattering anisotropy is presented. From the point od view of the accuracy and computing rate, the optimal approximation of the scattering anisotropy is established for the basic protective materials on the basis of simple problem calculations. (author)
BAKER, DR; STAEBLER, GM; PETTY, CC; GREENFIELD, CM; LUCE, TC
2003-01-01
OAK-B135 The gyrokinetic equations predict that various drift type waves or modes can be unstable in a tokamak. For some of these modes, such as the ion temperature gradient (ITG) mode and the electron temperature gradient mode, there exists a critical gradient, above which the mode is unstable. Since the existence of unstable modes can cause increased transport, plasmas which are centrally heated tend to increase in temperature gradient until the modes become unstable. Under some conditions the increased transport can fix the gradient at the critical value. here they present a comparison between the measured ion temperature gradients and the critical gradient as calculated by a gyrokinetic linear stability (GKS) code. They also present the maximum linear growth rate as calculated by this code for comparison to experimentally derived transport coefficients. The results show that for low confinement mode (L-mode) discharges, the measured ion temperature gradient is significantly greater than the GKS calculated critical gradient over a large region of the plasma. This is the same region of the plasma where the ion thermal diffusivity is large. For high confinement mode (H-mode) discharges the ion temperature gradient is closer to the critical gradient, but often still greater than the critical gradient over some region. For the best H-mode discharges, the ion temperature is less than or equal to the critical gradient over the whole plasma. In general they find that the position in the plasma where the ion thermal diffusivity starts to increase rapidly is where the maximum linear growth rate is greater than the E x B shearing rate
Application of preconditioned conjugate gradient-like methods to reactor kinetics
Yang, D.Y.; Chen, G.S.; Chou, H.P.
1993-01-01
Several conjugate gradient-like (CG-like) methods are applied to solve the nonsymmetric linear systems of equations derived from the time-dependent two-dimensional two-energy-group neutron diffusion equations by a finite difference approximation. The methods are: the generalized conjugate residual method; the generalized conjugate gradient least-square method; the generalized minimal residual method (GMRES); the conjugate gradient square method; and a variant of bi-conjugate gradient method (Bi-CGSTAB). In order to accelerate these methods, six preconditioning techniques are investigated. Two are based on pointwise incomplete factorization: the incomplete LU (ILU) and the modified incomplete LU (MILU) decompositions; two, based on the block tridiagonal structure of the coefficient matrix, are blockwise and modified blockwise incomplete factorizations, BILU and MBILU; two are the alternating-direction implicit and symmetric successive overrelaxation (SSOR) preconditioners, derived from the basic iterative schemes. Comparisons are made by using CG-like methods combined with different preconditioners to solve a sequence of time-step reactor transient problems. Numerical tests indicate that preconditioned BI-CGSTAB with the preconditioner MBILU requires less CPU time and fewer iterations than other methods. The preconditioned CG-like methods are less sensitive to the time-step size used than the Chebyshev semi-iteration method and line SOR method. The indication is that the CGS, Bi-CGSTAB and GMRES methods are, on average, better than the other methods in reactor kinetics computation and that a good preconditioner is more important than the choice of CG-like methods. The MILU decomposition based on the conventional row-sum criterion has difficulty yielding a convergent solution and an improved version is introduced. (author)
Nuclear Hartree-Fock approximation testing and other related approximations
Cohenca, J.M.
1970-01-01
Hartree-Fock, and Tamm-Dancoff approximations are tested for angular momentum of even-even nuclei. Wave functions, energy levels and momenta are comparatively evaluated. Quadripole interactions are studied following the Elliott model. Results are applied to Ne 20 [pt
Refined discrete and empirical horizontal gradients in VLBI analysis
Landskron, Daniel; Böhm, Johannes
2018-02-01
Missing or incorrect consideration of azimuthal asymmetry of troposphere delays is a considerable error source in space geodetic techniques such as Global Navigation Satellite Systems (GNSS) or Very Long Baseline Interferometry (VLBI). So-called horizontal troposphere gradients are generally utilized for modeling such azimuthal variations and are particularly required for observations at low elevation angles. Apart from estimating the gradients within the data analysis, which has become common practice in space geodetic techniques, there is also the possibility to determine the gradients beforehand from different data sources than the actual observations. Using ray-tracing through Numerical Weather Models (NWMs), we determined discrete gradient values referred to as GRAD for VLBI observations, based on the standard gradient model by Chen and Herring (J Geophys Res 102(B9):20489-20502, 1997. https://doi.org/10.1029/97JB01739) and also for new, higher-order gradient models. These gradients are produced on the same data basis as the Vienna Mapping Functions 3 (VMF3) (Landskron and Böhm in J Geod, 2017.https://doi.org/10.1007/s00190-017-1066-2), so they can also be regarded as the VMF3 gradients as they are fully consistent with each other. From VLBI analyses of the Vienna VLBI and Satellite Software (VieVS), it becomes evident that baseline length repeatabilities (BLRs) are improved on average by 5% when using a priori gradients GRAD instead of estimating the gradients. The reason for this improvement is that the gradient estimation yields poor results for VLBI sessions with a small number of observations, while the GRAD a priori gradients are unaffected from this. We also developed a new empirical gradient model applicable for any time and location on Earth, which is included in the Global Pressure and Temperature 3 (GPT3) model. Although being able to describe only the systematic component of azimuthal asymmetry and no short-term variations at all, even these
Shearlets and Optimally Sparse Approximations
Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q
2012-01-01
Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...... to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field....
Approximations to camera sensor noise
Jin, Xiaodan; Hirakawa, Keigo
2013-02-01
Noise is present in all image sensor data. Poisson distribution is said to model the stochastic nature of the photon arrival process, while it is common to approximate readout/thermal noise by additive white Gaussian noise (AWGN). Other sources of signal-dependent noise such as Fano and quantization also contribute to the overall noise profile. Question remains, however, about how best to model the combined sensor noise. Though additive Gaussian noise with signal-dependent noise variance (SD-AWGN) and Poisson corruption are two widely used models to approximate the actual sensor noise distribution, the justification given to these types of models are based on limited evidence. The goal of this paper is to provide a more comprehensive characterization of random noise. We concluded by presenting concrete evidence that Poisson model is a better approximation to real camera model than SD-AWGN. We suggest further modification to Poisson that may improve the noise model.
Rational approximations for tomographic reconstructions
Reynolds, Matthew; Beylkin, Gregory; Monzón, Lucas
2013-01-01
We use optimal rational approximations of projection data collected in x-ray tomography to improve image resolution. Under the assumption that the object of interest is described by functions with jump discontinuities, for each projection we construct its rational approximation with a small (near optimal) number of terms for a given accuracy threshold. This allows us to augment the measured data, i.e., double the number of available samples in each projection or, equivalently, extend (double) the domain of their Fourier transform. We also develop a new, fast, polar coordinate Fourier domain algorithm which uses our nonlinear approximation of projection data in a natural way. Using augmented projections of the Shepp–Logan phantom, we provide a comparison between the new algorithm and the standard filtered back-projection algorithm. We demonstrate that the reconstructed image has improved resolution without additional artifacts near sharp transitions in the image. (paper)
Approximation methods in probability theory
Čekanavičius, Vydas
2016-01-01
This book presents a wide range of well-known and less common methods used for estimating the accuracy of probabilistic approximations, including the Esseen type inversion formulas, the Stein method as well as the methods of convolutions and triangle function. Emphasising the correct usage of the methods presented, each step required for the proofs is examined in detail. As a result, this textbook provides valuable tools for proving approximation theorems. While Approximation Methods in Probability Theory will appeal to everyone interested in limit theorems of probability theory, the book is particularly aimed at graduate students who have completed a standard intermediate course in probability theory. Furthermore, experienced researchers wanting to enlarge their toolkit will also find this book useful.
Prudnikov, O. N.; Taichenachev, A. V.; Tumaikin, A. M.; Yudin, V. I.
2007-01-01
Generally, conditions for deep sub-Doppler laser cooling do not match conditions for strong atomic localization, that takes place in a deeper optical potential and leads to higher temperature. Moreover, for a given detuning in a deep optical potential the secular approximation, which is frequently used for a quantum description of laser cooling, fails. Here we investigate the atomic localization in optical potential, using a full quantum approach for atomic density matrix beyond the secular approximation. It is shown that laser cooling in a deep optical potential, created by a light field with polarization gradients, can be used as an alternative method for the formation of high contrast spatially localized structures of atoms for the purposes of atom lithography and atomic nanofabrication. Finally, we analyze possible limits for the width and contrast of localized atomic structures that can be reached in this type of light mask
Gougam, L.A.; Taibi, H.; Chikhi, A.; Mekideche-Chafa, F.
2009-01-01
The problem of determining the analytical description for a set of data arises in numerous sciences and applications and can be referred to as data modeling or system identification. Neural networks are a convenient means of representation because they are known to be universal approximates that can learn data. The desired task is usually obtained by a learning procedure which consists in adjusting the s ynaptic weights . For this purpose, many learning algorithms have been proposed to update these weights. The convergence for these learning algorithms is a crucial criterion for neural networks to be useful in different applications. The aim of the present contribution is to use a training algorithm for feed forward wavelet networks used for function approximation. The training is based on the minimization of the least-square cost function. The minimization is performed by iterative second order gradient-based methods. We make use of the Levenberg-Marquardt algorithm to train the architecture of the chosen network and, then, the training procedure starts with a simple gradient method which is followed by a BFGS (Broyden, Fletcher, Glodfarb et Shanno) algorithm. The performances of the two algorithms are then compared. Our method is then applied to determine the energy of the ground state associated to a sextic potential. In fact, the Schrodinger equation does not always admit an exact solution and one has, generally, to solve it numerically. To this end, the sextic potential is, firstly, approximated with the above outlined wavelet network and, secondly, implemented into a numerical scheme. Our results are in good agreement with the ones found in the literature.
Approximate reasoning in physical systems
Mutihac, R.
1991-01-01
The theory of fuzzy sets provides excellent ground to deal with fuzzy observations (uncertain or imprecise signals, wavelengths, temperatures,etc.) fuzzy functions (spectra and depth profiles) and fuzzy logic and approximate reasoning. First, the basic ideas of fuzzy set theory are briefly presented. Secondly, stress is put on application of simple fuzzy set operations for matching candidate reference spectra of a spectral library to an unknown sample spectrum (e.g. IR spectroscopy). Thirdly, approximate reasoning is applied to infer an unknown property from information available in a database (e.g. crystal systems). Finally, multi-dimensional fuzzy reasoning techniques are suggested. (Author)
Face Recognition using Approximate Arithmetic
Marso, Karol
Face recognition is image processing technique which aims to identify human faces and found its use in various diﬀerent ﬁelds for example in security. Throughout the years this ﬁeld evolved and there are many approaches and many diﬀerent algorithms which aim to make the face recognition as eﬀective...... processing applications the results do not need to be completely precise and use of the approximate arithmetic can lead to reduction in terms of delay, space and power consumption. In this paper we examine possible use of approximate arithmetic in face recognition using Eigenfaces algorithm....
Near-surface temperature gradient in a coastal upwelling regime
Maske, H.; Ochoa, J.; Almeda-Jauregui, C. O.; Ruiz-de la Torre, M. C.; Cruz-López, R.; Villegas-Mendoza, J. R.
2014-08-01
In oceanography, a near homogeneous mixed layer extending from the surface to a seasonal thermocline is a common conceptual basis in physics, chemistry, and biology. In a coastal upwelling region 3 km off the coast in the Mexican Pacific, we measured vertical density gradients with a free-rising CTD and temperature gradients with thermographs at 1, 3, and 5 m depths logging every 5 min during more than a year. No significant salinity gradient was observed down to 10 m depth, and the CTD temperature and density gradients showed no pronounced discontinuity that would suggest a near-surface mixed layer. Thermographs generally logged decreasing temperature with depth with gradients higher than 0.2 K m-1 more than half of the time in the summer between 1 and 3 m, 3 and 5 m and in the winter between 1 and 3 m. Some negative temperature gradients were present and gradients were generally highly variable in time with high peaks lasting fractions of hours to hours. These temporal changes were too rapid to be explained by local heating or cooling. The pattern of positive and negative peaks might be explained by vertical stacks of water layers of different temperatures and different horizontal drift vectors. The observed near-surface gradient has implications for turbulent wind energy transfer, vertical exchange of dissolved and particulate water constituents, the interpretation of remotely sensed SST, and horizontal wind-induced transport.
Higher-order force gradient symplectic algorithms
Chin, Siu A.; Kidwell, Donald W.
2000-12-01
We show that a recently discovered fourth order symplectic algorithm, which requires one evaluation of force gradient in addition to three evaluations of the force, when iterated to higher order, yielded algorithms that are far superior to similarly iterated higher order algorithms based on the standard Forest-Ruth algorithm. We gauge the accuracy of each algorithm by comparing the step-size independent error functions associated with energy conservation and the rotation of the Laplace-Runge-Lenz vector when solving a highly eccentric Kepler problem. For orders 6, 8, 10, and 12, the new algorithms are approximately a factor of 103, 104, 104, and 105 better.
Error Estimation in Preconditioned Conjugate Gradients
Strakoš, Zdeněk; Tichý, Petr
2005-01-01
Roč. 45, - (2005), s. 789-817 ISSN 0006-3835 R&D Projects: GA AV ČR 1ET400300415; GA AV ČR KJB1030306 Institutional research plan: CEZ:AV0Z10300504 Keywords : preconditioned conjugate gradient method * error bounds * stopping criteria * evaluation of convergence * numerical stability * finite precision arithmetic * rounding errors Subject RIV: BA - General Mathematics Impact factor: 0.509, year: 2005
Pressure gradient turbulent transport and collisionless reconnection
Connor, J.W.
1993-01-01
The scale invariance technique is employed to discuss pressure gradient driven turbulent transport when an Ohm's law with electron inertia, rather than resistivity, is relevant. An expression for thermal diffusivity which has many features appropriate to L-mode transport in tokamaks, is seen to have greater generality than indicated by their particular calculation. The results of applying the technique to a more appropriate collisionless Ohm's law are discussed. (Author)
Constantin, Lucian A; Fabiano, Eduardo; Della Sala, Fabio
2017-09-12
Using the semiclassical neutral atom theory, we developed a modified fourth-order kinetic energy (KE) gradient expansion (GE4m) that keeps unchanged all the linear-response terms of the uniform electron gas and gives a significant improvement with respect to the known semilocal functionals for both large atoms and jellium surfaces. On the other hand, GE4m is not accurate for light atoms; thus, we modified the GE4m coefficients making them dependent on a novel ingredient, the reduced Hartree potential, recently introduced in the Journal of Chemical Physics 2016, 145, 084110, in the context of exchange functionals. The resulting KE gradient expansion functional, named uGE4m, belongs to the novel class of u-meta-generalized-gradient-approximations (uMGGA) whose members depend on the conventional ingredients (i.e., the reduced gradient and Laplacian of the density) as well as on the reduced Hartree potential. To test uGE4m, we defined an appropriate benchmark (including total KE and KE differences for atoms, molecules and jellium clusters) for gradient expansion functionals, that is, including only those systems which are mainly described by a slowly varying density regime. While most of the GGA and meta-GGA KE functionals (we tested 18 of them) are accurate for some properties and inaccurate for others, uGE4m shows a consistently good performance for all the properties considered. This represents a qualitative boost in the KE functional development and highlights the importance of the reduced Hartree potential for the construction of next-generation KE functionals.
Gradient Boosting Machines, A Tutorial
Alexey eNatekin
2013-12-01
Full Text Available Gradient boosting machines are a family of powerful machine-learning techniques that have shown considerable success in a wide range of practical applications. They are highly customizable to the particular needs of the application, like being learned with respect to different loss functions. This article gives a tutorial introduction into the methodology of gradient boosting methods. A theoretical information is complemented with many descriptive examples and illustrations which cover all the stages of the gradient boosting model design. Considerations on handling the model complexity are discussed. A set of practical examples of gradient boosting applications are presented and comprehensively analyzed.
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...
Approximate Matching of Hierarchial Data
Augsten, Nikolaus
-grams of a tree are all its subtrees of a particular shape. Intuitively, two trees are similar if they have many pq-grams in common. The pq-gram distance is an efficient and effective approximation of the tree edit distance. We analyze the properties of the pq-gram distance and compare it with the tree edit...
Approximation of Surfaces by Cylinders
Randrup, Thomas
1998-01-01
We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...
Approximation properties of haplotype tagging
Dreiseitl Stephan
2006-01-01
Full Text Available Abstract Background Single nucleotide polymorphisms (SNPs are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns, disease association studies are facilitated by identifying SNPs that allow the unique identification of such patterns. This process, known as haplotype tagging, is formulated as a combinatorial optimization problem and analyzed in terms of complexity and approximation properties. Results It is shown that the tagging problem is NP-hard but approximable within 1 + ln((n2 - n/2 for n haplotypes but not approximable within (1 - ε ln(n/2 for any ε > 0 unless NP ⊂ DTIME(nlog log n. A simple, very easily implementable algorithm that exhibits the above upper bound on solution quality is presented. This algorithm has running time O((2m - p + 1 ≤ O(m(n2 - n/2 where p ≤ min(n, m for n haplotypes of size m. As we show that the approximation bound is asymptotically tight, the algorithm presented is optimal with respect to this asymptotic bound. Conclusion The haplotype tagging problem is hard, but approachable with a fast, practical, and surprisingly simple algorithm that cannot be significantly improved upon on a single processor machine. Hence, significant improvement in computatational efforts expended can only be expected if the computational effort is distributed and done in parallel.
All-Norm Approximation Algorithms
Azar, Yossi; Epstein, Leah; Richter, Yossi; Woeginger, Gerhard J.; Penttonen, Martti; Meineche Schmidt, Erik
2002-01-01
A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different ℓ p norms. We address this problem by introducing the concept of an All-norm ρ-approximation
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...
Approximate reasoning in decision analysis
Gupta, M M; Sanchez, E
1982-01-01
The volume aims to incorporate the recent advances in both theory and applications. It contains 44 articles by 74 contributors from 17 different countries. The topics considered include: membership functions; composite fuzzy relations; fuzzy logic and inference; classifications and similarity measures; expert systems and medical diagnosis; psychological measurements and human behaviour; approximate reasoning and decision analysis; and fuzzy clustering algorithms.
Pythagorean Approximations and Continued Fractions
Peralta, Javier
2008-01-01
In this article, we will show that the Pythagorean approximations of [the square root of] 2 coincide with those achieved in the 16th century by means of continued fractions. Assuming this fact and the known relation that connects the Fibonacci sequence with the golden section, we shall establish a procedure to obtain sequences of rational numbers…
Ultrafast Approximation for Phylogenetic Bootstrap
Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt
Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and
Lognormal Approximations of Fault Tree Uncertainty Distributions.
El-Shanawany, Ashraf Ben; Ardron, Keith H; Walker, Simon P
2018-01-26
Fault trees are used in reliability modeling to create logical models of fault combinations that can lead to undesirable events. The output of a fault tree analysis (the top event probability) is expressed in terms of the failure probabilities of basic events that are input to the model. Typically, the basic event probabilities are not known exactly, but are modeled as probability distributions: therefore, the top event probability is also represented as an uncertainty distribution. Monte Carlo methods are generally used for evaluating the uncertainty distribution, but such calculations are computationally intensive and do not readily reveal the dominant contributors to the uncertainty. In this article, a closed-form approximation for the fault tree top event uncertainty distribution is developed, which is applicable when the uncertainties in the basic events of the model are lognormally distributed. The results of the approximate method are compared with results from two sampling-based methods: namely, the Monte Carlo method and the Wilks method based on order statistics. It is shown that the closed-form expression can provide a reasonable approximation to results obtained by Monte Carlo sampling, without incurring the computational expense. The Wilks method is found to be a useful means of providing an upper bound for the percentiles of the uncertainty distribution while being computationally inexpensive compared with full Monte Carlo sampling. The lognormal approximation method and Wilks's method appear attractive, practical alternatives for the evaluation of uncertainty in the output of fault trees and similar multilinear models. © 2018 Society for Risk Analysis.
Gradient waveform synthesis for magnetic propulsion using MRI gradient coils
Han, B H; Lee, S Y; Park, S
2008-01-01
Navigating an untethered micro device in a living subject is of great interest for both diagnostic and therapeutic applications. Magnetic propulsion of an untethered device carrying a magnetic core in it is one of the promising methods to navigate the device. MRI gradients coils are thought to be suitable for navigating the device since they are capable of magnetic propulsion in any direction while providing magnetic resonance images. For precise navigation of the device, especially in the peripheral region of the gradient coils, the concomitant gradient fields, as well as the linear gradient fields in the main magnetic field direction, should be considered in driving the gradient coils. For simple gradient coil configurations, the Maxwell coil in the z-direction and the Golay coil in the x- and y-directions, we have calculated the magnetic force fields, which are not necessarily the same as the conventional linear gradient fields of MRI. Using the calculated magnetic force fields, we have synthesized gradient waveforms to navigate the device along a desired path
Approximating the Shifted Hartree-Exchange-Correlation Potential in Direct Energy Kohn-Sham Theory.
Sharpe, Daniel J; Levy, Mel; Tozer, David J
2018-02-13
Levy and Zahariev [Phys. Rev. Lett. 113 113002 (2014)] have proposed a new approach for performing density functional theory calculations, termed direct energy Kohn-Sham (DEKS) theory. In this approach, the electronic energy equals the sum of orbital energies, obtained from Kohn-Sham-like orbital equations involving a shifted Hartree-exchange-correlation potential, which must be approximated. In the present study, density scaling homogeneity considerations are used to facilitate DEKS calculations on a series of atoms and molecules, leading to three nonlocal approximations to the shifted potential. The first two rely on preliminary Kohn-Sham calculations using a standard generalized gradient approximation (GGA) exchange-correlation functional and the results illustrate the benefit of describing the dominant Hartree component of the shift exactly. A uniform electron gas analysis is used to eliminate the need for these preliminary Kohn-Sham calculations, leading to a potential with an unconventional form that yields encouraging results, providing strong motivation for further research in DEKS theory.
Approximate models for broken clouds in stochastic radiative transfer theory
Doicu, Adrian; Efremenko, Dmitry S.; Loyola, Diego; Trautmann, Thomas
2014-01-01
This paper presents approximate models in stochastic radiative transfer theory. The independent column approximation and its modified version with a solar source computed in a full three-dimensional atmosphere are formulated in a stochastic framework and for arbitrary cloud statistics. The nth-order stochastic models describing the independent column approximations are equivalent to the nth-order stochastic models for the original radiance fields in which the gradient vectors are neglected. Fast approximate models are further derived on the basis of zeroth-order stochastic models and the independent column approximation. The so-called “internal mixing” models assume a combination of the optical properties of the cloud and the clear sky, while the “external mixing” models assume a combination of the radiances corresponding to completely overcast and clear skies. A consistent treatment of internal and external mixing models is provided, and a new parameterization of the closure coefficient in the effective thickness approximation is given. An efficient computation of the closure coefficient for internal mixing models, using a previously derived vector stochastic model as a reference, is also presented. Equipped with appropriate look-up tables for the closure coefficient, these models can easily be integrated into operational trace gas retrieval systems that exploit absorption features in the near-IR solar spectrum. - Highlights: • Independent column approximation in a stochastic setting. • Fast internal and external mixing models for total and diffuse radiances. • Efficient optimization of internal mixing models to match reference models
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.
Approximated solutions to Born-Infeld dynamics
Ferraro, Rafael; Nigro, Mauro
2016-01-01
The Born-Infeld equation in the plane is usefully captured in complex language. The general exact solution can be written as a combination of holomorphic and anti-holomorphic functions. However, this solution only expresses the potential in an implicit way. We rework the formulation to obtain the complex potential in an explicit way, by means of a perturbative procedure. We take care of the secular behavior common to this kind of approach, by resorting to a symmetry the equation has at the considered order of approximation. We apply the method to build approximated solutions to Born-Infeld electrodynamics. We solve for BI electromagnetic waves traveling in opposite directions. We study the propagation at interfaces, with the aim of searching for effects susceptible to experimental detection. In particular, we show that a reflected wave is produced when a wave is incident on a semi-space containing a magnetostatic field.
Denaturing gradient gel electrophoresis
Kocherginskaya, S.A.; Cann, I.K.O.; Mackie, R.I.
2005-01-01
It is worthwhile considering that only some 30 species make up the bulk of the bacterial population in human faeces at any one time based on the classical cultivation-based approach. The situation in the rumen is similar. Thus, it is practical to focus on specific groups of interest within the complex community. These may be the predominant or the most active species, specific physiological groups or readily identifiable (genetic) clusters of phylogenetically related organisms. Several 16S rDNA fingerprinting techniques can be invaluable for selecting and monitoring sequences or phylogenetic groups of interest and are described below. Over the past few decades, considerable attention was focussed on the identification of pure cultures of microbes on the basis of genetic polymorphisms of DNA encoding rRNA such as ribotyping, amplified fragment length polymorphism and randomly amplified polymorphic DNA. However, many of these methods require prior cultivation and are less suitable for use in analysis of complex mixed populations although important in describing cultivated microbial diversity in molecular terms. Much less attention was given to molecular characterization of complex communities. In particular, research into diversity and community structure over time has been revolutionized by the advent of molecular fingerprinting techniques for complex communities. Denaturing or temperature gradient gel electrophoresis (DGGE/TGGE) methods have been successfully applied to the analysis of human, pig, cattle, dog and rodent intestinal populations
TRANSFORMED GENERATE APPROXIMATION METHOD FOR ...
Ignatius & Ebimene
generalized boundary value problems with first-kind Chebychev polynomials as trial ... For this course, we will consider the generalized boundary value problem of the form: ... 0(1)( − 1), are finite real constants and is the .... b. Ax = (10) where the elements of , and (with elements denoted as ,.
Gradient angle estimation by uniform directional simulation on a cone
Ditlevsen, Ove Dalager
1997-01-01
approximation to a locally most central limit state point. Moreover, the estimated angle can be used to correct the geometric reliability index.\\bfseries Keywords: Directional simulation, effectivity factor, gradient angle estimation, maximum likelihood, model-correction-factor method, Monte Carlo simulation...
Bayesian posterior sampling via stochastic gradient Fisher scoring
Ahn, S.; Korattikara, A.; Welling, M.; Langford, J.; Pineau, J.
2012-01-01
In this paper we address the following question: "Can we approximately sample from a Bayesian posterior distribution if we are only allowed to touch a small mini-batch of data-items for every sample we generate?". An algorithm based on the Langevin equation with stochastic gradients (SGLD) was
MIMO feed-forward design in wafer scanners using a gradient approximation-based algorithm
Heertjes, M.F.; Hennekens, D.W.T.; Steinbuch, M.
2010-01-01
An experimental demonstration is given of a data-based multi-input multi-output (MIMO) feed-forward control design applied to the motion systems of a wafer scanner. Atop a nominal single-input single-output (SISO) feed-forward controller, a MIMO controller is designed having a finite impulse
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...... functional theory and the adiabatic connection fluctuation-dissipation theorem and contains no fitted parameters. The new kernel is shown to preserve the accurate description of dispersive interactions from RPA while significantly improving the description of short-range correlation in molecules, insulators......, and metals. For molecular atomization energies, the rALDA is a factor of 7 better than RPA and a factor of 4 better than the Perdew-Burke-Ernzerhof (PBE) functional when compared to experiments, and a factor of 3 (1.5) better than RPA (PBE) for cohesive energies of solids. For transition metals...
Hydrogen: Beyond the Classic Approximation
Scivetti, Ivan
2003-01-01
The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position
Approximation errors during variance propagation
Dinsmore, Stephen
1986-01-01
Risk and reliability analyses are often performed by constructing and quantifying large fault trees. The inputs to these models are component failure events whose probability of occuring are best represented as random variables. This paper examines the errors inherent in two approximation techniques used to calculate the top event's variance from the inputs' variance. Two sample fault trees are evaluated and several three dimensional plots illustrating the magnitude of the error over a wide range of input means and variances are given
Electric field gradients in metals
Schatz, G.
1979-01-01
A review of the recent works on electric field gradient in metals is given. The main emphasis is put on the temperature dependence of the electric field gradient in nonmagnetic metals. Some methods of investigation of this effect using nuclear probes are described. One of them is nuclear accoustic resonance method. (S.B.)
A multipoint flux approximation of the steady-state heat conduction equation in anisotropic media
Salama, Amgad; Sun, Shuyu; El-Amin, M. F.
2013-01-01
In this work, we introduce multipoint flux (MF) approximation method to the problem of conduction heat transfer in anisotropic media. In such media, the heat flux vector is no longer coincident with the temperature gradient vector. In this case, thermal conductivity is described as a second order tensor that usually requires, at least, six quantities to be fully defined in general three-dimensional problems. The two-point flux finite differences approximation may not handle such anisotropy and essentially more points need to be involved to describe the heat flux vector. In the framework of mixed finite element method (MFE), the MFMFE methods are locally conservative with continuous normal fluxes. We consider the lowest order Brezzi-Douglas-Marini (BDM) mixed finite element method with a special quadrature rule that allows for nodal velocity elimination resulting in a cell-centered system for the temperature. We show comparisons with some analytical solution of the problem of conduction heat transfer in anisotropic long strip. We also consider the problem of heat conduction in a bounded, rectangular domain with different anisotropy scenarios. It is noticed that the temperature field is significantly affected by such anisotropy scenarios. Also, the technique used in this work has shown that it is possible to use the finite difference settings to handle heat transfer in anisotropic media. In this case, heat flux vectors, for the case of rectangular mesh, generally require six points to be described. Copyright © 2013 by ASME.
A multipoint flux approximation of the steady-state heat conduction equation in anisotropic media
Salama, Amgad
2013-03-20
In this work, we introduce multipoint flux (MF) approximation method to the problem of conduction heat transfer in anisotropic media. In such media, the heat flux vector is no longer coincident with the temperature gradient vector. In this case, thermal conductivity is described as a second order tensor that usually requires, at least, six quantities to be fully defined in general three-dimensional problems. The two-point flux finite differences approximation may not handle such anisotropy and essentially more points need to be involved to describe the heat flux vector. In the framework of mixed finite element method (MFE), the MFMFE methods are locally conservative with continuous normal fluxes. We consider the lowest order Brezzi-Douglas-Marini (BDM) mixed finite element method with a special quadrature rule that allows for nodal velocity elimination resulting in a cell-centered system for the temperature. We show comparisons with some analytical solution of the problem of conduction heat transfer in anisotropic long strip. We also consider the problem of heat conduction in a bounded, rectangular domain with different anisotropy scenarios. It is noticed that the temperature field is significantly affected by such anisotropy scenarios. Also, the technique used in this work has shown that it is possible to use the finite difference settings to handle heat transfer in anisotropic media. In this case, heat flux vectors, for the case of rectangular mesh, generally require six points to be described. Copyright © 2013 by ASME.
WKB approximation in atomic physics
Karnakov, Boris Mikhailovich
2013-01-01
Provides extensive coverage of the Wentzel-Kramers-Brillouin approximation and its applications. Presented as a sequence of problems with highly detailed solutions. Gives a concise introduction for calculating Rydberg states, potential barriers and quasistationary systems. This book has evolved from lectures devoted to applications of the Wentzel-Kramers-Brillouin- (WKB or quasi-classical) approximation and of the method of 1/N -expansion for solving various problems in atomic and nuclear physics. The intent of this book is to help students and investigators in this field to extend their knowledge of these important calculation methods in quantum mechanics. Much material is contained herein that is not to be found elsewhere. WKB approximation, while constituting a fundamental area in atomic physics, has not been the focus of many books. A novel method has been adopted for the presentation of the subject matter, the material is presented as a succession of problems, followed by a detailed way of solving them. The methods introduced are then used to calculate Rydberg states in atomic systems and to evaluate potential barriers and quasistationary states. Finally, adiabatic transition and ionization of quantum systems are covered.
An approximation method for diffusion based leaching models
Shukla, B.S.; Dignam, M.J.
1987-01-01
In connection with the fixation of nuclear waste in a glassy matrix equations have been derived for leaching models based on a uniform concentration gradient approximation, and hence a uniform flux, therefore requiring the use of only Fick's first law. In this paper we improve on the uniform flux approximation, developing and justifying the approach. The resulting set of equations are solved to a satisfactory approximation for a matrix dissolving at a constant rate in a finite volume of leachant to give analytical expressions for the time dependence of the thickness of the leached layer, the diffusional and dissolutional contribution to the flux, and the leachant composition. Families of curves are presented which cover the full range of all the physical parameters for this system. The same procedure can be readily extended to more complex systems. (author)
Space-efficient path-reporting approximate distance oracles
Elkin, Michael; Neiman, Ofer; Wulff-Nilsen, Christian
2016-01-01
We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirements, for general undirected graphs. For distance oracles, we show how to break the nlogn space bound of Thorup and Zwick if approximate paths rather than distances need...
Lakhin, V. P.; Ilgisonis, V. I.; Smolyakov, A. I.; Sorokina, E. A.; Marusov, N. A.
2018-01-01
The gradient-drift instabilities of partially magnetized plasmas in plasma devices with crossed electric and magnetic fields are investigated in the framework of the two-fluid model with finite electron temperature in an inhomogeneous magnetic field. The finite electron Larmor radius (FLR) effects are also included via the gyroviscosity tensor taking into account the magnetic field gradient. This model correctly describes the electron dynamics for k⊥ρe>1 in the sense of Padé approximants (here, k⊥ and ρe are the wavenumber perpendicular to the magnetic field and the electron Larmor radius, respectively). The local dispersion relation for electrostatic plasma perturbations with the frequency in the range between the ion and electron cyclotron frequencies and propagating strictly perpendicular to the magnetic field is derived. The dispersion relation includes the effects of the equilibrium E ×B electron current, finite ion velocity, electron inertia, electron FLR, magnetic field gradients, and Debye length effects. The necessary and sufficient condition of stability is derived, and the stability boundary is found. It is shown that, in general, the electron inertia and FLR effects stabilize the short-wavelength perturbations. In some cases, such effects completely suppress the high-frequency short-wavelength modes so that only the long-wavelength low-frequency (with respect to the lower-hybrid frequency) modes remain unstable.
Competitive ability, stress tolerance and plant interactions along stress gradients.
Qi, Man; Sun, Tao; Xue, SuFeng; Yang, Wei; Shao, DongDong; Martínez-López, Javier
2018-04-01
Exceptions to the generality of the stress-gradient hypothesis (SGH) may be reconciled by considering species-specific traits and stress tolerance strategies. Studies have tested stress tolerance and competitive ability in mediating interaction outcomes, but few have incorporated this to predict how species interactions shift between competition and facilitation along stress gradients. We used field surveys, salt tolerance and competition experiments to develop a predictive model interspecific interaction shifts across salinity stress gradients. Field survey and greenhouse tolerance tests revealed tradeoffs between stress tolerance and competitive ability. Modeling showed that along salinity gradients, (1) plant interactions shifted from competition to facilitation at high salinities within the physiological limits of salt-intolerant plants, (2) facilitation collapsed when salinity stress exceeded the physiological tolerance of salt-intolerant plants, and (3) neighbor removal experiments overestimate interspecific facilitation by including intraspecific effects. A community-level field experiment, suggested that (1) species interactions are competitive in benign and, facilitative in harsh condition, but fuzzy under medium environmental stress due to niche differences of species and weak stress amelioration, and (2) the SGH works on strong but not weak stress gradients, so SGH confusion arises when it is applied across questionable stress gradients. Our study clarifies how species interactions vary along stress gradients. Moving forward, focusing on SGH applications rather than exceptions on weak or nonexistent gradients would be most productive. © 2018 by the Ecological Society of America.
Liu, F. S.; Jiang, Dongfei; Faber, S. M.; Koo, David C.; Yesuf, Hassen M.; Tacchella, Sandro; Mao, Shude; Wang, Weichen; Guo, Yicheng; Fang, Jerome J.; Barro, Guillermo; Zheng, Xianzhong; Jia, Meng; Tong, Wei; Liu, Lu; Meng, Xianmin
2017-07-01
The rest-frame UV-optical (I.e., NUV - B) color is sensitive to both low-level recent star formation (specific star formation rate—sSFR) and dust. In this Letter, we extend our previous work on the origins of NUV - B color gradients in star-forming galaxies (SFGs) at z˜ 1 to those at z˜ 2. We use a sample of 1335 large (semimajor axis radius {R}{SMA}> 0\\buildrel{\\prime\\prime}\\over{.} 18) SFGs with extended UV emission out to 2{R}{SMA} in the mass range {M}* ={10}9{--}{10}11 {M}⊙ at 1.5negative NUV - B color gradients (redder centers), and their color gradients strongly increase with galaxy mass. We also show that the global rest-frame FUV - NUV color is approximately linear with {A}{{V}}, which is derived by modeling the observed integrated FUV to NIR spectral energy distributions of the galaxies. Applying this integrated calibration to our spatially resolved data, we find a negative dust gradient (more dust extinguished in the centers), which steadily becomes steeper with galaxy mass. We further find that the NUV - B color gradients become nearly zero after correcting for dust gradients regardless of galaxy mass. This indicates that the sSFR gradients are negligible and dust reddening is likely the principal cause of negative UV-optical color gradients in these SFGs. Our findings support that the buildup of the stellar mass in SFGs at Cosmic Noon is self-similar inside 2{R}{SMA}.
An extended discrete gradient formula for oscillatory Hamiltonian systems
Liu Kai; Shi Wei; Wu Xinyuan
2013-01-01
In this paper, incorporating the idea of the discrete gradient method into the extended Runge–Kutta–Nyström integrator, we derive and analyze an extended discrete gradient formula for the oscillatory Hamiltonian system with the Hamiltonian H(p,q)= 1/2 p T p+ 1/2 q T Mq+U(q), where q:R→R d represents generalized positions, p:R→R d represents generalized momenta and M is an element of R dxd is a symmetric and positive semi-definite matrix. The solution of this system is a nonlinear oscillator. Basically, many nonlinear oscillatory mechanical systems with a partitioned Hamiltonian function lend themselves to this approach. The extended discrete gradient formula presented in this paper exactly preserves the energy H(p, q). We derive some properties of the new formula. The convergence is analyzed for the implicit schemes based on the discrete gradient formula, and it turns out that the convergence of the implicit schemes based on the extended discrete gradient formula is independent of ‖M‖, which is a significant property for the oscillatory Hamiltonian system. Thus, it transpires that a larger step size can be chosen for the new energy-preserving schemes than that for the traditional discrete gradient methods when applied to the oscillatory Hamiltonian system. Illustrative examples show the competence and efficiency of the new schemes in comparison with the traditional discrete gradient methods in the scientific literature. (paper)
Xiangrong Li
Full Text Available It is generally acknowledged that the conjugate gradient (CG method achieves global convergence--with at most a linear convergence rate--because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP method in which the restart strategy is also used. Moreover, the method we developed includes not only n-step quadratic convergence but also both the function value information and gradient value information. In this paper, we will show that the new PRP method (with either the Armijo line search or the Wolfe line search is both linearly and quadratically convergent. The numerical experiments demonstrate that the new PRP algorithm is competitive with the normal CG method.
Li, Xiangrong; Zhao, Xupei; Duan, Xiabin; Wang, Xiaoliang
2015-01-01
It is generally acknowledged that the conjugate gradient (CG) method achieves global convergence--with at most a linear convergence rate--because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP method in which the restart strategy is also used. Moreover, the method we developed includes not only n-step quadratic convergence but also both the function value information and gradient value information. In this paper, we will show that the new PRP method (with either the Armijo line search or the Wolfe line search) is both linearly and quadratically convergent. The numerical experiments demonstrate that the new PRP algorithm is competitive with the normal CG method.
Voltammetry under a Controlled Temperature Gradient
Jan Krejci, Jr.
2010-07-01
Full Text Available Electrochemical measurements are generally done under isothermal conditions. Here we report on the application of a controlled temperature gradient between the working electrode surface and the solution. Using electrochemical sensors prepared on ceramic materials with extremely high specific heat conductivity, the temperature gradient between the electrode and solution was applied here as a second driving force. This application of the Soret phenomenon increases the mass transfer in the Nernst layer and enables more accurate control of the electrode response enhancement by a combination of diffusion and thermal diffusion. We have thus studied the effect of Soret phenomenon by cyclic voltammetry measurements in ferro/ferricyanide. The time dependence of sensor response disappears when applying the Soret phenomenon, and the complicated shape of the cyclic voltammogram is replaced by a simple exponential curve. We have derived the Cotrell-Soret equation describing the steady-state response with an applied temperature difference.
Optimizing sampling approaches along ecological gradients
Schweiger, Andreas; Irl, Severin D. H.; Steinbauer, Manuel
2016-01-01
1. Natural scientists and especially ecologists use manipulative experiments or field observations along gradients to differentiate patterns driven by processes from those caused by random noise. A well-conceived sampling design is essential for identifying, analysing and reporting underlying...... patterns in a statistically solid and reproducible manner, given the normal restrictions in labour, time and money. However, a technical guideline about an adequate sampling design to maximize prediction success under restricted resources is lacking. This study aims at developing such a solid...... and reproducible guideline for sampling along gradients in all fields of ecology and science in general. 2. We conducted simulations with artificial data for five common response types known in ecology, each represented by a simple function (no response, linear, exponential, symmetric unimodal and asymmetric...
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...... to the optimal one, which usually requires an unacceptable high complexity. Some of the treated approximate methods are based on QL-factorization of the channel matrix. In the work presented in this thesis it is proven how the QL-factorization of frequency-selective channels asymptotically provides the minimum...
Quantum tunneling beyond semiclassical approximation
Banerjee, Rabin; Majhi, Bibhas Ranjan
2008-01-01
Hawking radiation as tunneling by Hamilton-Jacobi method beyond semiclassical approximation is analysed. We compute all quantum corrections in the single particle action revealing that these are proportional to the usual semiclassical contribution. We show that a simple choice of the proportionality constants reproduces the one loop back reaction effect in the spacetime, found by conformal field theory methods, which modifies the Hawking temperature of the black hole. Using the law of black hole mechanics we give the corrections to the Bekenstein-Hawking area law following from the modified Hawking temperature. Some examples are explicitly worked out.
MODIFIED ARMIJO RULE ON GRADIENT DESCENT AND CONJUGATE GRADIENT
ZURAIDAH FITRIAH
2017-10-01
Full Text Available Armijo rule is an inexact line search method to determine step size in some descent method to solve unconstrained local optimization. Modified Armijo was introduced to increase the numerical performance of several descent algorithms that applying this method. The basic difference of Armijo and its modified are in existence of a parameter and estimating the parameter that is updated in every iteration. This article is comparing numerical solution and time of computation of gradient descent and conjugate gradient hybrid Gilbert-Nocedal (CGHGN that applying modified Armijo rule. From program implementation in Matlab 6, it's known that gradient descent was applying modified Armijo more effectively than CGHGN from one side: iteration needed to reach some norm of the gradient (input by the user. The amount of iteration was representing how long the step size of each algorithm in each iteration. In another side, time of computation has the same conclusion.
Approximate spacetime symmetries and conservation laws
Harte, Abraham I [Enrico Fermi Institute, University of Chicago, Chicago, IL 60637 (United States)], E-mail: harte@uchicago.edu
2008-10-21
A notion of geometric symmetry is introduced that generalizes the classical concepts of Killing fields and other affine collineations. There is a sense in which flows under these new vector fields minimize deformations of the connection near a specified observer. Any exact affine collineations that may exist are special cases. The remaining vector fields can all be interpreted as analogs of Poincare and other well-known symmetries near timelike worldlines. Approximate conservation laws generated by these objects are discussed for both geodesics and extended matter distributions. One example is a generalized Komar integral that may be taken to define the linear and angular momenta of a spacetime volume as seen by a particular observer. This is evaluated explicitly for a gravitational plane wave spacetime.
An Origami Approximation to the Cosmic Web
Neyrinck, Mark C.
2016-10-01
The powerful Lagrangian view of structure formation was essentially introduced to cosmology by Zel'dovich. In the current cosmological paradigm, a dark-matter-sheet 3D manifold, inhabiting 6D position-velocity phase space, was flat (with vanishing velocity) at the big bang. Afterward, gravity stretched and bunched the sheet together in different places, forming a cosmic web when projected to the position coordinates. Here, I explain some properties of an origami approximation, in which the sheet does not stretch or contract (an assumption that is false in general), but is allowed to fold. Even without stretching, the sheet can form an idealized cosmic web, with convex polyhedral voids separated by straight walls and filaments, joined by convex polyhedral nodes. The nodes form in `polygonal' or `polyhedral' collapse, somewhat like spherical/ellipsoidal collapse, except incorporating simultaneous filament and wall formation. The origami approximation allows phase-space geometries of nodes, filaments, and walls to be more easily understood, and may aid in understanding spin correlations between nearby galaxies. This contribution explores kinematic origami-approximation models giving velocity fields for the first time.
Blind sensor calibration using approximate message passing
Schülke, Christophe; Caltagirone, Francesco; Zdeborová, Lenka
2015-01-01
The ubiquity of approximately sparse data has led a variety of communities to take great interest in compressed sensing algorithms. Although these are very successful and well understood for linear measurements with additive noise, applying them to real data can be problematic if imperfect sensing devices introduce deviations from this ideal signal acquisition process, caused by sensor decalibration or failure. We propose a message passing algorithm called calibration approximate message passing (Cal-AMP) that can treat a variety of such sensor-induced imperfections. In addition to deriving the general form of the algorithm, we numerically investigate two particular settings. In the first, a fraction of the sensors is faulty, giving readings unrelated to the signal. In the second, sensors are decalibrated and each one introduces a different multiplicative gain to the measurements. Cal-AMP shares the scalability of approximate message passing, allowing us to treat large sized instances of these problems, and experimentally exhibits a phase transition between domains of success and failure. (paper)
Several Guaranteed Descent Conjugate Gradient Methods for Unconstrained Optimization
San-Yang Liu
2014-01-01
Full Text Available This paper investigates a general form of guaranteed descent conjugate gradient methods which satisfies the descent condition gkTdk≤-1-1/4θkgk2 θk>1/4 and which is strongly convergent whenever the weak Wolfe line search is fulfilled. Moreover, we present several specific guaranteed descent conjugate gradient methods and give their numerical results for large-scale unconstrained optimization.
Impulse approximation in solid helium
Glyde, H.R.
1985-01-01
The incoherent dynamic form factor S/sub i/(Q, ω) is evaluated in solid helium for comparison with the impulse approximation (IA). The purpose is to determine the Q values for which the IA is valid for systems such a helium where the atoms interact via a potential having a steeply repulsive but not infinite hard core. For 3 He, S/sub i/(Q, ω) is evaluated from first principles, beginning with the pair potential. The density of states g(ω) is evaluated using the self-consistent phonon theory and S/sub i/(Q,ω) is expressed in terms of g(ω). For solid 4 He resonable models of g(ω) using observed input parameters are used to evaluate S/sub i/(Q,ω). In both cases S/sub i/(Q, ω) is found to approach the impulse approximation S/sub IA/(Q, ω) closely for wave vector transfers Q> or approx. =20 A -1 . The difference between S/sub i/ and S/sub IA/, which is due to final state interactions of the scattering atom with the remainder of the atoms in the solid, is also predominantly antisymmetric in (ω-ω/sub R/), where ω/sub R/ is the recoil frequency. This suggests that the symmetrization procedure proposed by Sears to eliminate final state contributions should work well in solid helium
Finite approximations in fluid mechanics
Hirschel, E.H.
1986-01-01
This book contains twenty papers on work which was conducted between 1983 and 1985 in the Priority Research Program ''Finite Approximations in Fluid Mechanics'' of the German Research Society (Deutsche Forschungsgemeinschaft). Scientists from numerical mathematics, fluid mechanics, and aerodynamics present their research on boundary-element methods, factorization methods, higher-order panel methods, multigrid methods for elliptical and parabolic problems, two-step schemes for the Euler equations, etc. Applications are made to channel flows, gas dynamical problems, large eddy simulation of turbulence, non-Newtonian flow, turbomachine flow, zonal solutions for viscous flow problems, etc. The contents include: multigrid methods for problems from fluid dynamics, development of a 2D-Transonic Potential Flow Solver; a boundary element spectral method for nonstationary viscous flows in 3 dimensions; navier-stokes computations of two-dimensional laminar flows in a channel with a backward facing step; calculations and experimental investigations of the laminar unsteady flow in a pipe expansion; calculation of the flow-field caused by shock wave and deflagration interaction; a multi-level discretization and solution method for potential flow problems in three dimensions; solutions of the conservation equations with the approximate factorization method; inviscid and viscous flow through rotating meridional contours; zonal solutions for viscous flow problems
Plasma Physics Approximations in Ares
Managan, R. A.
2015-01-01
Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, Fn( μ/θ ), the chemical potential, μ or ζ = ln(1+e μ/θ ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A α (ζ ),A β (ζ ), ζ, f(ζ ) = (1 + e -μ/θ )F 1/2 (μ/θ), F 1/2 '/F 1/2 , F c α , and F c β . In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.
Combining Step Gradients and Linear Gradients in Density.
Kumar, Ashok A; Walz, Jenna A; Gonidec, Mathieu; Mace, Charles R; Whitesides, George M
2015-06-16
Combining aqueous multiphase systems (AMPS) and magnetic levitation (MagLev) provides a method to produce hybrid gradients in apparent density. AMPS—solutions of different polymers, salts, or surfactants that spontaneously separate into immiscible but predominantly aqueous phases—offer thermodynamically stable steps in density that can be tuned by the concentration of solutes. MagLev—the levitation of diamagnetic objects in a paramagnetic fluid within a magnetic field gradient—can be arranged to provide a near-linear gradient in effective density where the height of a levitating object above the surface of the magnet corresponds to its density; the strength of the gradient in effective density can be tuned by the choice of paramagnetic salt and its concentrations and by the strength and gradient in the magnetic field. Including paramagnetic salts (e.g., MnSO4 or MnCl2) in AMPS, and placing them in a magnetic field gradient, enables their use as media for MagLev. The potential to create large steps in density with AMPS allows separations of objects across a range of densities. The gradients produced by MagLev provide resolution over a continuous range of densities. By combining these approaches, mixtures of objects with large differences in density can be separated and analyzed simultaneously. Using MagLev to add an effective gradient in density also enables tuning the range of densities captured at an interface of an AMPS by simply changing the position of the container in the magnetic field. Further, by creating AMPS in which phases have different concentrations of paramagnetic ions, the phases can provide different resolutions in density. These results suggest that combining steps in density with gradients in density can enable new classes of separations based on density.
Block-conjugate-gradient method
McCarthy, J.F.
1989-01-01
It is shown that by using the block-conjugate-gradient method several, say s, columns of the inverse Kogut-Susskind fermion matrix can be found simultaneously, in less time than it would take to run the standard conjugate-gradient algorithm s times. The method improves in efficiency relative to the standard conjugate-gradient algorithm as the fermion mass is decreased and as the value of the coupling is pushed to its limit before the finite-size effects become important. Thus it is potentially useful for measuring propagators in large lattice-gauge-theory calculations of the particle spectrum
Kheloufi, Nawal; Bouzid, Abderrazak, E-mail: a_bouzid34@hotmail.com
2016-06-25
We present band gap calculations of zinc-blende ternary CdS{sub x}Te{sub 1-x} semiconductors within the standard DFT and quasiparticle calculations employing pseudopotential method. The DFT, the local density approximation (LDA) and the Generalized Gradient Approximation (GGA) based calculations have given very poor results compared to experimental data. The quasiparticle calculations have been investigated via the one-shot GW approximation. The present paper discuses and confirms the effect of inclusion of the semicore states in the cadmium (Cd) pseudopotential. The obtained GW quasiparticle band gap using Cd{sup +20} pseudopotential has been improved compared to the obtained results from the available pseudopotential without the treatment of semicore states. Our DFT and quasiparticle band gap results are discussed and compared to the available theoretical calculations and experimental data. - Graphical abstract: Band gaps improvement concerning the binary and ternary alloys using the GW approximation and Cd{sup 20+} pseudopotential with others levels of approximations (the LDA and GGA approximation employing the Cd{sup 12+} and the LDA within Cd{sup 20+} pseudopotential). - Highlights: • The direct Γ- Γ and indirect Γ- X and Γ- L bands gaps show a nonlinear behavior when S content is enhanced. • The quasiparticle band gap result for the investigated semiconductors is improved using the GW approximation. • All CdS{sub x}Te{sub 1-x} compounds in all compositions range from 0 to 1 are direct band gap semiconductors.
Thin-wall approximation in vacuum decay: A lemma
Brown, Adam R.
2018-05-01
The "thin-wall approximation" gives a simple estimate of the decay rate of an unstable quantum field. Unfortunately, the approximation is uncontrolled. In this paper I show that there are actually two different thin-wall approximations and that they bracket the true decay rate: I prove that one is an upper bound and the other a lower bound. In the thin-wall limit, the two approximations converge. In the presence of gravity, a generalization of this lemma provides a simple sufficient condition for nonperturbative vacuum instability.
Solving Math Problems Approximately: A Developmental Perspective.
Dana Ganor-Stern
Full Text Available Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults' ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger than the exact answer and when it was far (vs. close from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner.
Approximability of Robust Network Design
Olver, N.K.; Shepherd, F.B.
2014-01-01
We consider robust (undirected) network design (RND) problems where the set of feasible demands may be given by an arbitrary convex body. This model, introduced by Ben-Ameur and Kerivin [Ben-Ameur W, Kerivin H (2003) New economical virtual private networks. Comm. ACM 46(6):69-73], generalizes the
Approximating the minimum cycle mean
Krishnendu Chatterjee
2013-07-01
Full Text Available We consider directed graphs where each edge is labeled with an integer weight and study the fundamental algorithmic question of computing the value of a cycle with minimum mean weight. Our contributions are twofold: (1 First we show that the algorithmic question is reducible in O(n^2 time to the problem of a logarithmic number of min-plus matrix multiplications of n-by-n matrices, where n is the number of vertices of the graph. (2 Second, when the weights are nonnegative, we present the first (1 + ε-approximation algorithm for the problem and the running time of our algorithm is ilde(O(n^ω log^3(nW/ε / ε, where O(n^ω is the time required for the classic n-by-n matrix multiplication and W is the maximum value of the weights.
Spatial gradient tuning in metamaterials
Driscoll, Tom; Goldflam, Michael; Jokerst, Nan; Basov, Dimitri; Smith, David
2011-03-01
Gradient Index (GRIN) metamaterials have been used to create devices inspired by, but often surpassing the potential of, conventional GRIN optics. The unit-cell nature of metamaterials presents the opportunity to exert much greater control over spatial gradients than is possible in natural materials. This is true not only during the design phase but also offers the potential for real-time reconfiguration of the metamaterial gradient. This ability fits nicely into the picture of transformation-optics, in which spatial gradients can enable an impressive suite of innovative devices. We discuss methods to exert control over metamaterial response, focusing on our recent demonstrations using Vanadium Dioxide. We give special attention to role of memristance and mem-capacitance observed in Vanadium Dioxide, which simplify the demands of stimuli and addressing, as well as intersecting metamaterials with the field of memory-materials.
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 w...
Approximate cohomology in Banach algebras | Pourabbas ...
We introduce the notions of approximate cohomology and approximate homotopy in Banach algebras and we study the relation between them. We show that the approximate homotopically equivalent cochain complexes give the same approximate cohomologies. As a special case, approximate Hochschild cohomology is ...
Coronal Loops: Evolving Beyond the Isothermal Approximation
Schmelz, J. T.; Cirtain, J. W.; Allen, J. D.
2002-05-01
Are coronal loops isothermal? A controversy over this question has arisen recently because different investigators using different techniques have obtained very different answers. Analysis of SOHO-EIT and TRACE data using narrowband filter ratios to obtain temperature maps has produced several key publications that suggest that coronal loops may be isothermal. We have constructed a multi-thermal distribution for several pixels along a relatively isolated coronal loop on the southwest limb of the solar disk using spectral line data from SOHO-CDS taken on 1998 Apr 20. These distributions are clearly inconsistent with isothermal plasma along either the line of sight or the length of the loop, and suggested rather that the temperature increases from the footpoints to the loop top. We speculated originally that these differences could be attributed to pixel size -- CDS pixels are larger, and more `contaminating' material would be expected along the line of sight. To test this idea, we used CDS iron line ratios from our data set to mimic the isothermal results from the narrowband filter instruments. These ratios indicated that the temperature gradient along the loop was flat, despite the fact that a more complete analysis of the same data showed this result to be false! The CDS pixel size was not the cause of the discrepancy; rather, the problem lies with the isothermal approximation used in EIT and TRACE analysis. These results should serve as a strong warning to anyone using this simplistic method to obtain temperature. This warning is echoed on the EIT web page: ``Danger! Enter at your own risk!'' In other words, values for temperature may be found, but they may have nothing to do with physical reality. Solar physics research at the University of Memphis is supported by NASA grant NAG5-9783. This research was funded in part by the NASA/TRACE MODA grant for Montana State University.
Dose gradient curve: A new tool for evaluating dose gradient.
Sung, KiHoon; Choi, Young Eun
2018-01-01
Stereotactic radiotherapy, which delivers an ablative high radiation dose to a target volume for maximum local tumor control, requires a rapid dose fall-off outside the target volume to prevent extensive damage to nearby normal tissue. Currently, there is no tool to comprehensively evaluate the dose gradient near the target volume. We propose the dose gradient curve (DGC) as a new tool to evaluate the quality of a treatment plan with respect to the dose fall-off characteristics. The average distance between two isodose surfaces was represented by the dose gradient index (DGI) estimated by a simple equation using the volume and surface area of isodose levels. The surface area was calculated by mesh generation and surface triangulation. The DGC was defined as a plot of the DGI of each dose interval as a function of the dose. Two types of DGCs, differential and cumulative, were generated. The performance of the DGC was evaluated using stereotactic radiosurgery plans for virtual targets. Over the range of dose distributions, the dose gradient of each dose interval was well-characterized by the DGC in an easily understandable graph format. Significant changes in the DGC were observed reflecting the differences in planning situations and various prescription doses. The DGC is a rational method for visualizing the dose gradient as the average distance between two isodose surfaces; the shorter the distance, the steeper the dose gradient. By combining the DGC with the dose-volume histogram (DVH) in a single plot, the DGC can be utilized to evaluate not only the dose gradient but also the target coverage in routine clinical practice.
Approximate Bias Correction in Econometrics
James G. MacKinnon; Anthony A. Smith Jr.
1995-01-01
This paper discusses ways to reduce the bias of consistent estimators that are biased in finite samples. It is necessary that the bias function, which relates parameter values to bias, should be estimable by computer simulation or by some other method. If so, bias can be reduced or, in some cases that may not be unrealistic, even eliminated. In general, several evaluations of the bias function will be required to do this. Unfortunately, reducing bias may increase the variance, or even the mea...
Discovery of Approximate Differential Dependencies
Liu, Jixue; Kwashie, Selasi; Li, Jiuyong; Ye, Feiyue; Vincent, Millist
2013-01-01
Differential dependencies (DDs) capture the relationships between data columns of relations. They are more general than functional dependencies (FDs) and and the difference is that DDs are defined on the distances between values of two tuples, not directly on the values. Because of this difference, the algorithms for discovering FDs from data find only special DDs, not all DDs and therefore are not applicable to DD discovery. In this paper, we propose an algorithm to discover DDs from data fo...
Gradient Dynamics and Entropy Production Maximization
Janečka, Adam; Pavelka, Michal
2018-01-01
We compare two methods for modeling dissipative processes, namely gradient dynamics and entropy production maximization. Both methods require similar physical inputs-how energy (or entropy) is stored and how it is dissipated. Gradient dynamics describes irreversible evolution by means of dissipation potential and entropy, it automatically satisfies Onsager reciprocal relations as well as their nonlinear generalization (Maxwell-Onsager relations), and it has statistical interpretation. Entropy production maximization is based on knowledge of free energy (or another thermodynamic potential) and entropy production. It also leads to the linear Onsager reciprocal relations and it has proven successful in thermodynamics of complex materials. Both methods are thermodynamically sound as they ensure approach to equilibrium, and we compare them and discuss their advantages and shortcomings. In particular, conditions under which the two approaches coincide and are capable of providing the same constitutive relations are identified. Besides, a commonly used but not often mentioned step in the entropy production maximization is pinpointed and the condition of incompressibility is incorporated into gradient dynamics.
Erba, A.; Dovesi, R.; Shahrokhi, M.; Moradian, R.
2015-01-01
Harmonic and quasi-harmonic thermal properties of two isostructural simple oxides (periclase, MgO, and lime, CaO) are computed with ab initio periodic simulations based on the density-functional-theory (DFT). The more polarizable character of calcium with respect to magnesium cations is found to dramatically affect the validity domain of the quasi-harmonic approximation that, for thermal structural properties (such as temperature dependence of volume, V(T), bulk modulus, K(T), and thermal expansion coefficient, α(T)), reduces from [0 K-1000 K] for MgO to just [0 K-100 K] for CaO. On the contrary, thermodynamic properties (such as entropy, S(T), and constant-volume specific heat, C V (T)) are described reliably at least up to 2000 K and quasi-harmonic constant-pressure specific heat, C P (T), up to about 1000 K in both cases. The effect of the adopted approximation to the exchange-correlation functional of the DFT is here explicitly investigated by considering five different expressions of three different classes (local-density approximation, generalized-gradient approximation, and hybrids). Computed harmonic thermodynamic properties are found to be almost independent of the adopted functional, whereas quasi-harmonic structural properties are more affected by the choice of the functional, with differences that increase as the system becomes softer
Pajevic, Sinisa; Aldroubi, Akram; Basser, Peter J
2002-01-01
The effective diffusion tensor of water, D, measured by diffusion tensor MRI (DT-MRI), is inherently a discrete, noisy, voxel-averaged sample of an underlying macroscopic effective diffusion tensor field, D(x). Within fibrous tissues this field is presumed to be continuous and smooth at a gross anatomical length scale. Here a new, general mathematical framework is proposed that uses measured DT-MRI data to produce a continuous approximation to D(x). One essential finding is that the continuous tensor field representation can be constructed by repeatedly performing one-dimensional B-spline transforms of the DT-MRI data. The fidelity and noise-immunity of this approximation are tested using a set of synthetically generated tensor fields to which background noise is added via Monte Carlo methods. Generally, these tensor field templates are reproduced faithfully except at boundaries where diffusion properties change discontinuously or where the tensor field is not microscopically homogeneous. Away from such regions, the tensor field approximation does not introduce bias in useful DT-MRI parameters, such as Trace(D(x)). It also facilitates the calculation of several new parameters, particularly differential quantities obtained from the tensor of spatial gradients of D(x). As an example, we show that they can identify tissue boundaries across which diffusion properties change rapidly using in vivo human brain data. One important application of this methodology is to improve the reliability and robustness of DT-MRI fiber tractography.
A flexoelectric theory with rotation gradient effects for elastic dielectrics
Anqing, Li; Shenjie, Zhou; Lu, Qi; Xi, Chen
2016-01-01
In this paper, a general flexoelectric theory in the framework of couple stress theory is proposed for isotropic dielectrics, in which the rotation gradient and the polarization gradient are involved to represent the nonlocal mechanical and electrical effects, respectively. The present flexoelectric theory shows only the anti-symmetric part of rotation gradient can induce polarization, while the symmetric part of rotation gradient cannot induce polarization in isotropic dielectrics. The electrostatic stress is obtained naturally in the governing equations and boundary conditions in terms of the variational principle, which is composed of two parts: the Maxwell stress corresponding to the polarization and the remainder relating to the polarization gradient. The current theory is able to account for the effects of size, direct and inverse flexoelectricities, and electrostatic force. To illustrate this theory, a simple application of Bernoulli–Euler cantilever beam is discussed. The numerical results demonstrate neither the higher-order constant l 1 nor the higher-order constant l 2 associated with the symmetric and anti-symmetric parts of rotation gradient, respectively, can be ignored in the flexoelectric theory. In addition, the induced deflection increases as the increase of the flexoelectric coefficient. The polarization is no longer constant and the potential is no longer linear along the thickness direction of beam because of the influence of polarization gradient. (paper)
Xu, Qiuju; Belmonte, Andrew; deForest, Russ; Liu, Chun; Tan, Zhong
2017-04-01
In this paper, we study a fitness gradient system for two populations interacting via a symmetric game. The population dynamics are governed by a conservation law, with a spatial migration flux determined by the fitness. By applying the Galerkin method, we establish the existence, regularity and uniqueness of global solutions to an approximate system, which retains most of the interesting mathematical properties of the original fitness gradient system. Furthermore, we show that a Turing instability occurs for equilibrium states of the fitness gradient system, and its approximations.
Cafiero, Mauricio; Gonzalez, Carlos
2005-01-01
We show that potentials for exchange-correlation functionals within the Kohn-Sham density-functional-theory framework may be written as potentials for simpler functionals multiplied by a factor close to unity, and in a self-consistent field calculation, these effective potentials find the correct self-consistent solutions. This simple theory is demonstrated with self-consistent exchange-only calculations of the atomization energies of some small molecules using the Perdew-Kurth-Zupan-Blaha (PKZB) meta-generalized-gradient-approximation (meta-GGA) exchange functional. The atomization energies obtained with our method agree with or surpass previous meta-GGA calculations performed in a non-self-consistent manner. The results of this work suggest the utility of this simple theory to approximate exchange-correlation potentials corresponding to energy functionals too complicated to generate closed forms for their potentials. We hope that this method will encourage the development of complex functionals which have correct boundary conditions and are free of self-interaction errors without the worry that the functionals are too complex to differentiate to obtain potentials
Measure Fields for Function Approximation
1993-06-01
intelligence research is provided by ONR contract N00014-91-J-4038 J.L. Marroquin was supported in part by a grant from the Consejo Nacional de Ciencia y ... Tecnologia , Mexico. _ 93-28011 9-3 -- -" nnuM IInu 4 0 0 0 1 Introduction imating functions are always discontinuous, and the dis- continuities are...capacity and generalization capabili- is present panel (a) of figure 1 shows a function z(z, y ) ties. that is equal to a tilted plane inside an L
Saddlepoint Approximations in Conditional Inference
1990-06-11
Then the inverse transform can be written as (%, Y) = (T, q(T, Z)) for some function q. When the transform is not one to one, the domain should be...general regularity conditions described at the beginning of this section hold and that the solution t1 in (9) exists. Denote the inverse transform by (X, Y...density hn(t 0 l z) are desired. Then the inverse transform (Y, ) = (T, q(T, Z)) exists and the variable v in the cumulant generating function K(u, v
Topological charge using cooling and the gradient flow
Alexandrou, C.; Athenodorou, A.; The Cyprus Institute, Nicosia; Jansen, K.
2015-12-01
The equivalence of cooling to the gradient flow when the cooling step n c and the continuous flow step of gradient flow τ are matched is generalized to gauge actions that include rectangular terms. By expanding the link variables up to subleading terms in perturbation theory, we relate n c and τ and show that the results for the topological charge become equivalent when rescaling τ ≅ n c /(3-15c 1 ) where c 1 is the Symanzik coefficient multiplying the rectangular term. We, subsequently, apply cooling and the gradient flow using the Wilson, the Symanzik tree-level improved and the Iwasaki gauge actions to configurations produced with N f = 2 + 1 + 1 twisted mass fermions. We compute the topological charge, its distribution and the correlators between cooling and gradient flow at three values of the lattice spacing demonstrating that the perturbative rescaling τ ≅ n c /(3-15c 1 ) leads to equivalent results.
Comparative Studies of High-Gradient Rf and Dc Breakdowns
Kovermann, Jan Wilhelm; Wuensch, Walter
2010-01-01
The CLIC project is based on normal-conducting high-gradient accelerating structures with an average accelerating gradient of 100 MV/m. The maximum achievable gradient in these structures is limited by the breakdown phenomenon. The physics of breakdowns is not yet fully understood quantitatively. A full knowledge could have strong impact on the design, material choice and construction of rf structures. Therefore, understanding breakdowns has great importance to reaching a gradient of 100MV/m with an acceptable breakdown probability. This thesis addresses the physics underlying the breakdown effect, focusing on a comparison of breakdowns in rf structures and in a dc spark setup. The dc system is simpler, easier to benchmark against simulations, with a faster turnaround time, but the relationship to rf breakdown must be established. To do so, an experimental approach based on optical diagnostics and electrical measurements methods was made. Following an introduction into the CLIC project, a general theoretical ...
Hargreaves, Brian
2012-01-01
Gradient echo sequences are widely used in magnetic resonance imaging (MRI) for numerous applications ranging from angiography to perfusion to functional MRI. Compared with spin-echo techniques, the very short repetition times of gradient-echo methods enable very rapid 2D and 3D imaging, but also lead to complicated “steady states.” Signal and contrast behavior can be described graphically and mathematically, and depends strongly on the type of spoiling: fully balanced (no spoiling), gradient spoiling, or RF-spoiling. These spoiling options trade off between high signal and pure T1 contrast while the flip angle also affects image contrast in all cases, both of which can be demonstrated theoretically and in image examples. As with spin-echo sequences, magnetization preparation can be added to gradient-echo sequences to alter image contrast. Gradient echo sequences are widely used for numerous applications such as 3D perfusion imaging, functional MRI, cardiac imaging and MR angiography. PMID:23097185
The influence of ALN-Al gradient material gradient index on ballistic performance
Wang Youcong; Liu Qiwen; Li Yao; Shen Qiang
2013-01-01
Ballistic performance of the gradient material is superior to laminated material, and gradient materials have different gradient types. Using ls-dyna to simulate the ballistic performance of ALN-AL gradient target plates which contain three gradient index (b = 1, b = 0.5, b = 2). Through Hopkinson bar numerical simulation to the target plate materials, we obtained the reflection stress wave and transmission stress wave state of gradient material to get the best gradient index. The internal stress state of gradient material is simulated by amplification processing of the target plate model. When the gradient index b is equal to 1, the gradient target plate is best of all.
Approximating Markov Chains: What and why
Pincus, S.
1996-01-01
Much of the current study of dynamical systems is focused on geometry (e.g., chaos and bifurcations) and ergodic theory. Yet dynamical systems were originally motivated by an attempt to open-quote open-quote solve,close-quote close-quote or at least understand, a discrete-time analogue of differential equations. As such, numerical, analytical solution techniques for dynamical systems would seem desirable. We discuss an approach that provides such techniques, the approximation of dynamical systems by suitable finite state Markov Chains. Steady state distributions for these Markov Chains, a straightforward calculation, will converge to the true dynamical system steady state distribution, with appropriate limit theorems indicated. Thus (i) approximation by a computable, linear map holds the promise of vastly faster steady state solutions for nonlinear, multidimensional differential equations; (ii) the solution procedure is unaffected by the presence or absence of a probability density function for the attractor, entirely skirting singularity, fractal/multifractal, and renormalization considerations. The theoretical machinery underpinning this development also implies that under very general conditions, steady state measures are weakly continuous with control parameter evolution. This means that even though a system may change periodicity, or become chaotic in its limiting behavior, such statistical parameters as the mean, standard deviation, and tail probabilities change continuously, not abruptly with system evolution. copyright 1996 American Institute of Physics
Approximate analytic theory of the multijunction grill
Hurtak, O.; Preinhaelter, J.
1991-03-01
An approximate analytic theory of the general multijunction grill is developed. Omitting the evanescent modes in the subsidiary waveguides both at the junction and at the grill mouth and neglecting multiple wave reflection, simple formulae are derived for the reflection coefficient, the amplitudes of the incident and reflected waves and the spectral power density. These quantities are expressed through the basic grill parameters (the electric length of the structure and phase shift between adjacent waveguides) and two sets of reflection coefficients describing wave reflections in the subsidiary waveguides at the junction and at the plasma. Approximate expressions for these coefficients are also given. The results are compared with a numerical solution of two specific examples; they were shown to be useful for the optimization and design of multijunction grills.For the JET structure it is shown that, in the case of a dense plasma,many results can be obtained from the simple formulae for a two-waveguide multijunction grill. (author) 12 figs., 12 refs
Lunar ash flows - Isothermal approximation.
Pai, S. I.; Hsieh, T.; O'Keefe, J. A.
1972-01-01
Suggestion of the ash flow mechanism as one of the major processes required to account for some features of lunar soil. First the observational background and the gardening hypothesis are reviewed, and the shortcomings of the gardening hypothesis are shown. Then a general description of the lunar ash flow is given, and a simple mathematical model of the isothermal lunar ash flow is worked out with numerical examples to show the differences between the lunar and the terrestrial ash flow. The important parameters of the ash flow process are isolated and analyzed. It appears that the lunar surface layer in the maria is not a residual mantle rock (regolith) but a series of ash flows due, at least in part, to great meteorite impacts. The possibility of a volcanic contribution is not excluded. Some further analytic research on lunar ash flows is recommended.
Efficient and Robust Signal Approximations
2009-05-01
gains of MrICA over the non- adaptive wavelet method for these images are: 2.43 bpp , 0.62 bpp , 2.91 bpp , 2.78 bpp , 3.39 bpp , and 2.69 bpp . Figure 3.6...shows six examples of 64 × 64 images encoded at 20dB. The coding gain values of the adaptive method are in this case 1.5 bpp , 1.48 bpp , 0.33 bpp , 0.23... bpp , 0.45 bpp , and 1.23 bpp . (For both figures, the colormaps are maximally stretched to enhance visibility.) As a general conclusion, MrICA obtains a
Approximate simulation of Hawkes processes
Møller, Jesper; Rasmussen, Jakob Gulddahl
2006-01-01
Hawkes processes are important in point process theory and its applications, and simulation of such processes are often needed for various statistical purposes. This article concerns a simulation algorithm for unmarked and marked Hawkes processes, exploiting that the process can be constructed...... as a Poisson cluster process. The algorithm suffers from edge effects but is much faster than the perfect simulation algorithm introduced in our previous work Møller and Rasmussen (2004). We derive various useful measures for the error committed when using the algorithm, and we discuss various empirical...... results for the algorithm compared with perfect simulations. Extensions of the algorithm and the results to more general types of marked point processes are also discussed....
Dispersion of acoustic surface waves by velocity gradients
Kwon, S. D.; Kim, H. C.
1987-10-01
The perturbation theory of Auld [Acoustic Fields and Waves in Solids (Wiley, New York, 1973), Vol. II, p. 294], which describes the effect of a subsurface gradient on the velocity dispersion of surface waves, has been modified to a simpler form by an approximation using a newly defined velocity gradient for the case of isotropic materials. The modified theory is applied to nitrogen implantation in AISI 4140 steel with a velocity gradient of Gaussian profile, and compared with dispersion data obtained by the ultrasonic right-angle technique in the frequency range from 2.4 to 14.8 MHz. The good agreement between experiments and our theory suggests that the compound layer in the subsurface region plays a dominant role in causing the dispersion of acoustic surface waves.
Approximating chiral quark models with linear σ-models
Broniowski, Wojciech; Golli, Bojan
2003-01-01
We study the approximation of chiral quark models with simpler models, obtained via gradient expansion. The resulting Lagrangian of the type of the linear σ-model contains, at the lowest level of the gradient-expanded meson action, an additional term of the form ((1)/(2))A(σ∂ μ σ+π∂ μ π) 2 . We investigate the dynamical consequences of this term and its relevance to the phenomenology of the soliton models of the nucleon. It is found that the inclusion of the new term allows for a more efficient approximation of the underlying quark theory, especially in those cases where dynamics allows for a large deviation of the chiral fields from the chiral circle, such as in quark models with non-local regulators. This is of practical importance, since the σ-models with valence quarks only are technically much easier to treat and simpler to solve than the quark models with the full-fledged Dirac sea
Ordering, symbols and finite-dimensional approximations of path integrals
Kashiwa, Taro; Sakoda, Seiji; Zenkin, S.V.
1994-01-01
We derive general form of finite-dimensional approximations of path integrals for both bosonic and fermionic canonical systems in terms of symbols of operators determined by operator ordering. We argue that for a system with a given quantum Hamiltonian such approximations are independent of the type of symbols up to terms of O(ε), where ε of is infinitesimal time interval determining the accuracy of the approximations. A new class of such approximations is found for both c-number and Grassmannian dynamical variables. The actions determined by the approximations are non-local and have no classical continuum limit except the cases of pq- and qp-ordering. As an explicit example the fermionic oscillator is considered in detail. (author)
Accelerated gradient methods for constrained image deblurring
Bonettini, S; Zanella, R; Zanni, L; Bertero, M
2008-01-01
In this paper we propose a special gradient projection method for the image deblurring problem, in the framework of the maximum likelihood approach. We present the method in a very general form and we give convergence results under standard assumptions. Then we consider the deblurring problem and the generality of the proposed algorithm allows us to add a energy conservation constraint to the maximum likelihood problem. In order to improve the convergence rate, we devise appropriate scaling strategies and steplength updating rules, especially designed for this application. The effectiveness of the method is evaluated by means of a computational study on astronomical images corrupted by Poisson noise. Comparisons with standard methods for image restoration, such as the expectation maximization algorithm, are also reported.
Thygesen, Uffe Høgsbro
2016-01-01
We consider organisms which use a renewal strategy such as run–tumble when moving in space, for example to perform chemotaxis in chemical gradients. We derive a diffusion approximation for the motion, applying a central limit theorem due to Anscombe for renewal-reward processes; this theorem has ....... The proposed technique for obtaining diffusion approximations is conceptually and computationally simple, and applicable also when statistics of the motion is obtained empirically or through Monte Carlo simulation of the motion....
Hydraulic gradients in rock aquifers
Dahlblom, P.
1992-05-01
This report deals with fractured rock as a host for deposits of hazardous waste. In this context the rock, with its fractures containing moving groundwater, is called the geological barrier. The desired properties of the geological barrier are low permeability to water, low hydraulic gradients and ability to retain matter dissolved in the water. The hydraulic gradient together with the permeability and the porosity determines the migration velocity. Mathematical modelling of the migration involves calculation of the water flow and the hydrodynamic dispersion of the contaminant. The porous medium approach can be used to calculate mean flow velocities and hydrodynamic dispersion of a large number of fractures are connected, which means that a large volume have to be considered. It is assumed that the porous medium approach can be applied, and a number of idealized examples are shown. It is assumed that the groundwater table is replenished by percolation at a constant rate. One-dimensional analytical calculations show that zero hydraulic gradients may exist at relatively large distance from the coast. Two-dimensional numerical calculations show that it may be possible to find areas with low hydraulic gradients and flow velocities within blocks surrounded by areas with high hydraulic conductivity. (au)
Braak, ter C.J.F.
1988-01-01
The theory of gradient analysis is presented in this chapter, in which the heuristic techniques are integrated with regression, calibration, ordination and constrained ordination as distinct, well-defined statistical problems. The various techniques used for each type of problem are classified into
Compositional gradients in Gramineae genes
Wong, Gane Ka-Shu; Wang, Jun; Tao, Lin
2002-01-01
In this study, we describe a property of Gramineae genes, and perhaps all monocot genes, that is not observed in eudicot genes. Along the direction of transcription, beginning at the junction of the 5'-UTR and the coding region, there are gradients in GC content, codon usage, and amino-acid usage...
Orderings for conjugate gradient preconditionings
Ortega, James M.
1991-01-01
The effect of orderings on the rate of convergence of the conjugate gradient method with SSOR or incomplete Cholesky preconditioning is examined. Some results also are presented that help to explain why red/black ordering gives an inferior rate of convergence.
Color gradients in elliptical galaxies
Franx, M.; Illingworth, G.
1990-01-01
The relationship of the color gradients within ellipticals and the color differences between them are studied. It is found that the local color appears to be strongly related to the escape velocity. This suggests that the local escape velocity is the primary factor that determines the metallicity of the stellar population. Models with and without dark halos give comparable results. 27 refs
Is there a composition gradient in the halo
Kraft, R.P.; Trefzger, C.F.; Suntzeff, N.
1979-01-01
In the inner halo (galactocentric distance R < approximately 8 kpc), the Basel RGU photometry should allow the derivation of the shapes and dimensions of the iso-abundance contours. For the outer halo to R approximately 30 kpc, the authors review techniques based on Δs-measurements of RR Lyraes (Lick) and intermediate band-pass photometry of globular-cluster giants (Searle and Zinn, Palomar). Both methods suggest little change in mean [Fe/H] between 10 and 30 kpc; however, both may be biased against the discovery of very metal-poor objects. The conclusion that the outer halo has no abundance gradient may be somewhat premature. (Auth.)
Doorn, Stephen; Duque, Juan; Telg, Hagen; Chen, Hang; Swan, Anna; Haroz, Erik; Kono, Junichiro; Tu, Xiaomin; Zheng, Ming
2012-02-01
DNA wrapping-based ion exchange chromatography and density gradient ultracentrifugation provide nanotube samples highly enriched in single chiralities. We present resonance Raman excitation profiles for the G-band of several single chirality semiconducting and metallic species. The expected incoming and outgoing resonance peaks are observed in the profiles, but contrary to long-held assumptions, the outgoing resonance is always significantly weaker than the ingoing resonance peak. This strong asymmetry in the profiles arises from a violation of the Condon approximation [1]. Results will be discussed in the context of theoretical models that suggest significant coordinate dependence in the transition dipole (non-Condon effects). The generality of the behavior across semiconducting and metallic types, nanotube family, phonon mode, and Eii will be demonstrated. [4pt] [1] J. Duque et. al., ACS Nano, 5, 5233 (2011).
Shtromberger, N.L.
1989-01-01
To design a cyclotron magnetic system the legitimacy of two-dimensional approximations application is discussed. In all the calculations the finite difference method is used, and the linearization method with further use of the gradient conjugation method is used to solve the set of finite-difference equations. 3 refs.; 5 figs
Ab-initio calculation of EuO doped with 5% of (Ti, V, Cr and Fe): GGA and SIC approximation
Rouchdi, M.; Salmani, E.; Bekkioui, N.; Ez-Zahraouy, H.; Hassanain, N.; Benyoussef, A.; Mzerd, A.
2017-12-01
In this research, a simple theoretical method is proposed to investigate the electronic, magnetic and optical properties of Europium oxide (EuO) doped with 5% of (Ti, V, Cr and Fe). For a basic understanding of these properties, we employed Density-Functional Theory (DFT) based calculations with the Korringa-Kohn-Rostoker code (KKR) combined with the Coherent Potential Approximation (CPA). Also we investigated the half-metallic ferromagnetic behavior of EuO doped with 5% of (Ti, V, Cr and Fe) within the self-interaction-corrected Generalized Gradient Approximation (GGA-SIC). Our calculated results revealed that the Eu0.95TM0.05O is ferromagnetic with a high transition temperature. Moreover, the optical absorption spectra revealed that the half metallicity has been also predicted.
Elemental gradients in macrophytes from a reactor effluent gradient
Grace, J.B.; Tilly, L.J.
1978-01-01
The tissues of submersed macrophtes from along the thermal gradient were analyzed for phosphorus to determine whether any pattern correspondent to standing crop distributions could be detected. Although water concentrations of phosphorus showed no detectable relationship to the thermal effluent, tissue concentrations of this element in submersed macrophytes declined with distance from the effluent entry point. The occurrence of this concentration pattern suggests that phosphorus availability is greater near the discharge. Because phosphorus is the element most often determined to limit aquatic productivity, its greater availability may partially account for the apparent enhancement of macrophte growth near the thermal discharge. A patter of macrophyte abundance which indicated enchancement related to the discharge gradient in the reactor-cooling reservoir, Par Pond is reported. Correlative data tended to implicate light and temperature as important in influencing the differential abundance pattern
Generalized Response Surface Methodology : A New Metaheuristic
Kleijnen, J.P.C.
2006-01-01
Generalized Response Surface Methodology (GRSM) is a novel general-purpose metaheuristic based on Box and Wilson.s Response Surface Methodology (RSM).Both GRSM and RSM estimate local gradients to search for the optimal solution.These gradients use local first-order polynomials.GRSM, however, uses
Polarization-dependent ponderomotive gradient force in a standing wave
Smorenburg, P.W.; Kanters, J.H.M.; Lassise, A.; Brussaard, G.J.H.; Kamp, L.P.J.; Luiten, O.J.
2011-01-01
The ponderomotive force is derived for a relativistic charged particle entering an electromagnetic standing wave with a general three-dimensional field distribution and a nonrelativistic intensity, using a perturbation expansion method. It is shown that the well-known ponderomotive gradient force
Accurate reanalysis of structures by a preconditioned conjugate gradient method
Kirsch, U.; Kočvara, Michal; Zowe, J.
2002-01-01
Roč. 55, č. 2 (2002), s. 233-251 ISSN 0029-5981 R&D Projects: GA AV ČR IAA1075005 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : preconditioned conjugate gradient s * structural reanalysis Subject RIV: BA - General Mathematics Impact factor: 1.468, year: 2002
The Lanczos and Conjugate Gradient Algorithms in Finite Precision Arithmetic
Meurant, G.; Strakoš, Zdeněk
2006-01-01
Roč. 15, - (2006), s. 471-542 ISSN 0962-4929 R&D Projects: GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : Lanczos method * conjugate gradient method * finite precision arithmetic * numerical stability * iterative methods Subject RIV: BA - General Mathematics
Optimization in Quaternion Dynamic Systems: Gradient, Hessian, and Learning Algorithms.
Xu, Dongpo; Xia, Yili; Mandic, Danilo P
2016-02-01
The optimization of real scalar functions of quaternion variables, such as the mean square error or array output power, underpins many practical applications. Solutions typically require the calculation of the gradient and Hessian. However, real functions of quaternion variables are essentially nonanalytic, which are prohibitive to the development of quaternion-valued learning systems. To address this issue, we propose new definitions of quaternion gradient and Hessian, based on the novel generalized Hamilton-real (GHR) calculus, thus making a possible efficient derivation of general optimization algorithms directly in the quaternion field, rather than using the isomorphism with the real domain, as is current practice. In addition, unlike the existing quaternion gradients, the GHR calculus allows for the product and chain rule, and for a one-to-one correspondence of the novel quaternion gradient and Hessian with their real counterparts. Properties of the quaternion gradient and Hessian relevant to numerical applications are also introduced, opening a new avenue of research in quaternion optimization and greatly simplified the derivations of learning algorithms. The proposed GHR calculus is shown to yield the same generic algorithm forms as the corresponding real- and complex-valued algorithms. Advantages of the proposed framework are illuminated over illustrative simulations in quaternion signal processing and neural networks.
New Tests of the Fixed Hotspot Approximation
Gordon, R. G.; Andrews, D. L.; Horner-Johnson, B. C.; Kumar, R. R.
2005-05-01
We present new methods for estimating uncertainties in plate reconstructions relative to the hotspots and new tests of the fixed hotspot approximation. We find no significant motion between Pacific hotspots, on the one hand, and Indo-Atlantic hotspots, on the other, for the past ~ 50 Myr, but large and significant apparent motion before 50 Ma. Whether this motion is truly due to motion between hotspots or alternatively due to flaws in the global plate motion circuit can be tested with paleomagnetic data. These tests give results consistent with the fixed hotspot approximation and indicate significant misfits when a relative plate motion circuit through Antarctica is employed for times before 50 Ma. If all of the misfit to the global plate motion circuit is due to motion between East and West Antarctica, then that motion is 800 ± 500 km near the Ross Sea Embayment and progressively less along the Trans-Antarctic Mountains toward the Weddell Sea. Further paleomagnetic tests of the fixed hotspot approximation can be made. Cenozoic and Cretaceous paleomagnetic data from the Pacific plate, along with reconstructions of the Pacific plate relative to the hotspots, can be used to estimate an apparent polar wander (APW) path of Pacific hotspots. An APW path of Indo-Atlantic hotspots can be similarly estimated (e.g. Besse & Courtillot 2002). If both paths diverge in similar ways from the north pole of the hotspot reference frame, it would indicate that the hotspots have moved in unison relative to the spin axis, which may be attributed to true polar wander. If the two paths diverge from one another, motion between Pacific hotspots and Indo-Atlantic hotspots would be indicated. The general agreement of the two paths shows that the former is more important than the latter. The data require little or no motion between groups of hotspots, but up to ~10 mm/yr of motion is allowed within uncertainties. The results disagree, in particular, with the recent extreme interpretation of
Trajectory averaging for stochastic approximation MCMC algorithms
Liang, Faming
2010-01-01
to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic
Reduction of Linear Programming to Linear Approximation
Vaserstein, Leonid N.
2006-01-01
It is well known that every Chebyshev linear approximation problem can be reduced to a linear program. In this paper we show that conversely every linear program can be reduced to a Chebyshev linear approximation problem.
Quick, Christopher M; Venugopal, Arun M; Dongaonkar, Ranjeet M; Laine, Glen A; Stewart, Randolph H
2008-05-01
To return lymph to the great veins of the neck, it must be actively pumped against a pressure gradient. Mean lymph flow in a portion of a lymphatic network has been characterized by an empirical relationship (P(in) - P(out) = -P(p) + R(L)Q(L)), where P(in) - P(out) is the axial pressure gradient and Q(L) is mean lymph flow. R(L) and P(p) are empirical parameters characterizing the effective lymphatic resistance and pump pressure, respectively. The relation of these global empirical parameters to the properties of lymphangions, the segments of a lymphatic vessel bounded by valves, has been problematic. Lymphangions have a structure like blood vessels but cyclically contract like cardiac ventricles; they are characterized by a contraction frequency (f) and the slopes of the end-diastolic pressure-volume relationship [minimum value of resulting elastance (E(min))] and end-systolic pressure-volume relationship [maximum value of resulting elastance (E(max))]. Poiseuille's law provides a first-order approximation relating the pressure-flow relationship to the fundamental properties of a blood vessel. No analogous formula exists for a pumping lymphangion. We therefore derived an algebraic formula predicting lymphangion flow from fundamental physical principles and known lymphangion properties. Quantitative analysis revealed that lymph inertia and resistance to lymph flow are negligible and that lymphangions act like a series of interconnected ventricles. For a single lymphangion, P(p) = P(in) (E(max) - E(min))/E(min) and R(L) = E(max)/f. The formula was tested against a validated, realistic mathematical model of a lymphangion and found to be accurate. Predicted flows were within the range of flows measured in vitro. The present work therefore provides a general solution that makes it possible to relate fundamental lymphangion properties to lymphatic system function.
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.
An approximation for kanban controlled assembly systems
Topan, E.; Avsar, Z.M.
2011-01-01
An approximation is proposed to evaluate the steady-state performance of kanban controlled two-stage assembly systems. The development of the approximation is as follows. The considered continuous-time Markov chain is aggregated keeping the model exact, and this aggregate model is approximated
Operator approximant problems arising from quantum theory
Maher, Philip J
2017-01-01
This book offers an account of a number of aspects of operator theory, mainly developed since the 1980s, whose problems have their roots in quantum theory. The research presented is in non-commutative operator approximation theory or, to use Halmos' terminology, in operator approximants. Focusing on the concept of approximants, this self-contained book is suitable for graduate courses.
Performance evaluation of matrix gradient coils.
Jia, Feng; Schultz, Gerrit; Testud, Frederik; Welz, Anna Masako; Weber, Hans; Littin, Sebastian; Yu, Huijun; Hennig, Jürgen; Zaitsev, Maxim
2016-02-01
In this paper, we present a new performance measure of a matrix coil (also known as multi-coil) from the perspective of efficient, local, non-linear encoding without explicitly considering target encoding fields. An optimization problem based on a joint optimization for the non-linear encoding fields is formulated. Based on the derived objective function, a figure of merit of a matrix coil is defined, which is a generalization of a previously known resistive figure of merit for traditional gradient coils. A cylindrical matrix coil design with a high number of elements is used to illustrate the proposed performance measure. The results are analyzed to reveal novel features of matrix coil designs, which allowed us to optimize coil parameters, such as number of coil elements. A comparison to a scaled, existing multi-coil is also provided to demonstrate the use of the proposed performance parameter. The assessment of a matrix gradient coil profits from using a single performance parameter that takes the local encoding performance of the coil into account in relation to the dissipated power.
Computational Strain Gradient Crystal Plasticity
Niordson, Christian Frithiof; Kysar, Jeffrey W.
2011-01-01
A model for strain gradient crystal visco-plasticity is formulated along the lines proposed by Fleck andWillis (2009) for isotropic plasticity. Size-effects are included in the model due to the addition of gradient terms in both the free energy as well as through a dissipation potential. A finite...... element solution method is presented, which delivers the slip-rate field and the velocity-field based on two minimum principles. Some plane deformation problems relevant for certain specific orientations of a face centered cubic crystal under plane loading conditions are studied, and effective in......-plane parameters are developed based on the crystallographic properties of the material. The problem of cyclic shear of a single crystal between rigid platens is studied as well as void growth of a cylindrical void....
Computational strain gradient crystal plasticity
Niordson, Christian Frithiof; Kysar, Jeffrey W.
2014-01-01
A numerical method for viscous strain gradient crystal plasticity theory is presented, which incorporates both energetic and dissipative gradient effects. The underlying minimum principles are discussed as well as convergence properties of the proposed finite element procedure. Three problems...... of plane crystal plasticity are studied: pure shear of a single crystal between rigid platens as well as plastic deformation around cylindrical voids in hexagonal close packed and face centered cubic crystals. Effective in-plane constitutive slip parameters for plane strain deformation of specifically...... oriented face centered cubic crystals are developed in terms of the crystallographic slip parameters. The effect on geometrically necessary dislocation structures introduced by plastic deformation is investigated as a function of the ratio of void radius to plasticity length scale....
Vertebrate pressure-gradient receivers
Christensen-Dalsgaard, Jakob
2011-01-01
The eardrums of all terrestrial vertebrates (tetrapods) are connected through Eustachian tubes or interaural canals. In some of the animals, these connections create pressure-gradient directionality, an enhanced directionality by interaction of sound arriving at both sides of the eardrum and stro......The eardrums of all terrestrial vertebrates (tetrapods) are connected through Eustachian tubes or interaural canals. In some of the animals, these connections create pressure-gradient directionality, an enhanced directionality by interaction of sound arriving at both sides of the eardrum....... Recent vertebrates form a continuum from perfect interaural transmission (0 dB in a certain frequency band) and pronounced eardrum directionality (30-40 dB) in the lizards, over somewhat attenuated transmission and limited directionality in birds and frogs, to the strongly attenuated interaural...
Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.
1988-11-01
Many physical problems require the solution of coupled partial differential equations on two-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES2 allows each spatial operator to have 5 or 9 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect indices which is vectorizable on some of the newer scientific computers.
Analysis of corrections to the eikonal approximation
Hebborn, C.; Capel, P.
2017-11-01
Various corrections to the eikonal approximations are studied for two- and three-body nuclear collisions with the goal to extend the range of validity of this approximation to beam energies of 10 MeV/nucleon. Wallace's correction does not improve much the elastic-scattering cross sections obtained at the usual eikonal approximation. On the contrary, a semiclassical approximation that substitutes the impact parameter by a complex distance of closest approach computed with the projectile-target optical potential efficiently corrects the eikonal approximation. This opens the possibility to analyze data measured down to 10 MeV/nucleon within eikonal-like reaction models.
A unified approach to the Darwin approximation
Krause, Todd B.; Apte, A.; Morrison, P. J.
2007-01-01
There are two basic approaches to the Darwin approximation. The first involves solving the Maxwell equations in Coulomb gauge and then approximating the vector potential to remove retardation effects. The second approach approximates the Coulomb gauge equations themselves, then solves these exactly for the vector potential. There is no a priori reason that these should result in the same approximation. Here, the equivalence of these two approaches is investigated and a unified framework is provided in which to view the Darwin approximation. Darwin's original treatment is variational in nature, but subsequent applications of his ideas in the context of Vlasov's theory are not. We present here action principles for the Darwin approximation in the Vlasov context, and this serves as a consistency check on the use of the approximation in this setting
An Approximate Approach to Automatic Kernel Selection.
Ding, Lizhong; Liao, Shizhong
2016-02-02
Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.
Bounded-Degree Approximations of Stochastic Networks
Quinn, Christopher J.; Pinar, Ali; Kiyavash, Negar
2017-06-01
We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence. The user-chosen sparsity trades off the quality of the approximation against visual conciseness and computational tractability. One class of approximations contains graphs with speci ed in-degrees. Another class additionally requires that the graph is connected. For both classes, we propose algorithms to identify the optimal approximations and also near-optimal approximations, using a novel relaxation of submodularity. We also propose algorithms to identify the r-best approximations among these classes, enabling robust decision making.
A Modified Conjugacy Condition and Related Nonlinear Conjugate Gradient Method
Shengwei Yao
2014-01-01
Full Text Available The conjugate gradient (CG method has played a special role in solving large-scale nonlinear optimization problems due to the simplicity of their very low memory requirements. In this paper, we propose a new conjugacy condition which is similar to Dai-Liao (2001. Based on this condition, the related nonlinear conjugate gradient method is given. With some mild conditions, the given method is globally convergent under the strong Wolfe-Powell line search for general functions. The numerical experiments show that the proposed method is very robust and efficient.
Cophylogeny reconstruction via an approximate Bayesian computation.
Baudet, C; Donati, B; Sinaimeri, B; Crescenzi, P; Gautier, C; Matias, C; Sagot, M-F
2015-05-01
Despite an increasingly vast literature on cophylogenetic reconstructions for studying host-parasite associations, understanding the common evolutionary history of such systems remains a problem that is far from being solved. Most algorithms for host-parasite reconciliation use an event-based model, where the events include in general (a subset of) cospeciation, duplication, loss, and host switch. All known parsimonious event-based methods then assign a cost to each type of event in order to find a reconstruction of minimum cost. The main problem with this approach is that the cost of the events strongly influences the reconciliation obtained. Some earlier approaches attempt to avoid this problem by finding a Pareto set of solutions and hence by considering event costs under some minimization constraints. To deal with this problem, we developed an algorithm, called Coala, for estimating the frequency of the events based on an approximate Bayesian computation approach. The benefits of this method are 2-fold: (i) it provides more confidence in the set of costs to be used in a reconciliation, and (ii) it allows estimation of the frequency of the events in cases where the data set consists of trees with a large number of taxa. We evaluate our method on simulated and on biological data sets. We show that in both cases, for the same pair of host and parasite trees, different sets of frequencies for the events lead to equally probable solutions. Moreover, often these solutions differ greatly in terms of the number of inferred events. It appears crucial to take this into account before attempting any further biological interpretation of such reconciliations. More generally, we also show that the set of frequencies can vary widely depending on the input host and parasite trees. Indiscriminately applying a standard vector of costs may thus not be a good strategy. © The Author(s) 2014. Published by Oxford University Press, on behalf of the Society of Systematic Biologists.
Galerkin approximations of nonlinear optimal control problems in Hilbert spaces
Mickael D. Chekroun
2017-07-01
Full Text Available Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on the identification of a set of natural assumptions that allows us to deal with a broad class of nonlinear evolution equations and cost functionals for which we derive convergence of the value functions associated with the optimal control problem of the Galerkin approximations. This convergence result holds for a broad class of nonlinear control strategies as well. In particular, we show that the framework applies to the optimal control of semilinear heat equations posed on a general compact manifold without boundary. The framework is then shown to apply to geoengineering and mitigation of greenhouse gas emissions formulated here in terms of optimal control of energy balance climate models posed on the sphere $\\mathbb{S}^2$.
Approximate maximum likelihood estimation for population genetic inference.
Bertl, Johanna; Ewing, Gregory; Kosiol, Carolin; Futschik, Andreas
2017-11-27
In many population genetic problems, parameter estimation is obstructed by an intractable likelihood function. Therefore, approximate estimation methods have been developed, and with growing computational power, sampling-based methods became popular. However, these methods such as Approximate Bayesian Computation (ABC) can be inefficient in high-dimensional problems. This led to the development of more sophisticated iterative estimation methods like particle filters. Here, we propose an alternative approach that is based on stochastic approximation. By moving along a simulated gradient or ascent direction, the algorithm produces a sequence of estimates that eventually converges to the maximum likelihood estimate, given a set of observed summary statistics. This strategy does not sample much from low-likelihood regions of the parameter space, and is fast, even when many summary statistics are involved. We put considerable efforts into providing tuning guidelines that improve the robustness and lead to good performance on problems with high-dimensional summary statistics and a low signal-to-noise ratio. We then investigate the performance of our resulting approach and study its properties in simulations. Finally, we re-estimate parameters describing the demographic history of Bornean and Sumatran orang-utans.
Combinations of probabilistic and approximate quantum cloning and deleting
Qiu Daowen
2002-01-01
We first construct a probabilistic and approximate quantum cloning machine (PACM) and then clarify the relation between the PACM and other cloning machines. After that, we estimate the global fidelity of the approximate cloning that improves the previous estimation for the deterministic cloning machine; and also derive a bound on the success probability of producing perfect multiple clones. Afterwards, we further establish a more generalized probabilistic and approximate cloning and deleting machine (PACDM) and discuss the connections of the PACDM to some of the existing quantum cloning and deleting machines. Finally the global fidelity and a bound on the success probability of the PACDM are obtained. Summarily, the quantum devices established in this paper improve and also greatly generalize some of the existing machines
Rainbows: Mie computations and the Airy approximation.
Wang, R T; van de Hulst, H C
1991-01-01
Efficient and accurate computation of the scattered intensity pattern by the Mie formulas is now feasible for size parameters up to x = 50,000 at least, which in visual light means spherical drops with diameters up to 6 mm. We present a method for evaluating the Mie coefficients from the ratios between Riccati-Bessel and Neumann functions of successive order. We probe the applicability of the Airy approximation, which we generalize to rainbows of arbitrary p (number of internal reflections = p - 1), by comparing the Mie and Airy intensity patterns. Millimeter size water drops show a match in all details, including the position and intensity of the supernumerary maxima and the polarization. A fairly good match is still seen for drops of 0.1 mm. A small spread in sizes helps to smooth out irrelevant detail. The dark band between the rainbows is used to test more subtle features. We conclude that this band contains not only externally reflected light (p = 0) but also a sizable contribution f rom the p = 6 and p = 7 rainbows, which shift rapidly with wavelength. The higher the refractive index, the closer both theories agree on the first primary rainbow (p = 2) peak for drop diameters as small as 0.02 mm. This may be useful in supporting experimental work.
A rapid and robust gradient measurement technique using dynamic single-point imaging.
Jang, Hyungseok; McMillan, Alan B
2017-09-01
We propose a new gradient measurement technique based on dynamic single-point imaging (SPI), which allows simple, rapid, and robust measurement of k-space trajectory. To enable gradient measurement, we utilize the variable field-of-view (FOV) property of dynamic SPI, which is dependent on gradient shape. First, one-dimensional (1D) dynamic SPI data are acquired from a targeted gradient axis, and then relative FOV scaling factors between 1D images or k-spaces at varying encoding times are found. These relative scaling factors are the relative k-space position that can be used for image reconstruction. The gradient measurement technique also can be used to estimate the gradient impulse response function for reproducible gradient estimation as a linear time invariant system. The proposed measurement technique was used to improve reconstructed image quality in 3D ultrashort echo, 2D spiral, and multi-echo bipolar gradient-echo imaging. In multi-echo bipolar gradient-echo imaging, measurement of the k-space trajectory allowed the use of a ramp-sampled trajectory for improved acquisition speed (approximately 30%) and more accurate quantitative fat and water separation in a phantom. The proposed dynamic SPI-based method allows fast k-space trajectory measurement with a simple implementation and no additional hardware for improved image quality. Magn Reson Med 78:950-962, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.
Incompressible Maxwell-Boussinesq approximation: Existence, uniqueness and shape sensitivity
Consiglieri, L.; Nečasová, Šárka; Sokolowski, J.
2009-01-01
Roč. 38, č. 4 (2009), s. 1193-1215 ISSN 0324-8569 R&D Projects: GA ČR GA201/05/0005; GA ČR GA201/08/0012 Institutional research plan: CEZ:AV0Z10190503 Keywords : Maxwell-Boussinesq approximation Subject RIV: BA - General Mathematics Impact factor: 0.378, year: 2009
Kernel-Based Approximate Dynamic Programming Using Bellman Residual Elimination
2010-02-01
Redding, Mike Robbins, Frant Sobolic, Justin Teo, Tuna Toksoz, Glenn Tournier, Aditya Undurti, Mario Valenti, Andy Whitten, Albert Wu, and Rodrigo...vector algorithms. Neural Computation, 12(5):1207–1245, 2000. [143] P. Schweitzer and A. Seidman. Generalized polynomial approximation in Markovian
An extension of Brosowski-Meinardus theorem on invariant approximation
Liaqat Ali Khan; Abdul Rahim Khan.
1991-07-01
We obtain a generalization of a fixed point theorem of Dotson for non-expansive mappings on star-shaped sets and then use it to prove a unified Brosowski-Meinardus theorem on invariant approximation in the setting of p-normed linear spaces. (author). 13 refs
Subtracting a best rank-1 approximation may increase tensor rank
Stegeman, Alwin; Comon, Pierre
2010-01-01
It has been shown that a best rank-R approximation of an order-k tensor may not exist when R >= 2 and k >= 3. This poses a serious problem to data analysts using tensor decompositions it has been observed numerically that, generally, this issue cannot be solved by consecutively computing and
The dilute random field Ising model by finite cluster approximation
Benyoussef, A.; Saber, M.
1987-09-01
Using the finite cluster approximation, phase diagrams of bond and site diluted three-dimensional simple cubic Ising models with a random field have been determined. The resulting phase diagrams have the same general features for both bond and site dilution. (author). 7 refs, 4 figs
A Statistical Mechanics Approach to Approximate Analytical Bootstrap Averages
Malzahn, Dorthe; Opper, Manfred
2003-01-01
We apply the replica method of Statistical Physics combined with a variational method to the approximate analytical computation of bootstrap averages for estimating the generalization error. We demonstrate our approach on regression with Gaussian processes and compare our results with averages...
Gradient computation for VTI acoustic wavefield tomography
Li, Vladimir; Wang, Hui; Tsvankin, Ilya; Diaz, Esteban; Alkhalifah, Tariq Ali
2016-01-01
-power objective functions. We also obtain the gradient expressions for the data-domain objective function, which can incorporate borehole information necessary for stable VTI velocity analysis. These gradients are compared to the ones obtained with a space
Thygesen, Uffe Høgsbro
2016-03-01
We consider organisms which use a renewal strategy such as run-tumble when moving in space, for example to perform chemotaxis in chemical gradients. We derive a diffusion approximation for the motion, applying a central limit theorem due to Anscombe for renewal-reward processes; this theorem has not previously been applied in this context. Our results extend previous work, which has established the mean drift but not the diffusivity. For a classical model of tumble rates applied to chemotaxis, we find that the resulting chemotactic drift saturates to the swimming velocity of the organism when the chemical gradients grow increasingly steep. The dispersal becomes anisotropic in steep gradients, with larger dispersal across the gradient than along the gradient. In contrast to one-dimensional settings, strong bias increases dispersal. We next include Brownian rotation in the model and find that, in limit of high chemotactic sensitivity, the chemotactic drift is 64% of the swimming velocity, independent of the magnitude of the Brownian rotation. We finally derive characteristic timescales of the motion that can be used to assess whether the diffusion limit is justified in a given situation. The proposed technique for obtaining diffusion approximations is conceptually and computationally simple, and applicable also when statistics of the motion is obtained empirically or through Monte Carlo simulation of the motion.
Cosmological applications of Padé approximant
Wei, Hao; Yan, Xiao-Peng; Zhou, Ya-Nan
2014-01-01
As is well known, in mathematics, any function could be approximated by the Padé approximant. The Padé approximant is the best approximation of a function by a rational function of given order. In fact, the Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. In the present work, we consider the Padé approximant in two issues. First, we obtain the analytical approximation of the luminosity distance for the flat XCDM model, and find that the relative error is fairly small. Second, we propose several parameterizations for the equation-of-state parameter (EoS) of dark energy based on the Padé approximant. They are well motivated from the mathematical and physical points of view. We confront these EoS parameterizations with the latest observational data, and find that they can work well. In these practices, we show that the Padé approximant could be an useful tool in cosmology, and it deserves further investigation
Cosmological applications of Padé approximant
Wei, Hao; Yan, Xiao-Peng; Zhou, Ya-Nan
2014-01-01
As is well known, in mathematics, any function could be approximated by the Padé approximant. The Padé approximant is the best approximation of a function by a rational function of given order. In fact, the Padé approximant often gives better approximation of the function than truncating its Taylor series, and it may still work where the Taylor series does not converge. In the present work, we consider the Padé approximant in two issues. First, we obtain the analytical approximation of the luminosity distance for the flat XCDM model, and find that the relative error is fairly small. Second, we propose several parameterizations for the equation-of-state parameter (EoS) of dark energy based on the Padé approximant. They are well motivated from the mathematical and physical points of view. We confront these EoS parameterizations with the latest observational data, and find that they can work well. In these practices, we show that the Padé approximant could be an useful tool in cosmology, and it deserves further investigation.
Mingqi Xiang
2013-04-01
Full Text Available In this article, we study a class of nonlocal quasilinear parabolic variational inequality involving $p(x$-Laplacian operator and gradient constraint on a bounded domain. Choosing a special penalty functional according to the gradient constraint, we transform the variational inequality to a parabolic equation. By means of Galerkin's approximation method, we obtain the existence of weak solutions for this equation, and then through a priori estimates, we obtain the weak solutions of variational inequality.
An education gradient in health, a health gradient in education, or a confounded gradient in both?
Lynch, Jamie L; von Hippel, Paul T
2016-04-01
There is a positive gradient associating educational attainment with health, yet the explanation for this gradient is not clear. Does higher education improve health (causation)? Do the healthy become highly educated (selection)? Or do good health and high educational attainment both result from advantages established early in the life course (confounding)? This study evaluates these competing explanations by tracking changes in educational attainment and Self-rated Health (SRH) from age 15 to age 31 in the National Longitudinal Study of Youth, 1997 cohort. Ordinal logistic regression confirms that high-SRH adolescents are more likely to become highly educated. This is partly because adolescent SRH is associated with early advantages including adolescents' academic performance, college plans, and family background (confounding); however, net of these confounders adolescent SRH still predicts adult educational attainment (selection). Fixed-effects longitudinal regression shows that educational attainment has little causal effect on SRH at age 31. Completion of a high school diploma or associate's degree has no effect on SRH, while completion of a bachelor's or graduate degree have effects that, though significant, are quite small (less than 0.1 points on a 5-point scale). While it is possible that educational attainment would have greater effect on health at older ages, at age 31 what we see is a health gradient in education, shaped primarily by selection and confounding rather than by a causal effect of education on health. Copyright © 2016 Elsevier Ltd. All rights reserved.
Strain gradient effects in surface roughening
Borg, Ulrik; Fleck, N.A.
2007-01-01
evidence for strain gradient effects. Numerical analyses of a bicrystal undergoing in-plane tensile deformation are also studied using a strain gradient crystal plasticity theory and also by using a strain gradient plasticity theory for an isotropic solid. Both theories include an internal material length...
Generalization of free-operant avoidance behavior in pigeons1
Klein, Marty; Rilling, Mark
1974-01-01
Three groups of four pigeons, trained to press a treadle on a free-operant avoidance schedule, were given auditory discrimination training. Alternating 2-min components of avoidance and no shock were paired with either a tone or white noise. The pigeons were subsequently given two types of generalization tests, with and without avoidable shocks scheduled. Two of the groups, trained interdimensionally, produced excitatory and inhibitory generalization gradients along the tone frequency dimension. A predicted post-discrimination gradient was computed from the algebraic summation of these gradients of excitation and inhibition. The predicted gradient was compared with the actual post-discrimination gradient obtained from the third group of pigeons that had been given intradimensional discrimination training on the tone frequency dimension. The predicted postdiscrimination gradient agreed in shape with the empirical postdiscrimination gradient. The results in general support Spence's (1937) gradient interaction theory. PMID:16811735
A Stokes drift approximation based on the Phillips spectrum
Breivik, Øyvind; Bidlot, Jean-Raymond; Janssen, Peter A. E. M.
2016-04-01
A new approximation to the Stokes drift velocity profile based on the exact solution for the Phillips spectrum is explored. The profile is compared with the monochromatic profile and the recently proposed exponential integral profile. ERA-Interim spectra and spectra from a wave buoy in the central North Sea are used to investigate the behavior of the profile. It is found that the new profile has a much stronger gradient near the surface and lower normalized deviation from the profile computed from the spectra. Based on estimates from two open-ocean locations, an average value has been estimated for a key parameter of the profile. Given this parameter, the profile can be computed from the same two parameters as the monochromatic profile, namely the transport and the surface Stokes drift velocity.
Theory of magnetohydrodynamic waves: The WKB approximation revisited
Barnes, A.
1992-01-01
Past treatments of the eikonal or WKB theory of the propagation of magnetohydrodynamics waves have assumed a strictly isentropic background. IF in fact there is a gradient in the background entropy, then in second order in the WKB ordering, adiabatic fluctuations (in the Lagrangian sense) are not strictly isentropic in the Eulerian sense. This means that in the second order of the WKB expansion, which determines the variation of wave amplitude along rays, the violation of isentropy must be accounted for. The present paper revisits the derivation of the WKB approximation for small-amplitude magnetohydrodynamic waves, allowing for possible spatial variation of the background entropy. The equation of variation of wave amplitude is rederived; it is a bilinear equation which, it turns out, can be recast in the action conservation form. It is shown that this action conservation equation is in fact equivalent to the action conservation law obtained from Lagrangian treatments
cultivadas bajo un gradiente de sombra
Marco V. Gutiérrez
2007-01-01
Full Text Available Se evaluó el crecimiento de 9 especies de palmas cultivadas bajo un gradiente de sombra producido por mallas de polipropileno negro de 40, 50, 60, 70 y 80% de sombra, más un tratamiento de malla aluminizada de 70%, y uno con plantas a pleno sol. Las especies evaluadas fueron Caryota mitis (cola de pez, Chamaedorea costaricana (pacaya, Chamaedorea tepejilote (tepejilote, Dypsis lutescens (areca, Licuala elegans (licuala, Phoenix roebelenii (fénix, Ptychosperma macarthurii (palma macarthur, Roystonea regia (palma real, y Veitchia merrillii (navideña. Se midió la altura de las plantas, la longitud de las hojas maduras, y el número de hojas cosechadas, durante 5 cosechas por 2 años. En general, la altura de las plantas y la longitud de las hojas fueron menores a 0-40% de sombra, se incrementaron a 50-70%, y decrecieron a 80%. C. mitis, C. tepejilote, L. elegans y P. macarthurii, se comportaron como especies obligadas de sombra y no sobrevivieron a pleno sol. C. costaricana y D. lutescens sobrevivieron a plena exposición solar, y su crecimiento alcanzó valores máximos a 50-60%. P. roebelenii, R. regia, y V. merrillii mostraron un crecimiento reducido a 0-40%, pero éste mejoró bajo los demás niveles de sombra a lo largo del gradiente. En general, 1-2 años es un periodo apropiado para el cultivo de palmas de crecimiento rápido (R. regia, Chamedorea spp., D. lutescens en casas de mallas. Palmas de lento crecimiento (L.elegans pueden permanecer 3-5 años en una casa de sombra. Se discute estrategias para el uso de gradientes de sombra en el tiempo y en el espacio, según la utilidad y los requerimientos de las especies, los requisitos establecidos por el mercado, y el ciclo de producción del material vegetal.
Justifying quasiparticle self-consistent schemes via gradient optimization in Baym-Kadanoff theory.
Ismail-Beigi, Sohrab
2017-09-27
The question of which non-interacting Green's function 'best' describes an interacting many-body electronic system is both of fundamental interest as well as of practical importance in describing electronic properties of materials in a realistic manner. Here, we study this question within the framework of Baym-Kadanoff theory, an approach where one locates the stationary point of a total energy functional of the one-particle Green's function in order to find the total ground-state energy as well as all one-particle properties such as the density matrix, chemical potential, or the quasiparticle energy spectrum and quasiparticle wave functions. For the case of the Klein functional, our basic finding is that minimizing the length of the gradient of the total energy functional over non-interacting Green's functions yields a set of self-consistent equations for quasiparticles that is identical to those of the quasiparticle self-consistent GW (QSGW) (van Schilfgaarde et al 2006 Phys. Rev. Lett. 96 226402-4) approach, thereby providing an a priori justification for such an approach to electronic structure calculations. In fact, this result is general, applies to any self-energy operator, and is not restricted to any particular approximation, e.g., the GW approximation for the self-energy. The approach also shows that, when working in the basis of quasiparticle states, solving the diagonal part of the self-consistent Dyson equation is of primary importance while the off-diagonals are of secondary importance, a common observation in the electronic structure literature of self-energy calculations. Finally, numerical tests and analytical arguments show that when the Dyson equation produces multiple quasiparticle solutions corresponding to a single non-interacting state, minimizing the length of the gradient translates into choosing the solution with largest quasiparticle weight.
Optimization of Coil Element Configurations for a Matrix Gradient Coil.
Kroboth, Stefan; Layton, Kelvin J; Jia, Feng; Littin, Sebastian; Yu, Huijun; Hennig, Jurgen; Zaitsev, Maxim
2018-01-01
Recently, matrix gradient coils (also termed multi-coils or multi-coil arrays) were introduced for imaging and B 0 shimming with 24, 48, and even 84 coil elements. However, in imaging applications, providing one amplifier per coil element is not always feasible due to high cost and technical complexity. In this simulation study, we show that an 84-channel matrix gradient coil (head insert for brain imaging) is able to create a wide variety of field shapes even if the number of amplifiers is reduced. An optimization algorithm was implemented that obtains groups of coil elements, such that a desired target field can be created by driving each group with an amplifier. This limits the number of amplifiers to the number of coil element groups. Simulated annealing is used due to the NP-hard combinatorial nature of the given problem. A spherical harmonic basis set up to the full third order within a sphere of 20-cm diameter in the center of the coil was investigated as target fields. We show that the median normalized least squares error for all target fields is below approximately 5% for 12 or more amplifiers. At the same time, the dissipated power stays within reasonable limits. With a relatively small set of amplifiers, switches can be used to sequentially generate spherical harmonics up to third order. The costs associated with a matrix gradient coil can be lowered, which increases the practical utility of matrix gradient coils.
Consolidation by Prefabricated Vertical Drains with a Threshold Gradient
Xiao Guo
2014-01-01
Full Text Available This paper shows the development of an approximate analytical solution of radial consolidation by prefabricated vertical drains with a threshold gradient. To understand the effect of the threshold gradient on consolidation, a parametric analysis was performed using the present solution. The applicability of the present solution was demonstrated in two cases, wherein the comparisons with Hansbo’s results and observed data were conducted. It was found that (1 the flow with the threshold gradient would not occur instantaneously throughout the whole unit cell. Rather, it gradually occurs from the vertical drain to the outside; (2 the moving boundary would never reach the outer radius of influence if R+1
Color Gradients Within Globular Clusters: Restricted Numerical Simulation
Young-Jong Sohn
1997-06-01
Full Text Available The results of a restricted numerical simulation for the color gradients within globular clusters have been presented. The standard luminosity function of M3 and Salpeter's initial mass functions were used to generate model clusters as a fundamental population. Color gradients with the sample clusters for both King and power law cusp models of surface brightness distributions are discussed in the case of using the standard luminosity function. The dependence of color gradients on several parameters for the simulations with Salpeter's initial mass functions, such as slope of initial mass functions, cluster ages, metallicities, concentration parameters of King model, and slopes of power law, are also discussed. No significant radial color gradients are shown to the sample clusters which are regenerated by a random number generation technique with various parameters in both of King and power law cusp models of surface brightness distributions. Dynamical mass segregation and stellar evolution of horizontal branch stars and blue stragglers should be included for the general case of model simulations to show the observed radial color gradients within globular clusters.
Multilevel Monte Carlo in Approximate Bayesian Computation
Jasra, Ajay
2017-02-13
In the following article we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.
Uniform analytic approximation of Wigner rotation matrices
Hoffmann, Scott E.
2018-02-01
We derive the leading asymptotic approximation, for low angle θ, of the Wigner rotation matrix elements, dm1m2 j(θ ) , uniform in j, m1, and m2. The result is in terms of a Bessel function of integer order. We numerically investigate the error for a variety of cases and find that the approximation can be useful over a significant range of angles. This approximation has application in the partial wave analysis of wavepacket scattering.
Exact and approximate multiple diffraction calculations
Alexander, Y.; Wallace, S.J.; Sparrow, D.A.
1976-08-01
A three-body potential scattering problem is solved in the fixed scatterer model exactly and approximately to test the validity of commonly used assumptions of multiple scattering calculations. The model problem involves two-body amplitudes that show diffraction-like differential scattering similar to high energy hadron-nucleon amplitudes. The exact fixed scatterer calculations are compared to Glauber approximation, eikonal-expansion results and a noneikonal approximation
Dhia, Hamed Ben
1987-10-01
Five hundred and fifty temperature values, initially measured as either bottom-hole temperatures (BHT) or drill-stem tests (DST), from 98 selected petroleum exploration wells form the basis of a geothermal gradient map of central Tunisia. A "global-statistical" method was employed to correct the BHT measurements, using the DST as references. The geothermal gradient ranges from 23° to 49°C/km. Comparison of the geothermal gradient with structural, gravimetric and petroleum data indicates that: (1) the general trend of the geothermal gradient curves reflects the main structural directions of the region, (2) zones of low and high geothermal gradient are correlated with zones of negative and positive Bouguer anomalies and (3) the five most important oil fields of central Tunisia are located near the geothermal gradient curve of 40° C/km. Such associations could have practical importance in petroleum exploration, but their significance must first be established through further investigation and additional data.
Bent approximations to synchrotron radiation optics
Heald, S.
1981-01-01
Ideal optical elements can be approximated by bending flats or cylinders. This paper considers the applications of these approximate optics to synchrotron radiation. Analytic and raytracing studies are used to compare their optical performance with the corresponding ideal elements. It is found that for many applications the performance is adequate, with the additional advantages of lower cost and greater flexibility. Particular emphasis is placed on obtaining the practical limitations on the use of the approximate elements in typical beamline configurations. Also considered are the possibilities for approximating very long length mirrors using segmented mirrors
Local density approximations for relativistic exchange energies
MacDonald, A.H.
1986-01-01
The use of local density approximations to approximate exchange interactions in relativistic electron systems is reviewed. Particular attention is paid to the physical content of these exchange energies by discussing results for the uniform relativistic electron gas from a new point of view. Work on applying these local density approximations in atoms and solids is reviewed and it is concluded that good accuracy is usually possible provided self-interaction corrections are applied. The local density approximations necessary for spin-polarized relativistic systems are discussed and some new results are presented
Approximate maximum parsimony and ancestral maximum likelihood.
Alon, Noga; Chor, Benny; Pardi, Fabio; Rapoport, Anat
2010-01-01
We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP-hard, so we seek approximate solutions. We formulate the two problems as Steiner tree problems under appropriate distances. The gist of our approach is the succinct characterization of Steiner trees for a small number of leaves for the two distances. This enables the use of known Steiner tree approximation algorithms. The approach leads to a 16/9 approximation ratio for AML and asymptotically to a 1.55 approximation ratio for MP.
APPROXIMATIONS TO PERFORMANCE MEASURES IN QUEUING SYSTEMS
Kambo, N. S.
2012-11-01
Full Text Available Approximations to various performance measures in queuing systems have received considerable attention because these measures have wide applicability. In this paper we propose two methods to approximate the queuing characteristics of a GI/M/1 system. The first method is non-parametric in nature, using only the first three moments of the arrival distribution. The second method treads the known path of approximating the arrival distribution by a mixture of two exponential distributions by matching the first three moments. Numerical examples and optimal analysis of performance measures of GI/M/1 queues are provided to illustrate the efficacy of the methods, and are compared with benchmark approximations.
Analytic Approximation to Radiation Fields from Line Source Geometry
Michieli, I.
2000-01-01
Line sources with slab shields represent typical source-shield configuration in gamma-ray attenuation problems. Such shielding problems often lead to the generalized Secant integrals of the specific form. Besides numerical integration approach, various expansions and rational approximations with limited applicability are in use for computing the value of such integral functions. Lately, the author developed rapidly convergent infinite series representation of generalized Secant Integrals involving incomplete Gamma functions. Validity of such representation was established for zero and positive values of integral parameter a (a=0). In this paper recurrence relations for generalized Secant Integrals are derived allowing us simple approximate analytic calculation of the integral for arbitrary a values. It is demonstrated how truncated series representation can be used, as the basis for such calculations, when possibly negative a values are encountered. (author)
Statistical convergence of a non-positive approximation process
Agratini, Octavian
2011-01-01
Highlights: → A general class of approximation processes is introduced. → The A-statistical convergence is studied. → Applications in quantum calculus are delivered. - Abstract: Starting from a general sequence of linear and positive operators of discrete type, we associate its r-th order generalization. This construction involves high order derivatives of a signal and it looses the positivity property. Considering that the initial approximation process is A-statistically uniform convergent, we prove that the property is inherited by the new sequence. Also, our result includes information about the uniform convergence. Two applications in q-Calculus are presented. We study q-analogues both of Meyer-Koenig and Zeller operators and Stancu operators.
Using function approximation to determine neural network accuracy
Wichman, R.F.; Alexander, J.
2013-01-01
Many, if not most, control processes demonstrate nonlinear behavior in some portion of their operating range and the ability of neural networks to model non-linear dynamics makes them very appealing for control. Control of high reliability safety systems, and autonomous control in process or robotic applications, however, require accurate and consistent control and neural networks are only approximators of various functions so their degree of approximation becomes important. In this paper, the factors affecting the ability of a feed-forward back-propagation neural network to accurately approximate a non-linear function are explored. Compared to pattern recognition using a neural network for function approximation provides an easy and accurate method for determining the network's accuracy. In contrast to other techniques, we show that errors arising in function approximation or curve fitting are caused by the neural network itself rather than scatter in the data. A method is proposed that provides improvements in the accuracy achieved during training and resulting ability of the network to generalize after training. Binary input vectors provided a more accurate model than with scalar inputs and retraining using a small number of the outlier x,y pairs improved generalization. (author)
Analytical models approximating individual processes: a validation method.
Favier, C; Degallier, N; Menkès, C E
2010-12-01
Upscaling population models from fine to coarse resolutions, in space, time and/or level of description, allows the derivation of fast and tractable models based on a thorough knowledge of individual processes. The validity of such approximations is generally tested only on a limited range of parameter sets. A more general validation test, over a range of parameters, is proposed; this would estimate the error induced by the approximation, using the original model's stochastic variability as a reference. This method is illustrated by three examples taken from the field of epidemics transmitted by vectors that bite in a temporally cyclical pattern, that illustrate the use of the method: to estimate if an approximation over- or under-fits the original model; to invalidate an approximation; to rank possible approximations for their qualities. As a result, the application of the validation method to this field emphasizes the need to account for the vectors' biology in epidemic prediction models and to validate these against finer scale models. Copyright © 2010 Elsevier Inc. All rights reserved.
Temperature Gradient in Hall Thrusters
Staack, D.; Raitses, Y.; Fisch, N.J.
2003-01-01
Plasma potentials and electron temperatures were deduced from emissive and cold floating probe measurements in a 2 kW Hall thruster, operated in the discharge voltage range of 200-400 V. An almost linear dependence of the electron temperature on the plasma potential was observed in the acceleration region of the thruster both inside and outside the thruster. This result calls into question whether secondary electron emission from the ceramic channel walls plays a significant role in electron energy balance. The proportionality factor between the axial electron temperature gradient and the electric field is significantly smaller than might be expected by models employing Ohmic heating of electrons
Dai-Kou type conjugate gradient methods with a line search only using gradient.
Huang, Yuanyuan; Liu, Changhe
2017-01-01
In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope. Under suitable conditions, the developed methods are globally convergent. Numerical tests and comparisons with the PRP+ conjugate gradient method only using gradient show that the methods are efficient.
LES of the adverse-pressure gradient turbulent boundary layer
Inoue, M.; Pullin, D.I.; Harun, Z.; Marusic, I.
2013-01-01
Highlights: • The adverse-pressure gradient turbulent boundary layer at high Re is studied. • Wall-model LES works well for nonequilibrium turbulent boundary layer. • Relationship of skin-friction to Re and Clauser pressure parameter is explored. • Self-similarity is observed in the velocity statistics over a wide range of Re. -- Abstract: We describe large-eddy simulations (LES) of the flat-plate turbulent boundary layer in the presence of an adverse pressure gradient. The stretched-vortex subgrid-scale model is used in the domain of the flow coupled to a wall model that explicitly accounts for the presence of a finite pressure gradient. The LES are designed to match recent experiments conducted at the University of Melbourne wind tunnel where a plate section with zero pressure gradient is followed by section with constant adverse pressure gradient. First, LES are described at Reynolds numbers based on the local free-stream velocity and the local momentum thickness in the range 6560–13,900 chosen to match the experimental conditions. This is followed by a discussion of further LES at Reynolds numbers at approximately 10 times and 100 times these values, which are well out of range of present day direct numerical simulation and wall-resolved LES. For the lower Reynolds number runs, mean velocity profiles, one-point turbulent statistics of the velocity fluctuations, skin friction and the Clauser and acceleration parameters along the streamwise, adverse pressure-gradient domain are compared to the experimental measurements. For the full range of LES, the relationship of the skin-friction coefficient, in the form of the ratio of the local free-stream velocity to the local friction velocity, to both Reynolds number and the Clauser parameter is explored. At large Reynolds numbers, a region of collapse is found that is well described by a simple log-like empirical relationship over two orders of magnitude. This is expected to be useful for constant adverse
Banks, H. T.; Kunisch, K.
1982-01-01
Approximation results from linear semigroup theory are used to develop a general framework for convergence of approximation schemes in parameter estimation and optimal control problems for nonlinear partial differential equations. These ideas are used to establish theoretical convergence results for parameter identification using modal (eigenfunction) approximation techniques. Results from numerical investigations of these schemes for both hyperbolic and parabolic systems are given.
Ternary gradient metal-organic frameworks.
Liu, Chong; Rosi, Nathaniel L
2017-09-08
Gradient MOFs contain directional gradients of either structure or functionality. We have successfully prepared two ternary gradient MOFs based on bMOF-100 analogues, namely bMOF-100/102/106 and bMOF-110/100/102, via cascade ligand exchange reactions. The cubic unit cell parameter discrepancy within an individual ternary gradient MOF crystal is as large as ∼1 nm, demonstrating the impressive compatibility and flexibility of the component MOF materials. Because of the presence of a continuum of unit cells, the pore diameters within individual crystals also change in a gradient fashion from ∼2.5 nm to ∼3.0 nm for bMOF-100/102/106, and from ∼2.2 nm to ∼2.7 nm for bMOF-110/100/102, indicating significant porosity gradients. Like previously reported binary gradient MOFs, the composition of the ternary gradient MOFs can be easily controlled by adjusting the reaction conditions. Finally, X-ray diffraction and microspectrophotometry were used to analyse fractured gradient MOF crystals by comparing unit cell parameters and absorbance spectra at different locations, thus revealing the profile of heterogeneity (i.e. gradient distribution of properties) and further confirming the formation of ternary gradient MOFs.
Fast and robust estimation of spectro-temporal receptive fields using stochastic approximations.
Meyer, Arne F; Diepenbrock, Jan-Philipp; Ohl, Frank W; Anemüller, Jörn
2015-05-15
The receptive field (RF) represents the signal preferences of sensory neurons and is the primary analysis method for understanding sensory coding. While it is essential to estimate a neuron's RF, finding numerical solutions to increasingly complex RF models can become computationally intensive, in particular for high-dimensional stimuli or when many neurons are involved. Here we propose an optimization scheme based on stochastic approximations that facilitate this task. The basic idea is to derive solutions on a random subset rather than computing the full solution on the available data set. To test this, we applied different optimization schemes based on stochastic gradient descent (SGD) to both the generalized linear model (GLM) and a recently developed classification-based RF estimation approach. Using simulated and recorded responses, we demonstrate that RF parameter optimization based on state-of-the-art SGD algorithms produces robust estimates of the spectro-temporal receptive field (STRF). Results on recordings from the auditory midbrain demonstrate that stochastic approximations preserve both predictive power and tuning properties of STRFs. A correlation of 0.93 with the STRF derived from the full solution may be obtained in less than 10% of the full solution's estimation time. We also present an on-line algorithm that allows simultaneous monitoring of STRF properties of more than 30 neurons on a single computer. The proposed approach may not only prove helpful for large-scale recordings but also provides a more comprehensive characterization of neural tuning in experiments than standard tuning curves. Copyright © 2015 Elsevier B.V. All rights reserved.
Strain gradient effects on cyclic plasticity
Niordson, Christian Frithiof; Legarth, Brian Nyvang
2010-01-01
Size effects on the cyclic shear response are studied numerically using a recent higher order strain gradient visco-plasticity theory accounting for both dissipative and energetic gradient hardening. Numerical investigations of the response under cyclic pure shear and shear of a finite slab between...... rigid platens have been carried out, using the finite element method. It is shown for elastic–perfectly plastic solids how dissipative gradient effects lead to increased yield strength, whereas energetic gradient contributions lead to increased hardening as well as a Bauschinger effect. For linearly...... hardening materials it is quantified how dissipative and energetic gradient effects promote hardening above that of conventional predictions. Usually, increased hardening is attributed to energetic gradient effects, but here it is found that also dissipative gradient effects lead to additional hardening...
Perturbative stability of the approximate Killing field eigenvalue problem
Beetle, Christopher; Wilder, Shawn
2014-01-01
An approximate Killing field may be defined on a compact, Riemannian geometry by solving an eigenvalue problem for a certain elliptic operator. This paper studies the effect of small perturbations in the Riemannian metric on the resulting vector field. It shows that small metric perturbations, as measured using a Sobolev-type supremum norm on the space of Riemannian geometries on a fixed manifold, yield small perturbations in the approximate Killing field, as measured using a Hilbert-type square integral norm. It also discusses applications to the problem of computing the spin of a generic black hole in general relativity. (paper)
Group C∗-algebras without the completely bounded approximation property
Haagerup, U.
2016-01-01
It is proved that: (1) The Fourier algebra A(G) of a simple Lie group G of real rank at least 2 with finite center does not have a multiplier bounded approximate unit. (2) The reduced C∗-algebra C∗ r of any lattice in a non-compact simple Lie group of real rank at least 2 with finite center does...... not have the completely bounded approximation property. Hence, the results obtained by de Canniere and the author for SOe (n, 1), n ≥ 2, and by Cowling for SU(n, 1) do not generalize to simple Lie groups of real rank at least 2. © 2016 Heldermann Verlag....
Approximate representations of propagators in an external field
Fried, H.M.
1979-01-01
A method of forming approximate representations for propagators with external field dependence is suggested and discussed in the context of potential scattering. An integro-differential equation in D+1 variables, where D represents the dimensionality of Euclidian space-time, is replaced by a Volterra equation in one variable. Approximate solutions to the latter provide a generalization of the Bloch-Nordsieck representation, containing the effects of all powers of hard-potential interactions, each modified by a characteristic soft-potential dependence [fr
High gradient RF breakdown study
Laurent, L.; Luhmann, N.C. Jr.; Scheitrum, G.; Hanna, S.; Pearson, C.; Phillips, R.
1998-01-01
Stanford Linear Accelerator Center and UC Davis have been investigating high gradient RF breakdown and its effects on pulse shortening in high energy microwave devices. RF breakdown is a critical issue in the development of high power microwave sources and next generation linear accelerators since it limits the output power of microwave sources and the accelerating gradient of linacs. The motivation of this research is to find methods to increase the breakdown threshold level in X-band structures by reducing dark current. Emphasis is focused on improved materials, surface finish, and cleanliness. The test platform for this research is a traveling wave resonant ring. A 30 MW klystron is employed to provide up to 300 MW of traveling wave power in the ring to trigger breakdown in the cavity. Five TM 01 cavities have previously been tested, each with a different combination of surface polish and/or coating. The onset of breakdown was extended up to 250 MV/m with a TiN surface finish, as compared to 210 MV/m for uncoated OFE copper. Although the TiN coating was helpful in depressing the field emission, the lowest dark current was obtained with a 1 microinch surface finish, single-point diamond-turned cavity
NIF optics phase gradient specfication
Williams, W.; Auerbach, J.; Hunt, J.; Lawson, L.; Manes, K.; Orth, C.; Sacks, R.; Trenholme, J.; Wegner, P.
1997-01-01
A root-mean-square (rms) phase gradient specification seems to allow a good connection between the NIP optics quality and focal spot requirements. Measurements on Beamlet optics individually, and as a chain, indicate they meet the assumptions necessary to use this specification, and that they have a typical rms phase gradient of ∼80 angstrom/cm. This may be sufficient for NIP to meet the proposed Stockpile Stewardship Management Program (SSMP) requirements of 80% of a high- power beam within a 200-250 micron diameter spot. Uncertainties include, especially, the scale length of the optics phase noise, the ability of the adaptive optic to correct against pump-induced distortions and optics noise, and the possibility of finding mitigation techniques against whole-beam self-focusing (e.g. a pre- correction optic). Further work is needed in these areas to better determine the NIF specifications. This memo is a written summary of a presentation on this topic given by W. Williams 24 April 1997 to NIP and LS ampersand T personnel