arXiv (All)
open access
NEP_MiniMax: An approach for NEPs based on minimax approximation of the split coefficient vector
We propose \textsf{NEP\_MiniMax}, a novel computational method for solving nonlinear eigenvalue problems (NEPs) $T(λ)\mathbf{u} = \mathbf{0}$ on a Jordan domain $Ω\subset \mathbb{C}$. For an NEP in split form $T(x)=\sum_{i=1}^s t_i(x)E_i$, the method applies the \textsf{m-d-Lawson} algorithm to the
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
- An Iterative Method with Asymptotic Orthogonality for Simultaneous Eigenpair Computation#925887
- Twisted and intermediate eigenvalue problems in shape optimisation#208691
- Perron similarities and the nonnegative inverse eigenvalue problem#609751
Record · ID 1014633
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