arXiv (All)
open access
An Iterative Method with Asymptotic Orthogonality for Simultaneous Eigenpair Computation
The simultaneous computation of a cluster of eigenpairs with mutually orthogonal eigenvectors is a basic task in scientific computing. We develop a predictor--corrector discretization of the quasi-Grassmannian gradient flow for simultaneous eigenpair computation. The proposed iteration requires neit
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
- Quadratization of Autonomous Partial Differential Equations: Algorithmic Solutions#972418
- Quantum matrix arithmetics with Hamiltonian evolution#821411
- Hierarchical Clustering and Signal Denoising on Digraphs#1128929
- Twisted and intermediate eigenvalue problems in shape optimisation#208691
- NEP_MiniMax: An approach for NEPs based on minimax approximation of the split coefficient vector#1014633
Record · ID 925887
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