{"paper":{"title":"The Smooth Selection Embedding Method with Chebyshev Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Daniel Agress, Dong Yan, Patrick Guidotti","submitted_at":"2019-02-11T03:36:24Z","abstract_excerpt":"We propose an implementation of the Smooth Selection Embedding Method (SSEM) in the setting of Chebyshev polynomials. The SSEM is a hybrid fictitious domain / collocation method which solves boundary value problems in complex domains by recasting them as constrained optimization problems in a simple encompassing set. Previously, the SSEM was introduced and implemented using a periodic box (read a torus) using Fourier series; here, it is implemented on a (non-periodic) rectangle using Chebyshev polynomial expansions. This implementation has faster convergence on smaller grids. Numerical experim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03713","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}