AbstractThe rate of convergence of the discrete Pólya-1 algorithm is studied. Examples are given to show that the rates derived are sharp
Abstract The concept of αβ-statistical convergence was introduced by Aktuğlu (J. Comput. Appl. Math....
AbstractSalam, A., On a generalization of the ϵ-algorithm, Journal of Computational and Applied Math...
We consider a recently proposed fully discrete Galerkin scheme for the Benjamin–Ono equation which h...
AbstractThe rate of convergence of the discrete Pólya-1 algorithm is studied. Examples are given to ...
AbstractIn approximating an arbitrary point of Rn from a fixed subspace, it is known that the net of...
AbstractIn this paper, we consider the problem of best approximation in ℓp(n), 1⩽p⩽∞. If hp, 1⩽p⩽∞, ...
AbstractIn this paper we consider a problem of best approximation in ℓp, 1<p⩽∞. Let hp denote the be...
AbstractWe give a detailed analysis of the rate of convergence of the pth power minimum of an affine...
• Topic: Convergence rates of splitting algorithms • Convergence rates of these algorithms were unkn...
Abstract—The convergence of a class of Hyvärinen–Oja’s inde-pendent component analysis (ICA) learnin...
<p>The convergence rates of algorithms using <a href="http://www.plosone.org/article/info:doi/10.137...
We revisit the one-unit gradient ICA algorithm derived from the kurtosis function. By carefully stud...
We analyze the convergence rate of the multiplicative gradient (MG) method for PET-type problems wit...
In this paper we prove the L² convergence rates for a fully discrete finite element procedure for a...
AbstractBy use of the three-term recurrence relation, an elementary and constructive proof is given ...
Abstract The concept of αβ-statistical convergence was introduced by Aktuğlu (J. Comput. Appl. Math....
AbstractSalam, A., On a generalization of the ϵ-algorithm, Journal of Computational and Applied Math...
We consider a recently proposed fully discrete Galerkin scheme for the Benjamin–Ono equation which h...
AbstractThe rate of convergence of the discrete Pólya-1 algorithm is studied. Examples are given to ...
AbstractIn approximating an arbitrary point of Rn from a fixed subspace, it is known that the net of...
AbstractIn this paper, we consider the problem of best approximation in ℓp(n), 1⩽p⩽∞. If hp, 1⩽p⩽∞, ...
AbstractIn this paper we consider a problem of best approximation in ℓp, 1<p⩽∞. Let hp denote the be...
AbstractWe give a detailed analysis of the rate of convergence of the pth power minimum of an affine...
• Topic: Convergence rates of splitting algorithms • Convergence rates of these algorithms were unkn...
Abstract—The convergence of a class of Hyvärinen–Oja’s inde-pendent component analysis (ICA) learnin...
<p>The convergence rates of algorithms using <a href="http://www.plosone.org/article/info:doi/10.137...
We revisit the one-unit gradient ICA algorithm derived from the kurtosis function. By carefully stud...
We analyze the convergence rate of the multiplicative gradient (MG) method for PET-type problems wit...
In this paper we prove the L² convergence rates for a fully discrete finite element procedure for a...
AbstractBy use of the three-term recurrence relation, an elementary and constructive proof is given ...
Abstract The concept of αβ-statistical convergence was introduced by Aktuğlu (J. Comput. Appl. Math....
AbstractSalam, A., On a generalization of the ϵ-algorithm, Journal of Computational and Applied Math...
We consider a recently proposed fully discrete Galerkin scheme for the Benjamin–Ono equation which h...
DOI
Add to ORKG