REVIEW 1 cited by
The ultraspherical rectangular collocation method and its convergence
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We develop the ultraspherical rectangular collocation (URC) method, a collocation implementation of the sparse ultraspherical method of Olver \& Townsend for two-point boundary-value problems. The URC method is provably convergent, the implementation is simple and efficient, the convergence proof motivates a preconditioner for iterative methods, and the modification of collocation nodes is straightforward. The convergence theorem applies to all boundary-value problems when the coefficient functions are sufficiently smooth and when the roots of certain ultraspherical polynomials are used as collocation nodes. We also adapt a theorem of Krasnolsel'skii et al.~to our setting to prove convergence for the rectangular collocation method of Driscoll \& Hale for a restricted class of boundary conditions.
Forward citations
Cited by 1 Pith paper
-
Achieving Tokenizer Flexibility in Language Models through Heuristic Adaptation and Supertoken Learning
TokenAdapt initializes new token embeddings by blending subword-decomposition and semantic-neighbor estimates, and achieves lower zero-shot perplexity after tokenizer replacement than ReTok and TransTokenizer, while s...
Discussion (0). Continue with ORCID to comment.