✦ LIBER ✦

A remark on a class of regularizing algorithms

✍ Scribed by A.B. Bakushinskii

Publisher: Elsevier Science
Year: 1973
Weight: 206 KB
Volume: 13
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(73)90023-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the convergence of a family of regula

On the convergence of a family of regularizing algorithms

✍ Yu.I. Khudak 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 420 KB

Global Solution and Regularizing Propert

Global Solution and Regularizing Properties on a Class of Nonlinear Evolution Equation

✍ Jaime E Muñoz Rivera 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 853 KB

In this paper we will consider the equation where The initial value problem is proved to be locally well posed for initial data taken in D(A 2 )\_D(A 3Â2 ) and globally well posed for small data, in this case we also show the exponential decay of the solution as time goes to infinity. The main res

On a class of algorithms for total appro

On a class of algorithms for total approximation

✍ G.A Watson 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 474 KB

On a remarkable class of subvarieties of

On a remarkable class of subvarieties of a symmetric variety

✍ Silvana Abeasis 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 922 KB

On the construction of a class of regula

On the construction of a class of regular semigroups

✍ T.S Blyth; R McFadden 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 871 KB

On a class of Hamiltonian laceable 3-reg

On a class of Hamiltonian laceable 3-regular graphs

✍ Brian Alspach; C.C. Chen; Kevin McAvaney 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 741 KB

Using the concept of brick-products, Alspach and Zhang showed in that all cubic Cayley graphs over dihedral groups are Hamiltonian. It is also conjectured that all brick-products C(2n, m, r) are Hamiltonian laceable, in the sense that any two vertices at odd distance apart can be joined by a Hamilt