Results 11 to 20 of about 6,431,216 (308)

Pointwise Best Approximation Results for Galerkin Finite Element Solutions of Parabolic Problems [PDF]

SIAM Journal on Numerical Analysis, 2015
In this paper we establish a best approximation property of fully discrete Galerkin finite element solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty$ norm.
D. Leykekhman, B. Vexler
semanticscholar   +1 more source

Algebraic Solution of Tropical Best Approximation Problems

Mathematics, 2023
We introduce new discrete best approximation problems, formulated and solved in the framework of tropical algebra, which deals with semirings and semifields with idempotent addition.
Nikolai Krivulin
doaj   +1 more source

Finite element quasi-interpolation and best approximation [PDF]

, 2015
This paper introduces a quasi-interpolation operator for scalar- and vector-valued finite element spaces constructed on affine, shape-regular meshes with some continuity across mesh interfaces.This operator gives optimal estimates of the best ...
A. Ern, J. Guermond
semanticscholar   +1 more source

Fuzzy near best approximation as a generalization of fuzzy best approximation [PDF]

Journal of Mahani Mathematical Research
‎‎‎Given a fuzzy normed space, we will introduce the notion of fuzzy near best approximation as a generalization of the notion of fuzzy best approximation.
Ali Reza Khoddami, Rasoul Tourani
doaj   +1 more source

On best rank one approximation of tensors [PDF]

, 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, De Lathauwer, De Lathauwer, Friedland, Golub, Horn, Kolda, Kroonenberg, Varga, Zhang   +9 more
core   +3 more sources

Best rank k approximation for binary forms [PDF]

, 2017
In the tensor space $\mathrm{Sym}^d {\mathbb R}^2$ of binary forms we study the best rank $k$ approximation problem. The critical points of the best rank $1$ approximation problem are the eigenvectors and it is known that they span a hyperplane. We prove
Ottaviani, Giorgio, Tocino, Alicia
core   +3 more sources

NEGATIVE THEOREM FOR LP,0

Journal of Kufa for Mathematics and Computer, 2017
For a given nonnegative integer number n, we can find a monotone function f depending on n, defined on the interval I=[-1,1], and an absolute constant c>0, satisfying the following relationship: (2〖E_n (f ́ )〗_p)/(n+1)^3 ≤〖E_(n+1)^1 (f)〗_pâ ...
GHAZI ABDULLAH Madlol
doaj   +1 more source

On the (non)existence of best low-rank approximations of generic IxJx2 arrays [PDF]

, 2015
Several conjectures and partial proofs have been formulated on the (non)existence of a best low-rank approximation of real-valued IxJx2 arrays. We analyze this problem using the Generalized Schur Decomposition and prove (non)existence of a best rank-R ...
Stegeman, Alwin
core   +3 more sources

Equivalence of local-and global-best approximations, a simple stable local commuting projector, and optimal hp approximation estimates in H(div) [PDF]

IMA Journal of Numerical Analysis, 2019
Given an arbitrary function in $\boldsymbol{H}({\operatorname{div}})$, we show that the error attained by the global-best approximation by $\boldsymbol{H}({\operatorname{div}})$-conforming piecewise polynomial Raviart–Thomas–Nédélec elements under ...
A. Ern, T. Gudi, Iain Smears, M. Vohralík   +3 more
semanticscholar   +1 more source

Characterizing best approximation from a convex set without convex representation

Journal of Approximation Theory, 2019
In this paper, we study the problem of whether the best approximation to any x in a real Hilbert space X from the closed convex set K ≔ C ∩ D can be characterized by the best approximation to a perturbation x − l of x from the set C for some l in a ...
V. Jeyakumar, H. Mohebi
semanticscholar   +1 more source