973 resultados para Approximations
Resumo:
We modify a nonlinear σ model (NLσM) for the description of a granular disordered system in the presence of both the Coulomb repulsion and the Cooper pairing. We show that under certain controlled approximations the action of this model is reduced to the Ambegaokar-Eckern-Schön (AES) action, which is further reduced to the Bose-Hubbard (or “dirty-boson”) model with renormalized coupling constants. We obtain an effective action which is more general than the AES one but still simpler than the full NLσM action. This action can be applied in the region of parameters where the reduction to the AES or the Bose-Hubbard model is not justified. This action may lead to a different picture of the superconductor-insulator transition in two-dimensional systems.
Resumo:
The author is partially supported by: M. U. R. S. T. Prog. Nazionale “Problemi e Metodi nella Teoria delle Equazioni Iperboliche”.
Resumo:
The aim of this paper is to study a generalized form of elliptic-type integrals which unify and extend various families of elliptic-type integrals studied recently by several authors. In a recent communication [1] we have obtained recurrence relations and asymptotic formula for this generalized elliptic-type integral. Here we shall obtain some more results which are single and multiple integral formulae, differentiation formula, fractional integral and approximations for this class of generalized elliptic-type integrals.
Resumo:
This paper considers the problem of concept generalization in decision-making systems where such features of real-world databases as large size, incompleteness and inconsistence of the stored information are taken into account. The methods of the rough set theory (like lower and upper approximations, positive regions and reducts) are used for the solving of this problem. The new discretization algorithm of the continuous attributes is proposed. It essentially increases an overall performance of generalization algorithms and can be applied to processing of real value attributes in large data tables. Also the search algorithm of the significant attributes combined with a stage of discretization is developed. It allows avoiding splitting of continuous domains of insignificant attributes into intervals.
Resumo:
The task of smooth and stable decision rules construction in logical recognition models is considered. Logical regularities of classes are defined as conjunctions of one-place predicates that determine the membership of features values in an intervals of the real axis. The conjunctions are true on a special no extending subsets of reference objects of some class and are optimal. The standard approach of linear decision rules construction for given sets of logical regularities consists in realization of voting schemes. The weighting coefficients of voting procedures are done as heuristic ones or are as solutions of complex optimization task. The modifications of linear decision rules are proposed that are based on the search of maximal estimations of standard objects for their classes and use approximations of logical regularities by smooth sigmoid functions.
Resumo:
Mathematics Subject Classification: 26A33, 45K05, 60J60, 60G50, 65N06, 80-99.
Resumo:
In this work we give su±cient conditions for k-th approximations of the polynomial roots of f(x) when the Maehly{Aberth{Ehrlich, Werner-Borsch-Supan, Tanabe, Improved Borsch-Supan iteration methods fail on the next step. For these methods all non-attractive sets are found. This is a subsequent improvement of previously developed techniques and known facts. The users of these methods can use the results presented here for software implementation in Distributed Applications and Simulation Environ- ments. Numerical examples with graphics are shown.
Resumo:
The importance of “control variations” for obtaining local approximations of the reachable set of nonlinear control systems is well known. Heuristically, if one can construct control variations in all possible directions, then the considered control system is small-time locally controllable (STLC). Two concepts of control variations of higher order are introduced for the case of smooth control systems. The relation between these variations and the small-time local controllability is studied and a new sufficient STLC condition is proved.
Resumo:
Implementation of a Monte Carlo simulation for the solution of population balance equations (PBEs) requires choice of initial sample number (N0), number of replicates (M), and number of bins for probability distribution reconstruction (n). It is found that Squared Hellinger Distance, H2, is a useful measurement of the accuracy of Monte Carlo (MC) simulation, and can be related directly to N0, M, and n. Asymptotic approximations of H2 are deduced and tested for both one-dimensional (1-D) and 2-D PBEs with coalescence. The central processing unit (CPU) cost, C, is found in a power-law relationship, C= aMNb0, with the CPU cost index, b, indicating the weighting of N0 in the total CPU cost. n must be chosen to balance accuracy and resolution. For fixed n, M × N0 determines the accuracy of MC prediction; if b > 1, then the optimal solution strategy uses multiple replications and small sample size. Conversely, if 0 < b < 1, one replicate and a large initial sample size is preferred. © 2015 American Institute of Chemical Engineers AIChE J, 61: 2394–2402, 2015
Resumo:
2000 Mathematics Subject Classification: 60J60, 62M99.
Resumo:
2000 Mathematics Subject Classification: 62F15.
Resumo:
This paper is dedicated to Prof. Nikolay Kyurkchiev on the occasion of his 70th anniversary This paper gives sufficient conditions for kth approximations of the zeros of polynomial f (x) under which Kyurkchiev’s method fails on the next step. The research is linked with an attack on the global convergence hypothesis of this commonly used in practice method (as correlate hypothesis for Weierstrass–Dochev’s method). Graphical examples are presented.
Resumo:
This work is an initial study of a numerical method for identifying multiple leak zones in saturated unsteady flow. Using the conventional saturated groundwater flow equation, the leak identification problem is modelled as a Cauchy problem for the heat equation and the aim is to find the regions on the boundary of the solution domain where the solution vanishes, since leak zones correspond to null pressure values. This problem is ill-posed and to reconstruct the solution in a stable way, we therefore modify and employ an iterative regularizing method proposed in [1] and [2]. In this method, mixed well-posed problems obtained by changing the boundary conditions are solved for the heat operator as well as for its adjoint, to get a sequence of approximations to the original Cauchy problem. The mixed problems are solved using a Finite element method (FEM), and the numerical results indicate that the leak zones can be identified with the proposed method.
Resumo:
The Stokes perturbative solution of the nonlinear (boundary value dependent) surface gravity wave problem is known to provide results of reasonable accuracy to engineers in estimating the phase speed and amplitudes of such nonlinear waves. The weakling in this structure though is the presence of aperiodic “secular variation” in the solution that does not agree with the known periodic propagation of surface waves. This has historically necessitated increasingly higher-ordered (perturbative) approximations in the representation of the velocity profile. The present article ameliorates this long-standing theoretical insufficiency by invoking a compact exact n-ordered solution in the asymptotic infinite depth limit, primarily based on a representation structured around the third-ordered perturbative solution, that leads to a seamless extension to higher-order (e.g., fifth-order) forms existing in the literature. The result from this study is expected to improve phenomenological engineering estimates, now that any desired higher-ordered expansion may be compacted within the same representation, but without any aperiodicity in the spectral pattern of the wave guides.
Resumo:
UncertWeb is a European research project running from 2010-2013 that will realize the uncertainty enabled model web. The assumption is that data services, in order to be useful, need to provide information about the accuracy or uncertainty of the data in a machine-readable form. Models taking these data as imput should understand this and propagate errors through model computations, and quantify and communicate errors or uncertainties generated by the model approximations. The project will develop technology to realize this and provide demonstration case studies.