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)

Related topics

Related topics

12 relations
Computational mathematicsConjugate gradient methodIterative methodJacobian matrix and determinant

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Parallel Matrix-Free Implementation of Frequency-Domain Finite Difference Methods for Cluster Computing
Full-wave 3D electromagnetic simulations of complex planar devices, multilayer interconnects, and chip packages are presented for… 
2014
2014
Inexact Newton matrix-free methods for solving complex biotechnological systems
In the article a new approach for solving complex and highly nonlinear differential-algebraic equations (DAEs) was presented. An… 
2013
2013
An accelerated, fully-coupled, parallel 3D hybrid finite-volume fluid-structure interaction scheme
2012
2012
A shift-invert strategy for global flow instability analysis using matrix-free methods
A new time-stepping shift-invert algorithm for linear stability analysis of large-scale laminar ows in complex geometries is… 
2012
2012
Matrix-free continuation of large thermoacoustic systems
To define the safe operating region of a thermoacoustic system, it is critical to find the regions of parameter space where limit… 
2006
2006
A Matrix-Free Implicit Method for Flows at All Speeds
Matrix-free implicit treatments are now commonly used for computing compressible flow problems: a reduced cost per iteration and… 
2003
2003
Optimal switching policies using coarse timesteppers
We present a computer-assisted approach to approximating coarse optimal switching policies for systems described by microscopic… 
2001
2001
Sensitivity analysis of large-scale time dependent PDEs ? ? This research is supported by the Univer
1999
1999
Mesh Independence of Matrix-Free Methods for Path Following
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
"On-the-fly" solution techniques for stochastic Petri nets and extensions
Use of a high-level modeling representation, such as stochastic Petri nets, frequently results in a very large state space. In… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)