Sparse Matrices in MATLAB: Design and Implementation
direct methodsmathematical softwareMATLABmatrix additionmatrix multiplicationsparse linear systemssparse matrix
Software, source code, etc. for problems pertaining to linear algebra (15-04) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Theory of programming languages (68N15) Graph theory (including graph drawing) in computer science (68R10)
MATLAB is an interactive environment and programming language for numerical computation. This paper describes the addition of sparse matrix storage and operations to MATLAB. This has not added any new functionality but has made existing programs more efficient in terms of storage and time. The authors concentrate on elementary sparse matrix operations, such as addition and multiplication, and on direct methods for solving sparse linear systems. A variety of examples showing the advantages of the new enhancement are given.
- The chebop system for automatic solution of differential equations
- Fixed-domain asymptotic properties of tapered maximum likelihood estimators
- A sparse counterpart of Reichel and Gragg's package QRUP
- Krylov methods for solving models with forward-looking variables
- Monte Carlo estimates of the log determinant of large sparse matrices
- Predicting the structure of sparse orthogonal factors
- Separators and structure prediction in sparse orthogonal factorization
- Sparse direct methods for model simulation
- Supplementary projections for the acceleration of Kaczmarz algorithm
- A user-friendly hybrid sparse matrix class in C++
- DNSLab: a gateway to turbulent flow simulation in Matlab
- Phoretic motion of soft vesicles and droplets: an XFEM/particle-based numerical solution
- Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR
- An efficient simplex type algorithm for sparse and dense linear programs.
- Efficient solvers for the IBC method
- A triangulation and fill-reducing initialization procedure for the simplex algorithm
- Cached Gaussian elimination for simulating Stokes flow on domains with repetitive geometry
- Fast power flow scheduling and sensitivity analysis for sizing a microgrid with storage
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- An algorithm for solving singular perturbation problems with mechanization
- Optimal control in first-order Sobolev spaces with inequality constraints
- Superconsistent collocation methods with applications to convection-dominated convection-diffusion equations
- DSJM: A Software Toolkit for Direct Determination of Sparse Jacobian Matrices
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Sparsity in higher order methods for unconstrained optimization
- Reconciling conflicting combinatorial preprocessors for geometric constraint systems
- Implementing sparse matrices for graph algorithms
- A banded preconditioner for the two-sided, nonlinear space-fractional diffusion equation
- Equivalence between lowest-order mixed finite element and multi-point finite volume methods on simplicial meshes
- Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices
- An efficient storage format for large sparse matrices
- Assembling sparse matrices in MATLAB
- High performance verified computing using C-XSC
- Estimating sensitivity indices based on Gaussian process metamodels with compactly supported correlation functions
- Recent experiences on mixed finite elements for 2D simulations of magnetic fields
- scientific article; zbMATH DE number 1083122 (Why is no real title available?)
- Kriging with large data sets using sparse matrix techniques
- Rejoinder to ‘Dynamic dependence networks: Financial time series forecasting and portfolio decisions’
- An object‐oriented interface for the dynamic memory management of sparse discrete mathematical operators in numerical scientific applications
- scientific article; zbMATH DE number 2098239 (Why is no real title available?)
- Multiscale matrix sampling and sublinear-time PageRank computation
- Iterative ILU preconditioners for linear systems and eigenproblems
- Finite horizon maximum likelihood estimation for integrated navigation with RF beacon measurements
- Exact solution of sparse linear systems via left-looking roundoff-error-free Lu factorization in time proportional to arithmetic work
- A MATLAB-based code generator for sparse matrix computations
- Factoring matrices with a tree-structured sparsity pattern
- Storage formats for sparse matrices in Java
- Balanced binary search trees based approach for sparse matrix representation
- A survey of direct methods for sparse linear systems
- Fast maximum likelihood estimation of very large spatial autoregressive models: a characteristic polynomial approach.
- Scalable semiparametric spatio-temporal regression for large data analysis
- Bayesian nonstationary spatial modeling for very large datasets
- Efficient solution for Galerkin-based polynomial chaos expansion systems
- Differential geometry with extreme eigenvalues in the positive semidefinite cone
- Algorithm 1037: SuiteSparse:GraphBLAS: parallel graph algorithms in the language of sparse linear algebra
- On improving the robustness and scalability of shared-memory AMG solvers for point-block problems
- Ascend-SpMM: Accelerating Sparse Matrix-Dense Matrix Multiplication on Ascend NPUs
- Estimating the matrix p-norm
This page was built for publication: Sparse Matrices in MATLAB: Design and Implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988993)