arXiv (All)
open access
A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices
We present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in different scientific applications. We follow the idea of Approximate Computing, allowing imprecision in the final result in o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A General Algorithm to Calculate the Inverse Principal $p$-th Root of Symmetric Positive Definite Matrices#1128455
- Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots#1128454
- MPX: A Unified Systolic Array for Matrix and Polynomial Multiplication#280109
- Parameter optimization for restarted mixed precision iterative sparse solver#798573
- Parameter optimization for restarted mixed precision iterative sparse solver#797160
Record · ID 1128457
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive