scientific article; zbMATH DE number 1163749
From MaRDI portal
Publication:4395357
zbMATH Open0897.65017MaRDI QIDQ4395357
Publication date: 5 October 1998
Title of this publication is not available (Why is that?)
algorithmscomputational complexityparallel computationsparse matrixstructured matrixlarge linear systems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (4)
Solving systems of linear algebraic equations of a special kind with sparse polynomial and numerical coefficients ⋮ Analysis of the binary complexity of asymptotically fast algorithms for linear system solving ⋮ Upper bounds on the complexity of solving systems of linear equations ⋮ Complexity of Solving Linear Systems in Different Models of Computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4395357)
