• Thumbnail for Sparse matrix
    In numerical analysis and scientific computing, a sparse matrix or sparse array is a matrix in which most of the elements are zero. There is no strict...
    25 KB (3,241 words) - 23:26, 2 June 2025
  • In mathematics, particularly matrix theory, a band matrix or banded matrix is a sparse matrix whose non-zero entries are confined to a diagonal band, comprising...
    8 KB (1,170 words) - 13:59, 5 September 2024
  • directional gradient of a rasterized matrix. Once a matrix or a high-dimensional vector is transferred to a sparse space, different recovery algorithms...
    23 KB (3,499 words) - 10:30, 29 January 2025
  • Sparse matrix–vector multiplication (SpMV) of the form y = Ax is a widely used computational kernel existing in many scientific applications. The input...
    1 KB (111 words) - 18:28, 12 August 2023
  • adjacency matrix and the time needed to perform operations on them is dependent on the matrix representation chosen for the underlying matrix. Sparse matrix representations...
    20 KB (2,453 words) - 03:31, 18 May 2025
  • Thumbnail for Matrix representation
    LAPACK defines various matrix representations in memory. There is also Sparse matrix representation and Morton-order matrix representation. According...
    4 KB (463 words) - 19:48, 8 June 2025
  • designed to store sparse matrices, first described in 1982 as the format for the Harwell-Boeing collection of sparse matrix test problems. Matrix Market exchange...
    2 KB (88 words) - 21:55, 17 December 2024
  • The Sparse Matrix Converter is an AC/AC converter which offers a reduced number of components, a low-complexity modulation scheme, and low realization...
    9 KB (1,183 words) - 17:29, 4 May 2022
  • In linear algebra, a diagonal matrix is a matrix in which the entries outside the main diagonal are all zero; the term usually refers to square matrices...
    17 KB (2,414 words) - 01:49, 15 June 2025
  • sign matrix, a matrix of 0, 1, and −1 coefficients with the nonzeros in each row or column alternating between 1 and −1 and summing to 1 Sparse matrix, is...
    3 KB (319 words) - 20:48, 16 May 2025
  • statistics, the projection matrix ( P ) {\displaystyle (\mathbf {P} )} , sometimes also called the influence matrix or hat matrix ( H ) {\displaystyle (\mathbf...
    13 KB (1,831 words) - 21:07, 14 April 2025
  • to the star height of a regular language. It has also found use in sparse matrix computations (see Bodlaender et al. 1995) and logic (Rossman 2008)....
    11 KB (1,221 words) - 14:06, 27 May 2025
  • Thumbnail for Z-order curve
    Charles E. (2009), "Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks", ACM Symp. on Parallelism...
    21 KB (2,681 words) - 19:21, 8 February 2025
  • hierarchical matrices (H-matrices) are used as data-sparse approximations of non-sparse matrices. While a sparse matrix of dimension n {\displaystyle n} can be represented...
    15 KB (2,149 words) - 21:04, 14 April 2025
  • to BLAS for handling sparse matrices have been suggested over the course of the library's history; a small set of sparse matrix kernel routines was finally...
    36 KB (3,917 words) - 09:17, 27 May 2025
  • Thumbnail for Matrix (mathematics)
    be sparse, that is, contain few nonzero entries. Therefore, specifically tailored matrix algorithms can be used in network theory. The Hessian matrix of...
    118 KB (14,455 words) - 23:35, 23 June 2025
  • document. For this reason, document-term matrices are usually stored in a sparse matrix format. As a result of the power-law distribution of tokens in nearly...
    11 KB (1,529 words) - 07:47, 14 June 2025
  • complexity theory Sparse matrix, in numerical analysis, a matrix populated primarily with zeros Sparse file, a computer file mostly empty Sparse network, a network...
    436 bytes (95 words) - 17:36, 10 March 2023
  • a hollow matrix may refer to one of several related classes of matrix: a sparse matrix; a matrix with a large block of zeroes; or a matrix with diagonal...
    3 KB (422 words) - 21:04, 14 April 2025
  • Thumbnail for Bundle adjustment
    Adjustment of observations Stereoscopy Levenberg–Marquardt algorithm Sparse matrix Collinearity equation Structure from motion Simultaneous localization...
    9 KB (1,042 words) - 23:12, 23 May 2024
  • LU decomposition (category Matrix decompositions)
    factorization factors a matrix as the product of a lower triangular matrix and an upper triangular matrix (see matrix multiplication and matrix decomposition)...
    54 KB (8,677 words) - 22:02, 11 June 2025
  • Matrix multiplication algorithm, for practical implementation details Sparse matrix–vector multiplication Volker Strassen (Aug 1969). "Gaussian elimination...
    35 KB (4,285 words) - 19:52, 19 June 2025
  • analysis, the entries of a matrix which change from zero to a non-zero value in the execution of an algorithm; see Sparse matrix § Reducing fill-in An issue...
    562 bytes (116 words) - 11:09, 9 May 2025
  • following equivalent definition is in matrix form. Let V {\displaystyle V} be a p×p symmetric matrix, one can rewrite the sparse PCA problem as max T r ( Σ V )...
    17 KB (2,317 words) - 22:15, 19 June 2025
  • indirect energy conversion by employing the Indirect Matrix Converter (Fig. 5) or the Sparse matrix converter which was invented by Prof. Johann W. Kolar...
    8 KB (1,001 words) - 19:01, 5 November 2024
  • Thumbnail for Cuthill–McKee algorithm
    Cuthill–McKee algorithm (category Sparse matrices)
    James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth. The reverse...
    4 KB (521 words) - 14:28, 25 October 2024
  • Thumbnail for Skyline matrix
    skyline matrix storage, or SKS, or a variable band matrix storage, or envelope storage scheme is a form of a sparse matrix storage format matrix that reduces...
    4 KB (435 words) - 14:20, 1 October 2024
  • algorithm is the multiplication of matrix A {\displaystyle A} by a vector, so it is effective for a very large sparse matrix with appropriate implementation...
    13 KB (2,487 words) - 02:24, 17 June 2025
  • bandwidth of a symmetric sparse matrix Minimum degree algorithm: permute the rows and columns of a symmetric sparse matrix before applying the Cholesky...
    72 KB (7,951 words) - 17:13, 5 June 2025
  • Therefore, this type of data model relates to the mathematical notion of a sparse matrix. EAV is also known as object–attribute–value model, vertical database...
    66 KB (9,767 words) - 04:32, 15 June 2025