✦ LIBER ✦

Lower bound for the speed of convergence in a problem with two boundaries

✍ Scribed by Ya. Yu. Nikitin

Publisher: Springer
Year: 1974
Tongue: English
Weight: 128 KB
Volume: 14
Category: Article
ISSN: 0363-1672
DOI: 10.1007/bf01417614

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new lower bound for the non-oriented t

A new lower bound for the non-oriented two-dimensional bin-packing problem

✍ François Clautiaux; Antoine Jouglet; Joseph El Hayek 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 183 KB

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.

Lower bound for the rate of convergence

Lower bound for the rate of convergence in the CLT in a Hilbert space

✍ M. Bloznelis 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 442 KB

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

On the convergence of finite difference

On the convergence of finite difference methods for a class of two-point boundary value problems with periodic boundary conditions

✍ C.P. Katti; S.N. Baboo; S. Sivaloganathan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 441 KB

Convergence bounds of GMRES with Schwarz

Convergence bounds of GMRES with Schwarz' preconditioner for the scattering problem

✍ Faker Ben Belgacem; Nabil Gmati; Faten Jelassi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 277 KB

On the convergence of two branch-and-bou

On the convergence of two branch-and-bound algorithms for nonconvex programming problems

✍ H. P. Benson 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 276 KB