Pages with the most revisions
Jump to navigation
Jump to search
Showing below up to 34 results in range #301 to #334.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Serial-parallel method for solving tridiagonal matrices based on the LU decomposition and backward substitutions (1 revision)
- Bellman-Ford, C++, Boost Graph Library (1 revision)
- Prim's, C++, Boost Graph Library (1 revision)
- Poisson equation, solving with DFT, AccFFT (1 revision)
- QR algorithm (1 revision)
- Linpack, HPL (1 revision)
- K-means clustering, ELKI (1 revision)
- Linpack, locality (1 revision)
- Ullman's algorithm (1 revision)
- Backward substitution, scalability (1 revision)
- Newton's method for systems of nonlinear equations, parallel2 (1 revision)
- Orthogonalization method with reorthogonalization (1 revision)
- Parallel prefix scan algorithm using pairwise summation (1 revision)
- Classical point-wise Householder (reflections) method for reducing a matrix to Hessenberg form (1 revision)
- Prim's, Java, JGraphT (1 revision)
- Kruskal's, C++, Boost Graph Library (1 revision)
- Poisson equation, solving with DFT, PFFT (1 revision)
- Kaczmarz's, MATLAB1 (1 revision)
- Repeated Thomas, locality (1 revision)
- K-means clustering, Julia (1 revision)
- Poisson equation, solving with DFT, locality (1 revision)
- Участник:VolkovNikita94 (1 revision)
- Repeated two-sided Thomas, locality (1 revision)
- Dense matrix multiplication (1 revision)
- Newton's method for systems of nonlinear equations, parallel3 (1 revision)
- Tarjan's algorithm for finding the bridges of a graph (1 revision)
- Finding minimal-cost flow in a transportation network (1 revision)
- Serial Jacobi (rotations) method for symmetric matrices (1 revision)
- VF2, C++, VF Library (1 revision)
- VF2, Python, NetworkX (1 revision)
- Disjoint set union, Boost Graph Library (1 revision)
- Hungarian, Java, JGraphT (1 revision)
- Ford–Fulkerson, C++, Boost Graph Library (1 revision)
- Kaczmarz's, MATLAB2 (1 revision)
