arXiv (All)
open access
Stochastic Lanczos Quadrature for Computational Uncertainty in Linear Algebra
Applying a matrix function to a vector is a common operation in large-scale scientific computing, such as Bayesian inference. When the matrix is symmetric positive definite and the function is its inverse, the Lanczos algorithm gives a matrix-free approximation from matrix-vector products alone. Sto
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
- Lanczos with compression for symmetric eigenvalue problems#635753
- Lanczos with compression for symmetric eigenvalue problems#633404
- Improving the efficiency of a Hyperpower method for approximating inverse matrices#927723
- Matrix Methods in Data Analysis, Signal Processing, and Machine Learning#3620
- Nonlinear Rayleigh quotient optimization#998038
Record · ID 996996
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