Difference between revisions of "Algorithm classification"

From Algowiki
Jump to navigation Jump to search
[quality revision][quality revision]
Line 17: Line 17:
 
# <div id="Solution of linear equations systems">'''Solution of linear equations systems'''</div>
 
# <div id="Solution of linear equations systems">'''Solution of linear equations systems'''</div>
 
## ''Direct methods''
 
## ''Direct methods''
 +
### Linpack benchmark
 
### ''Matrices of a special form''
 
### ''Matrices of a special form''
 
#### ''Triangular matrices''
 
#### ''Triangular matrices''
 
##### [[Forward substitution]]
 
##### [[Forward substitution]]
 
##### [[Backward substitution]]
 
##### [[Backward substitution]]
 +
#### Tridiagonal matrices
 +
##### LU decomposition
 +
###### Thomas algorithm
 +
####### [[Thomas algorithm, pointwise version]]
 +
## ''Iterative methods''
 
# <div id="Computer benchmarks">'''Computer benchmarks'''</div>
 
# <div id="Computer benchmarks">'''Computer benchmarks'''</div>
 
# <div id="Fourier transform">'''Fourier transform'''</div>
 
# <div id="Fourier transform">'''Fourier transform'''</div>
Line 47: Line 53:
 
## ''Algorithms of quantum computation simulation''
 
## ''Algorithms of quantum computation simulation''
 
# <div id="Algorithms for solving equations of mathematical physics">'''Algorithms for solving equations of mathematical physics'''</div>
 
# <div id="Algorithms for solving equations of mathematical physics">'''Algorithms for solving equations of mathematical physics'''</div>
 +
## [[Poisson equation, solving with DFT]]
 
# <div id="Other algorithms">'''Other algorithms'''</div>
 
# <div id="Other algorithms">'''Other algorithms'''</div>
  
 
[[Ru:Классификация алгоритмов]]
 
[[Ru:Классификация алгоритмов]]

Revision as of 15:37, 3 March 2016

  1. Vector operations
    1. Pairwise summation
    2. Dot product
  2. Matrix-vector operations
    1. Dense matrix-vector multiplication
  3. Matrix operations
    1. Dense matrix multiplication
  4. Matrix decomposition
    1. Triangular decomposition
      1. Gaussian elimination
      2. Cholesky method
        1. Cholesky decomposition
    2. Unitary-triangular decomposition
      1. Givens method
    3. Decomposition into unitary and Hessenberg matrices
    4. Decomposition into unitary and diagonal matrices
  5. Solution of linear equations systems
    1. Direct methods
      1. Linpack benchmark
      2. Matrices of a special form
        1. Triangular matrices
          1. Forward substitution
          2. Backward substitution
        2. Tridiagonal matrices
          1. LU decomposition
            1. Thomas algorithm
              1. Thomas algorithm, pointwise version
    2. Iterative methods
  6. Computer benchmarks
  7. Fourier transform
    1. Cooley–Tukey Fast Fourier Transform, radix-2 case
  8. Algebra of polynomials
    1. Horners method
  9. Numerical integration methods
  10. Graph algorithms
    1. Single Source Shortest Path (SSSP)
    2. All Pairs Shortest Path (APSP)
    3. Transitive closure of a directed graph
    4. Construction of the minimum spanning tree (MST)
    5. Search for isomorphic subgraphs
    6. Graph connectivity
    7. Finding maximal flow in a transportation network
    8. Assignment problem
  11. Search algorithms
  12. Sorting algorithms
  13. Computational geometry
  14. Computer graphics
  15. Cryptographic algorithms
  16. Neural networks
  17. Optimization algorithms
  18. Game theory algorithms
  19. Algorithms of quantum system simulation
    1. Algorithms of quantum computation simulation
  20. Algorithms for solving equations of mathematical physics
    1. Poisson equation, solving with DFT
  21. Other algorithms