✦ LIBER ✦

Complexity of approximately solved problems

✍ Scribed by J.F Traub

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 528 KB
Volume: 1
Category: Article
ISSN: 0885-064X
DOI: 10.1016/0885-064x(85)90019-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate method of solving concave pr

Approximate method of solving concave programming problems

✍ B.M. Mukhamediev 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 528 KB

Solving deterministic problems by stocha

Solving deterministic problems by stochastic approximation

✍ H Sugiyama; E.S Lee 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 538 KB

Approximate methods for solving problems

Approximate methods for solving problems of convex programming

✍ Han Chang 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 532 KB

Scientific problems solved through Univa

Scientific problems solved through Univac

✍ The Staff of the Analysis Section 📂 Article 📅 1958 🏛 Elsevier Science 🌐 English ⚖ 136 KB

SQP algorithms for solving Toeplitz matr

SQP algorithms for solving Toeplitz matrix approximation problem

✍ Suliman S. Al-Homidan 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

Approximation technique for solving the

Approximation technique for solving the Vlasov–Poisson problem

✍ Z. Parsa; V. Zadorozhny 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 152 KB

In this paper, we describe the beam distribution in particle accelerators in the framework of a Vlasov-Poisson scheme. A new approach to the investigation and numerical simulation is based on the property of an universality of Maxwell equations, and Ł-moment problem. In this scheme, it is possible