Skip to search formSkip to main contentSkip to account menu

Matrix-free methods

In computational mathematics, a matrix-free method is an algorithm for solving a linear system of equations or an eigenvalue problem that does not… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
With the ever increasing computational power available and the development of high-performances computing, investigating the… 
2017
2017
Full-wave 3D electromagnetic simulations of complex planar devices, multilayer interconnects, and chip packages are presented for… 
2012
2012
A new time-stepping shift-invert algorithm for linear stability analysis of large-scale laminar ows in complex geometries is… 
2012
2012
To define the safe operating region of a thermoacoustic system, it is critical to find the regions of parameter space where limit… 
2006
2006
Matrix-free implicit treatments are now commonly used for computing compressible flow problems: a reduced cost per iteration and… 
2003
2003
We present a computer-assisted approach to approximating coarse optimal switching policies for systems described by microscopic… 
1999
1999
In this paper we consider a matrix-free path following algorithm for nonlinear parameter-dependent compact fixed point problems… 
Highly Cited
1997
Highly Cited
1997
Use of a high-level modeling representation, such as stochastic Petri nets, frequently results in a very large state space. In…