Wanted pages

Jump to navigation Jump to search

List of non-existing pages with the most links to them, excluding pages which only have redirects linking to them. For a list of non-existent pages that have redirects linking to them, see the list of broken redirects.

Showing below up to 50 results in range #41 to #90.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Compact scheme of Gaussian elimination for tri-diagonal matrices, serial variant компактная схема метода Гаусса для трёхдиагональной матрицы, последовательный вариант‏‎ (1 link)
  2. Complete reduction method‏‎ (1 link)
  3. Convex polygon intersection‏‎ (1 link)
  4. Cyclic reduction repeated for a new right-hand side‏‎ (1 link)
  5. Decompositions of special tri-diagonal matrices‏‎ (1 link)
  6. Delaunay triangulation‏‎ (1 link)
  7. Determining visible parts of a three-dimensional scene‏‎ (1 link)
  8. Dichotomy method‏‎ (1 link)
  9. Direct methods‏‎ (1 link)
  10. Fast Fourier transform for composite dimension‏‎ (1 link)
  11. Fast Fourier transform for composite dimension with small prime divisors (2,3,5,7)‏‎ (1 link)
  12. Fast Fourier transform for even powers-of-two‏‎ (1 link)
  13. Fast Fourier transform for prime dimension‏‎ (1 link)
  14. Finding the convex hull of a point set‏‎ (1 link)
  15. Finding the diameter of a point set‏‎ (1 link)
  16. Ford-Fulkerson algorithm‏‎ (1 link)
  17. Forward and backward substitution for bidiagonal matrices‏‎ (1 link)
  18. Forward and backward substitution for block bidiagonal matrices‏‎ (1 link)
  19. Forward substitution (a real version)‏‎ (1 link)
  20. Fourier transform‏‎ (1 link)
  21. Gauss rule‏‎ (1 link)
  22. Genetic algorithms‏‎ (1 link)
  23. Givens (rotations) method for reducing a matrix to Hessenberg form‏‎ (1 link)
  24. Givens (rotations) reduction of a matrix to bidiagonal form‏‎ (1 link)
  25. Givens (rotations) reduction to tridiagonal form‏‎ (1 link)
  26. Global illumination: Regarding direct illumination and reflection from other objects‏‎ (1 link)
  27. Hopcroft-Karp algorithm‏‎ (1 link)
  28. Householder (reflections) method for reducing to tridiagonal form‏‎ (1 link)
  29. Hungarian Method‏‎ (1 link)
  30. Hybrid algorithms‏‎ (1 link)
  31. Hypercube‏‎ (1 link)
  32. Jacobi method with a special choice of rotations for finding singular values‏‎ (1 link)
  33. Kruskal algorithm‏‎ (1 link)
  34. LU-разложение методом Гаусса‏‎ (1 link)
  35. LU-разложение методом Гаусса с выбором ведущего элемента по всей матрице‏‎ (1 link)
  36. LU-разложение методом Гаусса с выбором ведущего элемента по главной диагонали‏‎ (1 link)
  37. LU-разложение методом Гаусса с выбором ведущего элемента по столбцу‏‎ (1 link)
  38. LU-разложение методом Гаусса с выбором ведущего элемента по строке‏‎ (1 link)
  39. Lanczos algorithm‏‎ (1 link)
  40. Line drawing algorithms: Approximating a line segment on discrete graphical media‏‎ (1 link)
  41. Linear programming‏‎ (1 link)
  42. Linear search: Finding an item in an arbitrary list‏‎ (1 link)
  43. Matrices of a special form‏‎ (1 link)
  44. Merge sort (serial and parallel variants)‏‎ (1 link)
  45. Method of bisection‏‎ (1 link)
  46. Methods based on the conventional LU decomposition‏‎ (1 link)
  47. Methods for calculating singular values of bidiagonal matrices‏‎ (1 link)
  48. Methods for solving block tridiagonal matrices‏‎ (1 link)
  49. Partial eigenvalue problem‏‎ (1 link)
  50. Pattern recognition‏‎ (1 link)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

Retrieved from "https://algowiki-project.org/en/Special:WantedPages"