Difference between revisions of "Algorithm classification"

From Algowiki
Jump to navigation Jump to search
[quality revision][quality revision]
(Add levels of classification.)
Line 1: Line 1:
 
# <div id="Vector operations">'''Vector operations'''</div>
 
# <div id="Vector operations">'''Vector operations'''</div>
−
## [[Pairwise summation]]
+
## {{level|Pairwise summation}}
−
## [[Dot product]]
+
## {{level|Dot product}}
 
# <div id="Matrix-vector operations">'''Matrix-vector operations'''</div>
 
# <div id="Matrix-vector operations">'''Matrix-vector operations'''</div>
−
## [[Dense matrix-vector multiplication]]
+
## {{level|Dense matrix-vector multiplication}}
 
# <div id="Matrix operations">'''Matrix operations'''</div>
 
# <div id="Matrix operations">'''Matrix operations'''</div>
−
## [[Dense matrix multiplication]]
+
## {{level|Dense matrix multiplication}}
 
# <div id="Matrix decomposition">'''Matrix decomposition'''</div>
 
# <div id="Matrix decomposition">'''Matrix decomposition'''</div>
 
## ''Triangular decomposition''
 
## ''Triangular decomposition''
−
### [[Gaussian elimination]]
+
### {{level|Gaussian elimination}}
−
### [[Cholesky method]]
+
### {{level|Cholesky method}}
−
#### [[Cholesky decomposition]]
+
#### {{level|Cholesky decomposition}}
 
## ''Unitary-triangular decomposition''
 
## ''Unitary-triangular decomposition''
−
### [[Givens method]]
+
### {{level|Givens method}}
 
## ''Decomposition into unitary and Hessenberg matrices''
 
## ''Decomposition into unitary and Hessenberg matrices''
 
## ''Decomposition into unitary and diagonal matrices''
 
## ''Decomposition into unitary and diagonal matrices''
Line 20: Line 20:
 
### ''Matrices of a special form''
 
### ''Matrices of a special form''
 
#### ''Triangular matrices''
 
#### ''Triangular matrices''
−
##### [[Forward substitution]]
+
##### {{level|Forward substitution}}
−
##### [[Backward substitution]]
+
##### {{level|Backward substitution}}
 
#### ''Tridiagonal matrices''
 
#### ''Tridiagonal matrices''
 
##### ''LU decomposition''
 
##### ''LU decomposition''
 
###### ''Thomas algorithm''
 
###### ''Thomas algorithm''
−
####### [[Thomas algorithm, pointwise version]]
+
####### {{level|Thomas algorithm, pointwise version}}
 
## ''Iterative methods''
 
## ''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>
−
## [[Cooley–Tukey Fast Fourier Transform, radix-2 case]]
+
## {{level|Cooley–Tukey Fast Fourier Transform, radix-2 case}}
 
# <div id="Algebra of polynomials">'''Algebra of polynomials'''</div>
 
# <div id="Algebra of polynomials">'''Algebra of polynomials'''</div>
−
## [[Horners method]]
+
## {{level|Horners method}}
 
# <div id="Numerical integration methods">'''Numerical integration methods'''</div>
 
# <div id="Numerical integration methods">'''Numerical integration methods'''</div>
 
# <div id="Graph algorithms">'''Graph algorithms'''</div>
 
# <div id="Graph algorithms">'''Graph algorithms'''</div>
−
## [[Single Source Shortest Path (SSSP)]]
+
## {{level|Single Source Shortest Path (SSSP)}}
−
## [[All Pairs Shortest Path (APSP)]]
+
## {{level|All Pairs Shortest Path (APSP)}}
−
## [[Transitive closure of a directed graph]]
+
## {{level|Transitive closure of a directed graph}}
−
## [[Construction of the minimum spanning tree (MST)]]
+
## {{level|Construction of the minimum spanning tree (MST)}}
−
## [[Search for isomorphic subgraphs]]
+
## {{level|Search for isomorphic subgraphs}}
−
## [[Graph connectivity]]
+
## {{level|Graph connectivity}}
−
## [[Finding maximal flow in a transportation network]]
+
## {{level|Finding maximal flow in a transportation network}}
−
## [[Assignment problem]]
+
## {{level|Assignment problem}}
 
# <div id="Search algorithms">'''Search algorithms'''</div>
 
# <div id="Search algorithms">'''Search algorithms'''</div>
 
# <div id="Sorting algorithms">'''Sorting algorithms'''</div>
 
# <div id="Sorting algorithms">'''Sorting algorithms'''</div>
Line 53: 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]]
+
## {{level|Poisson equation, solving with DFT}}
 
# <div id="Other algorithms">'''Other algorithms'''</div>
 
# <div id="Other algorithms">'''Other algorithms'''</div>
  
 
[[Ru:Классификация алгоритмов]]
 
[[Ru:Классификация алгоритмов]]

Revision as of 13:56, 11 April 2016

  1. Vector operations
    1. Method level Pairwise summation
    2. Algorithm level Dot product
  2. Matrix-vector operations
    1. Algorithm level Dense matrix-vector multiplication
  3. Matrix operations
    1. Problem level Dense matrix multiplication
  4. Matrix decomposition
    1. Triangular decomposition
      1. Gaussian elimination
      2. Method level Cholesky method
        1. Algorithm level Cholesky decomposition
    2. Unitary-triangular decomposition
      1. Algorithm level 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. Algorithm level Forward substitution
          2. Algorithm level Backward substitution
        2. Tridiagonal matrices
          1. LU decomposition
            1. Thomas algorithm
              1. Algorithm level Thomas algorithm, pointwise version
    2. Iterative methods
  6. Computer benchmarks
  7. Fourier transform
    1. Algorithm level Cooley–Tukey Fast Fourier Transform, radix-2 case
  8. Algebra of polynomials
    1. Algorithm level Horners method
  9. Numerical integration methods
  10. Graph algorithms
    1. Problem level Single Source Shortest Path (SSSP)
    2. Problem level All Pairs Shortest Path (APSP)
    3. Problem level Transitive closure of a directed graph
    4. Problem level Construction of the minimum spanning tree (MST)
    5. Problem level Search for isomorphic subgraphs
    6. Problem level Graph connectivity
    7. Problem level Finding maximal flow in a transportation network
    8. Problem level 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. Algorithm level Poisson equation, solving with DFT
  21. Other algorithms
Retrieved from "https://algowiki-project.org/algowiki/en/index.php?title=Algorithm_classification&oldid=671"