arXiv (All)
open access
Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices
Efficient inversion of large sparse positive definite matrices requires exploiting sparsity patterns beyond those captured by conventional bandwidth reduction. In this work, we recast nested dissection, a prominent alternative, as a two-stage framework. The matrix was first packed into block-tridiag
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
- Structural Packing and Dyadic Factorization of Sparse Positive Definite Matrices#797190
- Dense Matrices Are Alike; Sparse Matrices Are Sparse in Their Own Way: A Structure-Adaptive Tile Cholesky Factorization#1077692
- LDPC Fractus Codes: Sparse Codes with Recursive Structure#1131091
- A General Algorithm to Calculate the Inverse Principal $p$-th Root of Symmetric Positive Definite Matrices#1128455
- Lanczos with compression for symmetric eigenvalue problems#635753
Record · ID 798603
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