Search results for "Linear approximation"
showing 10 items of 21 documents
NEW DEVELOPMENTS ON INVERSE POLYGON MAPPING TO CALCULATE GRAVITATIONAL LENSING MAGNIFICATION MAPS: OPTIMIZED COMPUTATIONS
2011
We derive an exact solution (in the form of a series expansion) to compute gravitational lensing magnification maps. It is based on the backward gravitational lens mapping of a partition of the image plane in polygonal cells (inverse polygon mapping, IPM), not including critical points (except perhaps at the cell boundaries). The zeroth-order term of the series expansion leads to the method described by Mediavilla et al. The first-order term is used to study the error induced by the truncation of the series at zeroth order, explaining the high accuracy of the IPM even at this low order of approximation. Interpreting the Inverse Ray Shooting (IRS) method in terms of IPM, we explain the previ…
Nonlinear dynamical model of Costas loop and an approach to the analysis of its stability in the large
2015
The analysis of the stability and numerical simulation of Costas loop circuits for high-frequency signals is a challenging task. The problem lies in the fact that it is necessary to simultaneously observe very fast time scale of the input signals and slow time scale of phase difference between the input signals. To overcome this difficult situation it is possible, following the approach presented in the classical works of Gardner and Viterbi, to construct a mathematical model of Costas loop, in which only slow time change of signal?s phases and frequencies is considered. Such a construction, in turn, requires the computation of phase detector characteristic, depending on the waveforms of th…
A Simple Method for the Consecutive Determination of Protonation Constants through Evaluation of Formation Curves
2013
A simple method is presented for the consecutive determination of protonation constants of polyprotic acids based on their formation curves. The procedure is based on generally known equations that describe dissociation equilibria. It has been demonstrated through simulation that the values obtained through the proposed method are sufficiently consistent with the actual values. In contrast with the universally known and applied Bjerrum’s method, no differences in the accuracy of determination of subsequent protonation constant values are observed. The proposed method requires the value of one of the protonation constants (e.g., of the first one, K1) of the polyprotic acid. An iterative meth…
Bayesian Unification of Gradient and Bandit-based Learning for Accelerated Global Optimisation
2017
Bandit based optimisation has a remarkable advantage over gradient based approaches due to their global perspective, which eliminates the danger of getting stuck at local optima. However, for continuous optimisation problems or problems with a large number of actions, bandit based approaches can be hindered by slow learning. Gradient based approaches, on the other hand, navigate quickly in high-dimensional continuous spaces through local optimisation, following the gradient in fine grained steps. Yet, apart from being susceptible to local optima, these schemes are less suited for online learning due to their reliance on extensive trial-and-error before the optimum can be identified. In this…
On the optimal approximation rate of certain stochastic integrals
2010
AbstractGiven an increasing function H:[0,1)→[0,∞) and An(H)≔infτ∈Tn(∑i=1n∫ti−1ti(ti−t)H(t)2dt)12, where Tn≔{τ=(ti)i=0n:0=t0<t1<⋯<tn=1}, we characterize the property An(H)≤cn, and give conditions for An(H)≤cnβ and An(H)≥1cnβ for β∈(0,1), both in terms of integrability properties of H. These results are applied to the approximation of stochastic integrals.
The next-to-ladder approximation for linear Dyson–Schwinger equations
2007
We solve the linear Dyson Schwinger equation for a massless vertex in Yukawa theory, iterating the first two primitive graphs.
Compression Methods for Microclimate Data Based on Linear Approximation of Sensor Data
2019
Edge computing is currently one of the main research topics in the field of Internet of Things. Edge computing requires lightweight and computationally simple algorithms for sensor data analytics. Sensing edge devices are often battery powered and have a wireless connection. In designing edge devices the energy efficiency needs to be taken into account. Pre-processing the data locally in the edge device reduces the amount of data and thus decreases the energy consumption of wireless data transmission. Sensor data compression algorithms presented in this paper are mainly based on data linearity. Microclimate data is near linear in short time window and thus simple linear approximation based …
A method for the time-varying nonlinear prediction of complex nonstationary biomedical signals
2009
A method to perform time-varying (TV) nonlinear prediction of biomedical signals in the presence of nonstationarity is presented in this paper. The method is based on identification of TV autoregressive models through expansion of the TV coefficients onto a set of basis functions and on k -nearest neighbor local linear approximation to perform nonlinear prediction. The approach provides reasonable nonlinear prediction even for TV deterministic chaotic signals, which has been a daunting task to date. Moreover, the method is used in conjunction with a TV surrogate method to provide statistical validation that the presence of nonlinearity is not due to nonstationarity itself. The approach is t…
Perturbations of spacetime: gauge transformations and gauge invariance at second order and beyond
1996
We consider in detail the problem of gauge dependence that exists in relativistic perturbation theory, going beyond the linear approximation and treating second and higher order perturbations. We first derive some mathematical results concerning the Taylor expansion of tensor fields under the action of one-parameter families (not necessarily groups) of diffeomorphisms. Second, we define gauge invariance to an arbitrary order $n$. Finally, we give a generating formula for the gauge transformation to an arbitrary order and explicit rules to second and third order. This formalism can be used in any field of applied general relativity, such as cosmological and black hole perturbations, as well …
Extremal problems of approximation theory in fuzzy context
1999
Abstract The problem of approximation of a fuzzy subset of a normed space is considered. We study the error of approximation, which in this case is characterized by an L -fuzzy number. In order to do this we define the supremum of an L -fuzzy set of real numbers as well as the supremum and the infimum of a crisp set of L -fuzzy numbers. The introduced concepts allow us to investigate the best approximation and the optimal linear approximation. In particular, we consider approximation of a fuzzy subset in the space L p m of differentiable functions in the L q -metric. We prove the fuzzy counterparts of duality theorems, which in crisp case allows effectively to solve extremal problems of the…