Matrix-free methods
id:
matrix-free-methods-243-3025968
title:
Matrix-free methods
text:
In computational mathematics, a matrix-free method is an algorithm for solving a linear system of equations or an eigenvalue problem that does not store the coefficient matrix explicitly, but accesses the matrix by evaluating matrix-vector products. Such methods can be preferable when the matrix is so big that storing and manipulating it would cost a lot of memory and computing time, even with the use of methods for sparse matrices. Many iterative methods allow for a matrix-free implementation,
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Matrix-free_methods
date created:
date modified:
2023-08-11T00:52:40Z
main entity:
{"identifier":"Q4080929","url":"https://www.wikidata.org/entity/Q4080929"}
image:
fields total:
13
integrity:
13