Results 51 to 60 of about 4,720,579 (297)
A Note on Generalized Approximation Property
Journal of Function Spaces and Applications, 2013 We introduce a notion of generalized approximation property, which we refer to as --AP possessed by a Banach space , corresponding to an arbitrary Banach sequence space and a convex subset of , the class of bounded linear operators on .
Antara Bhar, Manjul Gupta
doaj +1 more source
Space–time proper generalized decompositions for the resolution of transient elastodynamic models [PDF]
, 2013 In this paper, we investigate ability of proper generalized decomposition (PGD) to solve transient elastodynamic models in space–time domain. Classical methods use time integration schemes and an incremental resolution process.
BOUCINHA, Lucas +2 more
core +1 more source
Synergistic perspectives—How single‐molecule biophysics complement biochemical understanding
FEBS Letters, EarlyView.In this review, we discuss how ensemble biochemistry and single‐molecule approaches are complementary, outline commonly used single‐molecule techniques, and illustrate their relevance through two representative case studies: chromatin organization by SMC complexes and pathway choice during DNA double‐strand break repair.
Sara De Bragança +2 more
wiley +1 more source
Efficient function approximation in enriched approximation spaces
IMA Journal of Numerical AnalysisAbstract An enriched approximation space is the span of a conventional basis with a few extra functions included, for example to capture known features of the solution to a computational problem. Adding functions to a basis makes it overcomplete and, consequently, the corresponding discretized approximation problem may require solving an
Herremans, Astrid, Huybrechs, Daan
openaire +2 more sources
Lagrange approximation in Banach spaces [PDF]
Czechoslovak Mathematical Journal, 2015 Using an integral representation formula for holomorphic functions on Banach spaces combined with Lagrange interpolation of the exponential function \(e^z\) in the complex plane, the authors define Lagrange interpolating polynomials for representable functions defined on a Banach space \(E\).
Nilsson, Lisa +2 more
openaire +2 more sources
FEBS Letters, EarlyView.Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source
A New Approach to Near Approximation in Fuzzy Ideals of an MV-Algebras
Foundations of Computing and Decision SciencesThe rough set concept was originally proposed by Pawlak as a formal tool for modeling incompleteness and imprecision in information systems. Rough set theory is an extension of set theory in which a subset of a universe is described by a pair of sets ...
Jokar Fatemeh, Davvaz Bijan
doaj +1 more source
SoftwareX, 2016 Random Phase Approximation (RPA) is one of the main approximation tools in studying nuclear structure. Here, we present a graphical user interface (GUI) Fortran code: Particle–Particle Random Phase Approximation (PPRPA) version 1, 2015. The code performs
Ali H. Taqi
doaj +1 more source
BEST APPROXIMATION IN QUASI TENSOR PRODUCT SPACE AND DIRECT SUM OF LATTICE NORMED SPACES [PDF]
Journal of Algebraic Systems, 2014 We study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesX_{i}. We introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by ...
Mahdi Iranmanesh, Fateme Solimani
doaj +1 more source
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
, 2008 In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler +3 more
core +1 more source