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
5,055 result(s) for "Truncation"
Sort by:
batman: BAsic Transit Model cAlculatioN in Python
I introduce batman, a Python package for modeling exoplanet transit and eclipse light curves. The batman package supports calculation of light curves for any radially symmetric stellar limb darkening law, using a new integration algorithm for models that cannot be quickly calculated analytically. The code uses C extension modules to speed up model calculation and is parallelized with OpenMP. For a typical light curve with 100 data points in transit, batman can calculate one million quadratic limb-darkened models in 30 s with a single 1.7 GHz Intel Core i5 processor. The same calculation takes seven minutes using the four-parameter nonlinear limb darkening model (computed to 1 ppm accuracy). Maximum truncation error for integrated models is an input parameter that can be set as low as 0.001 ppm, ensuring that the community is prepared for the precise transit light curves we anticipate measuring with upcoming facilities. The batman package is open source and publicly available at https://github.com/lkreidberg/batman.
Mixtures of Hidden Truncation Hyperbolic Factor Analyzers
The mixture of factor analyzers model was first introduced over 20 years ago and, in the meantime, has been extended to several non-Gaussian analogs. In general, these analogs account for situations with heavy tailed and/or skewed clusters. An approach is introduced that unifies many of these approaches into one very general model: the mixture of hidden truncation hyperbolic factor analyzers (MHTHFA) model. In the process of doing this, a hidden truncation hyperbolic factor analysis model is also introduced. The MHTHFA model is illustrated for clustering as well as semi-supervised classification using two real datasets.
EXACT POST-SELECTION INFERENCE, WITH APPLICATION TO THE LASSO
We develop a general approach to valid inference after model selection. At the core of our framework is a result that characterizes the distribution of a post-selection estimator conditioned on the selection event. We specialize the approach to model selection by the lasso to form valid confidence intervals for the selected coefficients and test whether all relevant variables have been included in the model.
Non-local matrix elements in B(s) → {K(), ϕ}ℓ+ℓ
A bstract We revisit the theoretical predictions and the parametrization of non-local matrix elements in rare B ¯ s → K ¯ ∗ ϕ ℓ + ℓ − and B ¯ s → K ¯ ∗ ϕ γ decays. We improve upon the current state of these matrix elements in two ways. First, we recalculate the hadronic matrix elements needed at subleading power in the light-cone OPE using B -meson light-cone sum rules. Our analytical results supersede those in the literature. We discuss the origin of our improvements and provide numerical results for the processes under consideration. Second, we derive the first dispersive bound on the non-local matrix elements. It provides a parametric handle on the truncation error in extrapolations of the matrix elements to large timelike momentum transfer using the z expansion. We illustrate the power of the dispersive bound at the hand of a simple phenomenological application. As a side result of our work, we also provide numerical results for the B s → ϕ form factors from B -meson light-cone sum rules.
On symmetric div-quasiconvex hulls and divsym-free L∞-truncations
We establish that for any non-empty, compact set K⊂Rsym3×3​ the 1- and ∞-symmetric div-quasiconvex hulls K(1) and K(∞) coincide. This settles a conjecture in a recent work of Conti,Müller & Ortiz [Arch. Ration. Mech. Anal. 235 (2020)] in the affirmative. As a key novelty, we construct an L∞-truncation that preserves both symmetry and solenoidality of matrix-valued maps in L1. For comparison, we moreover give a construction of A-free truncations in the regime 1
Numerical Solution for Fuzzy Fractional Differential Equations by Fuzzy Multi-Step Methods
To solve fractional differential equations, they are typically converted into their corresponding crisp problems through a process known as the embedding method. This paper introduces a novel direct approach to solving fuzzy differential equations using fuzzy calculations, bypassing the need for this transformation. In this study, we develop the fuzzy Adams–Bashforth (A-B) method and the fuzzy Adams–Moulton (A-M) method to find numerical solutions for fuzzy fractional differential equations (FFDEs) with fuzzy initial values. To demonstrate the accuracy and efficiency of the proposed methods, we determine both the local truncation error and the global truncation error. Additionally, we establish the convergence and stability of these methods in detail. Finally, numerical examples are provided to illustrate the flexibility and effectiveness of the proposed methods.
A Johnson–Kist type representation for truncated vector lattices
We introduce the notion of (maximal) multi-truncations on a vector lattice as a generalization of the notion of truncations, an object of recent origin. We obtain a Johnson–Kist type representation of vector lattices with maximal multi-truncations as vector lattices of almost-finite extended-real continuous functions. The spectrum that allows such a representation is a particular set of prime ideals equipped with the Hull–Kernel topology. Various representations from the existing literature will appear as special cases of our general result.
Infinite-dimensional bilinear and stochastic balanced truncation with explicit error bounds
Along the ideas of Curtain and Glover (in: Bart, Gohberg, Kaashoek (eds) Operator theory and systems, Birkhäuser, Boston, 1986), we extend the balanced truncation method for (infinite-dimensional) linear systems to arbitrary-dimensional bilinear and stochastic systems. In particular, we apply Hilbert space techniques used in many-body quantum mechanics to establish new fully explicit error bounds for the truncated system and prove convergence results. The functional analytic setting allows us to obtain mixed Hardy space error bounds for both finite-and infinite-dimensional systems, and it is then applied to the model reduction of stochastic evolution equations driven by Wiener noise.
Modal truncation method for continuum structures based on matrix norm: modal perturbation method
Modal analysis is a widely applied method to study the vibration phenomenon of continuum structures, but there is no clear method to solve the modal truncation problem at present. To determine the contribution of different modes to the whole system, a new mode truncation method based on perturbation theory is proposed in this paper. The modes are subjected to perturbation parameters during discretization, and using norm error analysis on the stiffness matrix in different degrees of freedom (DOFs) systems confirms the model number of the continuum structure system. The results show that the DOF identified by the modal perturbation method is related to the perturbation parameter, and the smaller the perturbation parameter is, the fewer modes need to be considered. When the perturbation parameter is large enough, the response of the system can only be accurately explained by truncation to higher-order modes. Finally, the perturbation parameter is fixed to 1, and the traditional Galerkin method is connected to the modal perturbation, making traditional discretization a unique case for the modal perturbation method. This method can significantly reduce the modal truncation error, which is of great significance to the dynamic analysis of engineering applications.