464 resultados para Linear Approximation Operators
Resumo:
The reported values of bandgap of rutile GeO2 calculated by the standard density functional theory within local-density approximation (LDA)/generalized gradient approximation (GGA) show a wide variation (similar to 2 eV), whose origin remains unresolved. Here, we investigate the reasons for this variation by studying the electronic structure of rutile-GeO2 using many-body perturbation theory within the GW framework. The bandgap as well as valence bandwidth at Gamma-point of rutile phase shows a strong dependence on volume change, which is independent of bandgap underestimation problem of LDA/GGA. This strong dependence originates from a change in hybridization among O-p and Ge-(s and p) orbitals. Furthermore, the parabolic nature of first conduction band along X-Gamma-M direction changes towards a linear dispersion with volume expansion. (C) 2015 AIP Publishing LLC.
Resumo:
Response analysis of a linear structure with uncertainties in both structural parameters and external excitation is considered here. When such an analysis is carried out using the spectral stochastic finite element method (SSFEM), often the computational cost tends to be prohibitive due to the rapid growth of the number of spectral bases with the number of random variables and the order of expansion. For instance, if the excitation contains a random frequency, or if it is a general random process, then a good approximation of these excitations using polynomial chaos expansion (PCE) involves a large number of terms, which leads to very high cost. To address this issue of high computational cost, a hybrid method is proposed in this work. In this method, first the random eigenvalue problem is solved using the weak formulation of SSFEM, which involves solving a system of deterministic nonlinear algebraic equations to estimate the PCE coefficients of the random eigenvalues and eigenvectors. Then the response is estimated using a Monte Carlo (MC) simulation, where the modal bases are sampled from the PCE of the random eigenvectors estimated in the previous step, followed by a numerical time integration. It is observed through numerical studies that this proposed method successfully reduces the computational burden compared with either a pure SSFEM of a pure MC simulation and more accurate than a perturbation method. The computational gain improves as the problem size in terms of degrees of freedom grows. It also improves as the timespan of interest reduces.
Resumo:
In the context of wireless sensor networks, we are motivated by the design of a tree network spanning a set of source nodes that generate packets, a set of additional relay nodes that only forward packets from the sources, and a data sink. We assume that the paths from the sources to the sink have bounded hop count, that the nodes use the IEEE 802.15.4 CSMA/CA for medium access control, and that there are no hidden terminals. In this setting, starting with a set of simple fixed point equations, we derive explicit conditions on the packet generation rates at the sources, so that the tree network approximately provides certain quality of service (QoS) such as end-to-end delivery probability and mean delay. The structures of our conditions provide insight on the dependence of the network performance on the arrival rate vector, and the topological properties of the tree network. Our numerical experiments suggest that our approximations are able to capture a significant part of the QoS aware throughput region (of a tree network), that is adequate for many sensor network applications. Furthermore, for the special case of equal arrival rates, default backoff parameters, and for a range of values of target QoS, we show that among all path-length-bounded trees (spanning a given set of sources and the data sink) that meet the conditions derived in the paper, a shortest path tree achieves the maximum throughput. (C) 2015 Elsevier B.V. All rights reserved.
Resumo:
Speech polarity detection is a crucial first step in many speech processing techniques. In this paper, an algorithm is proposed that improvises the existing technique using the skewness of the voice source (VS) signal. Here, the integrated linear prediction residual (ILPR) is used as the VS estimate, which is obtained using linear prediction on long-term frames of the low-pass filtered speech signal. This excludes the unvoiced regions from analysis and also reduces the computation. Further, a modified skewness measure is proposed for decision, which also considers the magnitude of the skewness of the ILPR along with its sign. With the detection error rate (DER) as the performance metric, the algorithm is tested on 8 large databases and its performance (DER=0.20%) is found to be comparable to that of the best technique (DER=0.06%) on both clean and noisy speech. Further, the proposed method is found to be ten times faster than the best technique.
Resumo:
In this paper, we present the solutions of 1-D and 2-D non-linear partial differential equations with initial conditions. We approach the solutions in time domain using two methods. We first solve the equations using Fourier spectral approximation in the spatial domain and secondly we compare the results with the approximation in the spatial domain using orthogonal functions such as Legendre or Chebyshev polynomials as their basis functions. The advantages and the applicability of the two different methods for different types of problems are brought out by considering 1-D and 2-D nonlinear partial differential equations namely the Korteweg-de-Vries and nonlinear Schrodinger equation with different potential function. (C) 2015 Elsevier Ltd. All rights reserved.
Resumo:
Diffusion-a measure of dynamics, and entropy-a measure of disorder in the system are found to be intimately correlated in many systems, and the correlation is often strongly non-linear. We explore the origin of this complex dependence by studying diffusion of a point Brownian particle on a model potential energy surface characterized by ruggedness. If we assume that the ruggedness has a Gaussian distribution, then for this model, one can obtain the excess entropy exactly for any dimension. By using the expression for the mean first passage time, we present a statistical mechanical derivation of the well-known and well-tested scaling relation proposed by Rosenfeld between diffusion and excess entropy. In anticipation that Rosenfeld diffusion-entropy scaling (RDES) relation may continue to be valid in higher dimensions (where the mean first passage time approach is not available), we carry out an effective medium approximation (EMA) based analysis of the effective transition rate and hence of the effective diffusion coefficient. We show that the EMA expression can be used to derive the RDES scaling relation for any dimension higher than unity. However, RDES is shown to break down in the presence of spatial correlation among the energy landscape values. (C) 2015 AIP Publishing LLC.
Resumo:
Climate change in response to a change in external forcing can be understood in terms of fast response to the imposed forcing and slow feedback associated with surface temperature change. Previous studies have investigated the characteristics of fast response and slow feedback for different forcing agents. Here we examine to what extent that fast response and slow feedback derived from time-mean results of climate model simulations can be used to infer total climate change. To achieve this goal, we develop a multivariate regression model of climate change, in which the change in a climate variable is represented by a linear combination of its sensitivity to CO2 forcing, solar forcing, and change in global mean surface temperature. We derive the parameters of the regression model using time-mean results from a set of HadCM3L climate model step-forcing simulations, and then use the regression model to emulate HadCM3L-simulated transient climate change. Our results show that the regression model emulates well HadCM3L-simulated temporal evolution and spatial distribution of climate change, including surface temperature, precipitation, runoff, soil moisture, cloudiness, and radiative fluxes under transient CO2 and/or solar forcing scenarios. Our findings suggest that temporal and spatial patterns of total change for the climate variables considered here can be represented well by the sum of fast response and slow feedback. Furthermore, by using a simple 1-D heat-diffusion climate model, we show that the temporal and spatial characteristics of climate change under transient forcing scenarios can be emulated well using information from step-forcing simulations alone.
Resumo:
This paper analyses deviated linear cyclic pursuit in which an agent pursues its leader with an angle of deviation in both the continuous- and discrete-time domains, while admitting heterogeneous gains and deviations for the agents. Sufficient conditions for the stability of such systems, in both the domains, are presented in this paper along with the derivation of the reachable set, which is a set of points where the agents may converge asymptotically. The stability conditions are derived based on Gershgorin's theorem. Simulations validating the theoretical results presented in this paper are provided.
Resumo:
In this paper, we present two new stochastic approximation algorithms for the problem of quantile estimation. The algorithms uses the characterization of the quantile provided in terms of an optimization problem in 1]. The algorithms take the shape of a stochastic gradient descent which minimizes the optimization problem. Asymptotic convergence of the algorithms to the true quantile is proven using the ODE method. The theoretical results are also supplemented through empirical evidence. The algorithms are shown to provide significant improvement in terms of memory requirement and accuracy.
Resumo:
Measurement of out-of-plane linear motion with high precision and bandwidth is indispensable for development of precision motion stages and for dynamic characterization of mechanical structures. This paper presents an optical beam deflection (OBD) based system for measurement of out-of-plane linear motion for fully reflective samples. The system also achieves nearly zero cross-sensitivity to angular motion, and a large working distance. The sensitivities to linear and angular motion are analytically obtained and employed to optimize the system design. The optimal shot-noise limited resolution is shown to be less than one angstrom over a bandwidth in excess of 1 kHz. Subsequently, the system is experimentally realized and the sensitivities to out-of-plane motions are calibrated using a novel strategy. The linear sensitivity is found to be in agreement with theory. The angular sensitivity is shown to be over 7.5-times smaller than that of conventional OBD. Finally, the measurement system is employed to measure the transient response of a piezo-positioner, and, with the aid of an open-loop controller, reduce the settling time by about 90%. It is also employed to operate the positioner in closed-loop and demonstrate significant minimization of hysteresis and positioning error.
Resumo:
Computational and experimental tools have been used to understand the linear cluster plug nozzle flowfield for a range of pressure ratios. The experimental cluster configuration is arrived at from a linear plug nozzle by introducing splitter plates in the primary nozzle, and computational analysis of corresponding geometry is also carried out. The flow development on the plug surface has been analyzed for two different cluster module spacings. The interactions between the cluster module jets is a complex one with a three-dimensional shock structure because of the differential end condition the shock experiences on the plug wall and freejet boundary. A prominent streamwise vorticity resulting from curvature of the shock is also seen along the length of the plug downstream of the module junctions. The out-of-phase wave interactions occurring along the module centerline and the splitter plate centerline, resulting in a wavy surface-limiting streamline pattern, particularly at lower pressure ratios, is explained.
Resumo:
Anderson localization is known to be inevitable in one-dimension for generic disordered models. Since localization leads to Poissonian energy level statistics, we ask if localized systems possess `additional' integrals of motion as well, so as to enhance the analogy with quantum integrable systems. We answer this in the affirmative in the present work. We construct a set of nontrivial integrals of motion for Anderson localized models, in terms of the original creation and annihilation operators. These are found as a power series in the hopping parameter. The recently found Type-1 Hamiltonians, which are known to be quantum integrable in a precise sense, motivate our construction. We note that these models can be viewed as disordered electron models with infinite-range hopping, where a similar series truncates at the linear order. We show that despite the infinite range hopping, all states but one are localized. We also study the conservation laws for the disorder free Aubry-Andre model, where the states are either localized or extended, depending on the strength of a coupling constant. We formulate a specific procedure for averaging over disorder, in order to examine the convergence of the power series. Using this procedure in the Aubry-Andre model, we show that integrals of motion given by our construction are well-defined in localized phase, but not so in the extended phase. Finally, we also obtain the integrals of motion for a model with interactions to lowest order in the interaction.
Resumo:
We perform global linear stability analysis and idealized numerical simulations in global thermal balance to understand the condensation of cold gas from hot/virial atmospheres (coronae), in particular the intracluster medium (ICM). We pay particular attention to geometry (e.g. spherical versus plane-parallel) and the nature of the gravitational potential. Global linear analysis gives a similar value for the fastest growing thermal instability modes in spherical and Cartesian geometries. Simulations and observations suggest that cooling in haloes critically depends on the ratio of the cooling time to the free-fall time (t(cool)/t(ff)). Extended cold gas condenses out of the ICM only if this ratio is smaller than a threshold value close to 10. Previous works highlighted the difference between the nature of cold gas condensation in spherical and plane-parallel atmospheres; namely, cold gas condensation appeared easier in spherical atmospheres. This apparent difference due to geometry arises because the previous plane-parallel simulations focused on in situ condensation of multiphase gas but spherical simulations studied condensation anywhere in the box. Unlike previous claims, our non-linear simulations show that there are only minor differences in cold gas condensation, either in situ or anywhere, for different geometries. The amount of cold gas depends on the shape of tcool/tff; gas has more time to condense if gravitational acceleration decreases towards the centre. In our idealized plane-parallel simulations with heating balancing cooling in each layer, there can be significant mass/energy/momentum transfer across layers that can trigger condensation and drive tcool/tff far beyond the critical value close to 10.
Resumo:
The bilateral filter is a versatile non-linear filter that has found diverse applications in image processing, computer vision, computer graphics, and computational photography. A common form of the filter is the Gaussian bilateral filter in which both the spatial and range kernels are Gaussian. A direct implementation of this filter requires O(sigma(2)) operations per pixel, where sigma is the standard deviation of the spatial Gaussian. In this paper, we propose an accurate approximation algorithm that can cut down the computational complexity to O(1) per pixel for any arbitrary sigma (constant-time implementation). This is based on the observation that the range kernel operates via the translations of a fixed Gaussian over the range space, and that these translated Gaussians can be accurately approximated using the so-called Gauss-polynomials. The overall algorithm emerging from this approximation involves a series of spatial Gaussian filtering, which can be efficiently implemented (in parallel) using separability and recursion. We present some preliminary results to demonstrate that the proposed algorithm compares favorably with some of the existing fast algorithms in terms of speed and accuracy.