For one-dimensional second-order elliptic PDEs, the Random Feature Method achieves spectral convergence for smooth solutions, but its feature matrix is exponentially ill-conditioned.
In: Advances in Neural Information Processing Systems, vol
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Spectral connvergece of random feature method in one dimension
For one-dimensional second-order elliptic PDEs, the Random Feature Method achieves spectral convergence for smooth solutions, but its feature matrix is exponentially ill-conditioned.