Search results for "SOFC"
showing 10 items of 660 documents
Advances in photonic reservoir computing
2017
We review a novel paradigm that has emerged in analogue neuromorphic optical computing. The goal is to implement a reservoir computer in optics, where information is encoded in the intensity and phase of the optical field. Reservoir computing is a bio-inspired approach especially suited for processing time-dependent information. The reservoir’s complex and high-dimensional transient response to the input signal is capable of universal computation. The reservoir does not need to be trained, which makes it very well suited for optics. As such, much of the promise of photonic reservoirs lies in their minimal hardware requirements, a tremendous advantage over other hardware-intensive neural net…
A nonlinear Chaikin-based binary subdivision scheme
2019
Abstract In this work we introduce and analyze a new nonlinear subdivision scheme based on a nonlinear blending between Chaikin’s subdivision rules and the linear 3-cell subdivision scheme. Our scheme seeks to improve the lack of convergence in the uniform metric of the nonlinear scheme proposed in Amat et al. (2012), where the authors define a cell-average version of the PPH subdivision scheme (Amat et al., 2006). The properties of the new scheme are analyzed and its performance is illustrated through numerical examples.
Non-fragile fuzzy control design for nonlinear time-delay systems
2013
In this paper, a non-fragile fuzzy control design is proposed for a class of nonlinear systems with mixed discrete and distributed time delays. The Takagi and Sugeno (T-S) fuzzy set approach is applied to the modelling of the nonlinear dynamics, and a T-S fuzzy model is constructed, which can represent the nonlinear system. Then, based on the fuzzy linear model, a fuzzy linear controller is developed to stabilize the nonlinear system. The control law is obtained to ensure stochastically exponentially stability in the mean square. The sufficient conditions for the existence of such a control are proposed in terms of certain linear matrix inequalities.
Data Compression with ENO Schemes: A Case Study
2001
Abstract We study the compresion properties of ENO-type nonlinear multiresolution transformations on digital images. Specific error control algorithms are used to ensure a prescribed accuracy. The numerical results reveal that these methods strongly outperform the more classical wavelet decompositions in the case of piecewise smooth geometric images.
Lacunary bifurcation for operator equations and nonlinear boundary value problems on ℝN
1991
SynopsisWe consider nonlinear eigenvalue problems of the form Lu + F(u) = λu in a real Hilbert space, where L is a positive self-adjoint linear operator and F is a nonlinearity vanishing to higher order at u = 0. We suppose that there are gaps in the essential spectrum of L and use critical point theory for strongly indefinite functionals to derive conditions for the existence of non-zero solutions for λ belonging to such a gap, and for the bifurcation of such solutions from the line of trivial solutions at the boundary points of a gap. The abstract results are applied to the L2-theory of semilinear elliptic partial differential equations on ℝN. We obtain existence results for the general c…
A Singular Multi-Grid Iteration Method for Bifurcation Problems
1984
We propose an efficient technique for the numerical computation of bifurcating branches of solutions of large sparse systems of nonlinear, parameter-dependent equations. The algorithm consists of a nested iteration procedure employing a multi-grid method for singular problems. The basic iteration scheme is related to the Lyapounov-Schmidt method and is widely used for proving the existence of bifurcating solutions. We present numerical examples which confirm the efficiency of the algorithm.
Measurement of the mass of the W boson using direct reconstruction at √s = 183 GeV
1999
From data corresponding to an integrated luminosity of 53.5 pb(-1) taken during the 183 GeV run in 1997, DELPHI has measured the W mass from direct reconstruction of WW --> lq (q) over bar and WW --> q (q) over bar q (q) over bar events. Combining these channels, a value of m(w) = 80.238 +/- 0.154(stat) +/- 0.035(syst) +/- 0.035(fsi) +/- 0.021 (LEP) GeV/c(2) is obtained, where fsi denotes final state interaction. Combined with the W mass obtained by DELPHI from the WW production cross-section and with the direct measurement at 172 GeV this leads to a measured value of m(w) = 80.270 +/- 0.137(stat) +/- 0.031(syst) +/- 0.030(fsi) +/- 0.021(LEP)GeV/c(2), in good agreement with the Standard Mod…
Correcting for Potential Barriers in Quantum Walk Search
2015
A randomly walking quantum particle searches in Grover's $\Theta(\sqrt{N})$ iterations for a marked vertex on the complete graph of $N$ vertices by repeatedly querying an oracle that flips the amplitude at the marked vertex, scattering by a "coin" flip, and hopping. Physically, however, potential energy barriers can hinder the hop and cause the search to fail, even when the amplitude of not hopping decreases with $N$. We correct for these errors by interpreting the quantum walk search as an amplitude amplification algorithm and modifying the phases applied by the coin flip and oracle such that the amplification recovers the $\Theta(\sqrt{N})$ runtime.
Separation properties of (n, m)-IFS attractors
2017
Abstract The separation properties of self similar sets are discussed in this article. An open set condition for the (n, m)- iterated function system is introduced and the concepts of self similarity, similarity dimension and Hausdorff dimension of the attractor generated by an (n, m) - iterated function system are studied. It is proved that the similarity dimension and the Hausdorff dimension of the attractor of an (n, m) - iterated function system are equal under this open set condition. Further a necessary and sufficient condition for a set to satisfy the open set condition is established.
High-order Runge–Kutta–Nyström geometric methods with processing
2001
Abstract We present new families of sixth- and eighth-order Runge–Kutta–Nystrom geometric integrators with processing for ordinary differential equations. Both the processor and the kernel are composed of explicitly computable flows associated with non trivial elements belonging to the Lie algebra involved in the problem. Their efficiency is found to be superior to other previously known algorithms of equivalent order, in some case up to four orders of magnitude.