✦ LIBER ✦

Direct algorithms to solve the two-sided obstacle problem for an M-matrix

✍ Scribed by J. P. Zeng; Y. J. Jiang

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 110 KB
Volume: 13
Category: Article
ISSN: 1070-5325
DOI: 10.1002/nla.487

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Direct algorithm for the solution of two

Direct algorithm for the solution of two-sided obstacle problems with M-matrix

✍ Ying-Jun Jiang; Jin-Ping Zeng 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

An algebraic multigrid wave–ray algorith

An algebraic multigrid wave–ray algorithm to solve eigenvalue problems for the helmholtz operator

✍ Irene Livshits 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract Helmholtz equations with variable coefficients are known to be hard to solve both analytically and numerically. In this paper, we introduce a numerical multigrid solver for one‐dimensional Helmholtz eigenvalue problems with periodic potentials and solutions. The solvers employ wave–ray

An algorithm to solve the m × n assignme

An algorithm to solve the m × n assignment problem in expected time O(mn log n)

✍ Richard M. Karp 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB

## Abstract We give an algorithm to solve the __m__‐source, __n__‐destination assignment problem in expected time __O(mn__ log __n__) under the assumption that the edge costs are independent random variables and the costs of the edges incident with any given source are identically distributed. The