IRIS
metadata only
A Bisection Eigenvalue Algorithm for Symmetric Quasiseparable Matrices
In this paper we design a fast bisection algorithm for computing a prescribed eigenvalue of a symmetric quasiseparable matrix represented by its Cholesky-like factorization (Formula presented.), where (Formula presented.) is a lower triangular quasiseparable matrix and (Formula presented.) is a sign
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
- Least-squares spectral methods for ODE eigenvalue problems#984777
- Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems#799181
- Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems#797758
- Non-resonant angles in a Robin eigenvalue problem#1297953
- A Fast and Stable Square-Root-Free Unitary Core-Chasing Algorithm#1249652
Record · ID 1470219
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