Search Results Heading

MBRLSearchResults

mbrl.module.common.modules.added.book.to.shelf
Title added to your shelf!
View what I already have on My Shelf.
Oops! Something went wrong.
Oops! Something went wrong.
While trying to add the title to your shelf something went wrong :( Kindly try again later!
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
    Done
    Filters
    Reset
  • Discipline
      Discipline
      Clear All
      Discipline
  • Is Peer Reviewed
      Is Peer Reviewed
      Clear All
      Is Peer Reviewed
  • Item Type
      Item Type
      Clear All
      Item Type
  • Subject
      Subject
      Clear All
      Subject
  • Year
      Year
      Clear All
      From:
      -
      To:
  • More Filters
      More Filters
      Clear All
      More Filters
      Source
    • Language
211,417 result(s) for "Approximations"
Sort by:
Hardy–Littlewood and Ulyanov inequalities
We give the full solution of the following problem: obtain sharp inequalities between the moduli of smoothness The main tool is the new Hardy–Littlewood–Nikol’skii inequalities. More precisely, we obtained the asymptotic behavior of the quantity We also prove the Ulyanov and Kolyada-type inequalities in the Hardy spaces. Finally, we apply the obtained estimates to derive new embedding theorems for the Lipschitz and Besov spaces.
Sign-changing solutions of critical quasilinear Kirchhoff-Schrödinger-Poisson system with logarithmic nonlinearity
In the present paper, we study the following Kirchhoff-Schrödinger-Poisson system with logarithmic and critical nonlinearity: $ \\begin{align} \\begin{array}{ll} \\left \\{ \\begin{array}{ll} - \\Bigr(a+b\\int_\\Omega|\\nabla u|^2{\\mathrm{d}}x \\Bigr)\\Delta u+V(x)u-\\frac{1}{2}u\\Delta (u^2)+\\phi u = \\lambda |u|^{q-2}u\\ln|u|^2+|u|^4u, &x\\in \\Omega, \\\ -\\Delta \\phi = u^2,& x\\in \\Omega, \\\ u = \\phi = 0,& x\\in \\partial\\Omega, \\end{array} \\right . \\end{array} \\end{align} $ where$ \\lambda, b > 0, a > \\frac{1}{4}, 4 < q < 6, $$ V(x) $is a smooth potential function and$ \\Omega $is a bounded domain in$ \\mathbb{R}^3 $with Lipschitz boundary. Combining constraint variational method and perturbation method, we prove that the above problem has a least energy sign-changing solution$ u_0 $which has precisely two nodal domains. Moreover, we show that the energy of$ u_0 $is strictly larger than twice the ground state energy.
Reproducibility in density functional theory calculations of solids
Density functional theory (DFT) is now routinely used for simulating material properties. Many software packages are available, which makes it challenging to know which are the best to use for a specific calculation. Lejaeghere et al. compared the calculated values for the equation of states for 71 elemental crystals from 15 different widely used DFT codes employing 40 different potentials (see the Perspective by Skylaris). Although there were variations in the calculated values, most recent codes and methods converged toward a single value, with errors comparable to those of experiment. Science , this issue p. 10.1126/science.aad3000 ; see also p. 1394 A survey of recent density functional theory methods shows a convergence to more accurate property calculations. [Also see Perspective by Skylaris ] The widespread popularity of density functional theory has given rise to an extensive range of dedicated codes for predicting molecular and crystalline properties. However, each code implements the formalism in a different way, raising questions about the reproducibility of such predictions. We report the results of a community-wide effort that compared 15 solid-state codes, using 40 different potentials or basis set types, to assess the quality of the Perdew-Burke-Ernzerhof equations of state for 71 elemental crystals. We conclude that predictions from recent codes and pseudopotentials agree very well, with pairwise differences that are comparable to those between different high-precision experiments. Older methods, however, have less precise agreement. Our benchmark provides a framework for users and developers to document the precision of new applications and methodological improvements.
Renormalon-free definition of the gluon condensate within the large- $\\beta_0$approximation
We propose a clear definition of the gluon condensate within the large- $\\beta_0$approximation as an attempt toward a systematic argument on the gluon condensate. We define the gluon condensate such that it is free from a renormalon uncertainty, consistent with the renormalization scale independence of each term of the operator product expansion (OPE), and an identical object irrespective of observables. The renormalon uncertainty of$\\mathcal{O}(\\Lambda^4)$ , which renders the gluon condensate ambiguous, is separated from a perturbative calculation by using a recently suggested analytic formulation. The renormalon uncertainty is absorbed into the gluon condensate in the OPE, which makes the gluon condensate free from the renormalon uncertainty. As a result, we can define the OPE in a renormalon-free way. Based on this renormalon-free OPE formula, we discuss numerical extraction of the gluon condensate using the lattice data of the energy density operator defined by the Yang–Mills gradient flow.
Rational Approximations of Arbitrary Order: A Survey
This paper deals with the study and analysis of several rational approximations to approach the behavior of arbitrary-order differentiators and integrators in the frequency domain. From the Riemann–Liouville, Grünwald–Letnikov and Caputo basic definitions of arbitrary-order calculus until the reviewed approximation methods, each of them is coded in a Maple 18 environment and their behaviors are compared. For each approximation method, an application example is explained in detail. The advantages and disadvantages of each approximation method are discussed. Afterwards, two model order reduction methods are applied to each rational approximation and assist a posteriori during the synthesis process using analog electronic design or reconfigurable hardware. Examples for each reduction method are discussed, showing the drawbacks and benefits. To wrap up, this survey is very useful for beginners to get started quickly and learn arbitrary-order calculus and then to select and tune the best approximation method for a specific application in the frequency domain. Once the approximation method is selected and the rational transfer function is generated, the order can be reduced by applying a model order reduction method, with the target of facilitating the electronic synthesis.
Spectral expansions of non-self-adjoint generalized Laguerre semigroups
We provide the spectral expansion in a weighted Hilbert space of a substantial class of invariant non-self-adjoint and non-local Markov operators which appear in limit theorems for positive-valued Markov processes. We show that this class is in bijection with a subset of negative definite functions and we name it the class of generalized Laguerre semigroups. Our approach, which goes beyond the framework of perturbation theory, is based on an in-depth and original analysis of an intertwining relation that we establish between this class and a self-adjoint Markov semigroup, whose spectral expansion is expressed in terms of the classical Laguerre polynomials. As a by-product, we derive smoothness properties for the solution to the associated Cauchy problem as well as for the heat kernel. Our methodology also reveals a variety of possible decays, including the hypocoercivity type phenomena, for the speed of convergence to equilibrium for this class and enables us to provide an interpretation of these in terms of the rate of growth of the weighted Hilbert space norms of the spectral projections. Depending on the analytic properties of the aforementioned negative definite functions, we are led to implement several strategies, which require new developments in a variety of contexts, to derive precise upper bounds for these norms.
Overlapping Iterated Function Systems from the Perspective of Metric Number Theory
In this paper we develop a new approach for studying overlapping iterated function systems. This approach is inspired by a famous result due to Khintchine from Diophantine approximation which shows that for a family of limsup sets, their Lebesgue measure is determined by the convergence or divergence of naturally occurring volume sums. For many parameterised families of overlapping iterated function systems, we prove that a typical member will exhibit similar Khintchine like behaviour. Families of iterated function systems that our results apply to include those arising from Bernoulli convolutions, the For each Last of all, we introduce a property of an iterated function system that we call being consistently separated with respect to a measure. We prove that this property implies that the pushforward of the measure is absolutely continuous. We include several explicit examples of consistently separated iterated function systems.
Properties and applications of P_n-simple functionals
In this paper some representations of a linear positive functional are established. These results are extended for linear positive operators L_n:C[a,b] [rightarrow] C[a,b]. Also, approximation properties of linear positive operators, expressed in terms of moduli of smoothness, are considered. In the last section, the remainder term in various approximation processes is studied.