Results 31 to 40 of about 1,388,848 (321)

Continuity of best approximants [PDF]

open access: yesProceedings of the American Mathematical Society, 1981
Let C n {C_n} , n ∈ N n \in {\mathbf {N}} , be Φ \Phi -closed lattices in an Orlicz-space L Φ ( Ω , A
Landers, D., Rogge, L.
openaire   +1 more source

Separable approximations of density matrices of composite quantum systems [PDF]

open access: yes, 2000
We investigate optimal separable approximations (decompositions) of states rho of bipartite quantum systems A and B of arbitrary dimensions MxN following the lines of Ref. [M. Lewenstein and A. Sanpera, Phys. Rev. Lett. 80, 2261 (1998)].
Bennett C H   +23 more
core   +2 more sources

On best rank one approximation of tensors [PDF]

open access: yes, 2012
In this paper we suggest a new algorithm for the computation of a best rank one approximation of tensors, called alternating singular value decomposition.
Cartwright   +9 more
core   +3 more sources

Best N-Simultaneous Approximation in Lp(μ,X)

open access: yesJournal of Function Spaces, 2017
Let X be a Banach space.
Tijani Pakhrou
doaj   +1 more source

Best Approximation Results in Various Frameworks

open access: yesAxioms, 2019
We first provide a best proximity point result for quasi-noncyclic relatively nonexpansive mappings in the setting of dualistic partial metric spaces. Then, those spaces will be endowed with convexity and a result for a cyclic mapping will be obtained ...
Taoufik Sabar   +2 more
doaj   +1 more source

Best Approximation Results for Fuzzy-Number-Valued Continuous Functions

open access: yesAxioms, 2023
In this paper, we study the best approximation of a fixed fuzzy-number-valued continuous function to a subset of fuzzy-number-valued continuous functions.
Juan J. Font, Sergio Macario
doaj   +1 more source

Approximation algorithms for node-weighted prize-collecting Steiner tree problems on planar graphs [PDF]

open access: yes, 2016
We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST.
Byrka, Jarosław   +2 more
core   +2 more sources

Canonical Sets of Best L1-Approximation

open access: yesJournal of Function Spaces and Applications, 2012
In mathematics, the term approximation usually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the ...
Dimiter Dryanov, Petar Petrov
doaj   +1 more source

Best Simultaneous Approximation in Orlicz Spaces

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2007
Let X be a Banach space and let LΦ(I,X) denote the space of Orlicz X-valued integrable functions on the unit interval I equipped with the Luxemburg norm. In this paper, we present a distance formula dist(f1,f2,LΦ(I,G))Φ, where G is a closed subspace of X,
M. Khandaqji, Sh. Al-Sharif
doaj   +1 more source

Best Copositive Approximation

open access: yesJournal of Approximation Theory, 1993
Let \(M\) be an \(n\)-dimensional Chebyshev subspace of \(C[a,b]\). For \(f\in C[a,b]\) define \(M_ f\) as the set of functions \(p\in M\) such that \(p(x)f(x)\geq 0\) for all \(x\in [a,b]\). Best copositive approximation to \(f\) is the approximation by elements of \(M_ f\). The author develops a theory for best copositive approximation which is quite
openaire   +2 more sources

Home - About - Disclaimer - Privacy