arXiv (All)
open access
Unrolling Iterative Lanczos Algorithm for Ideal Low-pass Graph Filter Approximation
Low-pass (LP) filtering is a fundamental operation in graph signal processing (GSP). Among finite-order nodal-domain methods, Lanczos-based filtering provides more accurate approximations of ideal LP filters than Chebyshev polynomial methods. We show that the approximation of Lanczos filtering can b
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
- Fractal antenna inspired EMP power grid mitigation device placement through cycle removal using graph theory#454240
- Preconditioned Hyperbolic Smoothing Modified L-BFGS Algorithms for Finite Minimax Problems#1084347
- Distributed Lower Bounds via Automatic Self-Reduction#1129011
- Distributed Lower Bounds via Automatic Self-Reduction#1108707
- Affine Facial Reduction for Semidefinite Relaxations of Binary and Mixed-Binary Optimization Problems#925019
Record · ID 1077015
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