Using randomization to make recursive matrix algorithms practical

DOI10.1017/S0956796899003470MaRDI QIDQ4948004zbMATH OpenOpenAlexFDO

Authors

Publication date 26 April 2000

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796899003470

zbMATH Keywords

quadtree algorithmsrecursive block decomposition algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Randomized methods for matrix computations
• Randomized Algorithms for Matrices and Data
• A randomized algorithm for the decomposition of matrices
• Advancing matrix computations with randomized preprocessing
• A fast randomized algorithm for the approximation of matrices
• Randomization and the parallel solution of linear algebra problems
• Randomized algorithms in numerical linear algebra
• Efficient generation of random nonsingular matrices
• scientific article; zbMATH DE number 2086387

Cited in

(2)

• Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games
• Randomized Algorithms for Matrices and Data

Describes a project that uses

Uses Software

• ScaLAPACK
• LAPACK

This page was built for publication: Using randomization to make recursive matrix algorithms practical

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948004)