arXiv (All)
open access
A Structure-Preserving LOBPCG Method for Computing Several of the Largest Generalized Singular Triplets
We develop a structure-preserving locally optimal block preconditioned conjugate gradient(LOBPCG) method for computing several of the largest positive generalized singular values of a matrix pair \((A, B)\), where \(B\) has full column rank, together with the associated generalized singular vectors.
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
- Per-Matrix Optimality Is Not Enough: Three-Level Optimization for Low-Rank LLM Compression#1109878
- Distributed principal component analysis with limited communication#308498
- Nora: Normalized Orthogonal Row Alignment for Scalable Matrix Optimizer#155302
- Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging#1061762
- Muon learns balanced solutions in matrix factorization without slow saddle-to-saddle dynamics#321833
Record · ID 1116737
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