Difference between revisions of "Category:Started articles"
Jump to navigation
Jump to search
Nebaruzdin (talk | contribs) (Add supercategory.) |
Nebaruzdin (talk | contribs) m (Put interwiki for categories.) |
||
| Line 1: | Line 1: | ||
[[Category:Articles by readiness]] | [[Category:Articles by readiness]] | ||
| + | |||
| + | [[ru:Категория:Начатые статьи]] | ||
Latest revision as of 15:53, 4 June 2015
Pages in category "Started articles"
The following 155 pages are in this category, out of 155 total.
B
- Backward substitution, scalability
- BiCGStab, HYPRE
- BiCGStab, MIT
- BiCGStab, NVIDIA AmgX
- Biconjugate gradient stabilized method (BiCGStab)
- Binary search, .NET Framework 2.0
- Binary search, C++
- Binary search, Java
- Binary search, locality
- Binary search, Python
- Binary search, С
- Binary search: Finding the position of a target value within a sorted array
- Block Thomas algorithm
C
- Classical orthogonalization method
- Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form
- Compact scheme for Gaussian elimination and its modifications: Tridiagonal matrix
- Complete cyclic reduction
- Complete cyclic reduction, locality
- Complete cyclic reduction, scalability
- Cubature rules
D
F
G
- Gabow's edge connectivity algorithm
- Gaussian elimination (finding the LU decomposition)
- Gaussian elimination with column pivoting
- Gaussian elimination with complete pivoting
- Gaussian elimination with diagonal pivoting
- Gaussian elimination with row pivoting
- GHS algorithm
- Givens (rotations) method for the QR decomposition of a matrix
H
- Hessenberg QR algorithm as implemented in SCALAPACK
- High Performance Conjugate Gradient (HPCG) benchmark
- Hopcroft–Karp algorithm
- Householder (reflections) method for reducing a complex Hermitian matrix to symmetric tridiagonal form
- Householder (reflections) method for the QR decomposition of a square matrix, real point-wise version
- Householder (reflections) method for the QR decomposition, locality
- Householder (reflections) method for the QR decomposition, SCALAPACK
- Householder (reflections) reduction of a matrix to bidiagonal form
- Householder (reflections) reduction of a matrix to bidiagonal form, locality
- Householder (reflections) reduction of a matrix to bidiagonal form, SCALAPACK
- HPCG, locality
- HPCG, scalability
- Hungarian algorithm
K
- K-means clustering
- K-means clustering, Accord.NET
- K-means clustering, Apache Mahout
- K-means clustering, CrimeStat
- K-means clustering, ELKI
- K-means clustering, Julia
- K-means clustering, MLPACK
- K-means clustering, Octave
- K-means clustering, OpenCV
- K-means clustering, R
- K-means clustering, scalability1
- K-means clustering, scalability2
- K-means clustering, scalability3
- K-means clustering, scalability4
- K-means clustering, scikit-learn
- K-means clustering, SciPy
- K-means clustering, Spark
- K-means clustering, Torch
- K-means clustering, Weka
- Kaczmarz's algorithm
- Kaczmarz's, MATLAB1
- Kaczmarz's, MATLAB2
- Kaczmarz's, MATLAB3
- Kruskal's algorithm
L
M
N
- Newton's method for systems of nonlinear equations
- Newton's method for systems of nonlinear equations, ALIAS C++
- Newton's method for systems of nonlinear equations, Numerical Mathematics - NewtonLib
- Newton's method for systems of nonlinear equations, Numerical Recipes
- Newton's method for systems of nonlinear equations, parallel1
- Newton's method for systems of nonlinear equations, parallel2
- Newton's method for systems of nonlinear equations, parallel3
- Newton's method for systems of nonlinear equations, PETSc
- Newton's method for systems of nonlinear equations, scalability1
- Newton's method for systems of nonlinear equations, scalability2
- Newton's method for systems of nonlinear equations, scalability3
- Newton's method for systems of nonlinear equations, scalability4
- Newton's method for systems of nonlinear equations, Sundials
- Numerical quadrature (cubature) rules on an interval (for a multidimensional cube)
- Numerical quadrature (cubature) rules on an interval (for a multidimensional cube), scalability
P
Q
R
S
- SDDP, scalability
- Serial Jacobi (rotations) method for symmetric matrices
- Serial Jacobi (rotations) method with thresholds for symmetric matrices
- Serial-parallel algorithm for the LU decomposition of a tridiagonal matrix
- Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions
- Shiloach-Vishkin algorithm for finding the connected components
- Singular value decomposition (finding singular values and singular vectors)
- Stochastic dual dynamic programming (SDDP)
- Stone doubling algorithm
- Stone doubling algorithm for solving bidiagonal SLAEs
- Symmetric QR algorithm as implemented in SCALAPACK
T
- Tarjan's algorithm for finding the bridges of a graph
- Tarjan's biconnected components algorithm
- Tarjan's strongly connected components algorithm
- Tarjan-Vishkin biconnected components algorithm
- Tarjan-Vishkin biconnected components, scalability
- The classical Jacobi (rotations) method with pivoting for symmetric matrices
- The Jacobi (rotations) method for solving the symmetric eigenvalue problem
- Thomas algorithm
- Triangular decompositions
- Two-qubit transform of a state vector
- Two-sided Thomas algorithm, block variant
