Search results
From MaRDI portal
- circumscribing polygons of disjoint line segments 1993-01-16 Paper A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs 1989-01-01 Paper River routing...10 bytes (16 words) - 02:11, 7 October 2023
- by using large dense blocks 1998-03-29 Paper A locally optimized reordering algorithm and its application to a parallel sparse linear system solver 1995-01-30...10 bytes (16 words) - 14:22, 11 December 2023
- Manipulation and Visualization of Sparse Matrices 1993-04-01 Paper A Fast Reordering Algorithm for Parallel Sparse Triangular Solution 1992-06-28 Paper https://portal...10 bytes (18 words) - 03:56, 7 October 2023
- functions via the Lanczos algorithm 2000-05-03 Paper A new family of block methods 2000-02-01 Paper A rational Lanczos algorithm for model reduction 1997-09-17...10 bytes (19 words) - 03:53, 10 December 2023
- distribution scheduling problem 2022-12-19 Paper An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate...10 bytes (18 words) - 20:03, 12 December 2023
- element formulation 2007-07-26 Paper Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured...10 bytes (20 words) - 08:23, 13 December 2023
- Factorization 1990-01-01 Paper Reordering sparse matrices for parallel elimination 1989-01-01 Paper A Linear Reordering Algorithm for Parallel Pivoting of Chordal...10 bytes (20 words) - 02:44, 25 September 2023
- Orthogonal Factorization: Givens and Householder Algorithms 1989-01-01 Paper A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization 1989-01-01...10 bytes (17 words) - 02:44, 25 September 2023
- Publication Date of Publication Type An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient...10 bytes (20 words) - 23:42, 24 September 2023
- Publication Date of Publication Type Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured...10 bytes (18 words) - 07:17, 7 October 2023
- with a Hill-Climbing strategy 2021-10-21 Paper An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate...10 bytes (22 words) - 03:01, 7 October 2023
- methods for large-scale problems 1995-02-02 Paper A locally optimized reordering algorithm and its application to a parallel sparse linear system solver 1995-01-30...10 bytes (19 words) - 23:18, 9 December 2023
- free‐surface flows 2007-07-04 Paper Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured...10 bytes (18 words) - 09:44, 24 September 2023
- conduction utilizing Lanczos algorithm 1989-01-01 Paper Nonlinear dynamic analysis using the pseudo-force method and the Lanczos algorithm 1988-01-01 Paper On the...10 bytes (22 words) - 09:15, 9 December 2023
- mardi4nfdi.de/entity/Q4314000 1995-02-16 Paper A locally optimized reordering algorithm and its application to a parallel sparse linear system solver 1995-01-30...10 bytes (17 words) - 09:55, 9 December 2023
- horizon 2015-05-29 Paper Online scheduling with rejection and reordering: exact algorithms for unit size jobs 2015-01-21 Paper Preemptive online scheduling...10 bytes (18 words) - 17:43, 6 October 2023
- universality of iterated hashing over variable-length strings 2012-05-04 Paper Reordering columns for smaller indexes 2011-06-22 Paper Faster retrieval with a two-pass...10 bytes (16 words) - 09:04, 9 December 2023
- Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices 1985-01-01 Paper Algorithm 586: ITPACK 2C: A FORTRAN Package for...10 bytes (18 words) - 07:14, 12 December 2023
- A physical study of the LLL algorithm 2023-01-12 Paper Improved lattice enumeration algorithms by primal and dual reordering methods 2022-12-07 Paper M...10 bytes (17 words) - 08:06, 12 December 2023
- 2014-07-23 Paper Online Stochastic Reordering Buffer Scheduling 2014-07-01 Paper Almost tight bounds for reordering buffer management 2014-06-05 Paper...10 bytes (16 words) - 17:31, 12 December 2023
