Skip to Main Navigation

A recursive form in the inverse of general sparse matrices (anglais)

The Helierman-Rarick preassigned pivot procedure and recursive partitioning algorithm are used to find a stable and compact representation of the inverse of a general sparse matrix.
Voir la suite

INFORMATION

TÉLÉCHARGER

RAPPORT COMPLET

Version officielle du document (peut inclure des signatures etc…)

This document is being processed or is not available.