- [[Category:sparse]] ...l control. The C version provides a large set of auxiliary subroutines for sparse matrix computations and efficient usage of modern multicore workstations.3 KB (363 words) - 15:06, 25 August 2022
- U = speye(N); % Sparse unit matrix T = gallery('tridiag',N,-1,2,-1); % Sparse tridiagonal matrix5 KB (731 words) - 07:34, 17 June 2025
- [[Category:Sparse]]959 bytes (106 words) - 10:16, 9 May 2025
- .../forschung/modellordnungsreduktion/software/psssmor/ psssMOR] - Parametric Sparse State-Space and Model Order Reduction Toolbox (MATLAB) ...0.5281/zenodo.4600763 SOLBT] - Limited Balanced Truncation for Large-Scale Sparse Second-Order Systems (MATLAB)4 KB (599 words) - 11:33, 14 September 2024
- ...:Sparse_grid|sparse grids]], see, e.g. <ref>H.-J. Bungartz and M. Griebel, Sparse grids. Sparse grids and related approximation schemes for higher dimensional problems5 KB (745 words) - 10:20, 17 June 2013
- [[Category:Sparse]] B = N * sparse(1,1,1,N,1);5 KB (657 words) - 07:33, 17 June 2025
- [[Category:Sparse]] ...integers and <math>B</math> and <math>C</math> are full matrices stored as sparse matrices):5 KB (628 words) - 11:28, 30 November 2023
- [[Category:Sparse]] B = sparse(1,1,1,n,1);4 KB (514 words) - 10:42, 11 June 2025
- [[Category:sparse]]1 KB (196 words) - 13:03, 29 January 2021
- [[Category:Sparse]]2 KB (190 words) - 18:01, 11 April 2024
- ! Sparse3 KB (390 words) - 18:36, 8 January 2025
- [[Category:sparse]]2 KB (227 words) - 16:04, 22 October 2020
- | <code>is*Sparse</code> | (list of bool) the matrix * is stored in a sparse format; note that AP systems will have a list of floats, with each entry pe9 KB (1,193 words) - 17:25, 2 April 2024
- B = sparse(1,1,1,N,1); % input matrix C = sparse(1,1,1,1,N); % output matrix9 KB (1,440 words) - 07:36, 17 June 2025
- ...he matrix disk function, and on iterative low-rank solvers for large-scale sparse systems. '''Model reduction methods for dense and sparse, first- and second-order, ODE and DAE systems:'''4 KB (571 words) - 04:43, 26 September 2023
- For this benchmark the system matrix is block diagonal and thus chosen to be sparse. A_k = cellfun(@(p) sparse([-2.0*p(1)*p(2),-p(2);p(2),0]), ...6 KB (815 words) - 07:31, 17 June 2025
- [[Category:sparse]]3 KB (319 words) - 15:38, 22 October 2020
- [[Category:sparse]]3 KB (376 words) - 17:59, 8 December 2020
- [[Category:Sparse]]3 KB (371 words) - 11:39, 30 November 2023
- [[Category:Sparse]] B = 2 * sparse(mod(1:N, 2)).';10 KB (1,534 words) - 07:40, 17 June 2025